TSTP Solution File: LCL016-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL016-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 : art03.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 229.0s
% Output : Assurance 229.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/LCL016-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,17,50,1,20,0,1,42,50,1,45,0,1,37241,4,2180,37428,5,2902,37429,1,2906,37429,50,2909,37429,40,2909,37432,0,2909,37435,50,2910,37438,0,2922,37446,50,2923,37449,0,2923,37479,50,2923,37482,0,2923,41874,3,3426,42834,4,3677,43393,5,3924,43393,5,3924,43394,1,3924,43394,50,3925,43394,40,3925,43397,0,3931,43648,50,3933,43651,0,3933,87237,3,4736,99316,4,5134,110744,5,5534,110745,5,5535,110748,1,5535,110748,50,5538,110748,40,5538,110751,0,5538,153290,4,7714,153465,5,8442,153466,1,8446,153466,50,8450,153466,40,8450,153469,0,8450,161052,3,10166,162709,4,11014,163872,5,11851,163874,5,11852,163874,1,11852,163874,50,11854,163874,40,11854,163877,0,11854,184357,3,13856,197225,4,14858,208521,5,15855,208521,1,15855,208521,50,15856,208521,40,15856,208524,0,15856,239638,3,16707,241385,4,17132,244045,5,17557,244046,5,17557,244047,1,17557,244047,50,17558,244047,40,17558,244050,0,17558,286336,3,19328,290605,4,19735,320826,5,20459,320827,5,20460,320827,1,20460,320827,50,20461,320827,40,20461,320830,0,20461,320833,50,20461,320836,0,20461,320839,50,20461,320842,0,20467,320862,50,20467,320865,0,20467)
%
%
% START OF PROOF
% 320863 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 320864 [] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,equivalent(equivalent(Z,Y),X)))).
% 320865 [] -is_a_theorem(equivalent(equivalent(a,b),equivalent(c,equivalent(equivalent(b,c),a)))).
% 320867 [binary:320863,320864] is_a_theorem(equivalent(X,equivalent(equivalent(X,Y),Z))) | -is_a_theorem(equivalent(Z,Y)).
% 320869 [binary:320864,320867.2] is_a_theorem(equivalent(X,equivalent(equivalent(X,equivalent(Y,equivalent(equivalent(Y,Z),U))),equivalent(U,Z)))).
% 320870 [binary:320863,320869] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(equivalent(Y,Z),U))),equivalent(U,Z))) | -is_a_theorem(X).
% 320872 [binary:320864,320870.2] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,equivalent(equivalent(Z,Y),X))),equivalent(U,equivalent(equivalent(U,V),W))),equivalent(W,V))).
% 320873 [binary:320863,320872] -is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,equivalent(equivalent(Z,Y),X))),equivalent(U,equivalent(equivalent(U,V),W)))) | is_a_theorem(equivalent(W,V)).
% 320876 [binary:320872,320873] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),Z),Y),X),Z)).
% 320877 [binary:320863,320876] -is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),Y),X)) | is_a_theorem(Z).
% 320878 [binary:320867.2,320876] is_a_theorem(equivalent(X,equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(equivalent(Z,U),Y),U),Z)))).
% 320879 [binary:320870.2,320876] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),Z),Y),X),Z),equivalent(U,equivalent(equivalent(U,V),W))),equivalent(W,V))).
% 320881 [binary:320863,320878] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(equivalent(Z,U),Y),U),Z))) | -is_a_theorem(X).
% 320885 [binary:320864,320881.2] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,equivalent(equivalent(Z,Y),X))),U),equivalent(equivalent(equivalent(equivalent(V,W),U),W),V))).
% 320886 [binary:320876,320881.2] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),Z),Y),X),Z),U),equivalent(equivalent(equivalent(equivalent(V,W),U),W),V))).
% 320888 [binary:320863,320885] -is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,equivalent(equivalent(Z,Y),X))),U)) | is_a_theorem(equivalent(equivalent(equivalent(equivalent(V,W),U),W),V)).
% 320894 [binary:320863,320886,binarydemod:320877] -is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),Z),Y),X),Z),U)) | is_a_theorem(U).
% 320900 [binary:320872,320888] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,U),equivalent(V,equivalent(equivalent(V,U),Z)))),Y),X)).
% 320902 [binary:320894,320900] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,equivalent(equivalent(Z,Y),X))),U),U)).
% 320904 [binary:320877,320902] is_a_theorem(equivalent(X,equivalent(equivalent(X,Y),Y))).
% 320908 [binary:320863,320904] is_a_theorem(equivalent(equivalent(X,Y),Y)) | -is_a_theorem(X).
% 320909 [binary:320867.2,320904] is_a_theorem(equivalent(X,equivalent(equivalent(X,equivalent(equivalent(Y,Z),Z)),Y))).
% 320915 [binary:320904,320908.2] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(X,Y),Y)),Z),Z)).
% 320917 [binary:320867.2,320909] is_a_theorem(equivalent(X,equivalent(equivalent(X,equivalent(equivalent(Y,equivalent(equivalent(Z,U),U)),Z)),Y))).
% 320927 [binary:320877,320915] is_a_theorem(equivalent(equivalent(equivalent(X,X),Y),Y)).
% 320931 [binary:320863,320927] -is_a_theorem(equivalent(equivalent(X,X),Y)) | is_a_theorem(Y).
% 320949 [binary:320909,320931] is_a_theorem(equivalent(equivalent(equivalent(X,X),equivalent(equivalent(Y,Z),Z)),Y)).
% 320983 [binary:320863,320949] -is_a_theorem(equivalent(equivalent(X,X),equivalent(equivalent(Y,Z),Z))) | is_a_theorem(Y).
% 321026 [binary:320872,320983] is_a_theorem(equivalent(equivalent(equivalent(X,Y),X),Y)).
% 321030 [binary:320867.2,321026] is_a_theorem(equivalent(X,equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),Z)))).
% 321034 [binary:320908.2,321026] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),X),Y),Z),Z)).
% 321114 [binary:320867.2,321030] is_a_theorem(equivalent(X,equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(U,Z),U))),Y))).
% 321115 [binary:320870.2,321030] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),Z))),equivalent(U,equivalent(equivalent(U,V),W))),equivalent(W,V))).
% 321121 [binary:320931,321030] is_a_theorem(equivalent(equivalent(equivalent(X,X),Y),equivalent(equivalent(Z,Y),Z))).
% 321238 [binary:320863,321121] -is_a_theorem(equivalent(equivalent(X,X),Y)) | is_a_theorem(equivalent(equivalent(Z,Y),Z)).
% 321369 [binary:321034,321238] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(equivalent(Y,Z),Y),Z)),X)).
% 321487 [binary:320863,321369] -is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(Y,Z),Y),Z))) | is_a_theorem(X).
% 321577 [binary:320869,321487] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(X,Y),Z)),equivalent(Z,Y))).
% 321589 [binary:321030,321487] is_a_theorem(equivalent(X,equivalent(equivalent(Y,X),Y))).
% 321596 [binary:320917,321487] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,Z),Z)),Y),X)).
% 321629 [binary:320863,321589] is_a_theorem(equivalent(equivalent(X,Y),X)) | -is_a_theorem(Y).
% 321630 [binary:320867.2,321589] is_a_theorem(equivalent(X,equivalent(equivalent(X,equivalent(equivalent(Y,Z),Y)),Z))).
% 321827 [binary:320863,321596] -is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),Z)),Y)) | is_a_theorem(X).
% 325063 [binary:321487,321114] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),Z)),X)).
% 325086 [binary:320863,325063] -is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),Z))) | is_a_theorem(X).
% 325091 [binary:320894,325063] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),Z)),Y)).
% 325124 [binary:320863,325091] -is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),Z))) | is_a_theorem(Y).
% 325373 [binary:321577,325124] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Y,X))).
% 325376 [binary:320863,325373] -is_a_theorem(equivalent(X,Y)) | is_a_theorem(equivalent(Y,X)).
% 325377 [binary:320867.2,325373] is_a_theorem(equivalent(X,equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,Y)))).
% 325442 [binary:321630,325376] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,Z),Y)),Z),X)).
% 325815 [binary:325376,325377] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,Y)),X)).
% 326429 [binary:320894,325442] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),X),Z),Y),Z)).
% 327347 [binary:320894,325815] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Y,X)),Z)).
% 327360 [binary:321827,325815] is_a_theorem(equivalent(X,equivalent(Y,equivalent(X,Y)))).
% 327373 [binary:325086,325815] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),X),equivalent(Z,Y))).
% 327379 [binary:320867.2,327360] is_a_theorem(equivalent(X,equivalent(equivalent(X,equivalent(Y,equivalent(Z,Y))),Z))).
% 330403 [binary:320863,326429] -is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),X),Z),Y)) | is_a_theorem(Z).
% 333362 [binary:320863,327347] -is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Y,X))) | is_a_theorem(Z).
% 333432 [binary:320863,327373] -is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),X)) | is_a_theorem(equivalent(Z,Y)).
% 333514 [binary:321629.2,327379,binarydemod:333432] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,equivalent(Z,Y))),Z),X)).
% 335964 [binary:321577,330403] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),X),Z),Y)).
% 336993 [binary:320894,333514] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,equivalent(Y,X)),Z),Y),Z)).
% 342268 [binary:320863,335964] -is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),X),Z)) | is_a_theorem(Y).
% 343732 [binary:320863,336993] -is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,X)),Z),Y)) | is_a_theorem(Z).
% 349524 [binary:342268,321115] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(X,Y),equivalent(Y,Z))),Z)).
% 353808 [binary:333362,349524] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Z,equivalent(Y,X)))).
% 353834 [binary:343732,349524] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,X)),Z),equivalent(Z,Y))).
% 360642 [binary:320863,353808] -is_a_theorem(equivalent(equivalent(X,Y),Z)) | is_a_theorem(equivalent(Z,equivalent(Y,X))).
% 360773 [binary:320863,353834] -is_a_theorem(equivalent(equivalent(X,equivalent(Y,X)),Z)) | is_a_theorem(equivalent(Z,Y)).
% 366204 [binary:353808,360642] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(X,equivalent(Z,Y)))).
% 366819 [binary:320879,360773] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(Y,Z),X),Z))).
% 380690 [binary:320863,366204] -is_a_theorem(equivalent(X,equivalent(Y,Z))) | is_a_theorem(equivalent(X,equivalent(Z,Y))).
% 400174 [binary:366819,380690,slowcut:320865] 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 8
% seconds given: 111
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 8170
% derived clauses: 1190572
% kept clauses: 286623
% kept size sum: 0
% kept mid-nuclei: 59099
% kept new demods: 0
% forw unit-subs: 398743
% forw double-subs: 72104
% forw overdouble-subs: 78230
% backward subs: 1137
% fast unit cutoff: 12064
% full unit cutoff: 1098
% dbl unit cutoff: 1147
% real runtime : 232.97
% process. runtime: 231.75
% specific non-discr-tree subsumption statistics:
% tried: 52220650
% length fails: 7581823
% strength fails: 11854526
% predlist fails: 1681067
% aux str. fails: 2869605
% by-lit fails: 3576833
% full subs tried: 22770946
% full subs fail: 22672318
%
% ; 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/LCL016-1+noeq.in")
%
%------------------------------------------------------------------------------