TSTP Solution File: NLP006-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NLP006-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 : art05.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.3s
% Output : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/NLP/NLP006-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 1 59)
% (binary-unit 9 #f 1 59)
% (binary-double 9 #f 1 59)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 1 59)
% (binary-order 25 #f 1 59)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% SOS clause
% -lonely(X) | -way(X) | -street(X) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(Y) | -down(Z,X) | -barrel(Z,Y) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -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).
% -lonely(X) | -way(X) | -street(X) | -down(Z,X) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(Y) | -event(Z) | -in(Z,U) | -hollywood(U) | -city(U).
% -ss^sk^c0(0).
%
% Starting a split proof attempt with 3 components.
%
% Split component 1 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -lonely(X) | -way(X) | -street(X) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(Y) | -down(Z,X) | -barrel(Z,Y) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -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,0,128,0,0,80048,5,1201,80049,1,1201,80049,50,1201,80049,40,1201,80119,0,1201,85075,3,1402,86311,4,1502,87218,1,1602,87218,50,1602,87218,40,1602,87288,0,1602,90273,3,1804,90679,4,1903,91208,5,2003,91208,1,2003,91208,50,2003,91208,40,2003,91278,0,2003,95252,3,2364,95911,4,2529,96798,5,2705,96799,1,2705,96799,50,2705,96799,40,2705,96869,0,2705,100565,3,3064,101441,4,3231,102262,5,3406,102262,1,3406,102262,50,3406,102262,40,3406,102332,0,3406,104458,3,4881,109937,4,5208,113527,5,5807,113527,1,5807,113527,50,5807,113527,40,5807,113597,0,5807,113781,3,6753,113781,4,6753,118558,1,7008,118558,50,7008,118558,40,7008,118628,0,7008,124050,50,7218,124050,40,7218,124120,0,7218,129587,50,7392,129587,40,7392,129657,0,7392,135528,3,7593,135840,50,7616,135840,40,7616,135910,0,7616,138031,3,9092,143403,4,9417,147244,1,10017,147244,50,10017,147244,40,10017,147314,0,10017,156287,3,10618,158142,4,10918,159971,1,11218,159971,50,11218,159971,40,11218,160041,0,11218,162019,3,12585,162170,50,12606,162170,40,12606,162240,0,12606,163856,3,13963,170537,4,14407,174313,5,15007,174313,1,15007,174313,50,15007,174313,40,15007,174383,0,15007,296627,5,16508,296628,1,16508,296628,50,16508,296628,40,16508,296698,0,16508,306553,3,19943,316014,4,21384,323524,1,23009,323524,50,23009,323524,40,23009,323524,40,23009,323644,0,23009)
%
%
% START OF PROOF
% 323530 [] front(skc25).
% 323531 [] seat(skc24).
% 323532 [] fellow(skc23).
% 323533 [] young(skc22).
% 323538 [] seat(skc17).
% 323539 [] young(skc16).
% 323540 [] fellow(skc15).
% 323582 [] -in(Z,U) | -in(X,Y) | equal(Z,X) | -man(Z) | -man(X) | -furniture(U) | -furniture(Y) | -young(Z) | -young(X) | -fellow(Z) | -fellow(X) | -seat(U) | -seat(Y) | -front(U) | -front(Y).
% 323590 [] -equal(skc16,skc15) | -ss^sk^c0(0).
% 323591 [] -equal(skc23,skc22) | ss^sk^c0(0).
% 323592 [] in(skc16,skc17) | -ss^sk^c0(0).
% 323593 [] in(skc15,skc17) | -ss^sk^c0(0).
% 323597 [] in(skc23,skc24) | ss^sk^c0(0).
% 323598 [] in(skc22,skc25) | ss^sk^c0(0).
% 323602 [] -ss^sk^c0(0) | furniture(skc17).
% 323603 [] -ss^sk^c0(0) | front(skc17).
% 323604 [] -ss^sk^c0(0) | man(skc16).
% 323605 [] -ss^sk^c0(0) | fellow(skc16).
% 323606 [] -ss^sk^c0(0) | man(skc15).
% 323607 [] -ss^sk^c0(0) | young(skc15).
% 323615 [] man(skc23) | ss^sk^c0(0).
% 323616 [] ss^sk^c0(0) | young(skc23).
% 323617 [] furniture(skc24) | ss^sk^c0(0).
% 323618 [] ss^sk^c0(0) | front(skc24).
% 323619 [] man(skc22) | ss^sk^c0(0).
% 323620 [] ss^sk^c0(0) | fellow(skc22).
% 323621 [] furniture(skc25) | ss^sk^c0(0).
% 323622 [] ss^sk^c0(0) | seat(skc25).
% 323775 [hyper:323602,323616] furniture(skc17) | young(skc23).
% 323777 [hyper:323604,323616] man(skc16) | young(skc23).
% 323778 [hyper:323605,323616] young(skc23) | fellow(skc16).
% 323779 [hyper:323606,323616] man(skc15) | young(skc23).
% 323780 [hyper:323607,323616] young(skc23) | young(skc15).
% 323833 [hyper:323606,323618] man(skc15) | front(skc24).
% 323834 [hyper:323607,323618] young(skc15) | front(skc24).
% 323889 [hyper:323602,323620] furniture(skc17) | fellow(skc22).
% 323891 [hyper:323604,323620] man(skc16) | fellow(skc22).
% 323892 [hyper:323605,323620] fellow(skc22) | fellow(skc16).
% 323943 [hyper:323602,323622] furniture(skc17) | seat(skc25).
% 323945 [hyper:323604,323622] man(skc16) | seat(skc25).
% 323946 [hyper:323605,323622] fellow(skc16) | seat(skc25).
% 323947 [hyper:323606,323622] man(skc15) | seat(skc25).
% 323948 [hyper:323607,323622] young(skc15) | seat(skc25).
% 340930 [hyper:323582,323598,323597,323948,323834,323620,cut:323533,cut:323530,binarycut:323619,binarycut:323621,cut:323532,cut:323531,binarycut:323615,binarycut:323617,binarycut:323780,binarycut:323591,binarycut:323607] young(skc15).
% 341105 [hyper:323582,323598,323597,323947,323833,323779,323620,cut:323533,cut:323530,binarycut:323619,binarycut:323621,cut:323532,cut:323531,binarycut:323615,binarycut:323617,binarycut:323591,binarycut:323606] man(skc15).
% 341107 [hyper:323582,323598,323597,323946,323618,cut:323533,cut:323530,binarycut:323619,binarycut:323621,cut:323532,cut:323531,binarycut:323615,binarycut:323617,binarycut:323778,binarycut:323892,binarycut:323591,binarycut:323605] fellow(skc16).
% 341257 [hyper:323582,323598,323597,323945,323777,323891,323618,cut:323533,cut:323530,binarycut:323619,binarycut:323621,cut:323532,cut:323531,binarycut:323615,binarycut:323617,binarycut:323591,binarycut:323604] man(skc16).
% 341388 [hyper:323582,323598,323597,323943,323775,323889,323618,cut:323533,cut:323530,binarycut:323619,binarycut:323621,cut:323532,cut:323531,binarycut:323615,binarycut:323617,binarycut:323591,binarycut:323602] furniture(skc17).
% 341500 [hyper:323582,323598,323597,323622,323616,323620,323618,cut:323533,cut:323530,binarycut:323619,binarycut:323621,cut:323532,cut:323531,binarycut:323615,binarycut:323617,binarycut:323591] ss^sk^c0(0).
% 341610 [hyper:323592,341500] in(skc16,skc17).
% 341611 [hyper:323593,341500] in(skc15,skc17).
% 341615 [hyper:323603,341500] front(skc17).
% 341660 [hyper:323582,341611,341610,cut:341105,cut:341388,cut:340930,cut:323540,cut:323538,cut:341615,cut:341257,cut:341388,cut:323539,cut:341107,cut:323538,cut:341615] equal(skc16,skc15).
% 341674 [hyper:323590,341660,cut:341500] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 59
% clause depth limited to 1
% seconds given: 8
%
%
% Split component 2 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -lonely(X) | -way(X) | -street(X) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(Y) | -down(Z,X) | -barrel(Z,Y) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -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: -lonely(X) | -way(X) | -street(X) | -down(Z,X) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(Y) | -event(Z) | -in(Z,U) | -hollywood(U) | -city(U).
% END OF PROOFPART
% Orig sos clause for pseudosplit:
% -lonely(X) | -way(X) | -street(X) | -down(Z,X) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(Y) | -event(Z) | -in(Z,U) | -hollywood(U) | -city(U).
% Pseudo-split-input-clause results in:
% -$spltprd1($spltcnst287,Z) | -$spltprd1($spltcnst286,Z) | -$spltprd1($spltcnst285,Z) | -$spltprd1($spltcnst284,Z).
% $spltprd1($spltcnst287,Z) | -event(Z).
% $spltprd1($spltcnst286,Z) | -lonely(X) | -way(X) | -street(X) | -down(Z,X).
% $spltprd1($spltcnst285,Z) | -barrel(Z,Y) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(Y).
% $spltprd1($spltcnst284,Z) | -in(Z,U) | -hollywood(U) | -city(U).
%
% Orig sos clause for pseudosplit:
% -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,0,128,0,0,80048,5,1201,80049,1,1201,80049,50,1201,80049,40,1201,80119,0,1201,85075,3,1402,86311,4,1502,87218,1,1602,87218,50,1602,87218,40,1602,87288,0,1602,90273,3,1804,90679,4,1903,91208,5,2003,91208,1,2003,91208,50,2003,91208,40,2003,91278,0,2003,95252,3,2364,95911,4,2529,96798,5,2705,96799,1,2705,96799,50,2705,96799,40,2705,96869,0,2705,100565,3,3064,101441,4,3231,102262,5,3406,102262,1,3406,102262,50,3406,102262,40,3406,102332,0,3406,104458,3,4881,109937,4,5208,113527,5,5807,113527,1,5807,113527,50,5807,113527,40,5807,113597,0,5807,113781,3,6753,113781,4,6753,118558,1,7008,118558,50,7008,118558,40,7008,118628,0,7008,124050,50,7218,124050,40,7218,124120,0,7218,129587,50,7392,129587,40,7392,129657,0,7392,135528,3,7593,135840,50,7616,135840,40,7616,135910,0,7616,138031,3,9092,143403,4,9417,147244,1,10017,147244,50,10017,147244,40,10017,147314,0,10017,156287,3,10618,158142,4,10918,159971,1,11218,159971,50,11218,159971,40,11218,160041,0,11218,162019,3,12585,162170,50,12606,162170,40,12606,162240,0,12606,163856,3,13963,170537,4,14407,174313,5,15007,174313,1,15007,174313,50,15007,174313,40,15007,174383,0,15007,296627,5,16508,296628,1,16508,296628,50,16508,296628,40,16508,296698,0,16508,306553,3,19943,316014,4,21384,323524,1,23009,323524,50,23009,323524,40,23009,323524,40,23009,323644,0,23009,341673,50,23096,341673,30,23096,341673,40,23096,341793,0,23096)
%
%
% START OF PROOF
% 341675 [] city(skc29).
% 341676 [] event(skc28).
% 341677 [] old(skc27).
% 341678 [] street(skc26).
% 341683 [] city(skc21).
% 341684 [] event(skc20).
% 341685 [] old(skc19).
% 341686 [] street(skc18).
% 341731 [] -in(X,Y) | -barrel(X,Z) | -down(X,U) | -hollywood(Y) | -dirty(Z) | -white(Z) | -car(Z) | -chevy(Z) | -way(U) | -lonely(U) | -street(U) | -old(Z) | -event(X) | -city(Y).
% 341743 [] in(skc20,skc21) | -ss^sk^c0(0).
% 341744 [] barrel(skc20,skc19) | -ss^sk^c0(0).
% 341745 [] down(skc20,skc18) | -ss^sk^c0(0).
% 341748 [] in(skc28,skc29) | ss^sk^c0(0).
% 341749 [] barrel(skc28,skc27) | ss^sk^c0(0).
% 341750 [] down(skc28,skc26) | ss^sk^c0(0).
% 341757 [] -ss^sk^c0(0) | hollywood(skc21).
% 341758 [] -ss^sk^c0(0) | dirty(skc19).
% 341759 [] -ss^sk^c0(0) | white(skc19).
% 341760 [] -ss^sk^c0(0) | car(skc19).
% 341761 [] -ss^sk^c0(0) | chevy(skc19).
% 341762 [] -ss^sk^c0(0) | way(skc18).
% 341763 [] -ss^sk^c0(0) | lonely(skc18).
% 341772 [] hollywood(skc29) | ss^sk^c0(0).
% 341773 [] dirty(skc27) | ss^sk^c0(0).
% 341774 [] white(skc27) | ss^sk^c0(0).
% 341775 [] car(skc27) | ss^sk^c0(0).
% 341776 [] chevy(skc27) | ss^sk^c0(0).
% 341777 [] way(skc26) | ss^sk^c0(0).
% 341778 [] lonely(skc26) | ss^sk^c0(0).
% 367445 [hyper:341731,341750,341748,341749,cut:341678,cut:341676,binarycut:341777,binarycut:341778,cut:341675,binarycut:341772,cut:341677,binarycut:341773,binarycut:341774,binarycut:341775,binarycut:341776] ss^sk^c0(0).
% 367469 [hyper:341743,367445] in(skc20,skc21).
% 367470 [hyper:341744,367445] barrel(skc20,skc19).
% 367471 [hyper:341745,367445] down(skc20,skc18).
% 367478 [hyper:341757,367445] hollywood(skc21).
% 367479 [hyper:341758,367445] dirty(skc19).
% 367480 [hyper:341759,367445] white(skc19).
% 367481 [hyper:341760,367445] car(skc19).
% 367482 [hyper:341761,367445] chevy(skc19).
% 367483 [hyper:341762,367445] way(skc18).
% 367484 [hyper:341763,367445] lonely(skc18).
% 367540 [hyper:341731,367471,367469,367470,cut:367483,cut:367484,cut:341686,cut:341684,cut:367478,cut:341683,cut:367479,cut:367480,cut:367481,cut:367482,cut:341685] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 59
% clause depth limited to 1
% seconds given: 8
%
%
% Split component 3 started.
%
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split:
% -lonely(X) | -way(X) | -street(X) | -chevy(Y) | -car(Y) | -white(Y) | -dirty(Y) | -old(Y) | -down(Z,X) | -barrel(Z,Y) | -event(Z) | -hollywood(U) | -city(U) | -in(Z,U) | -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
%
% 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($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
%
% 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
%
% old unit clauses discarded
%
% Split attempt finished with FAILURE.
%
% time limit exhausted: proof search terminated.
%
% Global statistics over all passes:
%
% given clauses: 63906
% derived clauses: 1678285
% kept clauses: 115856
% kept size sum: 0
% kept mid-nuclei: 229551
% kept new demods: 2
% forw unit-subs: 153942
% forw double-subs: 275892
% forw overdouble-subs: 686687
% backward subs: 41412
% fast unit cutoff: 475367
% full unit cutoff: 0
% dbl unit cutoff: 37811
% real runtime : 534.35
% process. runtime: 532.10
% specific non-discr-tree subsumption statistics:
% tried: 239524129
% length fails: 1288956
% strength fails: 123374759
% predlist fails: 48226574
% aux str. fails: 1956223
% by-lit fails: 28453131
% full subs tried: 31296693
% full subs fail: 30864780
%
% ; 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/NLP006-1+eq_r.in")
%
%------------------------------------------------------------------------------