TSTP Solution File: NLP005-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NLP005-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 : art06.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unknown 526.4s
% 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/NLP005-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
% -chevy(X) | -car(X) | -white(X) | -dirty(X) | -old(X) | -lonely(Y) | -way(Y) | -street(Y) | -event(Z) | -barrel(Z,X) | -down(Z,Y) | -in(Z,U) | -city(U) | -hollywood(U) | -seat(V) | -furniture(V) | -front(V) | -in(W,V) | -fellow(W) | -man(W) | -young(W) | -in(X1,X2) | -front(X2) | -furniture(X2) | -seat(X2) | -young(X1) | -man(X1) | -fellow(X1) | ss^sk^c0(0) | equal(X1,W).
% was split for some strategies as:
% -seat(V) | -furniture(V) | -front(V) | -in(W,V) | -fellow(W) | -man(W) | -young(W) | equal(X1,W) | -in(X1,X2) | -front(X2) | -furniture(X2) | -seat(X2) | -young(X1) | -man(X1) | -fellow(X1).
% -chevy(X) | -car(X) | -white(X) | -dirty(X) | -old(X) | -barrel(Z,X) | -event(Z) | -down(Z,Y) | -lonely(Y) | -way(Y) | -street(Y) | -in(Z,U) | -city(U) | -hollywood(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:
% -chevy(X) | -car(X) | -white(X) | -dirty(X) | -old(X) | -lonely(Y) | -way(Y) | -street(Y) | -event(Z) | -barrel(Z,X) | -down(Z,Y) | -in(Z,U) | -city(U) | -hollywood(U) | -seat(V) | -furniture(V) | -front(V) | -in(W,V) | -fellow(W) | -man(W) | -young(W) | -in(X1,X2) | -front(X2) | -furniture(X2) | -seat(X2) | -young(X1) | -man(X1) | -fellow(X1) | ss^sk^c0(0) | equal(X1,W).
% Split part used next: -seat(V) | -furniture(V) | -front(V) | -in(W,V) | -fellow(W) | -man(W) | -young(W) | equal(X1,W) | -in(X1,X2) | -front(X2) | -furniture(X2) | -seat(X2) | -young(X1) | -man(X1) | -fellow(X1).
% END OF PROOFPART
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(58,40,1,128,0,1,180970,4,950,181979,5,1204,181991,1,1206,181991,50,1206,181991,40,1206,182061,0,1206,187360,3,1407,188543,4,1507,189389,5,1607,189389,1,1607,189389,50,1607,189389,40,1607,189459,0,1607,192404,3,1809,192816,4,1909,193432,5,2008,193432,1,2008,193432,50,2008,193432,40,2008,193502,0,2008,197429,3,2359,198284,4,2536,199255,5,2709,199255,1,2709,199255,50,2709,199255,40,2709,199325,0,2709,203236,3,3073,203908,4,3236,204684,5,3410,204685,5,3410,204685,1,3410,204685,50,3410,204685,40,3410,204755,0,3410,207197,3,4677,214468,4,5211,217736,5,5811,217737,1,5811,217737,50,5811,217737,40,5811,217807,0,5811,217985,3,6705,218545,4,6712,223616,5,7012,223617,5,7012,223617,1,7012,223617,50,7012,223617,40,7012,223687,0,7012,226797,50,7082,226797,40,7082,226867,0,7082,229977,50,7151,229977,40,7151,230047,0,7151,233311,50,7230,233311,40,7230,233381,0,7231,236083,3,8572,242800,4,9032,246598,1,9632,246598,50,9632,246598,40,9632,246668,0,9632,256134,3,10233,257794,4,10533,259253,1,10833,259253,50,10833,259253,40,10833,259323,0,10833,261532,3,12345,261813,50,12376,261813,40,12376,261883,0,12376,264022,3,13580,271703,4,14177,275333,5,14777,275334,5,14777,275335,1,14777,275335,50,14777,275335,40,14777,275405,0,14777,533833,4,16090,534701,5,16278,534710,1,16278,534710,50,16279,534710,40,16279,534780,0,16279,541912,3,19567,553513,4,21155,560609,1,22780,560609,50,22780,560609,40,22780,560609,40,22780,560729,0,22780)
%
%
% START OF PROOF
% 560615 [] seat(skc25).
% 560616 [] young(skc24).
% 560617 [] fellow(skc23).
% 560622 [] front(skc18).
% 560623 [] seat(skc17).
% 560624 [] fellow(skc16).
% 560625 [] young(skc15).
% 560667 [] -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).
% 560675 [] -equal(skc16,skc15) | -ss^sk^c0(0).
% 560676 [] -equal(skc24,skc23) | ss^sk^c0(0).
% 560677 [] in(skc16,skc17) | -ss^sk^c0(0).
% 560678 [] in(skc15,skc18) | -ss^sk^c0(0).
% 560682 [] in(skc24,skc25) | ss^sk^c0(0).
% 560683 [] in(skc23,skc25) | ss^sk^c0(0).
% 560687 [] -ss^sk^c0(0) | man(skc16).
% 560688 [] -ss^sk^c0(0) | young(skc16).
% 560689 [] -ss^sk^c0(0) | furniture(skc17).
% 560690 [] -ss^sk^c0(0) | front(skc17).
% 560691 [] -ss^sk^c0(0) | man(skc15).
% 560692 [] -ss^sk^c0(0) | fellow(skc15).
% 560693 [] -ss^sk^c0(0) | furniture(skc18).
% 560694 [] -ss^sk^c0(0) | seat(skc18).
% 560702 [] furniture(skc25) | ss^sk^c0(0).
% 560703 [] ss^sk^c0(0) | front(skc25).
% 560704 [] man(skc24) | ss^sk^c0(0).
% 560705 [] ss^sk^c0(0) | fellow(skc24).
% 560706 [] man(skc23) | ss^sk^c0(0).
% 560707 [] ss^sk^c0(0) | young(skc23).
% 560841 [hyper:560687,560703] man(skc16) | front(skc25).
% 560843 [hyper:560689,560703] furniture(skc17) | front(skc25).
% 560844 [hyper:560690,560703] front(skc25) | front(skc17).
% 560845 [hyper:560691,560703] man(skc15) | front(skc25).
% 560847 [hyper:560693,560703] furniture(skc18) | front(skc25).
% 560901 [hyper:560691,560705] man(skc15) | fellow(skc24).
% 560903 [hyper:560693,560705] furniture(skc18) | fellow(skc24).
% 560953 [hyper:560687,560707] man(skc16) | young(skc23).
% 560955 [hyper:560689,560707] furniture(skc17) | young(skc23).
% 560956 [hyper:560690,560707] front(skc17) | young(skc23).
% 560957 [hyper:560691,560707] man(skc15) | young(skc23).
% 560959 [hyper:560693,560707] furniture(skc18) | young(skc23).
% 611046 [hyper:560667,560683,560682,560959,560903,560847,560703,cut:560617,cut:560615,binarycut:560702,binarycut:560706,cut:560616,cut:560615,binarycut:560702,binarycut:560704,binarycut:560676,binarycut:560693] furniture(skc18).
% 611074 [hyper:560667,560683,560682,560957,560901,560845,560703,cut:560617,cut:560615,binarycut:560702,binarycut:560706,cut:560616,cut:560615,binarycut:560702,binarycut:560704,binarycut:560676,binarycut:560691] man(skc15).
% 611076 [hyper:560667,560683,560682,560956,560705,cut:560617,cut:560615,binarycut:560702,binarycut:560706,cut:560616,cut:560615,binarycut:560702,binarycut:560704,binarycut:560844,binarycut:560844,binarycut:560676,binarycut:560690] front(skc17).
% 611093 [hyper:560667,560683,560682,560955,560843,560843,560705,cut:560617,cut:560615,binarycut:560702,binarycut:560706,cut:560616,cut:560615,binarycut:560702,binarycut:560704,binarycut:560676,binarycut:560689] furniture(skc17).
% 611105 [hyper:560667,560683,560682,560953,560841,560841,560705,cut:560617,cut:560615,binarycut:560702,binarycut:560706,cut:560616,cut:560615,binarycut:560702,binarycut:560704,binarycut:560676,binarycut:560687] man(skc16).
% 611112 [hyper:560667,560683,560682,560707,560703,560703,560705,cut:560617,cut:560615,binarycut:560702,binarycut:560706,cut:560616,cut:560615,binarycut:560702,binarycut:560704,binarycut:560676] ss^sk^c0(0).
% 612900 [hyper:560677,611112] in(skc16,skc17).
% 612901 [hyper:560678,611112] in(skc15,skc18).
% 612905 [hyper:560688,611112] young(skc16).
% 612906 [hyper:560692,611112] fellow(skc15).
% 612907 [hyper:560694,611112] seat(skc18).
% 613177 [hyper:560667,612901,612900,cut:611046,cut:611074,cut:560622,cut:612906,cut:560625,cut:612907,cut:611093,cut:611105,cut:611076,cut:560624,cut:612905,cut:560623] equal(skc16,skc15).
% 618920 [hyper:560675,613177,cut:611112] 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:
% -chevy(X) | -car(X) | -white(X) | -dirty(X) | -old(X) | -lonely(Y) | -way(Y) | -street(Y) | -event(Z) | -barrel(Z,X) | -down(Z,Y) | -in(Z,U) | -city(U) | -hollywood(U) | -seat(V) | -furniture(V) | -front(V) | -in(W,V) | -fellow(W) | -man(W) | -young(W) | -in(X1,X2) | -front(X2) | -furniture(X2) | -seat(X2) | -young(X1) | -man(X1) | -fellow(X1) | ss^sk^c0(0) | equal(X1,W).
% Split part used next: -chevy(X) | -car(X) | -white(X) | -dirty(X) | -old(X) | -barrel(Z,X) | -event(Z) | -down(Z,Y) | -lonely(Y) | -way(Y) | -street(Y) | -in(Z,U) | -city(U) | -hollywood(U).
% END OF PROOFPART
% Orig sos clause for pseudosplit:
% -chevy(X) | -car(X) | -white(X) | -dirty(X) | -old(X) | -barrel(Z,X) | -event(Z) | -down(Z,Y) | -lonely(Y) | -way(Y) | -street(Y) | -in(Z,U) | -city(U) | -hollywood(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) | -chevy(X) | -car(X) | -white(X) | -dirty(X) | -old(X) | -barrel(Z,X).
% $spltprd1($spltcnst285,Z) | -down(Z,Y) | -lonely(Y) | -way(Y) | -street(Y).
% $spltprd1($spltcnst284,Z) | -in(Z,U) | -city(U) | -hollywood(U).
%
% Orig sos clause for pseudosplit:
% -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) | -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) | -lonely(X) | -way(X) | -street(X) | -down(Z,X).
% $spltprd1($spltcnst291,Z) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(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,1,128,0,1,180970,4,950,181979,5,1204,181991,1,1206,181991,50,1206,181991,40,1206,182061,0,1206,187360,3,1407,188543,4,1507,189389,5,1607,189389,1,1607,189389,50,1607,189389,40,1607,189459,0,1607,192404,3,1809,192816,4,1909,193432,5,2008,193432,1,2008,193432,50,2008,193432,40,2008,193502,0,2008,197429,3,2359,198284,4,2536,199255,5,2709,199255,1,2709,199255,50,2709,199255,40,2709,199325,0,2709,203236,3,3073,203908,4,3236,204684,5,3410,204685,5,3410,204685,1,3410,204685,50,3410,204685,40,3410,204755,0,3410,207197,3,4677,214468,4,5211,217736,5,5811,217737,1,5811,217737,50,5811,217737,40,5811,217807,0,5811,217985,3,6705,218545,4,6712,223616,5,7012,223617,5,7012,223617,1,7012,223617,50,7012,223617,40,7012,223687,0,7012,226797,50,7082,226797,40,7082,226867,0,7082,229977,50,7151,229977,40,7151,230047,0,7151,233311,50,7230,233311,40,7230,233381,0,7231,236083,3,8572,242800,4,9032,246598,1,9632,246598,50,9632,246598,40,9632,246668,0,9632,256134,3,10233,257794,4,10533,259253,1,10833,259253,50,10833,259253,40,10833,259323,0,10833,261532,3,12345,261813,50,12376,261813,40,12376,261883,0,12376,264022,3,13580,271703,4,14177,275333,5,14777,275334,5,14777,275335,1,14777,275335,50,14777,275335,40,14777,275405,0,14777,533833,4,16090,534701,5,16278,534710,1,16278,534710,50,16279,534710,40,16279,534780,0,16279,541912,3,19567,553513,4,21155,560609,1,22780,560609,50,22780,560609,40,22780,560609,40,22780,560729,0,22780,618919,50,23288,618919,30,23288,618919,40,23288,619039,0,23288)
%
%
% START OF PROOF
% 618921 [] city(skc29).
% 618922 [] event(skc28).
% 618923 [] old(skc27).
% 618924 [] street(skc26).
% 618928 [] hollywood(skc22).
% 618929 [] event(skc21).
% 618930 [] street(skc20).
% 618931 [] old(skc19).
% 618977 [] -in(X,Y) | -barrel(X,Z) | -down(X,U) | -dirty(Z) | -white(Z) | -car(Z) | -chevy(Z) | -way(U) | -lonely(U) | -hollywood(Y) | -street(U) | -old(Z) | -event(X) | -city(Y).
% 618989 [] in(skc21,skc22) | -ss^sk^c0(0).
% 618990 [] down(skc21,skc20) | -ss^sk^c0(0).
% 618991 [] barrel(skc21,skc19) | -ss^sk^c0(0).
% 618994 [] in(skc28,skc29) | ss^sk^c0(0).
% 618995 [] barrel(skc28,skc27) | ss^sk^c0(0).
% 618996 [] down(skc28,skc26) | ss^sk^c0(0).
% 619005 [] -ss^sk^c0(0) | city(skc22).
% 619006 [] -ss^sk^c0(0) | way(skc20).
% 619007 [] -ss^sk^c0(0) | lonely(skc20).
% 619008 [] -ss^sk^c0(0) | dirty(skc19).
% 619009 [] -ss^sk^c0(0) | white(skc19).
% 619010 [] -ss^sk^c0(0) | car(skc19).
% 619011 [] -ss^sk^c0(0) | chevy(skc19).
% 619018 [] ss^sk^c0(0) | hollywood(skc29).
% 619019 [] dirty(skc27) | ss^sk^c0(0).
% 619020 [] white(skc27) | ss^sk^c0(0).
% 619021 [] car(skc27) | ss^sk^c0(0).
% 619022 [] chevy(skc27) | ss^sk^c0(0).
% 619023 [] way(skc26) | ss^sk^c0(0).
% 619024 [] lonely(skc26) | ss^sk^c0(0).
% 631880 [hyper:618977,618996,618994,618995,619018,cut:618924,cut:618922,binarycut:619023,binarycut:619024,cut:618921,cut:618923,binarycut:619019,binarycut:619020,binarycut:619021,binarycut:619022] ss^sk^c0(0).
% 631909 [hyper:618989,631880] in(skc21,skc22).
% 631910 [hyper:618990,631880] down(skc21,skc20).
% 631911 [hyper:618991,631880] barrel(skc21,skc19).
% 631920 [hyper:619005,631880] city(skc22).
% 631921 [hyper:619006,631880] way(skc20).
% 631922 [hyper:619007,631880] lonely(skc20).
% 631923 [hyper:619008,631880] dirty(skc19).
% 631924 [hyper:619009,631880] white(skc19).
% 631925 [hyper:619010,631880] car(skc19).
% 631926 [hyper:619011,631880] chevy(skc19).
% 632017 [hyper:618977,631911,631909,631910,cut:631923,cut:631924,cut:631925,cut:631926,cut:618931,cut:618929,cut:618928,cut:631920,cut:631921,cut:631922,cut:618930] 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:
% -chevy(X) | -car(X) | -white(X) | -dirty(X) | -old(X) | -lonely(Y) | -way(Y) | -street(Y) | -event(Z) | -barrel(Z,X) | -down(Z,Y) | -in(Z,U) | -city(U) | -hollywood(U) | -seat(V) | -furniture(V) | -front(V) | -in(W,V) | -fellow(W) | -man(W) | -young(W) | -in(X1,X2) | -front(X2) | -furniture(X2) | -seat(X2) | -young(X1) | -man(X1) | -fellow(X1) | ss^sk^c0(0) | equal(X1,W).
% Split part used next: ss^sk^c0(0).
% END OF PROOFPART
% Orig sos clause for pseudosplit:
% -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) | -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) | -lonely(X) | -way(X) | -street(X) | -down(Z,X).
% $spltprd1($spltcnst297,Z) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(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:
% -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) | -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) | -lonely(X) | -way(X) | -street(X) | -down(Z,X).
% $spltprd1($spltcnst303,Z) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(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:
% -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) | -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) | -lonely(X) | -way(X) | -street(X) | -down(Z,X).
% $spltprd1($spltcnst309,Z) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(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:
% -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) | -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) | -lonely(X) | -way(X) | -street(X) | -down(Z,X).
% $spltprd1($spltcnst315,Z) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(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:
% -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) | -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) | -lonely(X) | -way(X) | -street(X) | -down(Z,X).
% $spltprd1($spltcnst321,Z) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(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:
% -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) | -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) | -lonely(X) | -way(X) | -street(X) | -down(Z,X).
% $spltprd1($spltcnst327,Z) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(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:
% -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) | -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) | -lonely(X) | -way(X) | -street(X) | -down(Z,X).
% $spltprd1($spltcnst333,Z) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(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:
% -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) | -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) | -lonely(X) | -way(X) | -street(X) | -down(Z,X).
% $spltprd1($spltcnst339,Z) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(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:
% -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) | -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) | -lonely(X) | -way(X) | -street(X) | -down(Z,X).
% $spltprd1($spltcnst345,Z) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(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:
% -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) | -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) | -lonely(X) | -way(X) | -street(X) | -down(Z,X).
% $spltprd1($spltcnst351,Z) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(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:
% -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) | -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) | -lonely(X) | -way(X) | -street(X) | -down(Z,X).
% $spltprd1($spltcnst357,Z) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(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:
% -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) | -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) | -lonely(X) | -way(X) | -street(X) | -down(Z,X).
% $spltprd1($spltcnst363,Z) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(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:
% -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) | -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) | -lonely(X) | -way(X) | -street(X) | -down(Z,X).
% $spltprd1($spltcnst369,Z) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(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:
% -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) | -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) | -lonely(X) | -way(X) | -street(X) | -down(Z,X).
% $spltprd1($spltcnst375,Z) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(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:
% -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) | -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) | -lonely(X) | -way(X) | -street(X) | -down(Z,X).
% $spltprd1($spltcnst381,Z) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(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:
% -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) | -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) | -lonely(X) | -way(X) | -street(X) | -down(Z,X).
% $spltprd1($spltcnst387,Z) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(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: 63922
% derived clauses: 1585753
% kept clauses: 114452
% kept size sum: 587197
% kept mid-nuclei: 484342
% kept new demods: 2
% forw unit-subs: 118592
% forw double-subs: 121152
% forw overdouble-subs: 607096
% backward subs: 41178
% fast unit cutoff: 464651
% full unit cutoff: 0
% dbl unit cutoff: 44219
% real runtime : 538.5
% process. runtime: 533.92
% specific non-discr-tree subsumption statistics:
% tried: 245900688
% length fails: 1467662
% strength fails: 134899870
% predlist fails: 47805950
% aux str. fails: 2209853
% by-lit fails: 25120588
% full subs tried: 29742531
% full subs fail: 29344459
%
% ; 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/NLP005-1+eq_r.in")
%
%------------------------------------------------------------------------------