TSTP Solution File: LCL002-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL002-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 : art05.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 30.0s
% Output : Assurance 30.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/LCL002-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 7 5)
% (binary-unit 11 #f 7 5)
% (binary-double 17 #f 7 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 7 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(3,40,1,6,0,1,18,50,1,21,0,1,464,50,6,467,0,6,18624,4,2108,19391,5,2807,19391,1,2807,19391,50,2808,19391,40,2808,19394,0,2808)
%
%
% START OF PROOF
% 10195 [?] ?
% 11180 [?] ?
% 19392 [] -is_a_theorem(or(not(X),Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 19393 [] is_a_theorem(or(not(or(not(or(not(X),Y)),or(Z,or(U,V)))),or(not(or(not(U),X)),or(Z,or(V,X))))).
% 19394 [] -is_a_theorem(or(not(or(not(b),c)),or(not(or(a,b)),or(a,c)))).
% 19396 [binary:19392.3,19394] -is_a_theorem(or(not(X),or(not(or(not(b),c)),or(not(or(a,b)),or(a,c))))) | -is_a_theorem(X).
% 19398 [binary:19392,19393] -is_a_theorem(or(not(or(not(X),Y)),or(Z,or(U,V)))) | is_a_theorem(or(not(or(not(U),X)),or(Z,or(V,X)))).
% 19399 [binary:19396,19393] -is_a_theorem(or(not(or(not(c),X)),or(not(or(a,b)),or(b,a)))).
% 19400 [binary:19392.3,19399] -is_a_theorem(or(not(X),or(not(or(not(c),Y)),or(not(or(a,b)),or(b,a))))) | -is_a_theorem(X).
% 19402 [binary:19393,19398] is_a_theorem(or(not(or(not(X),or(not(Y),Z))),or(not(or(not(U),Y)),or(or(V,Y),or(not(Y),Z))))).
% 19411 [binary:19398,19402] is_a_theorem(or(not(or(not(or(X,Y)),Z)),or(not(or(not(U),Y)),or(or(not(Y),V),Z)))).
% 19413 [binary:19398,19411] is_a_theorem(or(not(or(not(or(not(X),Y)),or(Z,X))),or(not(or(not(U),X)),or(V,or(Z,X))))).
% 19422 [binary:19392,19413] is_a_theorem(or(not(or(not(X),Y)),or(Z,or(U,Y)))) | -is_a_theorem(or(not(or(not(Y),V)),or(U,Y))).
% 19436 [binary:19393,19422.2] is_a_theorem(or(not(or(not(X),or(not(Y),or(Z,Y)))),or(U,or(not(or(not(V),Y)),or(not(Y),or(Z,Y)))))).
% 19438 [binary:19411,19422.2] is_a_theorem(or(not(or(not(X),or(or(not(Y),Z),Y))),or(U,or(not(or(not(V),Y)),or(or(not(Y),Z),Y))))).
% 19441 [binary:19392,19436,cut:10195] is_a_theorem(or(X,or(not(or(not(Y),Z)),or(not(Z),or(U,Z))))).
% 19443 [binary:19392,19441,slowcut:19441] is_a_theorem(or(not(or(not(X),Y)),or(not(Y),or(Z,Y)))).
% 19448 [binary:19392.2,19443] -is_a_theorem(or(not(or(not(or(not(X),Y)),or(not(Y),or(Z,Y)))),U)) | is_a_theorem(U).
% 19449 [binary:19398,19443] is_a_theorem(or(not(or(not(X),Y)),or(not(Z),or(Z,Y)))).
% 19463 [binary:19392,19449] is_a_theorem(or(not(X),or(X,Y))) | -is_a_theorem(or(not(Z),Y)).
% 19464 [binary:19392.2,19449] -is_a_theorem(or(not(or(not(or(not(X),Y)),or(not(Z),or(Z,Y)))),U)) | is_a_theorem(U).
% 19465 [binary:19398,19449] is_a_theorem(or(not(or(not(X),Y)),or(not(X),or(Z,Y)))).
% 19529 [binary:19392,19465] is_a_theorem(or(not(X),or(Y,Z))) | -is_a_theorem(or(not(X),Z)).
% 19530 [binary:19392.2,19465] -is_a_theorem(or(not(or(not(or(not(X),Y)),or(not(X),or(Z,Y)))),U)) | is_a_theorem(U).
% 19545 [binary:19422.2,19465] is_a_theorem(or(not(or(not(X),or(Y,Z))),or(U,or(not(or(Y,Z)),or(Y,Z))))).
% 19564 [binary:19411,19529.2] is_a_theorem(or(not(or(not(or(X,Y)),Z)),or(U,or(not(or(not(V),Y)),or(or(not(Y),W),Z))))).
% 19570 [binary:19465,19529.2] is_a_theorem(or(not(or(not(X),Y)),or(Z,or(not(X),or(U,Y))))).
% 19632 [binary:19392,19438,cut:11180] is_a_theorem(or(X,or(not(or(not(Y),Z)),or(or(not(Z),U),Z)))).
% 19778 [binary:19392,19570] is_a_theorem(or(X,or(not(Y),or(Z,U)))) | -is_a_theorem(or(not(Y),U)).
% 19841 [binary:19570,19778.2] is_a_theorem(or(X,or(not(or(not(Y),Z)),or(U,or(V,or(not(Y),or(W,Z))))))).
% 19843 [binary:19392,19632,slowcut:19841] is_a_theorem(or(not(or(not(X),Y)),or(or(not(Y),Z),Y))).
% 19849 [binary:19392,19843] is_a_theorem(or(or(not(X),Y),X)) | -is_a_theorem(or(not(Z),X)).
% 19859 [binary:19422.2,19843] is_a_theorem(or(not(or(not(X),Y)),or(Z,or(or(not(Y),U),Y)))).
% 20035 [binary:19398,19859] is_a_theorem(or(not(or(not(or(not(X),Y)),Z)),or(U,or(X,Z)))).
% 20231 [binary:19463.2,20035] is_a_theorem(or(not(X),or(X,or(Y,or(Z,U))))).
% 20234 [binary:19448,20035] is_a_theorem(or(X,or(Y,or(not(Z),or(U,Z))))).
% 20245 [binary:19392,20231] is_a_theorem(or(X,or(Y,or(Z,U)))) | -is_a_theorem(X).
% 20301 [binary:20231,20245.2] is_a_theorem(or(or(not(X),or(X,or(Y,or(Z,U)))),or(V,or(W,X1)))).
% 20303 [binary:19392,20234,slowcut:20301] is_a_theorem(or(X,or(not(Y),or(Z,Y)))).
% 20335 [binary:20245.2,20234] is_a_theorem(or(or(X,or(Y,or(not(Z),or(U,Z)))),or(V,or(W,X1)))).
% 20337 [binary:19392,20303,slowcut:20335] is_a_theorem(or(not(X),or(Y,X))).
% 20372 [binary:20035,19464] is_a_theorem(or(X,or(Y,or(not(Z),or(Z,U))))).
% 20376 [binary:19392.2,20337] -is_a_theorem(or(not(or(not(X),or(Y,X))),Z)) | is_a_theorem(Z).
% 20378 [binary:19400,20337] -is_a_theorem(or(not(or(a,b)),or(b,a))).
% 20396 [binary:19529.2,20337] is_a_theorem(or(not(X),or(Y,or(Z,X)))).
% 20534 [binary:19392,20396] is_a_theorem(or(X,or(Y,Z))) | -is_a_theorem(Z).
% 20576 [binary:20396,20534.2] is_a_theorem(or(X,or(Y,or(not(Z),or(U,or(V,Z)))))).
% 20621 [binary:19392,20372,slowcut:20576] is_a_theorem(or(X,or(not(Y),or(Y,Z)))).
% 20658 [binary:20534.2,20372] is_a_theorem(or(X,or(Y,or(Z,or(U,or(not(V),or(V,W))))))).
% 20663 [binary:19392,20621,slowcut:20658] is_a_theorem(or(not(X),or(X,Y))).
% 20699 [binary:19392,20663] is_a_theorem(or(X,Y)) | -is_a_theorem(X).
% 20700 [binary:19392.2,20663] -is_a_theorem(or(not(or(not(X),or(X,Y))),Z)) | is_a_theorem(Z).
% 20710 [binary:19529.2,20663] is_a_theorem(or(not(X),or(Y,or(X,Z)))).
% 20767 [binary:19392,20710] is_a_theorem(or(X,or(Y,Z))) | -is_a_theorem(Y).
% 21872 [binary:20035,20376] is_a_theorem(or(X,or(Y,or(Z,or(not(Y),U))))).
% 21902 [binary:19392,21872,slowcut:21872] is_a_theorem(or(X,or(Y,or(not(X),Z)))).
% 21911 [binary:19392,21902] is_a_theorem(or(X,or(not(not(Y)),Z))) | -is_a_theorem(Y).
% 21948 [binary:20376,21902] is_a_theorem(or(X,or(not(not(or(not(Y),or(Z,Y)))),U))).
% 21950 [binary:20663,21911.2] is_a_theorem(or(X,or(not(not(or(not(Y),or(Y,Z)))),U))).
% 23006 [binary:20035,19530] is_a_theorem(or(X,or(Y,or(not(Y),or(Z,U))))).
% 23108 [binary:19392,23006,slowcut:23006] is_a_theorem(or(X,or(not(X),or(Y,Z)))).
% 23166 [binary:19392,23108] is_a_theorem(or(not(not(X)),or(Y,Z))) | -is_a_theorem(X).
% 23234 [binary:23108,23166.2] is_a_theorem(or(not(not(or(X,or(not(X),or(Y,Z))))),or(U,V))).
% 23560 [binary:19392,19545,slowcut:23234] is_a_theorem(or(X,or(not(or(Y,Z)),or(Y,Z)))).
% 23565 [binary:20699.2,19545] is_a_theorem(or(or(not(or(not(X),or(Y,Z))),or(U,or(not(or(Y,Z)),or(Y,Z)))),V)).
% 23568 [binary:19392,23560,slowcut:23565] is_a_theorem(or(not(or(X,Y)),or(X,Y))).
% 23572 [binary:19398,23560] is_a_theorem(or(not(or(not(X),Y)),or(not(or(X,Z)),or(Z,Y)))).
% 23635 [binary:19422.2,23568] is_a_theorem(or(not(or(not(X),Y)),or(Z,or(not(Y),Y)))).
% 23826 [binary:20700,19564] is_a_theorem(or(X,or(not(or(not(Y),Z)),or(or(not(Z),U),or(or(V,Z),W))))).
% 23831 [binary:19392,21948,slowcut:23826] is_a_theorem(or(not(not(or(not(X),or(Y,X)))),Z)).
% 23833 [binary:19849.2,23831] is_a_theorem(or(or(not(X),Y),X)).
% 23873 [binary:20699.2,23833] is_a_theorem(or(or(or(not(X),Y),X),Z)).
% 23980 [binary:20699.2,23873] is_a_theorem(or(or(or(or(not(X),Y),X),Z),U)).
% 24028 [binary:20699.2,23980] is_a_theorem(or(or(or(or(or(not(X),Y),X),Z),U),V)).
% 24193 [binary:19392,21950,slowcut:24028] is_a_theorem(or(not(not(or(not(X),or(X,Y)))),Z)).
% 24235 [binary:19392,23635,slowcut:24193] is_a_theorem(or(X,or(not(Y),Y))).
% 24275 [binary:20767.2,23635] is_a_theorem(or(X,or(or(not(or(not(Y),Z)),or(U,or(not(Z),Z))),V))).
% 24293 [binary:19392,24235,slowcut:24275] is_a_theorem(or(not(X),X)).
% 24358 [binary:19392.2,24293] -is_a_theorem(or(not(or(not(X),X)),Y)) | is_a_theorem(Y).
% 25059 [binary:20378,24358.2,slowcut:23572] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 5
% clause depth limited to 7
% seconds given: 11
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2067
% derived clauses: 390966
% kept clauses: 21528
% kept size sum: 454107
% kept mid-nuclei: 3064
% kept new demods: 0
% forw unit-subs: 271570
% forw double-subs: 66
% forw overdouble-subs: 0
% backward subs: 1119
% fast unit cutoff: 4
% full unit cutoff: 342
% dbl unit cutoff: 0
% real runtime : 31.16
% process. runtime: 31.16
% 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/LCL002-1+noeq.in")
%
%------------------------------------------------------------------------------