TSTP Solution File: NLP013-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NLP013-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 : art01.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.8s
% 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/NLP013-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
% -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) | -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).
% -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -barrel(Z,X) | -down(Z,Y) | -street(Y) | -way(Y) | -lonely(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:
% -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) | -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,180972,4,1042,181962,5,1201,181962,1,1201,181962,50,1201,181962,40,1201,182032,0,1201,187379,3,1402,188519,4,1502,189376,5,1602,189377,1,1602,189377,50,1602,189377,40,1602,189447,0,1602,192392,3,1803,192804,4,1903,193424,5,2003,193424,1,2003,193424,50,2003,193424,40,2003,193494,0,2003,197482,3,2359,198257,4,2529,199072,5,2704,199072,1,2704,199072,50,2704,199072,40,2704,199142,0,2704,203053,3,3063,203745,4,3230,204684,5,3406,204684,1,3406,204684,50,3406,204684,40,3406,204754,0,3406,207196,3,4697,214286,4,5207,217649,5,5808,217649,1,5808,217649,50,5808,217649,40,5808,217719,0,5808,217897,3,6699,218653,4,6709,223593,5,7009,223594,1,7009,223594,50,7009,223594,40,7009,223664,0,7009,226761,50,7078,226761,40,7078,226831,0,7078,229928,50,7146,229928,40,7146,229998,0,7146,233249,50,7226,233249,40,7226,233319,0,7226,236021,3,8564,242822,4,9027,246763,5,9627,246763,1,9627,246763,50,9627,246763,40,9627,246833,0,9627,256394,3,10228,258063,4,10528,259560,5,10828,259561,5,10828,259562,1,10828,259562,50,10828,259562,40,10828,259632,0,10828,261291,3,12189,261522,50,12208,261522,40,12208,261592,0,12208,263731,3,13414,271642,4,14009,275318,5,14611,275318,1,14611,275318,50,14611,275318,40,14611,275388,0,14611,533816,4,16027,534618,5,16116,534624,1,16119,534624,50,16119,534624,40,16119,534694,0,16119,541826,3,19441,553526,4,20995,560678,5,22620,560678,1,22620,560678,50,22620,560678,40,22620,560678,40,22620,560798,0,22620)
%
%
% START OF PROOF
% 560684 [] seat(skc25).
% 560685 [] young(skc24).
% 560686 [] fellow(skc23).
% 560691 [] seat(skc18).
% 560692 [] front(skc17).
% 560693 [] fellow(skc16).
% 560694 [] young(skc15).
% 560736 [] -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).
% 560744 [] -equal(skc16,skc15) | -ss^sk^c0(0).
% 560745 [] -equal(skc24,skc23) | ss^sk^c0(0).
% 560746 [] in(skc16,skc17) | -ss^sk^c0(0).
% 560747 [] in(skc15,skc18) | -ss^sk^c0(0).
% 560751 [] in(skc24,skc25) | ss^sk^c0(0).
% 560752 [] in(skc23,skc25) | ss^sk^c0(0).
% 560756 [] -ss^sk^c0(0) | furniture(skc17).
% 560757 [] -ss^sk^c0(0) | seat(skc17).
% 560758 [] -ss^sk^c0(0) | man(skc16).
% 560759 [] -ss^sk^c0(0) | young(skc16).
% 560760 [] -ss^sk^c0(0) | furniture(skc18).
% 560761 [] -ss^sk^c0(0) | front(skc18).
% 560762 [] -ss^sk^c0(0) | man(skc15).
% 560763 [] -ss^sk^c0(0) | fellow(skc15).
% 560771 [] furniture(skc25) | ss^sk^c0(0).
% 560772 [] ss^sk^c0(0) | front(skc25).
% 560773 [] man(skc24) | ss^sk^c0(0).
% 560774 [] ss^sk^c0(0) | fellow(skc24).
% 560775 [] man(skc23) | ss^sk^c0(0).
% 560776 [] ss^sk^c0(0) | young(skc23).
% 560910 [hyper:560756,560772] furniture(skc17) | front(skc25).
% 560912 [hyper:560758,560772] man(skc16) | front(skc25).
% 560914 [hyper:560760,560772] furniture(skc18) | front(skc25).
% 560915 [hyper:560761,560772] front(skc25) | front(skc18).
% 560916 [hyper:560762,560772] man(skc15) | front(skc25).
% 560972 [hyper:560762,560774] man(skc15) | fellow(skc24).
% 561022 [hyper:560756,560776] furniture(skc17) | young(skc23).
% 561024 [hyper:560758,560776] man(skc16) | young(skc23).
% 561026 [hyper:560760,560776] furniture(skc18) | young(skc23).
% 561027 [hyper:560761,560776] front(skc18) | young(skc23).
% 561028 [hyper:560762,560776] man(skc15) | young(skc23).
% 611101 [hyper:560736,560752,560751,561028,560972,560916,560772,cut:560686,cut:560684,binarycut:560771,binarycut:560775,cut:560685,cut:560684,binarycut:560771,binarycut:560773,binarycut:560745,binarycut:560762] man(skc15).
% 611103 [hyper:560736,560752,560751,561027,560774,cut:560686,cut:560684,binarycut:560771,binarycut:560775,cut:560685,cut:560684,binarycut:560771,binarycut:560773,binarycut:560915,binarycut:560915,binarycut:560745,binarycut:560761] front(skc18).
% 611125 [hyper:560736,560752,560751,561026,560914,560914,560774,cut:560686,cut:560684,binarycut:560771,binarycut:560775,cut:560685,cut:560684,binarycut:560771,binarycut:560773,binarycut:560745,binarycut:560760] furniture(skc18).
% 611142 [hyper:560736,560752,560751,561024,560912,560912,560774,cut:560686,cut:560684,binarycut:560771,binarycut:560775,cut:560685,cut:560684,binarycut:560771,binarycut:560773,binarycut:560745,binarycut:560758] man(skc16).
% 611154 [hyper:560736,560752,560751,561022,560910,560910,560774,cut:560686,cut:560684,binarycut:560771,binarycut:560775,cut:560685,cut:560684,binarycut:560771,binarycut:560773,binarycut:560745,binarycut:560756] furniture(skc17).
% 611161 [hyper:560736,560752,560751,560776,560772,560772,560774,cut:560686,cut:560684,binarycut:560771,binarycut:560775,cut:560685,cut:560684,binarycut:560771,binarycut:560773,binarycut:560745] ss^sk^c0(0).
% 613055 [hyper:560746,611161] in(skc16,skc17).
% 613056 [hyper:560747,611161] in(skc15,skc18).
% 613060 [hyper:560757,611161] seat(skc17).
% 613061 [hyper:560759,611161] young(skc16).
% 613062 [hyper:560763,611161] fellow(skc15).
% 613336 [hyper:560736,613056,613055,cut:611125,cut:611101,cut:611103,cut:613062,cut:560694,cut:560691,cut:611154,cut:611142,cut:560692,cut:560693,cut:613061,cut:613060] equal(skc16,skc15).
% 621435 [hyper:560744,613336,cut:611161] 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:
% -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) | -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: -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -barrel(Z,X) | -down(Z,Y) | -street(Y) | -way(Y) | -lonely(Y) | -event(Z) | -in(Z,U) | -hollywood(U) | -city(U).
% END OF PROOFPART
% Orig sos clause for pseudosplit:
% -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -barrel(Z,X) | -down(Z,Y) | -street(Y) | -way(Y) | -lonely(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) | -old(X) | -dirty(X) | -white(X) | -car(X) | -chevy(X) | -barrel(Z,X).
% $spltprd1($spltcnst285,Z) | -down(Z,Y) | -street(Y) | -way(Y) | -lonely(Y).
% $spltprd1($spltcnst284,Z) | -in(Z,U) | -hollywood(U) | -city(U).
%
% Orig sos clause for pseudosplit:
% -street(X) | -way(X) | -lonely(X) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y) | -event(Z) | -barrel(Z,Y) | -down(Z,X) | -in(Z,U) | -city(U) | -hollywood(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) | -street(X) | -way(X) | -lonely(X) | -down(Z,X).
% $spltprd1($spltcnst291,Z) | -barrel(Z,Y) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y).
% $spltprd1($spltcnst290,Z) | -in(Z,U) | -city(U) | -hollywood(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,180972,4,1042,181962,5,1201,181962,1,1201,181962,50,1201,181962,40,1201,182032,0,1201,187379,3,1402,188519,4,1502,189376,5,1602,189377,1,1602,189377,50,1602,189377,40,1602,189447,0,1602,192392,3,1803,192804,4,1903,193424,5,2003,193424,1,2003,193424,50,2003,193424,40,2003,193494,0,2003,197482,3,2359,198257,4,2529,199072,5,2704,199072,1,2704,199072,50,2704,199072,40,2704,199142,0,2704,203053,3,3063,203745,4,3230,204684,5,3406,204684,1,3406,204684,50,3406,204684,40,3406,204754,0,3406,207196,3,4697,214286,4,5207,217649,5,5808,217649,1,5808,217649,50,5808,217649,40,5808,217719,0,5808,217897,3,6699,218653,4,6709,223593,5,7009,223594,1,7009,223594,50,7009,223594,40,7009,223664,0,7009,226761,50,7078,226761,40,7078,226831,0,7078,229928,50,7146,229928,40,7146,229998,0,7146,233249,50,7226,233249,40,7226,233319,0,7226,236021,3,8564,242822,4,9027,246763,5,9627,246763,1,9627,246763,50,9627,246763,40,9627,246833,0,9627,256394,3,10228,258063,4,10528,259560,5,10828,259561,5,10828,259562,1,10828,259562,50,10828,259562,40,10828,259632,0,10828,261291,3,12189,261522,50,12208,261522,40,12208,261592,0,12208,263731,3,13414,271642,4,14009,275318,5,14611,275318,1,14611,275318,50,14611,275318,40,14611,275388,0,14611,533816,4,16027,534618,5,16116,534624,1,16119,534624,50,16119,534624,40,16119,534694,0,16119,541826,3,19441,553526,4,20995,560678,5,22620,560678,1,22620,560678,50,22620,560678,40,22620,560678,40,22620,560798,0,22620,621434,50,23146,621434,30,23146,621434,40,23146,621554,0,23146)
%
%
% START OF PROOF
% 621436 [] hollywood(skc29).
% 621437 [] event(skc28).
% 621438 [] chevy(skc27).
% 621439 [] lonely(skc26).
% 621443 [] city(skc22).
% 621444 [] event(skc21).
% 621445 [] lonely(skc20).
% 621446 [] chevy(skc19).
% 621492 [] -in(X,Y) | -down(X,Z) | -barrel(X,U) | -car(U) | -white(U) | -dirty(U) | -old(U) | -way(Z) | -street(Z) | -city(Y) | -lonely(Z) | -chevy(U) | -event(X) | -hollywood(Y).
% 621504 [] in(skc21,skc22) | -ss^sk^c0(0).
% 621505 [] barrel(skc21,skc19) | -ss^sk^c0(0).
% 621506 [] down(skc21,skc20) | -ss^sk^c0(0).
% 621509 [] in(skc28,skc29) | ss^sk^c0(0).
% 621510 [] down(skc28,skc26) | ss^sk^c0(0).
% 621511 [] barrel(skc28,skc27) | ss^sk^c0(0).
% 621520 [] -ss^sk^c0(0) | hollywood(skc22).
% 621521 [] -ss^sk^c0(0) | way(skc20).
% 621522 [] -ss^sk^c0(0) | street(skc20).
% 621523 [] -ss^sk^c0(0) | car(skc19).
% 621524 [] -ss^sk^c0(0) | white(skc19).
% 621525 [] -ss^sk^c0(0) | dirty(skc19).
% 621526 [] -ss^sk^c0(0) | old(skc19).
% 621533 [] ss^sk^c0(0) | city(skc29).
% 621534 [] car(skc27) | ss^sk^c0(0).
% 621535 [] white(skc27) | ss^sk^c0(0).
% 621536 [] dirty(skc27) | ss^sk^c0(0).
% 621537 [] old(skc27) | ss^sk^c0(0).
% 621538 [] way(skc26) | ss^sk^c0(0).
% 621539 [] street(skc26) | ss^sk^c0(0).
% 633859 [hyper:621492,621511,621509,621510,621533,cut:621438,cut:621437,binarycut:621534,binarycut:621535,binarycut:621536,binarycut:621537,cut:621436,cut:621439,binarycut:621538,binarycut:621539] ss^sk^c0(0).
% 633888 [hyper:621504,633859] in(skc21,skc22).
% 633889 [hyper:621505,633859] barrel(skc21,skc19).
% 633890 [hyper:621506,633859] down(skc21,skc20).
% 633899 [hyper:621520,633859] hollywood(skc22).
% 633900 [hyper:621521,633859] way(skc20).
% 633901 [hyper:621522,633859] street(skc20).
% 633902 [hyper:621523,633859] car(skc19).
% 633903 [hyper:621524,633859] white(skc19).
% 633904 [hyper:621525,633859] dirty(skc19).
% 633905 [hyper:621526,633859] old(skc19).
% 633998 [hyper:621492,633890,633888,633889,cut:633900,cut:633901,cut:621445,cut:621444,cut:621443,cut:633899,cut:633902,cut:633903,cut:633904,cut:633905,cut:621446] 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:
% -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) | -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:
% -street(X) | -way(X) | -lonely(X) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y) | -event(Z) | -barrel(Z,Y) | -down(Z,X) | -in(Z,U) | -city(U) | -hollywood(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) | -street(X) | -way(X) | -lonely(X) | -down(Z,X).
% $spltprd1($spltcnst297,Z) | -barrel(Z,Y) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y).
% $spltprd1($spltcnst296,Z) | -in(Z,U) | -city(U) | -hollywood(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:
% -street(X) | -way(X) | -lonely(X) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y) | -event(Z) | -barrel(Z,Y) | -down(Z,X) | -in(Z,U) | -city(U) | -hollywood(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) | -street(X) | -way(X) | -lonely(X) | -down(Z,X).
% $spltprd1($spltcnst303,Z) | -barrel(Z,Y) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y).
% $spltprd1($spltcnst302,Z) | -in(Z,U) | -city(U) | -hollywood(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:
% -street(X) | -way(X) | -lonely(X) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y) | -event(Z) | -barrel(Z,Y) | -down(Z,X) | -in(Z,U) | -city(U) | -hollywood(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) | -street(X) | -way(X) | -lonely(X) | -down(Z,X).
% $spltprd1($spltcnst309,Z) | -barrel(Z,Y) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y).
% $spltprd1($spltcnst308,Z) | -in(Z,U) | -city(U) | -hollywood(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:
% -street(X) | -way(X) | -lonely(X) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y) | -event(Z) | -barrel(Z,Y) | -down(Z,X) | -in(Z,U) | -city(U) | -hollywood(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) | -street(X) | -way(X) | -lonely(X) | -down(Z,X).
% $spltprd1($spltcnst315,Z) | -barrel(Z,Y) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y).
% $spltprd1($spltcnst314,Z) | -in(Z,U) | -city(U) | -hollywood(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:
% -street(X) | -way(X) | -lonely(X) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y) | -event(Z) | -barrel(Z,Y) | -down(Z,X) | -in(Z,U) | -city(U) | -hollywood(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) | -street(X) | -way(X) | -lonely(X) | -down(Z,X).
% $spltprd1($spltcnst321,Z) | -barrel(Z,Y) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y).
% $spltprd1($spltcnst320,Z) | -in(Z,U) | -city(U) | -hollywood(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:
% -street(X) | -way(X) | -lonely(X) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y) | -event(Z) | -barrel(Z,Y) | -down(Z,X) | -in(Z,U) | -city(U) | -hollywood(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) | -street(X) | -way(X) | -lonely(X) | -down(Z,X).
% $spltprd1($spltcnst327,Z) | -barrel(Z,Y) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y).
% $spltprd1($spltcnst326,Z) | -in(Z,U) | -city(U) | -hollywood(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:
% -street(X) | -way(X) | -lonely(X) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y) | -event(Z) | -barrel(Z,Y) | -down(Z,X) | -in(Z,U) | -city(U) | -hollywood(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) | -street(X) | -way(X) | -lonely(X) | -down(Z,X).
% $spltprd1($spltcnst333,Z) | -barrel(Z,Y) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y).
% $spltprd1($spltcnst332,Z) | -in(Z,U) | -city(U) | -hollywood(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:
% -street(X) | -way(X) | -lonely(X) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y) | -event(Z) | -barrel(Z,Y) | -down(Z,X) | -in(Z,U) | -city(U) | -hollywood(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) | -street(X) | -way(X) | -lonely(X) | -down(Z,X).
% $spltprd1($spltcnst339,Z) | -barrel(Z,Y) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y).
% $spltprd1($spltcnst338,Z) | -in(Z,U) | -city(U) | -hollywood(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:
% -street(X) | -way(X) | -lonely(X) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y) | -event(Z) | -barrel(Z,Y) | -down(Z,X) | -in(Z,U) | -city(U) | -hollywood(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) | -street(X) | -way(X) | -lonely(X) | -down(Z,X).
% $spltprd1($spltcnst345,Z) | -barrel(Z,Y) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y).
% $spltprd1($spltcnst344,Z) | -in(Z,U) | -city(U) | -hollywood(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:
% -street(X) | -way(X) | -lonely(X) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y) | -event(Z) | -barrel(Z,Y) | -down(Z,X) | -in(Z,U) | -city(U) | -hollywood(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) | -street(X) | -way(X) | -lonely(X) | -down(Z,X).
% $spltprd1($spltcnst351,Z) | -barrel(Z,Y) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y).
% $spltprd1($spltcnst350,Z) | -in(Z,U) | -city(U) | -hollywood(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:
% -street(X) | -way(X) | -lonely(X) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y) | -event(Z) | -barrel(Z,Y) | -down(Z,X) | -in(Z,U) | -city(U) | -hollywood(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) | -street(X) | -way(X) | -lonely(X) | -down(Z,X).
% $spltprd1($spltcnst357,Z) | -barrel(Z,Y) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y).
% $spltprd1($spltcnst356,Z) | -in(Z,U) | -city(U) | -hollywood(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:
% -street(X) | -way(X) | -lonely(X) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y) | -event(Z) | -barrel(Z,Y) | -down(Z,X) | -in(Z,U) | -city(U) | -hollywood(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) | -street(X) | -way(X) | -lonely(X) | -down(Z,X).
% $spltprd1($spltcnst363,Z) | -barrel(Z,Y) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y).
% $spltprd1($spltcnst362,Z) | -in(Z,U) | -city(U) | -hollywood(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:
% -street(X) | -way(X) | -lonely(X) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y) | -event(Z) | -barrel(Z,Y) | -down(Z,X) | -in(Z,U) | -city(U) | -hollywood(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) | -street(X) | -way(X) | -lonely(X) | -down(Z,X).
% $spltprd1($spltcnst369,Z) | -barrel(Z,Y) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y).
% $spltprd1($spltcnst368,Z) | -in(Z,U) | -city(U) | -hollywood(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:
% -street(X) | -way(X) | -lonely(X) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y) | -event(Z) | -barrel(Z,Y) | -down(Z,X) | -in(Z,U) | -city(U) | -hollywood(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) | -street(X) | -way(X) | -lonely(X) | -down(Z,X).
% $spltprd1($spltcnst375,Z) | -barrel(Z,Y) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y).
% $spltprd1($spltcnst374,Z) | -in(Z,U) | -city(U) | -hollywood(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:
% -street(X) | -way(X) | -lonely(X) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y) | -event(Z) | -barrel(Z,Y) | -down(Z,X) | -in(Z,U) | -city(U) | -hollywood(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) | -street(X) | -way(X) | -lonely(X) | -down(Z,X).
% $spltprd1($spltcnst381,Z) | -barrel(Z,Y) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y).
% $spltprd1($spltcnst380,Z) | -in(Z,U) | -city(U) | -hollywood(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:
% -street(X) | -way(X) | -lonely(X) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y) | -event(Z) | -barrel(Z,Y) | -down(Z,X) | -in(Z,U) | -city(U) | -hollywood(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) | -street(X) | -way(X) | -lonely(X) | -down(Z,X).
% $spltprd1($spltcnst387,Z) | -barrel(Z,Y) | -old(Y) | -dirty(Y) | -white(Y) | -car(Y) | -chevy(Y).
% $spltprd1($spltcnst386,Z) | -in(Z,U) | -city(U) | -hollywood(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: 64477
% derived clauses: 1596430
% kept clauses: 114969
% kept size sum: 587217
% kept mid-nuclei: 486461
% kept new demods: 2
% forw unit-subs: 124312
% forw double-subs: 121168
% forw overdouble-subs: 610856
% backward subs: 41557
% fast unit cutoff: 467754
% full unit cutoff: 0
% dbl unit cutoff: 44198
% real runtime : 534.31
% process. runtime: 532.58
% specific non-discr-tree subsumption statistics:
% tried: 247026511
% length fails: 1460831
% strength fails: 135636495
% predlist fails: 48434668
% aux str. fails: 2224509
% by-lit fails: 25105644
% full subs tried: 29488140
% full subs fail: 29091369
%
% ; 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/NLP013-1+eq_r.in")
%
%------------------------------------------------------------------------------