TSTP Solution File: LCL051-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL051-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 : art06.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/LCL051-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(5,40,1,10,0,1,17,50,1,22,0,1)
%
%
% START OF PROOF
% 18 [] -is_a_theorem(implies(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 19 [] is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 20 [] is_a_theorem(implies(implies(not(X),X),X)).
% 21 [] is_a_theorem(implies(X,implies(not(X),Y))).
% 22 [] -is_a_theorem(implies(implies(b,c),implies(implies(a,b),implies(a,c)))).
% 33 [hyper:18,19,20] is_a_theorem(implies(implies(X,Y),implies(implies(not(X),X),Y))).
% 34 [hyper:18,19,21] is_a_theorem(implies(implies(implies(not(X),Y),Z),implies(X,Z))).
% 35 [hyper:18,19,19] is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),U),implies(implies(Z,X),U))).
% 50 [hyper:18,34,20] is_a_theorem(implies(X,X)).
% 54 [hyper:18,50,21] is_a_theorem(implies(not(implies(X,X)),Y)).
% 67 [hyper:18,35,34] is_a_theorem(implies(implies(X,not(Y)),implies(Y,implies(X,Z)))).
% 68 [hyper:18,35,35] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(U,Y),implies(X,implies(U,Z))))).
% 71 [hyper:18,67,54] is_a_theorem(implies(X,implies(not(implies(Y,Y)),Z))).
% 73 [hyper:18,67,19] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),U),implies(implies(Y,not(X)),U))).
% 88 [hyper:18,73,19] is_a_theorem(implies(implies(X,not(Y)),implies(implies(implies(X,Z),U),implies(Y,U)))).
% 100 [hyper:18,68,33] is_a_theorem(implies(implies(X,implies(not(Y),Y)),implies(implies(Y,Z),implies(X,Z)))).
% 105 [hyper:18,68,88] is_a_theorem(implies(implies(X,implies(implies(Y,Z),U)),implies(implies(Y,not(V)),implies(X,implies(V,U))))).
% 111 [hyper:18,100,71] is_a_theorem(implies(implies(implies(X,X),Y),implies(Z,Y))).
% 115 [hyper:18,111,33] is_a_theorem(implies(X,implies(implies(not(Y),Y),Y))).
% 161 [hyper:18,105,115] is_a_theorem(implies(implies(not(X),not(Y)),implies(Z,implies(Y,X)))).
% 216 [hyper:18,161,34] is_a_theorem(implies(X,implies(Y,implies(Z,X)))).
% 229 [hyper:18,216,100] is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 249 [hyper:18,229,161] is_a_theorem(implies(not(X),implies(Y,implies(X,Z)))).
% 303 [hyper:18,249,100] is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))).
% 370 [hyper:18,303,100] is_a_theorem(implies(implies(X,Y),implies(implies(implies(X,Z),X),Y))).
% 712 [hyper:18,370,50] is_a_theorem(implies(implies(implies(X,Y),X),X)).
% 744 [hyper:18,712,35] is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))).
% 783 [hyper:18,744,35] is_a_theorem(implies(implies(implies(X,Y),X),implies(implies(X,Y),Y))).
% 1020 [hyper:18,783,229] is_a_theorem(implies(X,implies(implies(X,Y),Y))).
% 1030 [hyper:18,1020,19] is_a_theorem(implies(implies(implies(implies(X,Y),Y),Z),implies(X,Z))).
% 1259 [hyper:18,1030,35,slowcut:22] 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: 260
% derived clauses: 22932
% kept clauses: 688
% kept size sum: 9286
% kept mid-nuclei: 541
% kept new demods: 0
% forw unit-subs: 9989
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 22
% fast unit cutoff: 0
% full unit cutoff: 11
% dbl unit cutoff: 0
% real runtime : 0.17
% process. runtime: 0.15
% 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/LCL051-1+noeq.in")
%
%------------------------------------------------------------------------------