%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL029-1 : TPTP v3.4.2. Released v1.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art08.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unsatisfiable 0.0s
% Output : Assurance 0.0s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/LCL/LCL029-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (hyper 29 #f 4 5)
% (binary-unit 11 #f 4 5)
% (binary-double 17 #f 4 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 4 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(6,40,0,12,0,1,53,50,1,59,0,1)
%
%
% START OF PROOF
% 54 [] -is_a_theorem(implies(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 55 [] is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 56 [] is_a_theorem(implies(X,implies(Y,X))).
% 57 [] is_a_theorem(implies(implies(implies(X,Y),X),X)).
% 58 [] is_a_theorem(implies(falsehood,X)).
% 59 [] -is_a_theorem(implies(implies(implies(a,falsehood),falsehood),a)).
% 64 [hyper:54,56,58] is_a_theorem(implies(X,implies(falsehood,Y))).
% 87 [hyper:54,55,56] is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 88 [hyper:54,55,64] is_a_theorem(implies(implies(implies(falsehood,X),Y),implies(Z,Y))).
% 92 [hyper:54,55,55] is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),U),implies(implies(Z,X),U))).
% 100 [hyper:54,87,55] is_a_theorem(implies(X,implies(implies(X,Y),implies(Z,Y)))).
% 133 [hyper:54,100,55] is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),U),implies(X,U))).
% 179 [hyper:54,92,57] is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))).
% 187 [hyper:54,179,88] is_a_theorem(implies(implies(implies(falsehood,X),Y),Y)).
% 208 [hyper:54,187,92] is_a_theorem(implies(implies(X,falsehood),implies(X,Y))).
% 292 [hyper:54,133,179] is_a_theorem(implies(X,implies(implies(X,Y),Y))).
% 299 [hyper:54,292,55] is_a_theorem(implies(implies(implies(implies(X,Y),Y),Z),implies(X,Z))).
% 395 [hyper:54,299,92] is_a_theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 489 [hyper:54,395,57] is_a_theorem(implies(implies(X,implies(implies(Y,Z),Y)),implies(X,Y))).
% 550 [hyper:54,489,208,slowcut:59] contradiction
% 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 5
% clause depth limited to 5
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 116
% derived clauses: 8863
% kept clauses: 271
% kept size sum: 3536
% kept mid-nuclei: 243
% kept new demods: 0
% forw unit-subs: 4868
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 1
% fast unit cutoff: 0
% full unit cutoff: 14
% dbl unit cutoff: 0
% real runtime : 0.7
% process. runtime: 0.6
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% 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" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/LCL/LCL029-1+noeq.in")
%
%------------------------------------------------------------------------------