## TSTP Solution File: LAT270-2 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LAT270-2 : TPTP v3.4.2. Released v3.2.0.
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art03.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 1003MB
% OS       : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s

% Result   : Unsatisfiable 0.0s
% Output   : Assurance 0.0s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /tmp/SystemOnTPTP18441/LAT/LAT270-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: small
% detected subclass: long
%
% strategies selected:
% (hyper 57 #f 2 7)
% (binary-unit 28 #f 2 7)
% (binary-double 28 #f 2 7)
% (binary-posweight-order 28 #f 2 7)
% (binary-unit 62 #f)
% (hyper 159 #f)
% (binary-posweight-order 154 #f)
% (binary-weightorder 28 #f)
% (binary-order 28 #f)
% (binary 28 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(5,40,0,10,0,0)
%
%
% START OF PROOF
% 6 [] -c_lessequals(X,c_^tarski_^ointerval(v_r,Y,Z,t_a),tc_set(t_a)) | c_lessequals(X,v_^a,tc_set(t_a)) | -c_in(Z,v_^a,t_a) | -c_in(Y,v_^a,t_a).
% 7 [] c_in(v_a,v_^a,t_a).
% 8 [] c_in(v_b,v_^a,t_a).
% 9 [] c_lessequals(v_^s,c_^tarski_^ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)).
% 10 [] -c_lessequals(v_^s,v_^a,tc_set(t_a)).
% 15 [hyper:6,9,cut:8,cut:7] c_lessequals(v_^s,v_^a,tc_set(t_a)).
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 7
% clause depth limited to 2
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
%  given clauses:    5
%  derived clauses:   6
%  kept clauses:      1
%  kept size sum:     5
%  kept mid-nuclei:   4
%  kept new demods:   0
%  forw unit-subs:    0
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.1
%  process. runtime:  0.0
% specific non-discr-tree subsumption statistics:
%  tried:           4
%  length fails:    0
%  strength fails:  4
%  predlist fails:  0
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 0
%  full subs fail:  0
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP18441/LAT/LAT270-2+noeq.in")
%
%------------------------------------------------------------------------------