TSTP Solution File: CSR017+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : CSR017+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Apr 30 20:14:19 EDT 2024
% Result : Theorem 1.27s 0.61s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 28
% Syntax : Number of formulae : 130 ( 26 unt; 0 def)
% Number of atoms : 421 ( 151 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 454 ( 163 ~; 170 |; 95 &)
% ( 25 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 22 ( 20 usr; 12 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-2 aty)
% Number of variables : 131 ( 130 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [Event,Time,Fluent] :
( ( happens(Event,Time)
& terminates(Event,Fluent,Time) )
=> ~ holdsAt(Fluent,plus(Time,n1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f14,axiom,
! [Event,Fluent,Time] :
( terminates(Event,Fluent,Time)
<=> ( ( Event = push
& Fluent = backwards
& ~ happens(pull,Time) )
| ( Event = pull
& Fluent = forwards
& ~ happens(push,Time) )
| ( Event = pull
& Fluent = forwards
& happens(push,Time) )
| ( Event = pull
& Fluent = backwards
& happens(push,Time) )
| ( Event = push
& Fluent = spinning
& ~ happens(pull,Time) )
| ( Event = pull
& Fluent = spinning
& ~ happens(push,Time) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,axiom,
! [Event,Time] :
( happens(Event,Time)
<=> ( ( Event = push
& Time = n0 )
| ( Event = pull
& Time = n1 )
| ( Event = pull
& Time = n2 )
| ( Event = push
& Time = n2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,axiom,
push != pull,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f22,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f24,axiom,
plus(n0,n3) = n3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f27,axiom,
plus(n1,n3) = n4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f32,axiom,
! [X,Y] :
( less_or_equal(X,Y)
<=> ( less(X,Y)
| X = Y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f33,axiom,
~ ? [X] : less(X,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f35,axiom,
! [X] :
( less(X,n2)
<=> less_or_equal(X,n1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f37,axiom,
! [X] :
( less(X,n4)
<=> less_or_equal(X,n3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f43,axiom,
! [X,Y] :
( less(X,Y)
<=> ( ~ less(Y,X)
& Y != X ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f48,conjecture,
~ holdsAt(spinning,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f49,negated_conjecture,
~ ~ holdsAt(spinning,n1),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f91,plain,
! [Event,Time,Fluent] :
( ~ happens(Event,Time)
| ~ terminates(Event,Fluent,Time)
| ~ holdsAt(Fluent,plus(Time,n1)) ),
inference(pre_NNF_transformation,[status(esa)],[f10]) ).
fof(f92,plain,
! [Time,Fluent] :
( ! [Event] :
( ~ happens(Event,Time)
| ~ terminates(Event,Fluent,Time) )
| ~ holdsAt(Fluent,plus(Time,n1)) ),
inference(miniscoping,[status(esa)],[f91]) ).
fof(f93,plain,
! [X0,X1,X2] :
( ~ happens(X0,X1)
| ~ terminates(X0,X2,X1)
| ~ holdsAt(X2,plus(X1,n1)) ),
inference(cnf_transformation,[status(esa)],[f92]) ).
fof(f110,plain,
! [Event,Fluent,Time] :
( pd0_1(Time,Fluent,Event)
<=> ( ( Event = push
& Fluent = backwards
& ~ happens(pull,Time) )
| ( Event = pull
& Fluent = forwards
& ~ happens(push,Time) )
| ( Event = pull
& Fluent = forwards
& happens(push,Time) )
| ( Event = pull
& Fluent = backwards
& happens(push,Time) )
| ( Event = push
& Fluent = spinning
& ~ happens(pull,Time) ) ) ),
introduced(predicate_definition,[f14]) ).
fof(f111,plain,
! [Event,Fluent,Time] :
( terminates(Event,Fluent,Time)
<=> ( pd0_1(Time,Fluent,Event)
| ( Event = pull
& Fluent = spinning
& ~ happens(push,Time) ) ) ),
inference(formula_renaming,[status(thm)],[f14,f110]) ).
fof(f112,plain,
! [Event,Fluent,Time] :
( ( ~ terminates(Event,Fluent,Time)
| pd0_1(Time,Fluent,Event)
| ( Event = pull
& Fluent = spinning
& ~ happens(push,Time) ) )
& ( terminates(Event,Fluent,Time)
| ( ~ pd0_1(Time,Fluent,Event)
& ( Event != pull
| Fluent != spinning
| happens(push,Time) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f111]) ).
fof(f113,plain,
( ! [Event,Fluent,Time] :
( ~ terminates(Event,Fluent,Time)
| pd0_1(Time,Fluent,Event)
| ( Event = pull
& Fluent = spinning
& ~ happens(push,Time) ) )
& ! [Event,Fluent,Time] :
( terminates(Event,Fluent,Time)
| ( ~ pd0_1(Time,Fluent,Event)
& ( Event != pull
| Fluent != spinning
| happens(push,Time) ) ) ) ),
inference(miniscoping,[status(esa)],[f112]) ).
fof(f117,plain,
! [X0,X1,X2] :
( terminates(X0,X1,X2)
| ~ pd0_1(X2,X1,X0) ),
inference(cnf_transformation,[status(esa)],[f113]) ).
fof(f120,plain,
! [Event,Time] :
( pd0_2(Time,Event)
<=> ( ( Event = push
& Time = n0 )
| ( Event = pull
& Time = n1 )
| ( Event = pull
& Time = n2 ) ) ),
introduced(predicate_definition,[f16]) ).
fof(f121,plain,
! [Event,Time] :
( happens(Event,Time)
<=> ( pd0_2(Time,Event)
| ( Event = push
& Time = n2 ) ) ),
inference(formula_renaming,[status(thm)],[f16,f120]) ).
fof(f122,plain,
! [Event,Time] :
( ( ~ happens(Event,Time)
| pd0_2(Time,Event)
| ( Event = push
& Time = n2 ) )
& ( happens(Event,Time)
| ( ~ pd0_2(Time,Event)
& ( Event != push
| Time != n2 ) ) ) ),
inference(NNF_transformation,[status(esa)],[f121]) ).
fof(f123,plain,
( ! [Event,Time] :
( ~ happens(Event,Time)
| pd0_2(Time,Event)
| ( Event = push
& Time = n2 ) )
& ! [Event,Time] :
( happens(Event,Time)
| ( ~ pd0_2(Time,Event)
& ( Event != push
| Time != n2 ) ) ) ),
inference(miniscoping,[status(esa)],[f122]) ).
fof(f125,plain,
! [X0,X1] :
( ~ happens(X0,X1)
| pd0_2(X1,X0)
| X1 = n2 ),
inference(cnf_transformation,[status(esa)],[f123]) ).
fof(f126,plain,
! [X0,X1] :
( happens(X0,X1)
| ~ pd0_2(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f123]) ).
fof(f128,plain,
push != pull,
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f133,plain,
plus(n0,n1) = n1,
inference(cnf_transformation,[status(esa)],[f22]) ).
fof(f135,plain,
plus(n0,n3) = n3,
inference(cnf_transformation,[status(esa)],[f24]) ).
fof(f138,plain,
plus(n1,n3) = n4,
inference(cnf_transformation,[status(esa)],[f27]) ).
fof(f143,plain,
! [X,Y] :
( ( ~ less_or_equal(X,Y)
| less(X,Y)
| X = Y )
& ( less_or_equal(X,Y)
| ( ~ less(X,Y)
& X != Y ) ) ),
inference(NNF_transformation,[status(esa)],[f32]) ).
fof(f144,plain,
( ! [X,Y] :
( ~ less_or_equal(X,Y)
| less(X,Y)
| X = Y )
& ! [X,Y] :
( less_or_equal(X,Y)
| ( ~ less(X,Y)
& X != Y ) ) ),
inference(miniscoping,[status(esa)],[f143]) ).
fof(f146,plain,
! [X0,X1] :
( less_or_equal(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f144]) ).
fof(f147,plain,
! [X0,X1] :
( less_or_equal(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[status(esa)],[f144]) ).
fof(f148,plain,
! [X] : ~ less(X,n0),
inference(pre_NNF_transformation,[status(esa)],[f33]) ).
fof(f149,plain,
! [X0] : ~ less(X0,n0),
inference(cnf_transformation,[status(esa)],[f148]) ).
fof(f154,plain,
! [X] :
( ( ~ less(X,n2)
| less_or_equal(X,n1) )
& ( less(X,n2)
| ~ less_or_equal(X,n1) ) ),
inference(NNF_transformation,[status(esa)],[f35]) ).
fof(f155,plain,
( ! [X] :
( ~ less(X,n2)
| less_or_equal(X,n1) )
& ! [X] :
( less(X,n2)
| ~ less_or_equal(X,n1) ) ),
inference(miniscoping,[status(esa)],[f154]) ).
fof(f157,plain,
! [X0] :
( less(X0,n2)
| ~ less_or_equal(X0,n1) ),
inference(cnf_transformation,[status(esa)],[f155]) ).
fof(f162,plain,
! [X] :
( ( ~ less(X,n4)
| less_or_equal(X,n3) )
& ( less(X,n4)
| ~ less_or_equal(X,n3) ) ),
inference(NNF_transformation,[status(esa)],[f37]) ).
fof(f163,plain,
( ! [X] :
( ~ less(X,n4)
| less_or_equal(X,n3) )
& ! [X] :
( less(X,n4)
| ~ less_or_equal(X,n3) ) ),
inference(miniscoping,[status(esa)],[f162]) ).
fof(f165,plain,
! [X0] :
( less(X0,n4)
| ~ less_or_equal(X0,n3) ),
inference(cnf_transformation,[status(esa)],[f163]) ).
fof(f186,plain,
! [X,Y] :
( ( ~ less(X,Y)
| ( ~ less(Y,X)
& Y != X ) )
& ( less(X,Y)
| less(Y,X)
| Y = X ) ),
inference(NNF_transformation,[status(esa)],[f43]) ).
fof(f187,plain,
( ! [X,Y] :
( ~ less(X,Y)
| ( ~ less(Y,X)
& Y != X ) )
& ! [X,Y] :
( less(X,Y)
| less(Y,X)
| Y = X ) ),
inference(miniscoping,[status(esa)],[f186]) ).
fof(f189,plain,
! [X0,X1] :
( ~ less(X0,X1)
| X1 != X0 ),
inference(cnf_transformation,[status(esa)],[f187]) ).
fof(f190,plain,
! [X0,X1] :
( less(X0,X1)
| less(X1,X0)
| X1 = X0 ),
inference(cnf_transformation,[status(esa)],[f187]) ).
fof(f195,plain,
holdsAt(spinning,n1),
inference(cnf_transformation,[status(esa)],[f49]) ).
fof(f205,plain,
! [Event,Fluent,Time] :
( pd0_4(Time,Fluent,Event)
<=> ( ( Event = push
& Fluent = backwards
& ~ happens(pull,Time) )
| ( Event = pull
& Fluent = forwards
& ~ happens(push,Time) )
| ( Event = pull
& Fluent = forwards
& happens(push,Time) )
| ( Event = pull
& Fluent = backwards
& happens(push,Time) ) ) ),
introduced(predicate_definition,[f110]) ).
fof(f206,plain,
! [Event,Fluent,Time] :
( pd0_1(Time,Fluent,Event)
<=> ( pd0_4(Time,Fluent,Event)
| ( Event = push
& Fluent = spinning
& ~ happens(pull,Time) ) ) ),
inference(formula_renaming,[status(thm)],[f110,f205]) ).
fof(f207,plain,
! [Event,Fluent,Time] :
( ( ~ pd0_1(Time,Fluent,Event)
| pd0_4(Time,Fluent,Event)
| ( Event = push
& Fluent = spinning
& ~ happens(pull,Time) ) )
& ( pd0_1(Time,Fluent,Event)
| ( ~ pd0_4(Time,Fluent,Event)
& ( Event != push
| Fluent != spinning
| happens(pull,Time) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f206]) ).
fof(f208,plain,
( ! [Event,Fluent,Time] :
( ~ pd0_1(Time,Fluent,Event)
| pd0_4(Time,Fluent,Event)
| ( Event = push
& Fluent = spinning
& ~ happens(pull,Time) ) )
& ! [Event,Fluent,Time] :
( pd0_1(Time,Fluent,Event)
| ( ~ pd0_4(Time,Fluent,Event)
& ( Event != push
| Fluent != spinning
| happens(pull,Time) ) ) ) ),
inference(miniscoping,[status(esa)],[f207]) ).
fof(f213,plain,
! [X0,X1,X2] :
( pd0_1(X0,X1,X2)
| X2 != push
| X1 != spinning
| happens(pull,X0) ),
inference(cnf_transformation,[status(esa)],[f208]) ).
fof(f214,plain,
! [Event,Time] :
( pd0_5(Time,Event)
<=> ( ( Event = push
& Time = n0 )
| ( Event = pull
& Time = n1 ) ) ),
introduced(predicate_definition,[f120]) ).
fof(f215,plain,
! [Event,Time] :
( pd0_2(Time,Event)
<=> ( pd0_5(Time,Event)
| ( Event = pull
& Time = n2 ) ) ),
inference(formula_renaming,[status(thm)],[f120,f214]) ).
fof(f216,plain,
! [Event,Time] :
( ( ~ pd0_2(Time,Event)
| pd0_5(Time,Event)
| ( Event = pull
& Time = n2 ) )
& ( pd0_2(Time,Event)
| ( ~ pd0_5(Time,Event)
& ( Event != pull
| Time != n2 ) ) ) ),
inference(NNF_transformation,[status(esa)],[f215]) ).
fof(f217,plain,
( ! [Event,Time] :
( ~ pd0_2(Time,Event)
| pd0_5(Time,Event)
| ( Event = pull
& Time = n2 ) )
& ! [Event,Time] :
( pd0_2(Time,Event)
| ( ~ pd0_5(Time,Event)
& ( Event != pull
| Time != n2 ) ) ) ),
inference(miniscoping,[status(esa)],[f216]) ).
fof(f219,plain,
! [X0,X1] :
( ~ pd0_2(X0,X1)
| pd0_5(X0,X1)
| X0 = n2 ),
inference(cnf_transformation,[status(esa)],[f217]) ).
fof(f220,plain,
! [X0,X1] :
( pd0_2(X0,X1)
| ~ pd0_5(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f217]) ).
fof(f237,plain,
! [Event,Time] :
( ( ~ pd0_5(Time,Event)
| ( Event = push
& Time = n0 )
| ( Event = pull
& Time = n1 ) )
& ( pd0_5(Time,Event)
| ( ( Event != push
| Time != n0 )
& ( Event != pull
| Time != n1 ) ) ) ),
inference(NNF_transformation,[status(esa)],[f214]) ).
fof(f238,plain,
( ! [Event,Time] :
( ~ pd0_5(Time,Event)
| ( Event = push
& Time = n0 )
| ( Event = pull
& Time = n1 ) )
& ! [Event,Time] :
( pd0_5(Time,Event)
| ( ( Event != push
| Time != n0 )
& ( Event != pull
| Time != n1 ) ) ) ),
inference(miniscoping,[status(esa)],[f237]) ).
fof(f240,plain,
! [X0,X1] :
( ~ pd0_5(X0,X1)
| X1 = push
| X0 = n1 ),
inference(cnf_transformation,[status(esa)],[f238]) ).
fof(f243,plain,
! [X0,X1] :
( pd0_5(X0,X1)
| X1 != push
| X0 != n0 ),
inference(cnf_transformation,[status(esa)],[f238]) ).
fof(f272,plain,
! [X0] : less_or_equal(X0,X0),
inference(destructive_equality_resolution,[status(esa)],[f147]) ).
fof(f273,plain,
! [X0] : ~ less(X0,X0),
inference(destructive_equality_resolution,[status(esa)],[f189]) ).
fof(f275,plain,
! [X0] :
( pd0_1(X0,spinning,push)
| happens(pull,X0) ),
inference(destructive_equality_resolution,[status(esa)],[f213]) ).
fof(f279,plain,
pd0_5(n0,push),
inference(destructive_equality_resolution,[status(esa)],[f243]) ).
fof(f292,plain,
~ less_or_equal(n2,n1),
inference(resolution,[status(thm)],[f273,f157]) ).
fof(f297,plain,
~ less(n2,n1),
inference(resolution,[status(thm)],[f292,f146]) ).
fof(f299,plain,
( spl0_0
<=> less(n1,n2) ),
introduced(split_symbol_definition) ).
fof(f300,plain,
( less(n1,n2)
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f299]) ).
fof(f302,plain,
( spl0_1
<=> n2 = n1 ),
introduced(split_symbol_definition) ).
fof(f303,plain,
( n2 = n1
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f302]) ).
fof(f305,plain,
( less(n1,n2)
| n2 = n1 ),
inference(resolution,[status(thm)],[f297,f190]) ).
fof(f306,plain,
( spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f305,f299,f302]) ).
fof(f313,plain,
( ~ less_or_equal(n1,n1)
| ~ spl0_1 ),
inference(backward_demodulation,[status(thm)],[f303,f292]) ).
fof(f314,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f313,f272]) ).
fof(f315,plain,
~ spl0_1,
inference(contradiction_clause,[status(thm)],[f314]) ).
fof(f350,plain,
( spl0_6
<=> pd0_2(n0,pull) ),
introduced(split_symbol_definition) ).
fof(f351,plain,
( pd0_2(n0,pull)
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f350]) ).
fof(f352,plain,
( ~ pd0_2(n0,pull)
| spl0_6 ),
inference(component_clause,[status(thm)],[f350]) ).
fof(f355,plain,
( spl0_7
<=> happens(pull,n0) ),
introduced(split_symbol_definition) ).
fof(f357,plain,
( ~ happens(pull,n0)
| spl0_7 ),
inference(component_clause,[status(thm)],[f355]) ).
fof(f358,plain,
( spl0_8
<=> n0 = n2 ),
introduced(split_symbol_definition) ).
fof(f359,plain,
( n0 = n2
| ~ spl0_8 ),
inference(component_clause,[status(thm)],[f358]) ).
fof(f361,plain,
( ~ happens(pull,n0)
| n0 = n2
| spl0_6 ),
inference(resolution,[status(thm)],[f352,f125]) ).
fof(f362,plain,
( ~ spl0_7
| spl0_8
| spl0_6 ),
inference(split_clause,[status(thm)],[f361,f355,f358,f350]) ).
fof(f366,plain,
( pd0_1(n0,spinning,push)
| spl0_7 ),
inference(resolution,[status(thm)],[f357,f275]) ).
fof(f371,plain,
( terminates(push,spinning,n0)
| spl0_7 ),
inference(resolution,[status(thm)],[f366,f117]) ).
fof(f386,plain,
( spl0_10
<=> n1 = n0 ),
introduced(split_symbol_definition) ).
fof(f387,plain,
( n1 = n0
| ~ spl0_10 ),
inference(component_clause,[status(thm)],[f386]) ).
fof(f395,plain,
~ less_or_equal(n4,n3),
inference(resolution,[status(thm)],[f165,f273]) ).
fof(f401,plain,
( spl0_12
<=> n4 = n3 ),
introduced(split_symbol_definition) ).
fof(f402,plain,
( n4 = n3
| ~ spl0_12 ),
inference(component_clause,[status(thm)],[f401]) ).
fof(f403,plain,
( n4 != n3
| spl0_12 ),
inference(component_clause,[status(thm)],[f401]) ).
fof(f412,plain,
( ~ less_or_equal(n3,n3)
| ~ spl0_12 ),
inference(backward_demodulation,[status(thm)],[f402,f395]) ).
fof(f413,plain,
( $false
| ~ spl0_12 ),
inference(forward_subsumption_resolution,[status(thm)],[f412,f272]) ).
fof(f414,plain,
~ spl0_12,
inference(contradiction_clause,[status(thm)],[f413]) ).
fof(f484,plain,
( spl0_20
<=> pull = push ),
introduced(split_symbol_definition) ).
fof(f485,plain,
( pull = push
| ~ spl0_20 ),
inference(component_clause,[status(thm)],[f484]) ).
fof(f497,plain,
( $false
| ~ spl0_20 ),
inference(forward_subsumption_resolution,[status(thm)],[f485,f128]) ).
fof(f498,plain,
~ spl0_20,
inference(contradiction_clause,[status(thm)],[f497]) ).
fof(f509,plain,
( plus(n0,n3) = n4
| ~ spl0_10 ),
inference(backward_demodulation,[status(thm)],[f387,f138]) ).
fof(f510,plain,
( n3 = n4
| ~ spl0_10 ),
inference(forward_demodulation,[status(thm)],[f135,f509]) ).
fof(f511,plain,
( $false
| spl0_12
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[status(thm)],[f510,f403]) ).
fof(f512,plain,
( spl0_12
| ~ spl0_10 ),
inference(contradiction_clause,[status(thm)],[f511]) ).
fof(f543,plain,
( spl0_25
<=> happens(push,n0) ),
introduced(split_symbol_definition) ).
fof(f545,plain,
( ~ happens(push,n0)
| spl0_25 ),
inference(component_clause,[status(thm)],[f543]) ).
fof(f550,plain,
( spl0_26
<=> holdsAt(spinning,plus(n0,n1)) ),
introduced(split_symbol_definition) ).
fof(f552,plain,
( ~ holdsAt(spinning,plus(n0,n1))
| spl0_26 ),
inference(component_clause,[status(thm)],[f550]) ).
fof(f594,plain,
( ~ pd0_2(n0,push)
| spl0_25 ),
inference(resolution,[status(thm)],[f545,f126]) ).
fof(f600,plain,
( ~ pd0_5(n0,push)
| spl0_25 ),
inference(resolution,[status(thm)],[f594,f220]) ).
fof(f601,plain,
( $false
| spl0_25 ),
inference(forward_subsumption_resolution,[status(thm)],[f600,f279]) ).
fof(f602,plain,
spl0_25,
inference(contradiction_clause,[status(thm)],[f601]) ).
fof(f634,plain,
( less(n1,n0)
| ~ spl0_8
| ~ spl0_0 ),
inference(backward_demodulation,[status(thm)],[f359,f300]) ).
fof(f635,plain,
( $false
| ~ spl0_8
| ~ spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f634,f149]) ).
fof(f636,plain,
( ~ spl0_8
| ~ spl0_0 ),
inference(contradiction_clause,[status(thm)],[f635]) ).
fof(f1983,plain,
( spl0_111
<=> pd0_5(n0,pull) ),
introduced(split_symbol_definition) ).
fof(f1984,plain,
( pd0_5(n0,pull)
| ~ spl0_111 ),
inference(component_clause,[status(thm)],[f1983]) ).
fof(f1986,plain,
( pd0_5(n0,pull)
| n0 = n2
| ~ spl0_6 ),
inference(resolution,[status(thm)],[f219,f351]) ).
fof(f1987,plain,
( spl0_111
| spl0_8
| ~ spl0_6 ),
inference(split_clause,[status(thm)],[f1986,f1983,f358,f350]) ).
fof(f2016,plain,
( pull = push
| n0 = n1
| ~ spl0_111 ),
inference(resolution,[status(thm)],[f1984,f240]) ).
fof(f2017,plain,
( spl0_20
| spl0_10
| ~ spl0_111 ),
inference(split_clause,[status(thm)],[f2016,f484,f386,f1983]) ).
fof(f2146,plain,
( ~ happens(push,n0)
| ~ holdsAt(spinning,plus(n0,n1))
| spl0_7 ),
inference(resolution,[status(thm)],[f371,f93]) ).
fof(f2147,plain,
( ~ spl0_25
| ~ spl0_26
| spl0_7 ),
inference(split_clause,[status(thm)],[f2146,f543,f550,f355]) ).
fof(f2148,plain,
( ~ holdsAt(spinning,n1)
| spl0_26 ),
inference(forward_demodulation,[status(thm)],[f133,f552]) ).
fof(f2149,plain,
( $false
| spl0_26 ),
inference(forward_subsumption_resolution,[status(thm)],[f2148,f195]) ).
fof(f2150,plain,
spl0_26,
inference(contradiction_clause,[status(thm)],[f2149]) ).
fof(f2151,plain,
$false,
inference(sat_refutation,[status(thm)],[f306,f315,f362,f414,f498,f512,f602,f636,f1987,f2017,f2147,f2150]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.15 % Problem : CSR017+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.12/0.16 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.38 % Computer : n006.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8042.1875MB
% 0.13/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Apr 29 23:38:50 EDT 2024
% 0.13/0.38 % CPUTime :
% 0.13/0.39 % Drodi V3.6.0
% 1.27/0.61 % Refutation found
% 1.27/0.61 % SZS status Theorem for theBenchmark: Theorem is valid
% 1.27/0.61 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 1.27/0.62 % Elapsed time: 0.229535 seconds
% 1.27/0.62 % CPU time: 1.696200 seconds
% 1.27/0.62 % Total memory used: 86.913 MB
% 1.27/0.62 % Net memory used: 84.864 MB
%------------------------------------------------------------------------------