TSTP Solution File: LCL012-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL012-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 : art07.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 209.1s
% Output : Assurance 209.1s
% 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/LCL012-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 4 5)
% (binary-unit 11 #f 4 5)
% (binary-double 17 #f 4 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 4 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,39861,4,2200,40034,5,2904,40035,1,2908,40035,50,2912,40035,40,2912,40038,0,2912,40042,50,2912,40045,0,2917,40061,50,2917,40064,0,2917,40109,50,2917,40112,0,2917,44761,3,3420,45808,4,3674,46657,5,3918,46658,5,3918,46659,1,3918,46659,50,3919,46659,40,3919,46662,0,3924,98599,3,4779,110507,4,5202,112577,5,5625,112578,5,5625,112578,1,5625,112578,50,5628,112578,40,5628,112581,0,5628,160183,4,7813,160327,5,8531,160328,1,8535,160328,50,8540,160328,40,8540,160331,0,8540,168596,3,10255,170422,4,11131,171889,5,11941,171890,5,11941,171891,1,11942,171891,50,11943,171891,40,11943,171894,0,11943,251631,3,14334,254125,4,14944,271848,5,15944,271849,5,15945,271849,1,15945,271849,50,15948,271849,40,15948,271852,0,15948,302986,3,16799,304423,4,17224,308927,5,17649,308928,5,17649,308928,1,17649,308928,50,17650,308928,40,17650,308931,0,17650,377119,3,19112,381953,4,19829,406322,5,20551,406323,5,20552,406323,1,20552,406323,50,20555,406323,40,20555,406326,0,20555,406329,50,20555,406332,0,20555,406338,50,20555,406341,0,20565,406347,50,20565,406350,0,20565)
%
%
% START OF PROOF
% 406348 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 406349 [] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Y,equivalent(Z,X)))).
% 406350 [] -is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(b,c)))).
% 406352 [binary:406348,406349] -is_a_theorem(equivalent(equivalent(X,Y),Z)) | is_a_theorem(equivalent(Y,equivalent(Z,X))).
% 406354 [binary:406349,406352] is_a_theorem(equivalent(X,equivalent(equivalent(Y,equivalent(X,Z)),equivalent(Z,Y)))).
% 406355 [binary:406348,406354] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,X))) | -is_a_theorem(Y).
% 406356 [binary:406352,406354] is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(Y,equivalent(equivalent(Z,X),U)),equivalent(U,Y)),Z))).
% 406358 [binary:406349,406355.2] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(equivalent(equivalent(Y,Z),U),equivalent(Z,equivalent(U,Y))),V)),equivalent(V,X))).
% 406359 [binary:406348,406356] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,Z),U)),equivalent(U,X)),Y)) | -is_a_theorem(Z).
% 406361 [binary:406348,406358] -is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(equivalent(Y,Z),U),equivalent(Z,equivalent(U,Y))),V))) | is_a_theorem(equivalent(V,X)).
% 406362 [binary:406352,406358] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Y,equivalent(Z,X))),U),equivalent(equivalent(U,V),V))).
% 406365 [binary:406354,406361] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Y,Z),X)),Z)).
% 406367 [binary:406348,406365] -is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Y,Z),X))) | is_a_theorem(Z).
% 406368 [binary:406348,406362] -is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Y,equivalent(Z,X))),U)) | is_a_theorem(equivalent(equivalent(U,V),V)).
% 406370 [binary:406361,406362] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(equivalent(equivalent(U,V),W),equivalent(V,equivalent(W,U))),equivalent(equivalent(Z,X),Y)))).
% 406372 [binary:406354,406367] is_a_theorem(equivalent(equivalent(equivalent(X,Y),Y),X)).
% 406373 [binary:406348,406372] -is_a_theorem(equivalent(equivalent(X,Y),Y)) | is_a_theorem(X).
% 406374 [binary:406352,406372] is_a_theorem(equivalent(X,equivalent(Y,equivalent(Y,X)))).
% 406375 [binary:406355.2,406372] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(equivalent(equivalent(Y,Z),Z),Y),U)),equivalent(U,X))).
% 406377 [binary:406372,406373] is_a_theorem(equivalent(X,X)).
% 406378 [binary:406352,406377] is_a_theorem(equivalent(X,equivalent(equivalent(Y,X),Y))).
% 406380 [binary:406359.2,406377] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,equivalent(Z,Z)),U)),equivalent(U,X)),Y)).
% 406382 [binary:406348,406374] is_a_theorem(equivalent(X,equivalent(X,Y))) | -is_a_theorem(Y).
% 406385 [binary:406361,406374] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Y,equivalent(Z,X))),U),U)).
% 406388 [binary:406348,406378] is_a_theorem(equivalent(equivalent(X,Y),X)) | -is_a_theorem(Y).
% 406395 [binary:406377,406382.2] is_a_theorem(equivalent(X,equivalent(X,equivalent(Y,Y)))).
% 406403 [binary:406377,406388.2] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Y)),X)).
% 406404 [binary:406374,406388.2] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(Z,equivalent(Z,Y)))),X)).
% 406405 [binary:406378,406388.2] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(equivalent(Z,Y),Z))),X)).
% 406406 [binary:406348,406395] is_a_theorem(equivalent(X,equivalent(Y,Y))) | -is_a_theorem(X).
% 406412 [binary:406348,406403] -is_a_theorem(equivalent(X,equivalent(Y,Y))) | is_a_theorem(X).
% 406433 [binary:406365,406412] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Y,equivalent(Z,Z)),X))).
% 406434 [binary:406372,406412] is_a_theorem(equivalent(equivalent(equivalent(X,X),Y),Y)).
% 406445 [binary:406348,406434] -is_a_theorem(equivalent(equivalent(X,X),Y)) | is_a_theorem(Y).
% 406507 [binary:406348,406370] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Y,equivalent(Z,X))),equivalent(equivalent(U,V),W))) | -is_a_theorem(equivalent(V,equivalent(W,U))).
% 406519 [binary:406348,406375] -is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(equivalent(Y,Z),Z),Y),U))) | is_a_theorem(equivalent(U,X)).
% 406537 [binary:406368,406404] is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),Y),X),Z),Z)).
% 406539 [binary:406348,406405] -is_a_theorem(equivalent(X,equivalent(Y,equivalent(equivalent(Z,Y),Z)))) | is_a_theorem(X).
% 406551 [binary:406352,406380] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,equivalent(Y,equivalent(equivalent(Z,equivalent(U,U)),X))))).
% 406607 [binary:406348,406433] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Y)),Z)) | -is_a_theorem(equivalent(Z,X)).
% 406613 [binary:406368,406433,binarydemod:406373] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(U,U)),equivalent(equivalent(Z,X),Y))).
% 406650 [binary:406348,406385] -is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(Y,equivalent(Z,X))),U)) | is_a_theorem(U).
% 407124 [binary:406348,406537] -is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Y),X),Z)) | is_a_theorem(Z).
% 411659 [binary:406539,406551] is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(Y,equivalent(Z,Z)),X),Y))).
% 411696 [binary:406507.2,411659,binarydemod:406650] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,equivalent(Z,Z)),Y))).
% 411833 [binary:407124,411696] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Y),equivalent(Z,Z)),X)).
% 412420 [binary:406352,411833,binarydemod:406445] is_a_theorem(equivalent(X,equivalent(equivalent(X,Y),Y))).
% 412462 [binary:406361,412420] is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(Z,X),Y))).
% 412507 [binary:406507.2,412420,binarydemod:406650] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Y,X))).
% 412563 [binary:406348,412507] -is_a_theorem(equivalent(X,Y)) | is_a_theorem(equivalent(Y,X)).
% 412580 [binary:406607.2,412507] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Z)),equivalent(Y,X))).
% 412623 [binary:406365,412563] is_a_theorem(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Z,X),Y)))).
% 413995 [binary:406519,412462] is_a_theorem(equivalent(X,equivalent(Y,equivalent(X,equivalent(equivalent(Y,Z),Z))))).
% 414539 [binary:406348,412580] -is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,Z))) | is_a_theorem(equivalent(Y,X)).
% 414545 [binary:406406.2,412580,binarydemod:414539] is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Y,X),equivalent(Z,Z)))).
% 414883 [binary:406507.2,412623,binarydemod:406650] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),Y),equivalent(Z,X))).
% 418056 [binary:406406.2,413995,binarydemod:414539] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(equivalent(X,Z),Z))),Y)).
% 419130 [binary:406348,414545] is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,Z))) | -is_a_theorem(equivalent(Y,X)).
% 423089 [binary:406352,418056] is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),Z)),equivalent(X,Y))).
% 424402 [binary:406348,406613,binarydemod:419130] -is_a_theorem(equivalent(equivalent(X,Y),Z)) | is_a_theorem(equivalent(equivalent(Y,Z),X)).
% 426280 [binary:406348,423089] -is_a_theorem(equivalent(X,equivalent(equivalent(Y,Z),Z))) | is_a_theorem(equivalent(X,Y)).
% 433088 [binary:414883,426280] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,X)),Y),Z)).
% 442450 [binary:424402,433088,slowcut:406350] 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 7
% seconds given: 111
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 9009
% derived clauses: 1949328
% kept clauses: 345716
% kept size sum: 720572
% kept mid-nuclei: 52355
% kept new demods: 0
% forw unit-subs: 537684
% forw double-subs: 312501
% forw overdouble-subs: 166613
% backward subs: 1818
% fast unit cutoff: 16445
% full unit cutoff: 478
% dbl unit cutoff: 593
% real runtime : 218.40
% process. runtime: 216.85
% specific non-discr-tree subsumption statistics:
% tried: 22365206
% length fails: 3611521
% strength fails: 3456822
% predlist fails: 421662
% aux str. fails: 815700
% by-lit fails: 854938
% full subs tried: 12826489
% full subs fail: 12634938
%
% ; 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/LCL012-1+noeq.in")
%
%------------------------------------------------------------------------------