TSTP Solution File: LCL389-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL389-1 : TPTP v3.4.2. Released v2.3.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/LCL389-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,0,10,0,0)
%
%
% START OF PROOF
% 6 [] -is_a_theorem(implies(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 7 [] is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 8 [] is_a_theorem(implies(implies(not(X),X),X)).
% 9 [] is_a_theorem(implies(X,implies(not(X),Y))).
% 10 [] -is_a_theorem(implies(implies(x,implies(y,not(z))),implies(x,implies(z,not(y))))).
% 21 [hyper:6,7,8] is_a_theorem(implies(implies(X,Y),implies(implies(not(X),X),Y))).
% 22 [hyper:6,7,9] is_a_theorem(implies(implies(implies(not(X),Y),Z),implies(X,Z))).
% 23 [hyper:6,7,7] is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),U),implies(implies(Z,X),U))).
% 38 [hyper:6,22,8] is_a_theorem(implies(X,X)).
% 42 [hyper:6,38,9] is_a_theorem(implies(not(implies(X,X)),Y)).
% 55 [hyper:6,23,22] is_a_theorem(implies(implies(X,not(Y)),implies(Y,implies(X,Z)))).
% 56 [hyper:6,23,23] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(U,Y),implies(X,implies(U,Z))))).
% 59 [hyper:6,55,42] is_a_theorem(implies(X,implies(not(implies(Y,Y)),Z))).
% 61 [hyper:6,55,7] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),U),implies(implies(Y,not(X)),U))).
% 76 [hyper:6,61,7] is_a_theorem(implies(implies(X,not(Y)),implies(implies(implies(X,Z),U),implies(Y,U)))).
% 88 [hyper:6,56,21] is_a_theorem(implies(implies(X,implies(not(Y),Y)),implies(implies(Y,Z),implies(X,Z)))).
% 92 [hyper:6,56,76] is_a_theorem(implies(implies(X,implies(implies(Y,Z),U)),implies(implies(Y,not(V)),implies(X,implies(V,U))))).
% 97 [hyper:6,88,59] is_a_theorem(implies(implies(implies(X,X),Y),implies(Z,Y))).
% 101 [hyper:6,97,21] is_a_theorem(implies(X,implies(implies(not(Y),Y),Y))).
% 109 [hyper:6,97,7] is_a_theorem(implies(implies(implies(X,Y),Z),implies(implies(implies(U,U),Y),Z))).
% 147 [hyper:6,92,101] is_a_theorem(implies(implies(not(X),not(Y)),implies(Z,implies(Y,X)))).
% 205 [hyper:6,109,56] is_a_theorem(implies(implies(implies(X,X),implies(Y,Z)),implies(implies(U,Y),implies(V,implies(U,Z))))).
% 215 [hyper:6,147,22] is_a_theorem(implies(X,implies(Y,implies(Z,X)))).
% 229 [hyper:6,215,88] is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 248 [hyper:6,229,92] is_a_theorem(implies(implies(implies(X,Y),Z),implies(implies(X,not(U)),implies(V,implies(U,Z))))).
% 249 [hyper:6,229,147] is_a_theorem(implies(not(X),implies(Y,implies(X,Z)))).
% 290 [hyper:6,249,88] is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))).
% 335 [hyper:6,290,8] is_a_theorem(implies(not(not(X)),X)).
% 358 [hyper:6,290,88] is_a_theorem(implies(implies(X,Y),implies(implies(implies(X,Z),X),Y))).
% 368 [hyper:6,335,7] is_a_theorem(implies(implies(X,Y),implies(not(not(X)),Y))).
% 702 [hyper:6,358,38] is_a_theorem(implies(implies(implies(X,Y),X),X)).
% 733 [hyper:6,702,23] is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))).
% 772 [hyper:6,733,23] is_a_theorem(implies(implies(implies(X,Y),X),implies(implies(X,Y),Y))).
% 1019 [hyper:6,772,229] is_a_theorem(implies(X,implies(implies(X,Y),Y))).
% 1028 [hyper:6,1019,7] is_a_theorem(implies(implies(implies(implies(X,Y),Y),Z),implies(X,Z))).
% 1100 [hyper:6,205,21] is_a_theorem(implies(implies(X,implies(not(Y),Y)),implies(Z,implies(X,Y)))).
% 1204 [hyper:6,1028,23] is_a_theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 1403 [hyper:6,1204,8] is_a_theorem(implies(implies(X,implies(not(Y),Y)),implies(X,Y))).
% 1516 [hyper:6,1403,368] is_a_theorem(implies(implies(X,not(X)),not(X))).
% 1798 [hyper:6,248,1516] is_a_theorem(implies(implies(X,not(Y)),implies(Z,implies(Y,not(X))))).
% 2607 [hyper:6,1100,1798] is_a_theorem(implies(X,implies(implies(Y,not(Z)),implies(Z,not(Y))))).
% 2610 [hyper:6,2607,slowcut:2607] is_a_theorem(implies(implies(X,not(Y)),implies(Y,not(X)))).
% 2625 [hyper:6,2610,1204,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: 516
% derived clauses: 77283
% kept clauses: 1540
% kept size sum: 21733
% kept mid-nuclei: 1060
% kept new demods: 0
% forw unit-subs: 26721
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 44
% fast unit cutoff: 0
% full unit cutoff: 12
% dbl unit cutoff: 0
% real runtime : 0.57
% process. runtime: 0.56
% 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/LCL389-1+noeq.in")
%
%------------------------------------------------------------------------------