TSTP Solution File: LCL018-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL018-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 : art06.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 239.2s
% Output : Assurance 239.2s
% 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/LCL018-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,1,6,0,1,9,50,1,12,0,1,20,50,1,23,0,1,33,50,1,36,0,1,75,50,1,78,0,1,47416,4,2183,47563,5,2903,47564,1,2908,47564,50,2913,47564,40,2913,47567,0,2913,47570,50,2913,47573,0,2917,47584,50,2917,47587,0,2917,47606,50,2917,47609,0,2918,47914,50,2922,47917,0,2926,51981,3,3429,52906,4,3685,53845,5,3927,53847,5,3927,53847,1,3927,53847,50,3928,53847,40,3928,53850,0,3928,97952,3,4794,111550,4,5209,113333,5,5629,113334,5,5630,113334,1,5630,113334,50,5632,113334,40,5632,113337,0,5632,163674,4,7811,163832,5,8534,163833,1,8538,163833,50,8542,163833,40,8542,163836,0,8542,170368,3,10266,171919,4,11099,173800,5,11943,173801,5,11943,173801,1,11943,173801,50,11944,173801,40,11944,173804,0,11944,225471,3,13953,232368,4,14949,240439,5,15945,240440,1,15946,240440,50,15948,240440,40,15948,240443,0,15948,271820,3,16799,273609,4,17224,283037,5,17649,283038,5,17649,283039,1,17649,283039,50,17650,283039,40,17650,283042,0,17650,336862,3,19145,344366,4,19827,366469,5,20551,366470,5,20552,366470,1,20552,366470,50,20554,366470,40,20554,366473,0,20554,366476,50,20554,366479,0,20554,366485,50,20554,366488,0,20561,366494,50,20561,366497,0,20561,366540,50,20562,366543,0,20562)
%
%
% START OF PROOF
% 366541 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 366542 [] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),Y),equivalent(Z,X))).
% 366543 [] -is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a))).
% 366545 [binary:366541,366542] -is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),Y)) | is_a_theorem(equivalent(Z,X)).
% 366547 [binary:366542,366545] is_a_theorem(equivalent(X,equivalent(Y,equivalent(equivalent(equivalent(Z,Y),X),Z)))).
% 366548 [binary:366541,366547] is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(Y,X),Z),Y))) | -is_a_theorem(Z).
% 366550 [binary:366542,366548.2] is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(Y,X),equivalent(equivalent(equivalent(Z,equivalent(U,V)),U),equivalent(V,Z))),Y))).
% 366551 [binary:366547,366548.2] is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(Y,X),equivalent(Z,equivalent(U,equivalent(equivalent(equivalent(V,U),Z),V)))),Y))).
% 366552 [binary:366541,366550] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(Z,equivalent(U,V)),U),equivalent(V,Z))),X)) | -is_a_theorem(Y).
% 366553 [binary:366541,366551] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,equivalent(U,equivalent(equivalent(equivalent(V,U),Z),V)))),X)) | -is_a_theorem(Y).
% 366555 [binary:366542,366552.2] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(equivalent(Y,equivalent(Z,U)),Z),equivalent(U,Y))),equivalent(equivalent(equivalent(V,equivalent(W,X1)),W),equivalent(X1,V))),X)).
% 366558 [binary:366542,366553.2] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(equivalent(Y,equivalent(Z,U)),Z),equivalent(U,Y))),equivalent(V,equivalent(W,equivalent(equivalent(equivalent(X1,W),V),X1)))),X)).
% 366560 [binary:366541,366555] -is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(equivalent(Y,equivalent(Z,U)),Z),equivalent(U,Y))),equivalent(equivalent(equivalent(V,equivalent(W,X1)),W),equivalent(X1,V)))) | is_a_theorem(X).
% 366561 [binary:366545,366555] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(Y,equivalent(Z,X)),Z),equivalent(equivalent(equivalent(U,equivalent(V,W)),V),equivalent(W,U))))).
% 366564 [binary:366541,366561] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),Y),equivalent(equivalent(equivalent(U,equivalent(V,W)),V),equivalent(W,U)))) | -is_a_theorem(equivalent(Z,X)).
% 366568 [binary:366547,366564.2] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,equivalent(equivalent(equivalent(Y,X),Z),Y)),equivalent(U,Z)),U),equivalent(equivalent(equivalent(V,equivalent(W,X1)),W),equivalent(X1,V)))).
% 366575 [binary:366545,366558] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(equivalent(Y,X),Z),Y)),equivalent(Z,equivalent(equivalent(equivalent(U,equivalent(V,W)),V),equivalent(W,U))))).
% 366579 [binary:366541,366575,binarydemod:366548] is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(Y,equivalent(Z,U)),Z),equivalent(U,Y)))) | -is_a_theorem(X).
% 366584 [binary:366547,366579.2] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(equivalent(equivalent(Z,Y),X),Z))),equivalent(equivalent(equivalent(U,equivalent(V,W)),V),equivalent(W,U)))).
% 366607 [binary:366561,366560] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,equivalent(equivalent(Y,equivalent(U,X)),U))),Z)).
% 366608 [binary:366541,366607] -is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,equivalent(equivalent(Y,equivalent(U,X)),U)))) | is_a_theorem(Z).
% 366610 [binary:366561,366608] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(equivalent(Y,X),Z),Y)),equivalent(U,Z)),U)).
% 366611 [binary:366541,366610] -is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(equivalent(Y,X),Z),Y)),equivalent(U,Z))) | is_a_theorem(U).
% 366613 [binary:366561,366611] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(Z,equivalent(U,V)),U),equivalent(V,Z))),X),equivalent(W,Y)),W)).
% 366654 [binary:366545,366584] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,equivalent(equivalent(equivalent(Y,equivalent(Z,U)),Z),equivalent(U,Y))),V),X),V)).
% 366661 [binary:366541,366654] -is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(equivalent(Y,equivalent(Z,U)),Z),equivalent(U,Y))),V),X)) | is_a_theorem(V).
% 366708 [binary:366541,366613] -is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(Z,equivalent(U,V)),U),equivalent(V,Z))),X),equivalent(W,Y))) | is_a_theorem(W).
% 366762 [binary:366568,366708,binarydemod:366545] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,equivalent(Z,U)),Z)),equivalent(U,Y)),X)).
% 366763 [binary:366541,366762] -is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,equivalent(Z,U)),Z)),equivalent(U,Y))) | is_a_theorem(X).
% 366764 [binary:366545,366762] is_a_theorem(equivalent(X,equivalent(Y,equivalent(equivalent(X,equivalent(Z,Y)),Z)))).
% 366788 [binary:366542,366763] is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(X,equivalent(Y,Z)),Y),Z))).
% 366795 [binary:366762,366763] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,equivalent(U,equivalent(Y,equivalent(Z,X)))),U))).
% 366797 [binary:366541,366788] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),Y),Z)) | -is_a_theorem(X).
% 366815 [binary:366764,366797.2] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,equivalent(Y,equivalent(equivalent(X,equivalent(Z,Y)),Z))),equivalent(U,V)),U),V)).
% 366816 [binary:366788,366797.2] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,equivalent(equivalent(equivalent(X,equivalent(Y,Z)),Y),Z)),equivalent(U,V)),U),V)).
% 366823 [binary:366608,366795] is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(Y,equivalent(Z,U)),Z),equivalent(Y,equivalent(X,U))))).
% 366966 [binary:366661,366815] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,equivalent(Z,X)),Z)),equivalent(U,Y)),U)).
% 366969 [binary:366541,366966] -is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,equivalent(Z,X)),Z)),equivalent(U,Y))) | is_a_theorem(U).
% 367001 [binary:366661,366816] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),Y),Z),equivalent(U,X)),U)).
% 367004 [binary:366541,367001] -is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),Y),Z),equivalent(U,X))) | is_a_theorem(U).
% 367012 [binary:366654,367004] is_a_theorem(equivalent(X,equivalent(equivalent(Y,X),Y))).
% 367020 [binary:366541,367012] is_a_theorem(equivalent(equivalent(X,Y),X)) | -is_a_theorem(Y).
% 367063 [binary:367012,367020.2] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(equivalent(Z,Y),Z))),X)).
% 367065 [binary:366545,367063] is_a_theorem(equivalent(equivalent(equivalent(X,Y),X),Y)).
% 367087 [binary:366541,367065] -is_a_theorem(equivalent(equivalent(X,Y),X)) | is_a_theorem(Y).
% 367110 [binary:366607,367087] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Y,equivalent(Z,X)),Z))).
% 367111 [binary:366610,367087] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(equivalent(Y,X),Z),Y)),Z)).
% 367118 [binary:367001,367087] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),Y),Z),X)).
% 367440 [binary:366541,367110] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),Y)) | -is_a_theorem(equivalent(Z,X)).
% 367448 [binary:366611,367110] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),X),equivalent(Z,Y))).
% 367464 [binary:366969,367110] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),Y),equivalent(X,Z))).
% 367492 [binary:367087,367111] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Y),X)).
% 367495 [binary:366541,367492] -is_a_theorem(equivalent(equivalent(X,Y),Y)) | is_a_theorem(X).
% 367636 [binary:366545,367118] is_a_theorem(equivalent(X,equivalent(equivalent(Y,equivalent(Z,equivalent(Y,X))),Z))).
% 368640 [binary:366763,367448] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),Y),X),Z)).
% 368659 [binary:366541,367464] -is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),Y)) | is_a_theorem(equivalent(X,Z)).
% 368691 [binary:367495,367464] is_a_theorem(equivalent(X,equivalent(equivalent(X,Y),Y))).
% 368763 [binary:367440.2,368691] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Y),equivalent(Z,X)),Z)).
% 369536 [binary:367440.2,367636,binarydemod:368659] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,equivalent(X,Z))),Y),Z)).
% 371558 [binary:366545,368640] is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(Y,X),equivalent(Z,Y)),Z))).
% 372291 [binary:366541,368763] -is_a_theorem(equivalent(equivalent(equivalent(X,Y),Y),equivalent(Z,X))) | is_a_theorem(Z).
% 374994 [binary:368659,369536] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(X,Y))),Z)).
% 384972 [binary:371558,372291] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),Z)),equivalent(Y,X))).
% 387495 [binary:366541,374994] -is_a_theorem(equivalent(X,equivalent(equivalent(Y,Z),equivalent(X,Y)))) | is_a_theorem(Z).
% 404461 [binary:366541,384972] -is_a_theorem(equivalent(X,equivalent(equivalent(Y,Z),Z))) | is_a_theorem(equivalent(Y,X)).
% 407409 [binary:366795,387495] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Y,equivalent(Z,X)))).
% 435738 [binary:366823,404461] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(X,equivalent(Y,Z)),Z)),Y)).
% 439237 [binary:366541,407409] -is_a_theorem(equivalent(equivalent(X,Y),Z)) | is_a_theorem(equivalent(Y,equivalent(Z,X))).
% 465823 [binary:435738,439237,slowcut:366543] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos 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 9
% seconds given: 111
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 9041
% derived clauses: 1604922
% kept clauses: 349490
% kept size sum: 0
% kept mid-nuclei: 45700
% kept new demods: 0
% forw unit-subs: 485419
% forw double-subs: 111359
% forw overdouble-subs: 158700
% backward subs: 1957
% fast unit cutoff: 11900
% full unit cutoff: 652
% dbl unit cutoff: 309
% real runtime : 242.55
% process. runtime: 241.14
% specific non-discr-tree subsumption statistics:
% tried: 29086568
% length fails: 1596952
% strength fails: 4744081
% predlist fails: 2129485
% aux str. fails: 1076868
% by-lit fails: 819476
% full subs tried: 18300402
% full subs fail: 18118043
%
% ; 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/LCL018-1+noeq.in")
%
%------------------------------------------------------------------------------