TSTP Solution File: LAT015-1 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LAT015-1 : TPTP v3.4.2. Released v2.2.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art10.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   : Unknown 458.3s
% Output   : None 
% 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/LAT/LAT015-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: peq
% 
% strategies selected: 
% (hyper 30 #f 12 15)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 12 15)
% (binary-posweight-lex-big-order 30 #f 12 15)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
% 
% 
% SOS clause 
% -equal(meet(a,a),a) | -equal(meet(a,b),meet(b,a)) | -equal(meet(meet(a,b),c),meet(a,meet(b,c))) | -equal(join(a,a),a) | -equal(join(a,b),join(b,a)) | -equal(join(join(a,b),c),join(a,join(b,c))) | -equal(meet(a,join(a,b)),a) | -equal(join(a,meet(a,b)),a).
% was split for some strategies as: 
% -equal(meet(a,a),a).
% -equal(meet(a,b),meet(b,a)).
% -equal(meet(meet(a,b),c),meet(a,meet(b,c))).
% -equal(join(a,a),a).
% -equal(join(a,b),join(b,a)).
% -equal(join(join(a,b),c),join(a,join(b,c))).
% -equal(meet(a,join(a,b)),a).
% -equal(join(a,meet(a,b)),a).
% 
% Starting a split proof attempt with 8 components.
% 
% Split component 1 started.
% 
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split: 
% -equal(meet(a,a),a) | -equal(meet(a,b),meet(b,a)) | -equal(meet(meet(a,b),c),meet(a,meet(b,c))) | -equal(join(a,a),a) | -equal(join(a,b),join(b,a)) | -equal(join(join(a,b),c),join(a,join(b,c))) | -equal(meet(a,join(a,b)),a) | -equal(join(a,meet(a,b)),a).
% Split part used next: -equal(meet(a,a),a).
% END OF PROOFPART
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(3,40,0,6,0,0,8,50,6,11,0,6,13,50,9,16,0,9,2614,4,1063,3405,5,1410,3405,1,1410,3405,50,1410,3405,40,1410,3408,0,1410,3568,5,2013,3605,1,2147,3605,50,2147,3605,40,2147,3608,0,2147,9923,3,2449,10683,4,2600,11447,5,2748,11447,1,2748,11447,50,2748,11447,40,2748,11450,0,2748,11452,50,2750,11455,0,2768,11457,50,2770,11460,0,2789,22882,3,4240,30784,4,4967,36407,5,5690,36407,1,5690,36407,50,5691,36407,40,5691,36410,0,5691,36412,50,5693,36415,0,5707,36417,50,5709,36420,0,5720,38760,3,6461,39582,4,6771,39734,5,7121,39734,1,7121,39734,50,7121,39734,40,7121,39737,0,7121,39738,50,7121,39738,40,7121,39741,0,7134,40680,3,12382,41229,5,14937,41298,1,15391,41298,50,15391,41298,40,15391,41301,0,15391,54543,3,17949,56474,4,19223,58435,5,20492,58435,1,20492,58435,50,20492,58435,40,20492,58438,0,20492,74752,3,22037,83095,4,22753,91154,5,23493,91156,1,23493,91156,50,23493,91156,40,23493,91159,0,23493,91466,5,24997,91590,1,25846,91590,50,25846,91590,40,25846,91593,0,25846,101358,3,27049,104347,4,27650,107009,5,28247,107009,1,28247,107009,50,28247,107009,40,28247,107012,0,28247,114744,3,29005,116498,4,29376,117887,5,29764,117887,1,29764,117887,50,29764,117887,40,29764,117887,40,29764,117890,0,29764,117891,50,29766,117894,0,29766,117895,50,29768,117898,0,29780,118613,4,29865,118613,50,29866,118613,40,29866,118616,0,29866,118667,5,30067,118754,1,30552,118754,50,30552,118754,40,30552,118757,0,30552,120748,3,30653)
% 
% 
% START OF PROOF
% 118756 [] equal(join(meet(join(meet(X,Y),meet(Y,join(X,Y))),Z),meet(join(meet(X,join(join(meet(U,Y),meet(Y,V)),Y)),meet(join(meet(Y,meet(meet(join(U,join(Y,V)),join(W,Y)),Y)),meet(X1,join(Y,meet(meet(join(U,join(Y,V)),join(W,Y)),Y)))),join(X,join(join(meet(U,Y),meet(Y,V)),Y)))),join(join(meet(X,Y),meet(Y,join(X,Y))),Z))),Y).
% 118757 [] -equal(meet(a,a),a).
% 118761 [para:118756.1.1,118756.1.1.2.1.2.1] equal(join(meet(join(meet(X,join(meet(Y,Z),meet(Z,join(Y,Z)))),meet(join(meet(Y,Z),meet(Z,join(Y,Z))),join(X,join(meet(Y,Z),meet(Z,join(Y,Z)))))),U),meet(join(meet(X,join(join(meet(V,join(meet(Y,Z),meet(Z,join(Y,Z)))),meet(join(meet(Y,Z),meet(Z,join(Y,Z))),W)),join(meet(Y,Z),meet(Z,join(Y,Z))))),meet(Z,join(X,join(join(meet(V,join(meet(Y,Z),meet(Z,join(Y,Z)))),meet(join(meet(Y,Z),meet(Z,join(Y,Z))),W)),join(meet(Y,Z),meet(Z,join(Y,Z))))))),join(join(meet(X,join(meet(Y,Z),meet(Z,join(Y,Z)))),meet(join(meet(Y,Z),meet(Z,join(Y,Z))),join(X,join(meet(Y,Z),meet(Z,join(Y,Z)))))),U))),join(meet(Y,Z),meet(Z,join(Y,Z)))).
% 118789 [para:118756.1.1,118761.1.1.1.1.1.2,demod:118756] equal(join(meet(join(meet(X,Y),meet(Y,join(X,Y))),Z),meet(join(meet(X,join(join(meet(U,Y),meet(Y,V)),Y)),meet(join(meet(W,join(join(meet(X1,Y),meet(Y,X2)),Y)),meet(join(meet(Y,meet(meet(join(X1,join(Y,X2)),join(X3,Y)),Y)),meet(X4,join(Y,meet(meet(join(X1,join(Y,X2)),join(X3,Y)),Y)))),join(W,join(join(meet(X1,Y),meet(Y,X2)),Y)))),join(X,join(join(meet(U,Y),meet(Y,V)),Y)))),join(join(meet(X,Y),meet(Y,join(X,Y))),Z))),Y).
% 118842 [para:118756.1.1,118789.1.1.2.1] equal(join(meet(join(meet(join(meet(X,Y),meet(Y,join(X,Y))),Y),meet(Y,join(join(meet(X,Y),meet(Y,join(X,Y))),Y))),Z),meet(Y,join(join(meet(join(meet(X,Y),meet(Y,join(X,Y))),Y),meet(Y,join(join(meet(X,Y),meet(Y,join(X,Y))),Y))),Z))),Y).
% 118853 [para:118789.1.1,118761.1.1.1.1.1.2,demod:118789] equal(join(meet(join(meet(X,Y),meet(Y,join(X,Y))),Z),meet(join(meet(X,join(join(meet(U,Y),meet(Y,V)),Y)),meet(join(meet(W,join(join(meet(X1,Y),meet(Y,X2)),Y)),meet(join(meet(X3,join(join(meet(X4,Y),meet(Y,X5)),Y)),meet(join(meet(Y,meet(meet(join(X4,join(Y,X5)),join(X6,Y)),Y)),meet(X7,join(Y,meet(meet(join(X4,join(Y,X5)),join(X6,Y)),Y)))),join(X3,join(join(meet(X4,Y),meet(Y,X5)),Y)))),join(W,join(join(meet(X1,Y),meet(Y,X2)),Y)))),join(X,join(join(meet(U,Y),meet(Y,V)),Y)))),join(join(meet(X,Y),meet(Y,join(X,Y))),Z))),Y).
% 119089 [para:118842.1.1,118761.1.1.1.1.1.2,demod:118842] equal(join(meet(join(meet(X,Y),meet(Y,join(X,Y))),Z),meet(join(meet(X,join(join(meet(U,Y),meet(Y,V)),Y)),meet(Y,join(X,join(join(meet(U,Y),meet(Y,V)),Y)))),join(join(meet(X,Y),meet(Y,join(X,Y))),Z))),Y).
% 119117 [para:118842.1.1,118789.1.1.2.1.2.1] equal(join(meet(join(meet(X,Y),meet(Y,join(X,Y))),Z),meet(join(meet(X,join(join(meet(U,Y),meet(Y,V)),Y)),meet(join(meet(Y,meet(meet(join(W,join(Y,X1)),join(X2,Y)),Y)),meet(X3,join(Y,meet(meet(join(W,join(Y,X1)),join(X2,Y)),Y)))),join(X,join(join(meet(U,Y),meet(Y,V)),Y)))),join(join(meet(X,Y),meet(Y,join(X,Y))),Z))),Y).
% 119167 [para:118842.1.1,118842.1.1.1.1,demod:118842] equal(join(meet(X,Y),meet(X,join(X,Y))),X).
% 119376 [para:118756.1.1,119089.1.1.1.1,demod:119167,119117] equal(X,join(meet(Y,join(join(meet(Z,X),meet(X,U)),X)),meet(join(meet(X,meet(meet(join(Z,join(X,U)),join(V,X)),X)),meet(W,join(X,meet(meet(join(Z,join(X,U)),join(V,X)),X)))),join(Y,join(join(meet(Z,X),meet(X,U)),X))))).
% 119398 [para:119089.1.1,118789.1.1.1.1,demod:119167,119089,119376] equal(X,join(meet(Y,join(join(meet(Z,X),meet(X,U)),X)),meet(X,join(Y,join(join(meet(Z,X),meet(X,U)),X))))).
% 119465 [para:118756.1.1,118853.1.1.2.1.2.1,demod:119398] equal(join(meet(join(meet(X,Y),meet(Y,join(X,Y))),Z),meet(Y,join(join(meet(X,Y),meet(Y,join(X,Y))),Z))),Y).
% 119572 [para:118756.1.1,119398.1.2.1.2.1,demod:119465,119376] equal(X,join(meet(Y,join(X,X)),meet(X,join(Y,join(X,X))))).
% 121105 [para:119376.1.2,118842.1.1] equal(X,join(meet(X,meet(meet(join(Y,join(X,Z)),join(U,X)),X)),meet(V,join(X,meet(meet(join(Y,join(X,Z)),join(U,X)),X))))).
% 121209 [para:121105.1.2,118756.1.1] equal(join(meet(X,Y),meet(Y,join(X,Y))),Y).
% 121472 [para:121209.1.1,121105.1.2] equal(X,meet(meet(join(Y,join(X,Z)),join(U,X)),X)).
% 121663 [para:121472.1.2,121105.1.2.1.2,demod:121472] equal(X,join(meet(X,X),meet(Y,join(X,X)))).
% 121942 [para:121663.1.2,119398.1.2] equal(X,join(join(meet(Y,X),meet(X,Z)),X)).
% 121943 [para:121663.1.2,119572.1.2] equal(X,join(X,X)).
% 122067 [para:121943.1.2,118761.1.1.1.1.2.2,demod:119167,121942,121943,121209,slowcut:118757] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 2
% 
% 
% Split component 2 started.
% 
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split: 
% -equal(meet(a,a),a) | -equal(meet(a,b),meet(b,a)) | -equal(meet(meet(a,b),c),meet(a,meet(b,c))) | -equal(join(a,a),a) | -equal(join(a,b),join(b,a)) | -equal(join(join(a,b),c),join(a,join(b,c))) | -equal(meet(a,join(a,b)),a) | -equal(join(a,meet(a,b)),a).
% Split part used next: -equal(meet(a,b),meet(b,a)).
% END OF PROOFPART
% 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 15
% clause depth limited to 12
% seconds given: 2
% 
% 
% proof attempt stopped: sos exhausted
% 
% 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 15
% clause depth limited to 13
% seconds given: 2
% 
% 
% proof attempt stopped: sos exhausted
% 
% 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 15
% clause depth limited to 14
% seconds given: 2
% 
% 
% proof attempt stopped: time limit
% 
% 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
% seconds given: 2
% 
% 
% proof attempt stopped: time limit
% 
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 2
% 
% 
% proof attempt stopped: time limit
% 
% 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 15
% clause depth limited to 12
% seconds given: 6
% 
% 
% proof attempt stopped: sos exhausted
% 
% 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 15
% clause depth limited to 13
% seconds given: 6
% 
% 
% proof attempt stopped: sos exhausted
% 
% 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 15
% clause depth limited to 14
% seconds given: 6
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(3,40,0,6,0,0,8,50,6,11,0,6,13,50,9,16,0,9,2614,4,1063,3405,5,1410,3405,1,1410,3405,50,1410,3405,40,1410,3408,0,1410,3568,5,2013,3605,1,2147,3605,50,2147,3605,40,2147,3608,0,2147,9923,3,2449,10683,4,2600,11447,5,2748,11447,1,2748,11447,50,2748,11447,40,2748,11450,0,2748,11452,50,2750,11455,0,2768,11457,50,2770,11460,0,2789,22882,3,4240,30784,4,4967,36407,5,5690,36407,1,5690,36407,50,5691,36407,40,5691,36410,0,5691,36412,50,5693,36415,0,5707,36417,50,5709,36420,0,5720,38760,3,6461,39582,4,6771,39734,5,7121,39734,1,7121,39734,50,7121,39734,40,7121,39737,0,7121,39738,50,7121,39738,40,7121,39741,0,7134,40680,3,12382,41229,5,14937,41298,1,15391,41298,50,15391,41298,40,15391,41301,0,15391,54543,3,17949,56474,4,19223,58435,5,20492,58435,1,20492,58435,50,20492,58435,40,20492,58438,0,20492,74752,3,22037,83095,4,22753,91154,5,23493,91156,1,23493,91156,50,23493,91156,40,23493,91159,0,23493,91466,5,24997,91590,1,25846,91590,50,25846,91590,40,25846,91593,0,25846,101358,3,27049,104347,4,27650,107009,5,28247,107009,1,28247,107009,50,28247,107009,40,28247,107012,0,28247,114744,3,29005,116498,4,29376,117887,5,29764,117887,1,29764,117887,50,29764,117887,40,29764,117887,40,29764,117890,0,29764,117891,50,29766,117894,0,29766,117895,50,29768,117898,0,29780,118613,4,29865,118613,50,29866,118613,40,29866,118616,0,29866,118667,5,30067,118754,1,30552,118754,50,30552,118754,40,30552,118757,0,30552,120748,3,30653,122066,50,30692,122066,30,30692,122066,40,30692,122069,0,30692,122070,50,30695,122073,0,30695,122074,50,30697,122077,0,30709,124419,4,30785,125275,5,30810,125275,1,30810,125275,50,30810,125275,40,30810,125278,0,30810,127566,3,30914,129096,4,30961,129796,5,31011,129796,1,31011,129796,50,31011,129796,40,31011,129799,0,31011,131884,3,31112,133682,4,31162,134312,5,31212,134313,1,31212,134313,50,31212,134313,40,31212,134316,0,31212,134317,50,31214,134320,0,31226,134321,50,31228,134324,0,31241,138199,3,31501,139264,4,31617)
% 
% 
% START OF PROOF
% 134323 [] equal(join(meet(join(meet(X,Y),meet(Y,join(X,Y))),Z),meet(join(meet(X,join(join(meet(U,Y),meet(Y,V)),Y)),meet(join(meet(Y,meet(meet(join(U,join(Y,V)),join(W,Y)),Y)),meet(X1,join(Y,meet(meet(join(U,join(Y,V)),join(W,Y)),Y)))),join(X,join(join(meet(U,Y),meet(Y,V)),Y)))),join(join(meet(X,Y),meet(Y,join(X,Y))),Z))),Y).
% 134324 [] -equal(meet(a,b),meet(b,a)).
% 134325 [para:134323.1.1,134323.1.1.2.1.2.1] equal(join(meet(join(meet(X,join(meet(Y,Z),meet(Z,join(Y,Z)))),meet(join(meet(Y,Z),meet(Z,join(Y,Z))),join(X,join(meet(Y,Z),meet(Z,join(Y,Z)))))),U),meet(join(meet(X,join(join(meet(V,join(meet(Y,Z),meet(Z,join(Y,Z)))),meet(join(meet(Y,Z),meet(Z,join(Y,Z))),W)),join(meet(Y,Z),meet(Z,join(Y,Z))))),meet(Z,join(X,join(join(meet(V,join(meet(Y,Z),meet(Z,join(Y,Z)))),meet(join(meet(Y,Z),meet(Z,join(Y,Z))),W)),join(meet(Y,Z),meet(Z,join(Y,Z))))))),join(join(meet(X,join(meet(Y,Z),meet(Z,join(Y,Z)))),meet(join(meet(Y,Z),meet(Z,join(Y,Z))),join(X,join(meet(Y,Z),meet(Z,join(Y,Z)))))),U))),join(meet(Y,Z),meet(Z,join(Y,Z)))).
% 134326 [para:134323.1.1,134325.1.1.1.1.1.2,demod:134323] equal(join(meet(join(meet(X,Y),meet(Y,join(X,Y))),Z),meet(join(meet(X,join(join(meet(U,Y),meet(Y,V)),Y)),meet(join(meet(W,join(join(meet(X1,Y),meet(Y,X2)),Y)),meet(join(meet(Y,meet(meet(join(X1,join(Y,X2)),join(X3,Y)),Y)),meet(X4,join(Y,meet(meet(join(X1,join(Y,X2)),join(X3,Y)),Y)))),join(W,join(join(meet(X1,Y),meet(Y,X2)),Y)))),join(X,join(join(meet(U,Y),meet(Y,V)),Y)))),join(join(meet(X,Y),meet(Y,join(X,Y))),Z))),Y).
% 134328 [para:134323.1.1,134326.1.1.2.1] equal(join(meet(join(meet(join(meet(X,Y),meet(Y,join(X,Y))),Y),meet(Y,join(join(meet(X,Y),meet(Y,join(X,Y))),Y))),Z),meet(Y,join(join(meet(join(meet(X,Y),meet(Y,join(X,Y))),Y),meet(Y,join(join(meet(X,Y),meet(Y,join(X,Y))),Y))),Z))),Y).
% 134329 [para:134328.1.1,134323.1.1.1.1,demod:134328] equal(join(meet(X,Y),meet(join(meet(join(meet(join(meet(Z,X),meet(X,join(Z,X))),X),meet(X,join(join(meet(Z,X),meet(X,join(Z,X))),X))),join(join(meet(U,X),meet(X,V)),X)),meet(join(meet(X,meet(meet(join(U,join(X,V)),join(W,X)),X)),meet(X1,join(X,meet(meet(join(U,join(X,V)),join(W,X)),X)))),join(join(meet(join(meet(Z,X),meet(X,join(Z,X))),X),meet(X,join(join(meet(Z,X),meet(X,join(Z,X))),X))),join(join(meet(U,X),meet(X,V)),X)))),join(X,Y))),X).
% 134330 [para:134328.1.1,134325.1.1.1.1.1.2,demod:134328] equal(join(meet(join(meet(X,Y),meet(Y,join(X,Y))),Z),meet(join(meet(X,join(join(meet(U,Y),meet(Y,V)),Y)),meet(Y,join(X,join(join(meet(U,Y),meet(Y,V)),Y)))),join(join(meet(X,Y),meet(Y,join(X,Y))),Z))),Y).
% 134335 [para:134328.1.1,134326.1.1.2.1.2.1] equal(join(meet(join(meet(X,Y),meet(Y,join(X,Y))),Z),meet(join(meet(X,join(join(meet(U,Y),meet(Y,V)),Y)),meet(join(meet(Y,meet(meet(join(W,join(Y,X1)),join(X2,Y)),Y)),meet(X3,join(Y,meet(meet(join(W,join(Y,X1)),join(X2,Y)),Y)))),join(X,join(join(meet(U,Y),meet(Y,V)),Y)))),join(join(meet(X,Y),meet(Y,join(X,Y))),Z))),Y).
% 134341 [para:134328.1.1,134328.1.1.1.1,demod:134328] equal(join(meet(X,Y),meet(X,join(X,Y))),X).
% 134385 [para:134341.1.1,134341.1.1.2.2] equal(join(meet(meet(X,Y),meet(X,join(X,Y))),meet(meet(X,Y),X)),meet(X,Y)).
% 134428 [para:134323.1.1,134330.1.1.1.1,demod:134341,134335] equal(X,join(meet(Y,join(join(meet(Z,X),meet(X,U)),X)),meet(join(meet(X,meet(meet(join(Z,join(X,U)),join(V,X)),X)),meet(W,join(X,meet(meet(join(Z,join(X,U)),join(V,X)),X)))),join(Y,join(join(meet(Z,X),meet(X,U)),X))))).
% 134431 [para:134323.1.1,134330.1.1.2.1.2.2.2.1,demod:134428] equal(join(meet(join(meet(X,Y),meet(Y,join(X,Y))),Z),meet(join(meet(X,join(join(meet(join(meet(U,Y),meet(Y,join(U,Y))),Y),meet(Y,join(join(meet(U,Y),meet(Y,join(U,Y))),Y))),Y)),meet(Y,join(X,join(Y,Y)))),join(join(meet(X,Y),meet(Y,join(X,Y))),Z))),Y).
% 134434 [para:134325.1.1,134330.1.1.1.1,demod:134341,134325] equal(join(meet(X,Y),meet(Y,join(X,Y))),join(meet(Z,join(join(meet(U,join(meet(X,Y),meet(Y,join(X,Y)))),meet(join(meet(X,Y),meet(Y,join(X,Y))),V)),join(meet(X,Y),meet(Y,join(X,Y))))),meet(Y,join(Z,join(join(meet(U,join(meet(X,Y),meet(Y,join(X,Y)))),meet(join(meet(X,Y),meet(Y,join(X,Y))),V)),join(meet(X,Y),meet(Y,join(X,Y)))))))).
% 134435 [para:134330.1.1,134326.1.1.1.1,demod:134341,134330,134428] equal(X,join(meet(Y,join(join(meet(Z,X),meet(X,U)),X)),meet(X,join(Y,join(join(meet(Z,X),meet(X,U)),X))))).
% 134437 [?] ?
% 134462 [para:134329.1.1,134323.1.1.2.1.2.1,demod:134435] equal(join(meet(join(meet(X,Y),meet(Y,join(X,Y))),Z),meet(Y,join(join(meet(X,Y),meet(Y,join(X,Y))),Z))),Y).
% 134466 [para:134323.1.1,134329.1.1.2.1.2.1,demod:134462,134437] equal(X,join(meet(Y,X),meet(X,join(Y,X)))).
% 134482 [para:134329.1.1,134326.1.1.2.1.1.2.1,demod:134428,134466] equal(join(meet(X,Y),meet(join(meet(Z,join(X,X)),meet(X,join(Z,join(X,X)))),join(X,Y))),X).
% 134496 [para:134323.1.1,134466.1.2.2.2,demod:134466,134428] equal(meet(X,join(X,Y)),join(meet(meet(X,Y),meet(X,join(X,Y))),meet(meet(X,join(X,Y)),X))).
% 134531 [para:134466.1.2,134466.1.2.2.2] equal(meet(X,join(Y,X)),join(meet(meet(Y,X),meet(X,join(Y,X))),meet(meet(X,join(Y,X)),X))).
% 134618 [para:134482.1.1,134466.1.2] equal(join(meet(X,join(Y,Y)),meet(Y,join(X,join(Y,Y)))),Y).
% 134679 [para:134496.1.2,134466.1.2.2.2] equal(meet(meet(X,join(X,Y)),X),join(meet(meet(meet(X,Y),meet(X,join(X,Y))),meet(meet(X,join(X,Y)),X)),meet(meet(meet(X,join(X,Y)),X),meet(X,join(X,Y))))).
% 134747 [para:134462.1.1,134323.1.1.2.1,demod:134466] equal(join(meet(X,Y),meet(join(meet(X,meet(meet(join(Z,join(X,U)),join(V,X)),X)),meet(W,join(X,meet(meet(join(Z,join(X,U)),join(V,X)),X)))),join(X,Y))),X).
% 135157 [para:134466.1.2,134747.1.1.2.1] equal(join(meet(X,Y),meet(meet(meet(join(Z,join(X,U)),join(V,X)),X),join(X,Y))),X).
% 135214 [para:135157.1.1,134466.1.2] equal(meet(meet(join(X,join(Y,Z)),join(U,Y)),Y),Y).
% 135302 [para:135214.1.1,134466.1.2.1] equal(X,join(X,meet(X,join(meet(join(Y,join(X,Z)),join(U,X)),X)))).
% 135303 [para:134466.1.2,135214.1.1.1.1.2] equal(meet(meet(join(X,Y),join(Z,meet(U,Y))),meet(U,Y)),meet(U,Y)).
% 135373 [para:135214.1.1,134747.1.1.2.1.2,demod:135214] equal(join(meet(X,Y),meet(join(meet(X,X),join(X,X)),join(X,Y))),X).
% 135753 [para:135302.1.2,135214.1.1.1.1.2] equal(meet(meet(join(X,Y),join(Z,Y)),Y),Y).
% 136084 [para:135373.1.1,134466.1.2] equal(join(meet(X,X),join(X,X)),X).
% 136124 [para:134428.1.2,134328.1.1,demod:135214] equal(X,join(meet(X,X),meet(Y,join(X,X)))).
% 136258 [para:136084.1.1,135214.1.1.1.1] equal(meet(meet(X,join(Y,X)),X),X).
% 136297 [?] ?
% 136392 [para:136124.1.2,134618.1.1] equal(join(X,X),X).
% 136420 [para:136124.1.2,134435.1.2] equal(X,join(join(meet(Y,X),meet(X,Z)),X)).
% 136485 [para:135214.1.1,136124.1.2.2,demod:136392] equal(X,join(meet(X,X),X)).
% 136499 [para:136124.1.2,134428.1.2.1.2.1,demod:136485,136258,136392] equal(X,join(meet(Y,X),meet(join(meet(X,X),meet(Z,X)),join(Y,X)))).
% 136507 [para:136392.1.1,134323.1.1.2.2,demod:136499,136392,135214,136420,134466] equal(meet(X,X),X).
% 136587 [para:136392.1.1,135214.1.1.1.1] equal(meet(meet(join(X,Y),join(Z,X)),X),X).
% 136599 [para:136392.1.1,136124.1.2.2.2,demod:136507] equal(X,join(X,meet(Y,X))).
% 136624 [para:136507.1.1,135753.1.1.1] equal(meet(join(X,Y),Y),Y).
% 136701 [para:136599.1.2,135303.1.1.1.2,demod:136624] equal(meet(X,meet(Y,X)),meet(Y,X)).
% 136702 [para:136599.1.2,135373.1.1.2.2,demod:136392,136507,136701] equal(join(meet(X,Y),Y),Y).
% 136722 [?] ?
% 136725 [para:136624.1.1,134531.1.2.1.1,demod:136722,136258,136297] equal(meet(X,join(join(Y,X),X)),X).
% 136751 [para:136702.1.1,134341.1.1.2.2,demod:136392] equal(meet(meet(X,Y),Y),meet(X,Y)).
% 136781 [para:135302.1.2,134431.1.1.2.2,demod:136392,136507,136297,134466] equal(join(meet(X,join(meet(join(Y,join(X,Z)),join(U,X)),X)),X),X).
% 136782 [para:135302.1.2,134431.1.1.2.2.1.2.2,demod:134341,136392,136507,134466,136781,136258,135302,136297] equal(X,meet(X,join(meet(join(Y,join(X,Z)),join(U,X)),X))).
% 136851 [para:135214.1.1,136420.1.2.1.1] equal(X,join(join(X,meet(X,Y)),X)).
% 136887 [para:136851.1.2,134341.1.1.2.2,demod:136392] equal(meet(join(X,meet(X,Y)),X),join(X,meet(X,Y))).
% 136950 [para:135302.1.2,136587.1.1.1.2,demod:136751,136782] equal(meet(join(X,Y),X),X).
% 136960 [para:134323.1.1,136950.1.1.1,demod:134466] equal(meet(X,meet(X,Y)),meet(X,Y)).
% 137001 [para:136851.1.2,136950.1.1.1] equal(meet(X,join(X,meet(X,Y))),join(X,meet(X,Y))).
% 137002 [para:136960.1.1,134323.1.1.1,demod:137001,136599,136392,136507,135214,136420,134466] equal(join(meet(X,Y),join(X,meet(X,Y))),X).
% 137010 [?] ?
% 137013 [para:136960.1.1,134679.1.2.1.1.1,demod:137002,136507,137010,136887,137001] equal(join(X,meet(X,Y)),X).
% 137025 [para:134434.1.2,136725.1.1.2.1,demod:136258,137013,136420,134466] equal(X,meet(X,join(Y,X))).
% 137030 [para:137013.1.1,134385.1.1.1.2.2,demod:136392,136507,136960] equal(meet(meet(X,Y),X),meet(X,Y)).
% 137045 [para:137013.1.1,135303.1.1.1.2] equal(meet(meet(join(X,Y),Z),meet(Z,Y)),meet(Z,Y)).
% 137100 [para:136950.1.1,137030.1.1.1,demod:136950] equal(meet(X,join(X,Y)),X).
% 139500 [para:134323.1.1,137045.1.1.1.1,demod:137100,136702,137025,136599,136392,136507,135214,136420] equal(meet(meet(X,Y),meet(Y,X)),meet(Y,X)).
% 139568 [para:139500.1.1,134341.1.1.1,demod:137100] equal(join(meet(X,Y),meet(Y,X)),meet(Y,X)).
% 139570 [para:139500.1.1,134385.1.1.1.1,demod:136507,139500,139568,slowcut:134324] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using unit paramodulation 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 15
% clause depth limited to 14
% seconds given: 6
% 
% 
% Split component 3 started.
% 
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split: 
% -equal(meet(a,a),a) | -equal(meet(a,b),meet(b,a)) | -equal(meet(meet(a,b),c),meet(a,meet(b,c))) | -equal(join(a,a),a) | -equal(join(a,b),join(b,a)) | -equal(join(join(a,b),c),join(a,join(b,c))) | -equal(meet(a,join(a,b)),a) | -equal(join(a,meet(a,b)),a).
% Split part used next: -equal(meet(meet(a,b),c),meet(a,meet(b,c))).
% END OF PROOFPART
% 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 15
% clause depth limited to 12
% seconds given: 2
% 
% 
% proof attempt stopped: sos exhausted
% 
% 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 15
% clause depth limited to 13
% seconds given: 2
% 
% 
% proof attempt stopped: sos exhausted
% 
% 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 15
% clause depth limited to 14
% seconds given: 2
% 
% 
% proof attempt stopped: time limit
% 
% 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
% seconds given: 2
% 
% 
% proof attempt stopped: time limit
% 
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 2
% 
% 
% proof attempt stopped: time limit
% 
% 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 15
% clause depth limited to 12
% seconds given: 6
% 
% 
% proof attempt stopped: sos exhausted
% 
% 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 15
% clause depth limited to 13
% seconds given: 6
% 
% 
% proof attempt stopped: sos exhausted
% 
% 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 15
% clause depth limited to 14
% seconds given: 6
% 
% 
% proof attempt stopped: time limit
% 
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using lex ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 15
% clause depth limited to 12
% seconds given: 2
% 
% 
% proof attempt stopped: sos exhausted
% 
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using lex ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 15
% clause depth limited to 13
% seconds given: 2
% 
% 
% proof attempt stopped: sos exhausted
% 
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using lex ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 15
% clause depth limited to 14
% seconds given: 2
% 
% 
% proof attempt stopped: time limit
% 
% using binary resolution
% using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 2
% 
% 
% proof attempt stopped: sos exhausted
% 
% 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
% seconds given: 18
% 
% 
% proof attempt stopped: time limit
% 
% old unit clauses discarded
% 
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using lex ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 12
% 
% 
% proof attempt stopped: time limit
% 
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using first arg depth ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 6
% 
% 
% proof attempt stopped: time limit
% 
% using binary resolution
% using term-depth-order 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
% seconds given: 2
% 
% 
% proof attempt stopped: time limit
% 
% 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 smaller arities for lex ordering
% using clause demodulation
% seconds given: 4
% 
% 
% proof attempt stopped: time limit
% 
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using lex ordering for equality
% preferring smaller arities for lex ordering
% using clause demodulation
% seconds given: 80
% 
% 
% proof attempt stopped: time limit
% 
% Split attempt finished with FAILURE.
% 
% time limit exhausted: proof search terminated.
% 
% Global statistics over all passes: 
% 
%  given clauses:    4334
%  derived clauses:   2585280
%  kept clauses:      62150
%  kept size sum:     938143
%  kept mid-nuclei:   0
%  kept new demods:   57908
%  forw unit-subs:    2333355
%  forw double-subs: 0
%  forw overdouble-subs: 11487
%  backward subs:     273
%  fast unit cutoff:  1102
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  465.56
%  process. runtime:  463.38
% specific non-discr-tree subsumption statistics: 
%  tried:           1453575
%  length fails:    41800
%  strength fails:  95
%  predlist fails:  0
%  aux str. fails:  1123433
%  by-lit fails:    47
%  full subs tried: 129147
%  full subs fail:  127548
% 
% ; 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/LAT/LAT015-1+eq_r.in")
% 
%------------------------------------------------------------------------------