TSTP Solution File: LCL381-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL381-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 : art03.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/LCL381-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,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(implies(not(not(x)),y),z),implies(implies(x,y),z))).
% 31 [hyper:6,7,8] is_a_theorem(implies(implies(X,Y),implies(implies(not(X),X),Y))).
% 32 [hyper:6,7,9] is_a_theorem(implies(implies(implies(not(X),Y),Z),implies(X,Z))).
% 33 [hyper:6,7,7] is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),U),implies(implies(Z,X),U))).
% 41 [hyper:6,31,7] is_a_theorem(implies(implies(not(implies(X,Y)),implies(X,Y)),implies(implies(Y,Z),implies(X,Z)))).
% 55 [hyper:6,32,8] is_a_theorem(implies(X,X)).
% 64 [hyper:6,55,9] is_a_theorem(implies(not(implies(X,X)),Y)).
% 68 [hyper:6,33,7] is_a_theorem(implies(implies(X,Y),implies(implies(implies(X,Z),U),implies(implies(Y,Z),U)))).
% 70 [hyper:6,33,32] is_a_theorem(implies(implies(X,not(Y)),implies(Y,implies(X,Z)))).
% 71 [hyper:6,33,33] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(U,Y),implies(X,implies(U,Z))))).
% 104 [hyper:6,70,64] is_a_theorem(implies(X,implies(not(implies(Y,Y)),Z))).
% 107 [hyper:6,70,7] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),U),implies(implies(Y,not(X)),U))).
% 109 [hyper:6,70,32] is_a_theorem(implies(X,implies(Y,implies(not(X),Z)))).
% 113 [hyper:6,104,7] is_a_theorem(implies(implies(implies(not(implies(X,X)),Y),Z),implies(U,Z))).
% 117 [hyper:6,109,7] is_a_theorem(implies(implies(implies(X,implies(not(Y),Z)),U),implies(Y,U))).
% 138 [hyper:6,113,8] is_a_theorem(implies(X,implies(Y,Y))).
% 144 [hyper:6,138,7] is_a_theorem(implies(implies(implies(X,X),Y),implies(Z,Y))).
% 159 [hyper:6,144,31] is_a_theorem(implies(X,implies(implies(not(Y),Y),Y))).
% 386 [hyper:6,71,159] is_a_theorem(implies(implies(X,implies(not(Y),Y)),implies(Z,implies(X,Y)))).
% 665 [hyper:6,386,117] is_a_theorem(implies(X,implies(Y,implies(Z,X)))).
% 670 [hyper:6,386,107] is_a_theorem(implies(implies(not(X),not(Y)),implies(Z,implies(Y,X)))).
% 682 [hyper:6,665,386] is_a_theorem(implies(X,implies(Y,implies(Z,Y)))).
% 692 [hyper:6,682,41] is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 736 [hyper:6,692,7] is_a_theorem(implies(X,implies(implies(X,Y),implies(Z,Y)))).
% 928 [hyper:6,670,692] is_a_theorem(implies(not(X),implies(Y,implies(X,Z)))).
% 940 [hyper:6,928,386] is_a_theorem(implies(X,implies(not(Y),implies(Y,Z)))).
% 943 [hyper:6,928,736] is_a_theorem(implies(implies(implies(not(X),implies(Y,implies(X,Z))),U),implies(V,U))).
% 947 [hyper:6,940,slowcut:943] is_a_theorem(implies(not(X),implies(X,Y))).
% 971 [hyper:6,947,386] is_a_theorem(implies(X,implies(not(not(Y)),Y))).
% 975 [hyper:6,971,slowcut:971] is_a_theorem(implies(not(not(X)),X)).
% 989 [hyper:6,975,68,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: 140
% derived clauses: 13447
% kept clauses: 581
% kept size sum: 8738
% kept mid-nuclei: 356
% kept new demods: 0
% forw unit-subs: 7457
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 17
% fast unit cutoff: 0
% full unit cutoff: 39
% dbl unit cutoff: 0
% real runtime : 0.11
% process. runtime: 0.9
% 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/LCL381-1+noeq.in")
%
%------------------------------------------------------------------------------