TSTP Solution File: NLP008-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NLP008-1 : TPTP v3.4.2. Released v2.4.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art02.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 528.6s
% 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/NLP/NLP008-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 1 59)
% (binary-unit 9 #f 1 59)
% (binary-double 9 #f 1 59)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 1 59)
% (binary-order 25 #f 1 59)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% SOS clause
% -lonely(X) | -way(X) | -street(X) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(Y) | -down(Z,X) | -barrel(Z,Y) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -fellow(V) | -man(V) | -young(V) | -in(V,W) | -front(W) | -furniture(W) | -seat(W) | -young(X1) | -man(X1) | -fellow(X1) | -seat(X2) | -furniture(X2) | -front(X2) | -in(X1,X2) | ss^sk^c0(0) | equal(X1,V).
% was split for some strategies as:
% -fellow(V) | -man(V) | -young(V) | -in(V,W) | -front(W) | -furniture(W) | -seat(W) | equal(X1,V) | -young(X1) | -man(X1) | -fellow(X1) | -in(X1,X2) | -seat(X2) | -furniture(X2) | -front(X2).
% -lonely(X) | -way(X) | -street(X) | -down(Z,X) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(Y) | -event(Z) | -in(Z,U) | -hollywood(U) | -city(U).
% ss^sk^c0(0).
%
% Starting a split proof attempt with 3 components.
%
% Split component 1 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -lonely(X) | -way(X) | -street(X) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(Y) | -down(Z,X) | -barrel(Z,Y) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -fellow(V) | -man(V) | -young(V) | -in(V,W) | -front(W) | -furniture(W) | -seat(W) | -young(X1) | -man(X1) | -fellow(X1) | -seat(X2) | -furniture(X2) | -front(X2) | -in(X1,X2) | ss^sk^c0(0) | equal(X1,V).
% Split part used next: -fellow(V) | -man(V) | -young(V) | -in(V,W) | -front(W) | -furniture(W) | -seat(W) | equal(X1,V) | -young(X1) | -man(X1) | -fellow(X1) | -in(X1,X2) | -seat(X2) | -furniture(X2) | -front(X2).
% END OF PROOFPART
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(58,40,0,128,0,0,271120,5,1201,271122,1,1201,271122,50,1201,271122,40,1201,271192,0,1201,276816,3,1402,278133,4,1502,279022,1,1602,279022,50,1602,279022,40,1602,279092,0,1602,282132,3,1804,282535,4,1903,283114,1,2003,283114,50,2003,283114,40,2003,283184,0,2003,287304,3,2360,288152,4,2547,288909,5,2705,288909,1,2705,288909,50,2706,288909,40,2706,288979,0,2706,293020,3,3063,293750,4,3232,294663,5,3408,294663,1,3408,294663,50,3408,294663,40,3408,294733,0,3408,297329,3,4847,302591,4,5209,306663,1,5809,306663,50,5809,306663,40,5809,306733,0,5809,306916,3,6753,306916,4,6753,311915,5,7010,311916,1,7010,311916,50,7010,311916,40,7010,311986,0,7010,315921,50,7125,315921,40,7125,315991,0,7125,319945,50,7219,319945,40,7219,320015,0,7219,324385,50,7325,324385,40,7325,324455,0,7326,327048,3,8803,331958,4,9129,336081,5,9727,336082,1,9727,336082,50,9727,336082,40,9727,336152,0,9727,346198,3,10328,348022,4,10628,349817,1,10928,349817,50,10928,349817,40,10928,349887,0,10928,351856,3,12424,352106,50,12449,352106,40,12449,352176,0,12449,354469,3,13800,360673,4,14250,365024,1,14850,365024,50,14850,365024,40,14850,365094,0,14850,708963,4,16310,709737,5,16351,709738,1,16352,709738,50,16352,709738,40,16352,709808,0,16352,718815,3,19812,728969,4,21228,735900,1,22853,735900,50,22853,735900,40,22853,735900,40,22853,736020,0,22853)
%
%
% START OF PROOF
% 735906 [] seat(skc25).
% 735907 [] young(skc24).
% 735908 [] fellow(skc23).
% 735913 [] seat(skc18).
% 735914 [] front(skc17).
% 735915 [] fellow(skc16).
% 735916 [] young(skc15).
% 735958 [] -in(Z,U) | -in(X,Y) | equal(Z,X) | -furniture(U) | -furniture(Y) | -man(Z) | -man(X) | -front(U) | -front(Y) | -fellow(Z) | -fellow(X) | -young(Z) | -young(X) | -seat(U) | -seat(Y).
% 735966 [] -equal(skc16,skc15) | -ss^sk^c0(0).
% 735967 [] -equal(skc24,skc23) | ss^sk^c0(0).
% 735968 [] in(skc16,skc17) | -ss^sk^c0(0).
% 735969 [] in(skc15,skc18) | -ss^sk^c0(0).
% 735973 [] in(skc24,skc25) | ss^sk^c0(0).
% 735974 [] in(skc23,skc25) | ss^sk^c0(0).
% 735978 [] -ss^sk^c0(0) | furniture(skc17).
% 735979 [] -ss^sk^c0(0) | seat(skc17).
% 735980 [] -ss^sk^c0(0) | man(skc16).
% 735981 [] -ss^sk^c0(0) | young(skc16).
% 735982 [] -ss^sk^c0(0) | furniture(skc18).
% 735983 [] -ss^sk^c0(0) | front(skc18).
% 735984 [] -ss^sk^c0(0) | man(skc15).
% 735985 [] -ss^sk^c0(0) | fellow(skc15).
% 735993 [] furniture(skc25) | ss^sk^c0(0).
% 735994 [] ss^sk^c0(0) | front(skc25).
% 735995 [] man(skc24) | ss^sk^c0(0).
% 735996 [] ss^sk^c0(0) | fellow(skc24).
% 735997 [] man(skc23) | ss^sk^c0(0).
% 735998 [] ss^sk^c0(0) | young(skc23).
% 736132 [hyper:735978,735994] furniture(skc17) | front(skc25).
% 736134 [hyper:735980,735994] man(skc16) | front(skc25).
% 736136 [hyper:735982,735994] furniture(skc18) | front(skc25).
% 736137 [hyper:735983,735994] front(skc25) | front(skc18).
% 736138 [hyper:735984,735994] man(skc15) | front(skc25).
% 736194 [hyper:735984,735996] man(skc15) | fellow(skc24).
% 736244 [hyper:735978,735998] furniture(skc17) | young(skc23).
% 736246 [hyper:735980,735998] man(skc16) | young(skc23).
% 736248 [hyper:735982,735998] furniture(skc18) | young(skc23).
% 736249 [hyper:735983,735998] front(skc18) | young(skc23).
% 736250 [hyper:735984,735998] man(skc15) | young(skc23).
% 796912 [hyper:735958,735974,735973,736250,736194,736138,735994,cut:735908,cut:735906,binarycut:735993,binarycut:735997,cut:735907,cut:735906,binarycut:735993,binarycut:735995,binarycut:735967,binarycut:735984] man(skc15).
% 796914 [hyper:735958,735974,735973,736249,735996,cut:735908,cut:735906,binarycut:735993,binarycut:735997,cut:735907,cut:735906,binarycut:735993,binarycut:735995,binarycut:736137,binarycut:736137,binarycut:735967,binarycut:735983] front(skc18).
% 796936 [hyper:735958,735974,735973,736248,736136,736136,735996,cut:735908,cut:735906,binarycut:735993,binarycut:735997,cut:735907,cut:735906,binarycut:735993,binarycut:735995,binarycut:735967,binarycut:735982] furniture(skc18).
% 796953 [hyper:735958,735974,735973,736246,736134,736134,735996,cut:735908,cut:735906,binarycut:735993,binarycut:735997,cut:735907,cut:735906,binarycut:735993,binarycut:735995,binarycut:735967,binarycut:735980] man(skc16).
% 796965 [hyper:735958,735974,735973,736244,736132,736132,735996,cut:735908,cut:735906,binarycut:735993,binarycut:735997,cut:735907,cut:735906,binarycut:735993,binarycut:735995,binarycut:735967,binarycut:735978] furniture(skc17).
% 796972 [hyper:735958,735974,735973,735998,735994,735994,735996,cut:735908,cut:735906,binarycut:735993,binarycut:735997,cut:735907,cut:735906,binarycut:735993,binarycut:735995,binarycut:735967] ss^sk^c0(0).
% 797514 [hyper:735968,796972] in(skc16,skc17).
% 797515 [hyper:735969,796972] in(skc15,skc18).
% 797519 [hyper:735979,796972] seat(skc17).
% 797520 [hyper:735981,796972] young(skc16).
% 797521 [hyper:735985,796972] fellow(skc15).
% 797593 [hyper:735958,797515,797514,cut:796936,cut:796912,cut:796914,cut:797521,cut:735916,cut:735913,cut:796965,cut:796953,cut:735914,cut:735915,cut:797520,cut:797519] equal(skc16,skc15).
% 798753 [hyper:735966,797593,cut:796972] 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 59
% clause depth limited to 1
% seconds given: 8
%
%
% Split component 2 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -lonely(X) | -way(X) | -street(X) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(Y) | -down(Z,X) | -barrel(Z,Y) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -fellow(V) | -man(V) | -young(V) | -in(V,W) | -front(W) | -furniture(W) | -seat(W) | -young(X1) | -man(X1) | -fellow(X1) | -seat(X2) | -furniture(X2) | -front(X2) | -in(X1,X2) | ss^sk^c0(0) | equal(X1,V).
% Split part used next: -lonely(X) | -way(X) | -street(X) | -down(Z,X) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(Y) | -event(Z) | -in(Z,U) | -hollywood(U) | -city(U).
% END OF PROOFPART
% Orig sos clause for pseudosplit:
% -lonely(X) | -way(X) | -street(X) | -down(Z,X) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(Y) | -event(Z) | -in(Z,U) | -hollywood(U) | -city(U).
% Pseudo-split-input-clause results in:
% -$spltprd1($spltcnst287,Z) | -$spltprd1($spltcnst286,Z) | -$spltprd1($spltcnst285,Z) | -$spltprd1($spltcnst284,Z).
% $spltprd1($spltcnst287,Z) | -event(Z).
% $spltprd1($spltcnst286,Z) | -lonely(X) | -way(X) | -street(X) | -down(Z,X).
% $spltprd1($spltcnst285,Z) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(Y).
% $spltprd1($spltcnst284,Z) | -in(Z,U) | -hollywood(U) | -city(U).
%
% Orig sos clause for pseudosplit:
% -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -street(Y) | -way(Y) | -lonely(Y) | -down(Z,Y) | -barrel(Z,X) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -young(V) | -man(V) | -fellow(V) | -fellow(W) | -man(W) | -young(W) | -in(V,X1) | -in(W,X1) | -front(X1) | -furniture(X1) | -seat(X1) | -ss^sk^c0(0) | equal(W,V).
% Pseudo-split-input-clause results in:
% -$spltprd0($spltcnst289) | -$spltprd0($spltcnst288).
% -$spltprd1($spltcnst293,Z) | -$spltprd1($spltcnst292,Z) | -$spltprd1($spltcnst291,Z) | -$spltprd1($spltcnst290,Z) | $spltprd0($spltcnst289).
% $spltprd1($spltcnst293,Z) | -event(Z).
% $spltprd1($spltcnst292,Z) | -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -barrel(Z,X).
% $spltprd1($spltcnst291,Z) | -down(Z,Y) | -street(Y) | -way(Y) | -lonely(Y).
% $spltprd1($spltcnst290,Z) | -in(Z,U) | -hollywood(U) | -city(U).
% $spltprd0($spltcnst288) | -young(V) | -man(V) | -fellow(V) | -in(V,X1) | -in(W,X1) | -fellow(W) | -man(W) | -young(W) | -front(X1) | -furniture(X1) | -seat(X1) | equal(W,V) | -ss^sk^c0(0).
%
% 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 59
% clause depth limited to 1
% seconds given: 8
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(58,40,0,128,0,0,271120,5,1201,271122,1,1201,271122,50,1201,271122,40,1201,271192,0,1201,276816,3,1402,278133,4,1502,279022,1,1602,279022,50,1602,279022,40,1602,279092,0,1602,282132,3,1804,282535,4,1903,283114,1,2003,283114,50,2003,283114,40,2003,283184,0,2003,287304,3,2360,288152,4,2547,288909,5,2705,288909,1,2705,288909,50,2706,288909,40,2706,288979,0,2706,293020,3,3063,293750,4,3232,294663,5,3408,294663,1,3408,294663,50,3408,294663,40,3408,294733,0,3408,297329,3,4847,302591,4,5209,306663,1,5809,306663,50,5809,306663,40,5809,306733,0,5809,306916,3,6753,306916,4,6753,311915,5,7010,311916,1,7010,311916,50,7010,311916,40,7010,311986,0,7010,315921,50,7125,315921,40,7125,315991,0,7125,319945,50,7219,319945,40,7219,320015,0,7219,324385,50,7325,324385,40,7325,324455,0,7326,327048,3,8803,331958,4,9129,336081,5,9727,336082,1,9727,336082,50,9727,336082,40,9727,336152,0,9727,346198,3,10328,348022,4,10628,349817,1,10928,349817,50,10928,349817,40,10928,349887,0,10928,351856,3,12424,352106,50,12449,352106,40,12449,352176,0,12449,354469,3,13800,360673,4,14250,365024,1,14850,365024,50,14850,365024,40,14850,365094,0,14850,708963,4,16310,709737,5,16351,709738,1,16352,709738,50,16352,709738,40,16352,709808,0,16352,718815,3,19812,728969,4,21228,735900,1,22853,735900,50,22853,735900,40,22853,735900,40,22853,736020,0,22853,798752,50,23432,798752,30,23432,798752,40,23432,798872,0,23432)
%
%
% START OF PROOF
% 798754 [] city(skc29).
% 798755 [] event(skc28).
% 798756 [] lonely(skc27).
% 798757 [] chevy(skc26).
% 798761 [] city(skc22).
% 798762 [] event(skc21).
% 798763 [] old(skc20).
% 798764 [] street(skc19).
% 798810 [] -in(X,Y) | -barrel(X,Z) | -down(X,U) | -hollywood(Y) | -way(U) | -car(Z) | -white(Z) | -dirty(Z) | -street(U) | -old(Z) | -chevy(Z) | -lonely(U) | -event(X) | -city(Y).
% 798822 [] in(skc21,skc22) | -ss^sk^c0(0).
% 798823 [] barrel(skc21,skc20) | -ss^sk^c0(0).
% 798824 [] down(skc21,skc19) | -ss^sk^c0(0).
% 798827 [] in(skc28,skc29) | ss^sk^c0(0).
% 798828 [] barrel(skc28,skc26) | ss^sk^c0(0).
% 798829 [] down(skc28,skc27) | ss^sk^c0(0).
% 798838 [] -ss^sk^c0(0) | hollywood(skc22).
% 798839 [] -ss^sk^c0(0) | dirty(skc20).
% 798840 [] -ss^sk^c0(0) | white(skc20).
% 798841 [] -ss^sk^c0(0) | car(skc20).
% 798842 [] -ss^sk^c0(0) | chevy(skc20).
% 798843 [] -ss^sk^c0(0) | way(skc19).
% 798844 [] -ss^sk^c0(0) | lonely(skc19).
% 798851 [] hollywood(skc29) | ss^sk^c0(0).
% 798852 [] way(skc27) | ss^sk^c0(0).
% 798853 [] ss^sk^c0(0) | street(skc27).
% 798854 [] car(skc26) | ss^sk^c0(0).
% 798855 [] white(skc26) | ss^sk^c0(0).
% 798856 [] dirty(skc26) | ss^sk^c0(0).
% 798857 [] ss^sk^c0(0) | old(skc26).
% 826367 [hyper:798810,798829,798853,798827,798828,798857,cut:798756,cut:798755,binarycut:798852,cut:798754,binarycut:798851,cut:798757,binarycut:798854,binarycut:798855,binarycut:798856] ss^sk^c0(0).
% 826396 [hyper:798822,826367] in(skc21,skc22).
% 826397 [hyper:798823,826367] barrel(skc21,skc20).
% 826398 [hyper:798824,826367] down(skc21,skc19).
% 826407 [hyper:798838,826367] hollywood(skc22).
% 826408 [hyper:798839,826367] dirty(skc20).
% 826409 [hyper:798840,826367] white(skc20).
% 826410 [hyper:798841,826367] car(skc20).
% 826411 [hyper:798842,826367] chevy(skc20).
% 826412 [hyper:798843,826367] way(skc19).
% 826413 [hyper:798844,826367] lonely(skc19).
% 826506 [hyper:798810,826398,826396,826397,cut:826412,cut:798764,cut:826413,cut:798762,cut:826407,cut:798761,cut:826410,cut:826409,cut:826408,cut:798763,cut:826411] 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 59
% clause depth limited to 1
% seconds given: 8
%
%
% Split component 3 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -lonely(X) | -way(X) | -street(X) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(Y) | -down(Z,X) | -barrel(Z,Y) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -fellow(V) | -man(V) | -young(V) | -in(V,W) | -front(W) | -furniture(W) | -seat(W) | -young(X1) | -man(X1) | -fellow(X1) | -seat(X2) | -furniture(X2) | -front(X2) | -in(X1,X2) | ss^sk^c0(0) | equal(X1,V).
% Split part used next: ss^sk^c0(0).
% END OF PROOFPART
% Orig sos clause for pseudosplit:
% -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -street(Y) | -way(Y) | -lonely(Y) | -down(Z,Y) | -barrel(Z,X) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -young(V) | -man(V) | -fellow(V) | -fellow(W) | -man(W) | -young(W) | -in(V,X1) | -in(W,X1) | -front(X1) | -furniture(X1) | -seat(X1) | -ss^sk^c0(0) | equal(W,V).
% Pseudo-split-input-clause results in:
% -$spltprd0($spltcnst295) | -$spltprd0($spltcnst294).
% -$spltprd1($spltcnst299,Z) | -$spltprd1($spltcnst298,Z) | -$spltprd1($spltcnst297,Z) | -$spltprd1($spltcnst296,Z) | $spltprd0($spltcnst295).
% $spltprd1($spltcnst299,Z) | -event(Z).
% $spltprd1($spltcnst298,Z) | -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -barrel(Z,X).
% $spltprd1($spltcnst297,Z) | -down(Z,Y) | -street(Y) | -way(Y) | -lonely(Y).
% $spltprd1($spltcnst296,Z) | -in(Z,U) | -hollywood(U) | -city(U).
% $spltprd0($spltcnst294) | -young(V) | -man(V) | -fellow(V) | -in(V,X1) | -in(W,X1) | -fellow(W) | -man(W) | -young(W) | -front(X1) | -furniture(X1) | -seat(X1) | equal(W,V) | -ss^sk^c0(0).
%
% 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 59
% clause depth limited to 1
% seconds given: 8
%
%
% 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 59
% clause depth limited to 2
% seconds given: 8
%
%
% 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 59
% clause depth limited to 3
% seconds given: 8
%
%
% 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 59
% clause depth limited to 4
% seconds given: 8
%
%
% 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 59
% clause depth limited to 5
% seconds given: 8
%
%
% 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 59
% clause depth limited to 6
% seconds given: 8
%
%
% 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 59
% clause depth limited to 7
% seconds given: 8
%
%
% 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 59
% clause depth limited to 8
% seconds given: 8
%
%
% 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 59
% clause depth limited to 9
% seconds given: 8
%
%
% 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 59
% clause depth limited to 10
% seconds given: 8
%
%
% 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 59
% clause depth limited to 11
% seconds given: 8
%
%
% 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 59
% clause depth limited to 12
% seconds given: 8
%
%
% 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 59
% clause depth limited to 13
% seconds given: 8
%
%
% 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 59
% clause depth limited to 14
% seconds given: 8
%
%
% 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 59
% clause depth limited to 15
% seconds given: 8
%
%
% 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 59
% clause depth limited to 16
% seconds given: 8
%
%
% 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 59
% clause depth limited to 17
% seconds given: 8
%
%
% 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 59
% clause depth limited to 18
% seconds given: 8
%
%
% 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 59
% clause depth limited to 19
% seconds given: 8
%
%
% 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 59
% clause depth limited to 20
% seconds given: 8
%
%
% 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 59
% clause depth limited to 21
% seconds given: 8
%
%
% proof attempt stopped: sos exhausted
%
% Orig sos clause for pseudosplit:
% -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -street(Y) | -way(Y) | -lonely(Y) | -down(Z,Y) | -barrel(Z,X) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -young(V) | -man(V) | -fellow(V) | -fellow(W) | -man(W) | -young(W) | -in(V,X1) | -in(W,X1) | -front(X1) | -furniture(X1) | -seat(X1) | -ss^sk^c0(0) | equal(W,V).
% Pseudo-split-input-clause results in:
% -$spltprd0($spltcnst301) | -$spltprd0($spltcnst300).
% -$spltprd1($spltcnst305,Z) | -$spltprd1($spltcnst304,Z) | -$spltprd1($spltcnst303,Z) | -$spltprd1($spltcnst302,Z) | $spltprd0($spltcnst301).
% $spltprd1($spltcnst305,Z) | -event(Z).
% $spltprd1($spltcnst304,Z) | -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -barrel(Z,X).
% $spltprd1($spltcnst303,Z) | -down(Z,Y) | -street(Y) | -way(Y) | -lonely(Y).
% $spltprd1($spltcnst302,Z) | -in(Z,U) | -hollywood(U) | -city(U).
% $spltprd0($spltcnst300) | -young(V) | -man(V) | -fellow(V) | -in(V,X1) | -in(W,X1) | -fellow(W) | -man(W) | -young(W) | -front(X1) | -furniture(X1) | -seat(X1) | equal(W,V) | -ss^sk^c0(0).
%
% 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
% clause length limited to 59
% clause depth limited to 1
% seconds given: 2
%
%
% proof attempt stopped: sos exhausted
%
% 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
% clause length limited to 59
% clause depth limited to 2
% seconds given: 2
%
%
% proof attempt stopped: sos exhausted
%
% 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
% clause length limited to 59
% clause depth limited to 3
% seconds given: 2
%
%
% proof attempt stopped: sos exhausted
%
% Orig sos clause for pseudosplit:
% -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -street(Y) | -way(Y) | -lonely(Y) | -down(Z,Y) | -barrel(Z,X) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -young(V) | -man(V) | -fellow(V) | -fellow(W) | -man(W) | -young(W) | -in(V,X1) | -in(W,X1) | -front(X1) | -furniture(X1) | -seat(X1) | -ss^sk^c0(0) | equal(W,V).
% Pseudo-split-input-clause results in:
% -$spltprd0($spltcnst307) | -$spltprd0($spltcnst306).
% -$spltprd1($spltcnst311,Z) | -$spltprd1($spltcnst310,Z) | -$spltprd1($spltcnst309,Z) | -$spltprd1($spltcnst308,Z) | $spltprd0($spltcnst307).
% $spltprd1($spltcnst311,Z) | -event(Z).
% $spltprd1($spltcnst310,Z) | -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -barrel(Z,X).
% $spltprd1($spltcnst309,Z) | -down(Z,Y) | -street(Y) | -way(Y) | -lonely(Y).
% $spltprd1($spltcnst308,Z) | -in(Z,U) | -hollywood(U) | -city(U).
% $spltprd0($spltcnst306) | -young(V) | -man(V) | -fellow(V) | -in(V,X1) | -in(W,X1) | -fellow(W) | -man(W) | -young(W) | -front(X1) | -furniture(X1) | -seat(X1) | equal(W,V) | -ss^sk^c0(0).
%
% using binary resolution
% not using sos strategy
% using double 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 59
% clause depth limited to 1
% seconds given: 2
%
%
% proof attempt stopped: sos exhausted
%
% using binary resolution
% not using sos strategy
% using double 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 59
% clause depth limited to 2
% seconds given: 2
%
%
% proof attempt stopped: sos exhausted
%
% using binary resolution
% not using sos strategy
% using double 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 59
% clause depth limited to 3
% seconds given: 2
%
%
% proof attempt stopped: sos exhausted
%
% Orig sos clause for pseudosplit:
% -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -street(Y) | -way(Y) | -lonely(Y) | -down(Z,Y) | -barrel(Z,X) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -young(V) | -man(V) | -fellow(V) | -fellow(W) | -man(W) | -young(W) | -in(V,X1) | -in(W,X1) | -front(X1) | -furniture(X1) | -seat(X1) | -ss^sk^c0(0) | equal(W,V).
% Pseudo-split-input-clause results in:
% -$spltprd0($spltcnst313) | -$spltprd0($spltcnst312).
% -$spltprd1($spltcnst317,Z) | -$spltprd1($spltcnst316,Z) | -$spltprd1($spltcnst315,Z) | -$spltprd1($spltcnst314,Z) | $spltprd0($spltcnst313).
% $spltprd1($spltcnst317,Z) | -event(Z).
% $spltprd1($spltcnst316,Z) | -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -barrel(Z,X).
% $spltprd1($spltcnst315,Z) | -down(Z,Y) | -street(Y) | -way(Y) | -lonely(Y).
% $spltprd1($spltcnst314,Z) | -in(Z,U) | -hollywood(U) | -city(U).
% $spltprd0($spltcnst312) | -young(V) | -man(V) | -fellow(V) | -in(V,X1) | -in(W,X1) | -fellow(W) | -man(W) | -young(W) | -front(X1) | -furniture(X1) | -seat(X1) | equal(W,V) | -ss^sk^c0(0).
%
% using binary resolution
% not using sos strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% Orig sos clause for pseudosplit:
% -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -street(Y) | -way(Y) | -lonely(Y) | -down(Z,Y) | -barrel(Z,X) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -young(V) | -man(V) | -fellow(V) | -fellow(W) | -man(W) | -young(W) | -in(V,X1) | -in(W,X1) | -front(X1) | -furniture(X1) | -seat(X1) | -ss^sk^c0(0) | equal(W,V).
% Pseudo-split-input-clause results in:
% -$spltprd0($spltcnst319) | -$spltprd0($spltcnst318).
% -$spltprd1($spltcnst323,Z) | -$spltprd1($spltcnst322,Z) | -$spltprd1($spltcnst321,Z) | -$spltprd1($spltcnst320,Z) | $spltprd0($spltcnst319).
% $spltprd1($spltcnst323,Z) | -event(Z).
% $spltprd1($spltcnst322,Z) | -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -barrel(Z,X).
% $spltprd1($spltcnst321,Z) | -down(Z,Y) | -street(Y) | -way(Y) | -lonely(Y).
% $spltprd1($spltcnst320,Z) | -in(Z,U) | -hollywood(U) | -city(U).
% $spltprd0($spltcnst318) | -young(V) | -man(V) | -fellow(V) | -in(V,X1) | -in(W,X1) | -fellow(W) | -man(W) | -young(W) | -front(X1) | -furniture(X1) | -seat(X1) | equal(W,V) | -ss^sk^c0(0).
%
% using binary resolution
% using sos strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 4
%
%
% proof attempt stopped: sos exhausted
%
% Orig sos clause for pseudosplit:
% -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -street(Y) | -way(Y) | -lonely(Y) | -down(Z,Y) | -barrel(Z,X) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -young(V) | -man(V) | -fellow(V) | -fellow(W) | -man(W) | -young(W) | -in(V,X1) | -in(W,X1) | -front(X1) | -furniture(X1) | -seat(X1) | -ss^sk^c0(0) | equal(W,V).
% Pseudo-split-input-clause results in:
% -$spltprd0($spltcnst325) | -$spltprd0($spltcnst324).
% -$spltprd1($spltcnst329,Z) | -$spltprd1($spltcnst328,Z) | -$spltprd1($spltcnst327,Z) | -$spltprd1($spltcnst326,Z) | $spltprd0($spltcnst325).
% $spltprd1($spltcnst329,Z) | -event(Z).
% $spltprd1($spltcnst328,Z) | -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -barrel(Z,X).
% $spltprd1($spltcnst327,Z) | -down(Z,Y) | -street(Y) | -way(Y) | -lonely(Y).
% $spltprd1($spltcnst326,Z) | -in(Z,U) | -hollywood(U) | -city(U).
% $spltprd0($spltcnst324) | -young(V) | -man(V) | -fellow(V) | -in(V,X1) | -in(W,X1) | -fellow(W) | -man(W) | -young(W) | -front(X1) | -furniture(X1) | -seat(X1) | equal(W,V) | -ss^sk^c0(0).
%
% 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
% clause length limited to 59
% clause depth limited to 1
% seconds given: 16
%
%
% proof attempt stopped: time limit
%
% Orig sos clause for pseudosplit:
% -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -street(Y) | -way(Y) | -lonely(Y) | -down(Z,Y) | -barrel(Z,X) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -young(V) | -man(V) | -fellow(V) | -fellow(W) | -man(W) | -young(W) | -in(V,X1) | -in(W,X1) | -front(X1) | -furniture(X1) | -seat(X1) | -ss^sk^c0(0) | equal(W,V).
% Pseudo-split-input-clause results in:
% -$spltprd0($spltcnst331) | -$spltprd0($spltcnst330).
% -$spltprd1($spltcnst335,Z) | -$spltprd1($spltcnst334,Z) | -$spltprd1($spltcnst333,Z) | -$spltprd1($spltcnst332,Z) | $spltprd0($spltcnst331).
% $spltprd1($spltcnst335,Z) | -event(Z).
% $spltprd1($spltcnst334,Z) | -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -barrel(Z,X).
% $spltprd1($spltcnst333,Z) | -down(Z,Y) | -street(Y) | -way(Y) | -lonely(Y).
% $spltprd1($spltcnst332,Z) | -in(Z,U) | -hollywood(U) | -city(U).
% $spltprd0($spltcnst330) | -young(V) | -man(V) | -fellow(V) | -in(V,X1) | -in(W,X1) | -fellow(W) | -man(W) | -young(W) | -front(X1) | -furniture(X1) | -seat(X1) | equal(W,V) | -ss^sk^c0(0).
%
% 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
% clause length limited to 59
% clause depth limited to 1
% seconds given: 8
%
%
% proof attempt stopped: time limit
%
% Orig sos clause for pseudosplit:
% -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -street(Y) | -way(Y) | -lonely(Y) | -down(Z,Y) | -barrel(Z,X) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -young(V) | -man(V) | -fellow(V) | -fellow(W) | -man(W) | -young(W) | -in(V,X1) | -in(W,X1) | -front(X1) | -furniture(X1) | -seat(X1) | -ss^sk^c0(0) | equal(W,V).
% Pseudo-split-input-clause results in:
% -$spltprd0($spltcnst337) | -$spltprd0($spltcnst336).
% -$spltprd1($spltcnst341,Z) | -$spltprd1($spltcnst340,Z) | -$spltprd1($spltcnst339,Z) | -$spltprd1($spltcnst338,Z) | $spltprd0($spltcnst337).
% $spltprd1($spltcnst341,Z) | -event(Z).
% $spltprd1($spltcnst340,Z) | -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -barrel(Z,X).
% $spltprd1($spltcnst339,Z) | -down(Z,Y) | -street(Y) | -way(Y) | -lonely(Y).
% $spltprd1($spltcnst338,Z) | -in(Z,U) | -hollywood(U) | -city(U).
% $spltprd0($spltcnst336) | -young(V) | -man(V) | -fellow(V) | -in(V,X1) | -in(W,X1) | -fellow(W) | -man(W) | -young(W) | -front(X1) | -furniture(X1) | -seat(X1) | equal(W,V) | -ss^sk^c0(0).
%
% 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: 32
%
%
% proof attempt stopped: sos exhausted
%
% Orig sos clause for pseudosplit:
% -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -street(Y) | -way(Y) | -lonely(Y) | -down(Z,Y) | -barrel(Z,X) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -young(V) | -man(V) | -fellow(V) | -fellow(W) | -man(W) | -young(W) | -in(V,X1) | -in(W,X1) | -front(X1) | -furniture(X1) | -seat(X1) | -ss^sk^c0(0) | equal(W,V).
% Pseudo-split-input-clause results in:
% -$spltprd0($spltcnst343) | -$spltprd0($spltcnst342).
% -$spltprd1($spltcnst347,Z) | -$spltprd1($spltcnst346,Z) | -$spltprd1($spltcnst345,Z) | -$spltprd1($spltcnst344,Z) | $spltprd0($spltcnst343).
% $spltprd1($spltcnst347,Z) | -event(Z).
% $spltprd1($spltcnst346,Z) | -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -barrel(Z,X).
% $spltprd1($spltcnst345,Z) | -down(Z,Y) | -street(Y) | -way(Y) | -lonely(Y).
% $spltprd1($spltcnst344,Z) | -in(Z,U) | -hollywood(U) | -city(U).
% $spltprd0($spltcnst342) | -young(V) | -man(V) | -fellow(V) | -in(V,X1) | -in(W,X1) | -fellow(W) | -man(W) | -young(W) | -front(X1) | -furniture(X1) | -seat(X1) | equal(W,V) | -ss^sk^c0(0).
%
% 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: 8
%
%
% proof attempt stopped: sos exhausted
%
% Orig sos clause for pseudosplit:
% -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -street(Y) | -way(Y) | -lonely(Y) | -down(Z,Y) | -barrel(Z,X) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -young(V) | -man(V) | -fellow(V) | -fellow(W) | -man(W) | -young(W) | -in(V,X1) | -in(W,X1) | -front(X1) | -furniture(X1) | -seat(X1) | -ss^sk^c0(0) | equal(W,V).
% Pseudo-split-input-clause results in:
% -$spltprd0($spltcnst349) | -$spltprd0($spltcnst348).
% -$spltprd1($spltcnst353,Z) | -$spltprd1($spltcnst352,Z) | -$spltprd1($spltcnst351,Z) | -$spltprd1($spltcnst350,Z) | $spltprd0($spltcnst349).
% $spltprd1($spltcnst353,Z) | -event(Z).
% $spltprd1($spltcnst352,Z) | -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -barrel(Z,X).
% $spltprd1($spltcnst351,Z) | -down(Z,Y) | -street(Y) | -way(Y) | -lonely(Y).
% $spltprd1($spltcnst350,Z) | -in(Z,U) | -hollywood(U) | -city(U).
% $spltprd0($spltcnst348) | -young(V) | -man(V) | -fellow(V) | -in(V,X1) | -in(W,X1) | -fellow(W) | -man(W) | -young(W) | -front(X1) | -furniture(X1) | -seat(X1) | equal(W,V) | -ss^sk^c0(0).
%
% 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: 2
%
%
% proof attempt stopped: sos exhausted
%
% Orig sos clause for pseudosplit:
% -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -street(Y) | -way(Y) | -lonely(Y) | -down(Z,Y) | -barrel(Z,X) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -young(V) | -man(V) | -fellow(V) | -fellow(W) | -man(W) | -young(W) | -in(V,X1) | -in(W,X1) | -front(X1) | -furniture(X1) | -seat(X1) | -ss^sk^c0(0) | equal(W,V).
% Pseudo-split-input-clause results in:
% -$spltprd0($spltcnst355) | -$spltprd0($spltcnst354).
% -$spltprd1($spltcnst359,Z) | -$spltprd1($spltcnst358,Z) | -$spltprd1($spltcnst357,Z) | -$spltprd1($spltcnst356,Z) | $spltprd0($spltcnst355).
% $spltprd1($spltcnst359,Z) | -event(Z).
% $spltprd1($spltcnst358,Z) | -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -barrel(Z,X).
% $spltprd1($spltcnst357,Z) | -down(Z,Y) | -street(Y) | -way(Y) | -lonely(Y).
% $spltprd1($spltcnst356,Z) | -in(Z,U) | -hollywood(U) | -city(U).
% $spltprd0($spltcnst354) | -young(V) | -man(V) | -fellow(V) | -in(V,X1) | -in(W,X1) | -fellow(W) | -man(W) | -young(W) | -front(X1) | -furniture(X1) | -seat(X1) | equal(W,V) | -ss^sk^c0(0).
%
% using binary resolution
% using term-depth-order strategy
% 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: 16
%
%
% proof attempt stopped: time limit
%
% Orig sos clause for pseudosplit:
% -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -street(Y) | -way(Y) | -lonely(Y) | -down(Z,Y) | -barrel(Z,X) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -young(V) | -man(V) | -fellow(V) | -fellow(W) | -man(W) | -young(W) | -in(V,X1) | -in(W,X1) | -front(X1) | -furniture(X1) | -seat(X1) | -ss^sk^c0(0) | equal(W,V).
% Pseudo-split-input-clause results in:
% -$spltprd0($spltcnst361) | -$spltprd0($spltcnst360).
% -$spltprd1($spltcnst365,Z) | -$spltprd1($spltcnst364,Z) | -$spltprd1($spltcnst363,Z) | -$spltprd1($spltcnst362,Z) | $spltprd0($spltcnst361).
% $spltprd1($spltcnst365,Z) | -event(Z).
% $spltprd1($spltcnst364,Z) | -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -barrel(Z,X).
% $spltprd1($spltcnst363,Z) | -down(Z,Y) | -street(Y) | -way(Y) | -lonely(Y).
% $spltprd1($spltcnst362,Z) | -in(Z,U) | -hollywood(U) | -city(U).
% $spltprd0($spltcnst360) | -young(V) | -man(V) | -fellow(V) | -in(V,X1) | -in(W,X1) | -fellow(W) | -man(W) | -young(W) | -front(X1) | -furniture(X1) | -seat(X1) | equal(W,V) | -ss^sk^c0(0).
%
% 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: 8
%
%
% proof attempt stopped: sos exhausted
%
% Orig sos clause for pseudosplit:
% -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -street(Y) | -way(Y) | -lonely(Y) | -down(Z,Y) | -barrel(Z,X) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -young(V) | -man(V) | -fellow(V) | -fellow(W) | -man(W) | -young(W) | -in(V,X1) | -in(W,X1) | -front(X1) | -furniture(X1) | -seat(X1) | -ss^sk^c0(0) | equal(W,V).
% Pseudo-split-input-clause results in:
% -$spltprd0($spltcnst367) | -$spltprd0($spltcnst366).
% -$spltprd1($spltcnst371,Z) | -$spltprd1($spltcnst370,Z) | -$spltprd1($spltcnst369,Z) | -$spltprd1($spltcnst368,Z) | $spltprd0($spltcnst367).
% $spltprd1($spltcnst371,Z) | -event(Z).
% $spltprd1($spltcnst370,Z) | -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -barrel(Z,X).
% $spltprd1($spltcnst369,Z) | -down(Z,Y) | -street(Y) | -way(Y) | -lonely(Y).
% $spltprd1($spltcnst368,Z) | -in(Z,U) | -hollywood(U) | -city(U).
% $spltprd0($spltcnst366) | -young(V) | -man(V) | -fellow(V) | -in(V,X1) | -in(W,X1) | -fellow(W) | -man(W) | -young(W) | -front(X1) | -furniture(X1) | -seat(X1) | equal(W,V) | -ss^sk^c0(0).
%
% using binary resolution
% using weight-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: 16
%
%
% proof attempt stopped: sos exhausted
%
% Orig sos clause for pseudosplit:
% -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -street(Y) | -way(Y) | -lonely(Y) | -down(Z,Y) | -barrel(Z,X) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -young(V) | -man(V) | -fellow(V) | -fellow(W) | -man(W) | -young(W) | -in(V,X1) | -in(W,X1) | -front(X1) | -furniture(X1) | -seat(X1) | -ss^sk^c0(0) | equal(W,V).
% Pseudo-split-input-clause results in:
% -$spltprd0($spltcnst373) | -$spltprd0($spltcnst372).
% -$spltprd1($spltcnst377,Z) | -$spltprd1($spltcnst376,Z) | -$spltprd1($spltcnst375,Z) | -$spltprd1($spltcnst374,Z) | $spltprd0($spltcnst373).
% $spltprd1($spltcnst377,Z) | -event(Z).
% $spltprd1($spltcnst376,Z) | -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -barrel(Z,X).
% $spltprd1($spltcnst375,Z) | -down(Z,Y) | -street(Y) | -way(Y) | -lonely(Y).
% $spltprd1($spltcnst374,Z) | -in(Z,U) | -hollywood(U) | -city(U).
% $spltprd0($spltcnst372) | -young(V) | -man(V) | -fellow(V) | -in(V,X1) | -in(W,X1) | -fellow(W) | -man(W) | -young(W) | -front(X1) | -furniture(X1) | -seat(X1) | equal(W,V) | -ss^sk^c0(0).
%
% 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: 16
%
%
% proof attempt stopped: time limit
%
% old unit clauses discarded
%
% Orig sos clause for pseudosplit:
% -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -street(Y) | -way(Y) | -lonely(Y) | -down(Z,Y) | -barrel(Z,X) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -young(V) | -man(V) | -fellow(V) | -fellow(W) | -man(W) | -young(W) | -in(V,X1) | -in(W,X1) | -front(X1) | -furniture(X1) | -seat(X1) | -ss^sk^c0(0) | equal(W,V).
% Pseudo-split-input-clause results in:
% -$spltprd0($spltcnst379) | -$spltprd0($spltcnst378).
% -$spltprd1($spltcnst383,Z) | -$spltprd1($spltcnst382,Z) | -$spltprd1($spltcnst381,Z) | -$spltprd1($spltcnst380,Z) | $spltprd0($spltcnst379).
% $spltprd1($spltcnst383,Z) | -event(Z).
% $spltprd1($spltcnst382,Z) | -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -barrel(Z,X).
% $spltprd1($spltcnst381,Z) | -down(Z,Y) | -street(Y) | -way(Y) | -lonely(Y).
% $spltprd1($spltcnst380,Z) | -in(Z,U) | -hollywood(U) | -city(U).
% $spltprd0($spltcnst378) | -young(V) | -man(V) | -fellow(V) | -in(V,X1) | -in(W,X1) | -fellow(W) | -man(W) | -young(W) | -front(X1) | -furniture(X1) | -seat(X1) | equal(W,V) | -ss^sk^c0(0).
%
% using hyperresolution
% using term-depth-order strategy
% 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
% seconds given: 10
%
%
% proof attempt stopped: sos exhausted
%
% Orig sos clause for pseudosplit:
% -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -street(Y) | -way(Y) | -lonely(Y) | -down(Z,Y) | -barrel(Z,X) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -young(V) | -man(V) | -fellow(V) | -fellow(W) | -man(W) | -young(W) | -in(V,X1) | -in(W,X1) | -front(X1) | -furniture(X1) | -seat(X1) | -ss^sk^c0(0) | equal(W,V).
% Pseudo-split-input-clause results in:
% -$spltprd0($spltcnst385) | -$spltprd0($spltcnst384).
% -$spltprd1($spltcnst389,Z) | -$spltprd1($spltcnst388,Z) | -$spltprd1($spltcnst387,Z) | -$spltprd1($spltcnst386,Z) | $spltprd0($spltcnst385).
% $spltprd1($spltcnst389,Z) | -event(Z).
% $spltprd1($spltcnst388,Z) | -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -barrel(Z,X).
% $spltprd1($spltcnst387,Z) | -down(Z,Y) | -street(Y) | -way(Y) | -lonely(Y).
% $spltprd1($spltcnst386,Z) | -in(Z,U) | -hollywood(U) | -city(U).
% $spltprd0($spltcnst384) | -young(V) | -man(V) | -fellow(V) | -in(V,X1) | -in(W,X1) | -fellow(W) | -man(W) | -young(W) | -front(X1) | -furniture(X1) | -seat(X1) | equal(W,V) | -ss^sk^c0(0).
%
% 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: 240
%
%
% proof attempt stopped: time limit
%
% Split attempt finished with FAILURE.
%
% time limit exhausted: proof search terminated.
%
% Global statistics over all passes:
%
% given clauses: 63424
% derived clauses: 1665764
% kept clauses: 115382
% kept size sum: 589644
% kept mid-nuclei: 590826
% kept new demods: 2
% forw unit-subs: 104344
% forw double-subs: 123384
% forw overdouble-subs: 596978
% backward subs: 44784
% fast unit cutoff: 512261
% full unit cutoff: 0
% dbl unit cutoff: 133891
% real runtime : 538.10
% process. runtime: 536.9
% specific non-discr-tree subsumption statistics:
% tried: 234375687
% length fails: 1465647
% strength fails: 128728996
% predlist fails: 45888053
% aux str. fails: 2188325
% by-lit fails: 22644394
% full subs tried: 29156285
% full subs fail: 28775775
%
% ; 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/NLP/NLP008-1+eq_r.in")
%
%------------------------------------------------------------------------------