TSTP Solution File: LCL091-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL091-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 : art10.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/LCL091-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(3,40,0,6,0,0,12,50,0,15,0,0)
%
%
% START OF PROOF
% 13 [] -is_a_theorem(implies(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 14 [] is_a_theorem(implies(implies(implies(X,Y),implies(Z,U)),implies(implies(U,X),implies(V,implies(Z,X))))).
% 15 [] -is_a_theorem(implies(a,implies(b,a))).
% 18 [hyper:13,14,14] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),implies(Z,U)),implies(V,implies(implies(W,Z),implies(Z,U))))).
% 23 [hyper:13,18,18] is_a_theorem(implies(X,implies(implies(Y,Z),implies(Z,implies(implies(U,V),implies(V,Z)))))).
% 25 [hyper:13,18,14] is_a_theorem(implies(implies(implies(implies(X,Y),implies(Y,Z)),implies(U,implies(V,Y))),implies(W,implies(X1,implies(U,implies(V,Y)))))).
% 29 [hyper:13,23,slowcut:25] is_a_theorem(implies(implies(X,Y),implies(Y,implies(implies(Z,U),implies(U,Y))))).
% 34 [hyper:13,29,14] is_a_theorem(implies(implies(implies(implies(X,Y),implies(Y,Z)),U),implies(V,implies(Z,U)))).
% 38 [hyper:13,34,14] is_a_theorem(implies(X,implies(Y,implies(implies(Y,Z),implies(U,implies(V,Z)))))).
% 40 [hyper:13,34,14] is_a_theorem(implies(implies(implies(X,Y),implies(implies(Z,U),implies(U,X))),implies(V,implies(W,implies(implies(Z,U),implies(U,X)))))).
% 41 [hyper:13,34,18] is_a_theorem(implies(X,implies(implies(Y,Z),implies(Z,implies(U,implies(V,Z)))))).
% 42 [?] ?
% 46 [hyper:13,38,slowcut:42] is_a_theorem(implies(X,implies(implies(X,Y),implies(Z,implies(U,Y))))).
% 49 [hyper:13,46,14] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),U),implies(V,implies(implies(implies(U,W),Z),U)))).
% 53 [hyper:13,41,slowcut:49] is_a_theorem(implies(implies(X,Y),implies(Y,implies(Z,implies(U,Y))))).
% 55 [hyper:13,40,14] is_a_theorem(implies(X,implies(Y,implies(implies(Z,U),implies(U,implies(U,U)))))).
% 58 [hyper:13,53,34] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(U,implies(V,implies(X,implies(Y,Z)))))).
% 60 [hyper:13,53,14] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),U),implies(V,implies(Z,U)))).
% 64 [hyper:13,55,slowcut:60] is_a_theorem(implies(X,implies(implies(Y,Z),implies(Z,implies(Z,Z))))).
% 66 [hyper:13,64,slowcut:64] is_a_theorem(implies(implies(X,Y),implies(Y,implies(Y,Y)))).
% 68 [hyper:13,64,14] is_a_theorem(implies(implies(implies(X,implies(X,X)),Y),implies(Z,implies(implies(U,X),Y)))).
% 73 [hyper:13,66,34] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,implies(Y,Z)),implies(X,implies(Y,Z))))).
% 75 [hyper:13,66,14] is_a_theorem(implies(implies(implies(X,X),Y),implies(Z,implies(X,Y)))).
% 81 [hyper:13,75,14] is_a_theorem(implies(X,implies(implies(Y,Z),implies(implies(Z,Y),implies(U,implies(Y,Y)))))).
% 88 [hyper:13,75,14] is_a_theorem(implies(implies(implies(X,Y),implies(X,X)),implies(Z,implies(U,implies(X,X))))).
% 150 [hyper:13,68,14] is_a_theorem(implies(implies(implies(implies(X,Y),Z),implies(Y,implies(Y,Y))),implies(U,implies(V,implies(Y,implies(Y,Y)))))).
% 154 [hyper:13,81,slowcut:150] is_a_theorem(implies(implies(X,Y),implies(implies(Y,X),implies(Z,implies(X,X))))).
% 179 [hyper:13,88,75] is_a_theorem(implies(X,implies(Y,implies(implies(Z,Z),implies(Z,Z))))).
% 185 [hyper:13,88,154] is_a_theorem(implies(implies(implies(X,implies(Y,implies(Z,Z))),implies(implies(Z,U),implies(Z,Z))),implies(V,implies(implies(implies(Z,U),implies(Z,Z)),implies(implies(Z,U),implies(Z,Z)))))).
% 189 [hyper:13,179,slowcut:185] is_a_theorem(implies(X,implies(implies(Y,Y),implies(Y,Y)))).
% 194 [hyper:13,179,154] is_a_theorem(implies(implies(implies(X,implies(implies(Y,Y),implies(Y,Y))),Z),implies(U,implies(Z,Z)))).
% 197 [hyper:13,189,slowcut:194] is_a_theorem(implies(implies(X,X),implies(X,X))).
% 208 [hyper:13,197,88] is_a_theorem(implies(X,implies(Y,implies(Z,Z)))).
% 220 [hyper:13,73,14] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),X),implies(U,implies(implies(X,implies(Y,Z)),X)))).
% 224 [hyper:13,208,slowcut:220] is_a_theorem(implies(X,implies(Y,Y))).
% 226 [hyper:13,208,14] is_a_theorem(implies(implies(implies(X,X),Y),implies(Z,implies(U,Y)))).
% 230 [hyper:13,208,58] is_a_theorem(implies(X,implies(Y,implies(Z,implies(U,implies(V,V)))))).
% 233 [hyper:13,224,slowcut:230] is_a_theorem(implies(X,X)).
% 235 [hyper:13,224,14] is_a_theorem(implies(implies(X,Y),implies(Z,implies(X,Y)))).
% 239 [hyper:13,233,18] is_a_theorem(implies(X,implies(implies(Y,Z),implies(Z,implies(U,Z))))).
% 278 [hyper:13,226,235] is_a_theorem(implies(X,implies(implies(implies(Y,Y),Z),implies(U,implies(V,Z))))).
% 282 [hyper:13,239,slowcut:278] is_a_theorem(implies(implies(X,Y),implies(Y,implies(Z,Y)))).
% 290 [hyper:13,282,slowcut:233,slowcut:15] 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: 58
% derived clauses: 3061
% kept clauses: 131
% kept size sum: 2150
% kept mid-nuclei: 128
% kept new demods: 0
% forw unit-subs: 1489
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 17
% fast unit cutoff: 0
% full unit cutoff: 18
% dbl unit cutoff: 0
% real runtime : 0.4
% 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/LCL091-1+noeq.in")
%
%------------------------------------------------------------------------------