TSTP Solution File: LCL071-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL071-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 : art07.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/LCL071-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 6 5)
% (binary-unit 11 #f 6 5)
% (binary-double 17 #f 6 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 6 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(5,40,1,10,0,1)
%
%
% START OF PROOF
% 6 [] -is_a_theorem(implies(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 7 [] is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 8 [] is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))).
% 9 [] is_a_theorem(implies(implies(X,implies(not(Y),Z)),implies(X,implies(implies(U,Z),implies(implies(Y,U),Z))))).
% 10 [] -is_a_theorem(implies(implies(not(a),a),a)).
% 13 [hyper:6,7,7] is_a_theorem(implies(X,implies(Y,X))).
% 21 [hyper:6,13,7] is_a_theorem(implies(X,implies(Y,implies(Z,X)))).
% 29 [hyper:6,8,13] is_a_theorem(implies(not(X),implies(Y,implies(X,Z)))).
% 67 [hyper:6,9,7] is_a_theorem(implies(implies(implies(X,not(Y)),Z),implies(implies(U,Z),implies(implies(Y,U),Z)))).
% 69 [hyper:6,9,8] is_a_theorem(implies(implies(implies(X,Y),Z),implies(implies(U,Z),implies(implies(X,U),Z)))).
% 110 [hyper:6,69,7] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(implies(U,Y),X),implies(Y,Z)))).
% 111 [hyper:6,69,13] is_a_theorem(implies(implies(X,implies(Y,implies(Z,U))),implies(implies(Z,X),implies(Y,implies(Z,U))))).
% 125 [hyper:6,110,7] is_a_theorem(implies(implies(implies(X,Y),implies(implies(Z,Y),U)),implies(Y,U))).
% 129 [hyper:6,110,29] is_a_theorem(implies(implies(implies(X,Y),not(Z)),implies(Y,implies(Z,U)))).
% 146 [hyper:6,67,7] is_a_theorem(implies(implies(X,implies(Y,not(Z))),implies(implies(Z,X),implies(Y,not(Z))))).
% 196 [hyper:6,125,7] is_a_theorem(implies(X,X)).
% 198 [hyper:6,125,129] is_a_theorem(implies(not(X),implies(X,Y))).
% 211 [hyper:6,196,69] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(Y,X),implies(Y,Z)))).
% 221 [hyper:6,198,9] is_a_theorem(implies(not(not(X)),implies(implies(Y,Z),implies(implies(X,Y),Z)))).
% 283 [hyper:6,211,21] is_a_theorem(implies(implies(X,Y),implies(X,implies(Z,Y)))).
% 303 [hyper:6,211,196] is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))).
% 392 [hyper:6,283,111] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 1109 [hyper:6,392,196] is_a_theorem(implies(X,implies(implies(X,Y),Y))).
% 1166 [hyper:6,1109,196] is_a_theorem(implies(implies(implies(X,X),Y),Y)).
% 1217 [hyper:6,1166,283] is_a_theorem(implies(implies(implies(X,X),Y),implies(Z,Y))).
% 1423 [hyper:6,1217,211] is_a_theorem(implies(implies(X,implies(implies(Y,Y),Z)),implies(X,Z))).
% 1699 [hyper:6,146,198] is_a_theorem(implies(implies(X,not(Y)),implies(Y,not(X)))).
% 1928 [hyper:6,1699,196] is_a_theorem(implies(X,not(not(X)))).
% 1999 [hyper:6,1928,283] is_a_theorem(implies(X,implies(Y,not(not(X))))).
% 2046 [hyper:6,1999,146] is_a_theorem(implies(implies(not(X),X),implies(Y,not(not(X))))).
% 2980 [hyper:6,2046,303] is_a_theorem(implies(implies(not(X),X),not(not(X)))).
% 4882 [hyper:6,1423,221] is_a_theorem(implies(not(not(X)),implies(implies(X,Y),Y))).
% 4951 [hyper:6,4882,1423] is_a_theorem(implies(not(not(X)),X)).
% 4962 [hyper:6,4951,283] is_a_theorem(implies(not(not(X)),implies(Y,X))).
% 5034 [hyper:6,4962,211] is_a_theorem(implies(implies(X,not(not(Y))),implies(X,Y))).
% 5288 [hyper:6,5034,2980,slowcut:10] 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 6
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 438
% derived clauses: 106760
% kept clauses: 4129
% kept size sum: 64985
% kept mid-nuclei: 1101
% kept new demods: 0
% forw unit-subs: 50941
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 7
% fast unit cutoff: 0
% full unit cutoff: 45
% dbl unit cutoff: 0
% real runtime : 1.39
% process. runtime: 1.39
% 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/LCL071-1+noeq.in")
%
%------------------------------------------------------------------------------