TSTP Solution File: LCL083-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL083-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 : art08.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/LCL083-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(3,40,0,6,0,0,9,50,0,12,0,0,31,50,0,34,0,0)
%
%
% START OF PROOF
% 32 [] -is_a_theorem(implies(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 33 [] is_a_theorem(implies(implies(implies(X,Y),Z),implies(implies(Z,X),implies(U,X)))).
% 34 [] -is_a_theorem(implies(implies(implies(a,b),a),a)).
% 37 [hyper:32,33,33] is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),implies(Y,U)),implies(V,implies(Y,U)))).
% 44 [hyper:32,37,33] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),implies(implies(U,Y),implies(V,Y))),implies(W,implies(implies(U,Y),implies(V,Y))))).
% 54 [hyper:32,44,37] is_a_theorem(implies(X,implies(implies(Y,Z),implies(Z,Z)))).
% 66 [?] ?
% 70 [hyper:32,54,slowcut:66] is_a_theorem(implies(implies(X,Y),implies(Y,Y))).
% 79 [hyper:32,70,33] is_a_theorem(implies(implies(implies(X,X),Y),implies(Z,Y))).
% 85 [hyper:32,79,70] is_a_theorem(implies(X,implies(Y,Y))).
% 86 [hyper:32,79,79] is_a_theorem(implies(X,implies(Y,implies(Z,Z)))).
% 88 [hyper:32,79,37] is_a_theorem(implies(X,implies(Y,implies(Z,Y)))).
% 92 [hyper:32,85,slowcut:88] is_a_theorem(implies(X,X)).
% 100 [hyper:32,92,33] is_a_theorem(implies(implies(implies(X,Y),X),implies(Z,X))).
% 103 [hyper:32,86,33] is_a_theorem(implies(implies(implies(X,implies(Y,Y)),Z),implies(U,Z))).
% 106 [hyper:32,88,slowcut:103] is_a_theorem(implies(X,implies(Y,X))).
% 118 [hyper:32,106,33] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),Y),implies(U,Y))).
% 128 [hyper:32,100,33] is_a_theorem(implies(implies(implies(X,Y),implies(Y,Z)),implies(U,implies(Y,Z)))).
% 160 [hyper:32,118,33] is_a_theorem(implies(implies(implies(X,Y),implies(Z,implies(Y,U))),implies(V,implies(Z,implies(Y,U))))).
% 176 [hyper:32,128,33] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),implies(U,Y)),implies(V,implies(U,Y)))).
% 233 [hyper:32,176,33] is_a_theorem(implies(X,implies(implies(implies(implies(Y,Z),U),Z),implies(Y,Z)))).
% 243 [hyper:32,160,106] is_a_theorem(implies(X,implies(implies(implies(Y,Z),implies(U,implies(Z,V))),implies(W,implies(U,implies(Z,V)))))).
% 247 [hyper:32,233,slowcut:243] is_a_theorem(implies(implies(implies(implies(X,Y),Z),Y),implies(X,Y))).
% 250 [hyper:32,247,33] is_a_theorem(implies(implies(implies(X,Y),implies(implies(X,Y),Z)),implies(U,implies(implies(X,Y),Z)))).
% 277 [hyper:32,250,79] is_a_theorem(implies(X,implies(implies(implies(Y,Y),Z),Z))).
% 278 [hyper:32,250,100] is_a_theorem(implies(X,implies(implies(implies(Y,Z),Y),Y))).
% 297 [hyper:32,277,33] is_a_theorem(implies(implies(implies(implies(implies(X,X),Y),Y),Z),implies(U,Z))).
% 304 [hyper:32,278,slowcut:34,slowcut:297] 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: 85
% derived clauses: 4064
% kept clauses: 113
% kept size sum: 1670
% kept mid-nuclei: 164
% kept new demods: 0
% forw unit-subs: 2873
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 24
% fast unit cutoff: 0
% full unit cutoff: 10
% dbl unit cutoff: 0
% real runtime : 0.5
% process. runtime: 0.3
% 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/LCL083-1+noeq.in")
%
%------------------------------------------------------------------------------