TSTP Solution File: LCL004-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL004-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/LCL004-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,0,6,0,0,18,50,0,21,0,0,464,50,4,467,0,4)
%
%
% START OF PROOF
% 465 [] -is_a_theorem(or(not(X),Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 466 [] 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))))).
% 467 [] -is_a_theorem(or(not(a),or(b,a))).
% 470 [hyper:465,466,466] 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))))).
% 478 [hyper:465,470,466] is_a_theorem(or(not(or(not(or(X,Y)),Z)),or(not(or(not(U),Y)),or(or(not(Y),V),Z)))).
% 486 [hyper:465,478,466] 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))))).
% 500 [hyper:465,486,466] 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)))))).
% 501 [hyper:465,486,470] is_a_theorem(or(not(or(not(X),or(or(Y,Z),or(not(Z),U)))),or(V,or(not(or(not(W),Z)),or(or(Y,Z),or(not(Z),U)))))).
% 525 [hyper:465,500,466] is_a_theorem(or(X,or(not(or(not(Y),or(not(Z),U))),or(not(or(not(Z),U)),or(V,or(not(Z),U)))))).
% 527 [hyper:465,500,466] is_a_theorem(or(not(or(not(not(or(not(X),Y))),Z)),or(U,or(or(not(Y),or(V,Y)),Z)))).
% 543 [?] ?
% 549 [hyper:465,525,slowcut:543] is_a_theorem(or(not(or(not(X),or(not(Y),Z))),or(not(or(not(Y),Z)),or(U,or(not(Y),Z))))).
% 562 [hyper:465,549,466] is_a_theorem(or(not(or(not(X),Y)),or(not(or(not(Z),U)),or(or(not(Z),U),Y)))).
% 576 [hyper:465,562,527] is_a_theorem(or(not(or(not(X),Y)),or(or(not(X),Y),or(Z,or(or(not(U),or(V,U)),W))))).
% 579 [hyper:465,562,466] is_a_theorem(or(not(or(not(or(not(X),Y)),Z)),or(not(or(not(X),Y)),or(U,Z)))).
% 589 [hyper:465,579,466] is_a_theorem(or(not(or(not(or(not(X),Y)),or(Z,or(U,V)))),or(W,or(not(or(not(U),X)),or(Z,or(V,X)))))).
% 591 [hyper:465,579,478] 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))))).
% 593 [hyper:465,579,486] is_a_theorem(or(not(or(not(or(not(X),Y)),or(Z,X))),or(U,or(not(or(not(V),X)),or(W,or(Z,X)))))).
% 599 [hyper:465,579,527] is_a_theorem(or(not(or(not(not(or(not(X),Y))),Z)),or(U,or(V,or(or(not(Y),or(W,Y)),Z))))).
% 608 [hyper:465,579,486] is_a_theorem(or(not(or(not(X),or(not(Y),Z))),or(U,or(not(or(not(Y),Z)),or(not(Y),Z))))).
% 785 [hyper:465,576,466] is_a_theorem(or(not(or(not(X),Y)),or(or(not(Y),Z),or(or(or(not(U),or(V,U)),W),Y)))).
% 809 [hyper:465,608,466] is_a_theorem(or(not(or(not(not(or(not(X),Y))),Z)),or(U,or(or(not(X),Y),Z)))).
% 843 [hyper:465,785,466] is_a_theorem(or(not(or(not(or(or(not(X),or(Y,X)),Z)),U)),or(or(not(V),W),or(V,U)))).
% 874 [hyper:465,591,809] is_a_theorem(or(X,or(not(or(not(Y),Z)),or(or(not(Z),U),or(V,or(or(not(W),X1),Z)))))).
% 875 [hyper:465,591,843] is_a_theorem(or(X,or(not(or(not(Y),Z)),or(or(not(Z),U),or(or(not(V),W),or(V,Z)))))).
% 881 [hyper:465,591,576] is_a_theorem(or(or(not(or(not(or(X,Y)),Z)),or(U,or(not(or(not(V),Y)),or(or(not(Y),W),Z)))),or(X1,or(or(not(X2),or(X3,X2)),X4)))).
% 885 [hyper:465,874,slowcut:881] is_a_theorem(or(not(or(not(X),Y)),or(or(not(Y),Z),or(U,or(or(not(V),W),Y))))).
% 910 [hyper:465,885,466] is_a_theorem(or(not(or(not(X),Y)),or(or(not(Z),U),or(or(or(not(V),W),Z),Y)))).
% 948 [hyper:465,910,466] is_a_theorem(or(not(or(not(or(or(not(X),Y),Z)),U)),or(or(not(Z),V),or(W,U)))).
% 959 [hyper:465,948,874] is_a_theorem(or(or(not(X),Y),or(Z,or(not(or(not(U),V)),or(or(not(V),W),or(X1,or(or(not(X2),X3),V))))))).
% 966 [hyper:465,875,slowcut:959] is_a_theorem(or(not(or(not(X),Y)),or(or(not(Y),Z),or(or(not(U),V),or(U,Y))))).
% 1009 [hyper:465,966,466] is_a_theorem(or(not(or(not(or(not(X),Y)),Z)),or(or(not(U),V),or(or(X,U),Z)))).
% 1150 [hyper:465,501,948] is_a_theorem(or(X,or(not(or(not(Y),Z)),or(or(not(U),Z),or(not(Z),V))))).
% 1159 [hyper:465,501,1009] is_a_theorem(or(or(not(X),Y),or(or(Z,X),or(U,or(not(or(not(V),W)),or(or(X1,W),or(not(W),X2))))))).
% 1163 [hyper:465,1150,slowcut:1159] is_a_theorem(or(not(or(not(X),Y)),or(or(not(Z),Y),or(not(Y),U)))).
% 1203 [hyper:465,1163,466] is_a_theorem(or(not(or(not(not(X)),Y)),or(or(not(Z),X),or(U,Y)))).
% 1208 [hyper:465,1163,579] is_a_theorem(or(not(or(not(X),Y)),or(Z,or(or(not(U),Y),or(not(Y),V))))).
% 1223 [hyper:465,1203,466] is_a_theorem(or(not(or(not(X),not(Y))),or(or(not(Z),Y),or(U,not(Y))))).
% 1227 [hyper:465,1203,579] is_a_theorem(or(not(or(not(not(X)),Y)),or(Z,or(or(not(U),X),or(V,Y))))).
% 1243 [hyper:465,1223,466] is_a_theorem(or(not(or(not(X),Y)),or(or(not(Z),U),or(not(U),Y)))).
% 1317 [hyper:465,1208,466] is_a_theorem(or(not(or(not(or(not(X),Y)),Z)),or(U,or(or(not(Y),V),Z)))).
% 1431 [hyper:465,1317,1227] is_a_theorem(or(X,or(or(not(Y),Z),or(U,or(or(not(V),W),or(X1,Y)))))).
% 1437 [hyper:465,1317,500] is_a_theorem(or(X,or(not(or(not(Y),Z)),or(not(Z),or(or(not(U),V),Z))))).
% 1552 [hyper:465,1431,1227] is_a_theorem(or(X,or(or(not(Y),Z),or(U,or(or(not(V),W),or(X1,or(or(not(X2),X3),or(X4,V)))))))).
% 1557 [hyper:465,1437,slowcut:1552] is_a_theorem(or(not(or(not(X),Y)),or(not(Y),or(or(not(Z),U),Y)))).
% 1594 [hyper:465,1557,466] is_a_theorem(or(not(or(not(or(not(X),Y)),Z)),or(not(U),or(U,Z)))).
% 1615 [hyper:465,1594,579] is_a_theorem(or(not(X),or(X,or(not(or(not(Y),Z)),or(U,V))))).
% 1626 [hyper:465,1594,948] is_a_theorem(or(not(X),or(X,or(or(not(Y),Z),or(U,V))))).
% 1635 [hyper:465,1594,500] is_a_theorem(or(X,or(not(or(not(Y),Z)),or(not(Z),or(Z,Z))))).
% 2073 [hyper:465,1615,1626] is_a_theorem(or(or(not(X),or(X,or(not(or(not(Y),Z)),or(U,V)))),or(or(not(W),X1),or(X2,X3)))).
% 2077 [hyper:465,1635,slowcut:2073] is_a_theorem(or(not(or(not(X),Y)),or(not(Y),or(Y,Y)))).
% 2101 [hyper:465,2077,466] is_a_theorem(or(not(or(not(X),Y)),or(not(X),or(X,Y)))).
% 2117 [hyper:465,2101,466] is_a_theorem(or(not(or(not(X),X)),or(not(X),or(Y,X)))).
% 2118 [hyper:465,2101,579] is_a_theorem(or(not(or(not(X),Y)),or(Z,or(not(X),or(X,Y))))).
% 2140 [hyper:465,2117,500] is_a_theorem(or(X,or(not(or(not(Y),Z)),or(not(Z),or(U,Z))))).
% 2679 [hyper:465,2118,1594] is_a_theorem(or(not(X),or(X,or(Y,or(not(Z),or(Z,U)))))).
% 2827 [hyper:465,2679,2118] is_a_theorem(or(X,or(not(Y),or(Y,or(Y,or(Z,or(not(U),or(U,V)))))))).
% 2831 [hyper:465,2140,slowcut:2827] is_a_theorem(or(not(or(not(X),Y)),or(not(Y),or(Z,Y)))).
% 2883 [hyper:465,2831,466] is_a_theorem(or(not(or(not(X),Y)),or(not(Z),or(Z,Y)))).
% 2884 [hyper:465,2831,486] is_a_theorem(or(not(or(not(X),or(Y,Z))),or(U,or(not(Z),or(Y,Z))))).
% 2885 [hyper:465,2831,579] is_a_theorem(or(not(or(not(X),Y)),or(Z,or(not(Y),or(U,Y))))).
% 2906 [hyper:465,2883,466] is_a_theorem(or(not(or(not(X),Y)),or(not(X),or(Z,Y)))).
% 2908 [hyper:465,2883,579] is_a_theorem(or(not(or(not(X),Y)),or(Z,or(not(U),or(U,Y))))).
% 3916 [hyper:465,2885,466] is_a_theorem(or(not(or(not(not(X)),Y)),or(Z,or(or(U,X),Y)))).
% 4884 [hyper:465,3916,466] is_a_theorem(or(not(or(not(or(X,Y)),not(Y))),or(Z,or(U,not(Y))))).
% 6658 [hyper:465,4884,1594] is_a_theorem(or(not(X),or(X,or(Y,or(Z,not(U)))))).
% 6877 [hyper:465,6658,2883] is_a_theorem(or(not(X),or(X,or(Y,or(Z,or(U,not(V))))))).
% 7138 [hyper:465,6877,2906] is_a_theorem(or(not(X),or(Y,or(X,or(Z,or(U,or(V,not(W)))))))).
% 8514 [hyper:465,2884,2906] is_a_theorem(or(X,or(not(or(Y,Z)),or(not(U),or(Y,Z))))).
% 8518 [hyper:465,2884,4884] is_a_theorem(or(X,or(not(or(Y,not(Z))),or(U,or(Y,not(Z)))))).
% 8614 [hyper:465,593,7138] is_a_theorem(or(X,or(or(not(or(not(or(not(Y),Z)),or(U,Y))),or(V,or(not(or(not(W),Y)),or(X1,or(U,Y))))),or(X2,or(X3,or(X4,not(X5))))))).
% 8618 [hyper:465,8514,slowcut:8614] is_a_theorem(or(not(or(X,Y)),or(not(Z),or(X,Y)))).
% 8692 [hyper:465,8618,2906] is_a_theorem(or(not(or(X,Y)),or(Z,or(not(U),or(X,Y))))).
% 8912 [hyper:465,8692,589] is_a_theorem(or(X,or(not(or(not(not(Y)),Z)),or(U,or(or(not(Z),V),Z))))).
% 8916 [hyper:465,8518,slowcut:8912] is_a_theorem(or(not(or(X,not(Y))),or(Z,or(X,not(Y))))).
% 8969 [hyper:465,8916,466] is_a_theorem(or(not(or(not(not(X)),X)),or(Y,or(not(Z),X)))).
% 9029 [hyper:465,8969,1243] is_a_theorem(or(or(not(X),Y),or(not(Y),or(Z,or(not(U),V))))).
% 9034 [hyper:465,8969,1594] is_a_theorem(or(not(X),or(X,or(Y,or(not(Z),U))))).
% 9068 [hyper:465,8969,2884] is_a_theorem(or(X,or(not(or(not(Y),Z)),or(U,or(not(Y),Z))))).
% 9296 [hyper:465,9034,2906] is_a_theorem(or(not(X),or(Y,or(X,or(Z,or(not(U),V)))))).
% 10170 [hyper:465,9029,9296] is_a_theorem(or(X,or(or(or(not(Y),Z),or(not(Z),or(U,or(not(V),W)))),or(X1,or(not(X2),X3))))).
% 10173 [hyper:465,9068,slowcut:10170] is_a_theorem(or(not(or(not(X),Y)),or(Z,or(not(X),Y)))).
% 10231 [hyper:465,10173,466] is_a_theorem(or(not(or(not(not(X)),X)),or(Y,or(Z,X)))).
% 10344 [hyper:465,10231,2908] is_a_theorem(or(X,or(not(Y),or(Y,or(Z,or(U,V)))))).
% 10363 [hyper:465,10231,2884] is_a_theorem(or(X,or(not(or(Y,Z)),or(U,or(Y,Z))))).
% 10833 [hyper:465,599,10344] is_a_theorem(or(X,or(Y,or(or(not(Z),or(U,Z)),or(not(V),or(V,or(W,or(X1,X2)))))))).
% 10836 [hyper:465,10363,slowcut:10833] is_a_theorem(or(not(or(X,Y)),or(Z,or(X,Y)))).
% 10911 [hyper:465,10836,2906] is_a_theorem(or(not(or(X,Y)),or(Z,or(U,or(X,Y))))).
% 11287 [hyper:465,10911,466] is_a_theorem(or(not(or(not(X),Y)),or(Z,or(or(not(Y),U),Y)))).
% 11304 [hyper:465,10911,2906] is_a_theorem(or(not(or(X,Y)),or(Z,or(U,or(V,or(X,Y)))))).
% 12178 [hyper:465,11287,466] is_a_theorem(or(not(or(not(or(not(X),Y)),Z)),or(U,or(X,Z)))).
% 12477 [hyper:465,12178,2831] is_a_theorem(or(X,or(Y,or(not(Z),or(U,Z))))).
% 12574 [hyper:465,12178,10911] is_a_theorem(or(X,or(Y,or(not(or(not(or(not(Z),U)),V)),or(W,or(Z,V)))))).
% 12578 [hyper:465,12477,slowcut:12574] is_a_theorem(or(X,or(not(Y),or(Z,Y)))).
% 12620 [hyper:465,12477,11304] is_a_theorem(or(X,or(Y,or(Z,or(U,or(V,or(not(W),or(X1,W)))))))).
% 12623 [hyper:465,12578,slowcut:467,slowcut:12620] 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 9
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 476
% derived clauses: 51710
% kept clauses: 11795
% kept size sum: 299029
% kept mid-nuclei: 766
% kept new demods: 0
% forw unit-subs: 35191
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 248
% fast unit cutoff: 1
% full unit cutoff: 45
% dbl unit cutoff: 0
% real runtime : 2.39
% process. runtime: 2.35
% 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/LCL004-1+noeq.in")
%
%------------------------------------------------------------------------------