TSTP Solution File: LCL067-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL067-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/LCL067-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 5 5)
% (binary-unit 11 #f 5 5)
% (binary-double 17 #f 5 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 5 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(not(X),Y),implies(implies(Z,Y),implies(implies(X,Z),Y)))).
% 10 [] -is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))).
% 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,21,7] is_a_theorem(implies(X,implies(Y,implies(Z,implies(U,X))))).
% 36 [hyper:6,8,7] is_a_theorem(implies(not(implies(X,Y)),implies(Y,Z))).
% 37 [hyper:6,8,13] is_a_theorem(implies(not(X),implies(Y,implies(X,Z)))).
% 50 [hyper:6,9,13] is_a_theorem(implies(implies(X,implies(Y,not(Z))),implies(implies(Z,X),implies(Y,not(Z))))).
% 51 [hyper:6,9,36] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(implies(U,Y),X),implies(Y,Z)))).
% 56 [hyper:6,37,9] is_a_theorem(implies(implies(X,implies(Y,implies(Z,U))),implies(implies(Z,X),implies(Y,implies(Z,U))))).
% 68 [hyper:6,50,7] is_a_theorem(implies(implies(X,implies(implies(Y,Z),not(X))),implies(Z,not(X)))).
% 69 [hyper:6,50,13] is_a_theorem(implies(implies(X,not(X)),implies(Y,not(X)))).
% 92 [hyper:6,51,69] is_a_theorem(implies(implies(implies(X,Y),implies(Z,not(Z))),implies(Y,not(Z)))).
% 110 [hyper:6,56,13] is_a_theorem(implies(implies(X,implies(X,Y)),implies(Z,implies(X,Y)))).
% 111 [hyper:6,56,29] is_a_theorem(implies(implies(X,Y),implies(Z,implies(X,implies(U,Y))))).
% 136 [hyper:6,110,110] is_a_theorem(implies(X,implies(implies(Y,implies(Y,Z)),implies(Y,Z)))).
% 430 [hyper:6,92,68] is_a_theorem(implies(implies(implies(X,Y),not(Y)),not(Y))).
% 473 [hyper:6,111,430] is_a_theorem(implies(X,implies(implies(implies(Y,Z),not(Z)),implies(U,not(Z))))).
% 476 [hyper:6,136,slowcut:473] is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))).
% 480 [hyper:6,476,111] is_a_theorem(implies(implies(X,Y),implies(X,implies(Z,Y)))).
% 532 [hyper:6,480,56] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 1232 [hyper:6,532,480] is_a_theorem(implies(X,implies(implies(X,Y),implies(Z,Y)))).
% 1270 [hyper:6,1232,56,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 5
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 235
% derived clauses: 20093
% kept clauses: 737
% kept size sum: 9776
% kept mid-nuclei: 504
% kept new demods: 0
% forw unit-subs: 7810
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 7
% fast unit cutoff: 0
% full unit cutoff: 16
% dbl unit cutoff: 0
% real runtime : 0.15
% process. runtime: 0.14
% 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/LCL067-1+noeq.in")
%
%------------------------------------------------------------------------------