TSTP Solution File: CSR016+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : CSR016+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n012.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 0.18s 0.50s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 22
% Syntax : Number of formulae : 104 ( 22 unt; 0 def)
% Number of atoms : 342 ( 131 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 367 ( 129 ~; 142 |; 76 &)
% ( 19 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 8 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 128 ( 127 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [Event,Time,Fluent] :
( ( happens(Event,Time)
& initiates(Event,Fluent,Time) )
=> holdsAt(Fluent,plus(Time,n1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f13,axiom,
! [Event,Fluent,Time] :
( initiates(Event,Fluent,Time)
<=> ( ( Event = push
& Fluent = forwards
& ~ happens(pull,Time) )
| ( Event = pull
& Fluent = backwards
& ~ happens(push,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(f21,axiom,
plus(n0,n0) = n0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f22,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f25,axiom,
plus(n1,n1) = n2,
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(f48,conjecture,
holdsAt(forwards,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f49,negated_conjecture,
~ holdsAt(forwards,n1),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f88,plain,
! [Event,Time,Fluent] :
( ~ happens(Event,Time)
| ~ initiates(Event,Fluent,Time)
| holdsAt(Fluent,plus(Time,n1)) ),
inference(pre_NNF_transformation,[status(esa)],[f9]) ).
fof(f89,plain,
! [Time,Fluent] :
( ! [Event] :
( ~ happens(Event,Time)
| ~ initiates(Event,Fluent,Time) )
| holdsAt(Fluent,plus(Time,n1)) ),
inference(miniscoping,[status(esa)],[f88]) ).
fof(f90,plain,
! [X0,X1,X2] :
( ~ happens(X0,X1)
| ~ initiates(X0,X2,X1)
| holdsAt(X2,plus(X1,n1)) ),
inference(cnf_transformation,[status(esa)],[f89]) ).
fof(f101,plain,
! [Event,Fluent,Time] :
( pd0_0(Time,Fluent,Event)
<=> ( ( Event = push
& Fluent = forwards
& ~ happens(pull,Time) )
| ( Event = pull
& Fluent = backwards
& ~ happens(push,Time) ) ) ),
introduced(predicate_definition,[f13]) ).
fof(f102,plain,
! [Event,Fluent,Time] :
( initiates(Event,Fluent,Time)
<=> ( pd0_0(Time,Fluent,Event)
| ( Event = pull
& Fluent = spinning
& happens(push,Time) ) ) ),
inference(formula_renaming,[status(thm)],[f13,f101]) ).
fof(f103,plain,
! [Event,Fluent,Time] :
( ( ~ initiates(Event,Fluent,Time)
| pd0_0(Time,Fluent,Event)
| ( Event = pull
& Fluent = spinning
& happens(push,Time) ) )
& ( initiates(Event,Fluent,Time)
| ( ~ pd0_0(Time,Fluent,Event)
& ( Event != pull
| Fluent != spinning
| ~ happens(push,Time) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f102]) ).
fof(f104,plain,
( ! [Event,Fluent,Time] :
( ~ initiates(Event,Fluent,Time)
| pd0_0(Time,Fluent,Event)
| ( Event = pull
& Fluent = spinning
& happens(push,Time) ) )
& ! [Event,Fluent,Time] :
( initiates(Event,Fluent,Time)
| ( ~ pd0_0(Time,Fluent,Event)
& ( Event != pull
| Fluent != spinning
| ~ happens(push,Time) ) ) ) ),
inference(miniscoping,[status(esa)],[f103]) ).
fof(f108,plain,
! [X0,X1,X2] :
( initiates(X0,X1,X2)
| ~ pd0_0(X2,X1,X0) ),
inference(cnf_transformation,[status(esa)],[f104]) ).
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(f132,plain,
plus(n0,n0) = n0,
inference(cnf_transformation,[status(esa)],[f21]) ).
fof(f133,plain,
plus(n0,n1) = n1,
inference(cnf_transformation,[status(esa)],[f22]) ).
fof(f136,plain,
plus(n1,n1) = n2,
inference(cnf_transformation,[status(esa)],[f25]) ).
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(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(f195,plain,
~ holdsAt(forwards,n1),
inference(cnf_transformation,[status(esa)],[f49]) ).
fof(f196,plain,
! [Event,Fluent,Time] :
( pd0_3(Time,Fluent,Event)
<=> ( Event = push
& Fluent = forwards
& ~ happens(pull,Time) ) ),
introduced(predicate_definition,[f101]) ).
fof(f197,plain,
! [Event,Fluent,Time] :
( pd0_0(Time,Fluent,Event)
<=> ( pd0_3(Time,Fluent,Event)
| ( Event = pull
& Fluent = backwards
& ~ happens(push,Time) ) ) ),
inference(formula_renaming,[status(thm)],[f101,f196]) ).
fof(f198,plain,
! [Event,Fluent,Time] :
( ( ~ pd0_0(Time,Fluent,Event)
| pd0_3(Time,Fluent,Event)
| ( Event = pull
& Fluent = backwards
& ~ happens(push,Time) ) )
& ( pd0_0(Time,Fluent,Event)
| ( ~ pd0_3(Time,Fluent,Event)
& ( Event != pull
| Fluent != backwards
| happens(push,Time) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f197]) ).
fof(f199,plain,
( ! [Event,Fluent,Time] :
( ~ pd0_0(Time,Fluent,Event)
| pd0_3(Time,Fluent,Event)
| ( Event = pull
& Fluent = backwards
& ~ happens(push,Time) ) )
& ! [Event,Fluent,Time] :
( pd0_0(Time,Fluent,Event)
| ( ~ pd0_3(Time,Fluent,Event)
& ( Event != pull
| Fluent != backwards
| happens(push,Time) ) ) ) ),
inference(miniscoping,[status(esa)],[f198]) ).
fof(f203,plain,
! [X0,X1,X2] :
( pd0_0(X0,X1,X2)
| ~ pd0_3(X0,X1,X2) ),
inference(cnf_transformation,[status(esa)],[f199]) ).
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(f222,plain,
! [Event,Fluent,Time] :
( ( ~ pd0_3(Time,Fluent,Event)
| ( Event = push
& Fluent = forwards
& ~ happens(pull,Time) ) )
& ( pd0_3(Time,Fluent,Event)
| Event != push
| Fluent != forwards
| happens(pull,Time) ) ),
inference(NNF_transformation,[status(esa)],[f196]) ).
fof(f223,plain,
( ! [Event,Fluent,Time] :
( ~ pd0_3(Time,Fluent,Event)
| ( Event = push
& Fluent = forwards
& ~ happens(pull,Time) ) )
& ! [Event,Fluent,Time] :
( pd0_3(Time,Fluent,Event)
| Event != push
| Fluent != forwards
| happens(pull,Time) ) ),
inference(miniscoping,[status(esa)],[f222]) ).
fof(f227,plain,
! [X0,X1,X2] :
( pd0_3(X0,X1,X2)
| X2 != push
| X1 != forwards
| happens(pull,X0) ),
inference(cnf_transformation,[status(esa)],[f223]) ).
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(f277,plain,
! [X0] :
( pd0_3(X0,forwards,push)
| happens(pull,X0) ),
inference(destructive_equality_resolution,[status(esa)],[f227]) ).
fof(f279,plain,
pd0_5(n0,push),
inference(destructive_equality_resolution,[status(esa)],[f243]) ).
fof(f285,plain,
pd0_2(n0,push),
inference(resolution,[status(thm)],[f220,f279]) ).
fof(f286,plain,
happens(push,n0),
inference(resolution,[status(thm)],[f285,f126]) ).
fof(f294,plain,
( spl0_1
<=> push = pull ),
introduced(split_symbol_definition) ).
fof(f295,plain,
( push = pull
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f294]) ).
fof(f299,plain,
( spl0_2
<=> n0 = n1 ),
introduced(split_symbol_definition) ).
fof(f300,plain,
( n0 = n1
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f299]) ).
fof(f324,plain,
( spl0_6
<=> n0 = n2 ),
introduced(split_symbol_definition) ).
fof(f325,plain,
( n0 = n2
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f324]) ).
fof(f326,plain,
( n0 != n2
| spl0_6 ),
inference(component_clause,[status(thm)],[f324]) ).
fof(f359,plain,
! [X0] :
( less(X0,n0)
| ~ less_or_equal(X0,n1)
| ~ spl0_6 ),
inference(backward_demodulation,[status(thm)],[f325,f157]) ).
fof(f360,plain,
! [X0] :
( ~ less_or_equal(X0,n1)
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f359,f149]) ).
fof(f428,plain,
( push != push
| ~ spl0_1 ),
inference(forward_demodulation,[status(thm)],[f295,f128]) ).
fof(f429,plain,
( $false
| ~ spl0_1 ),
inference(trivial_equality_resolution,[status(esa)],[f428]) ).
fof(f430,plain,
~ spl0_1,
inference(contradiction_clause,[status(thm)],[f429]) ).
fof(f463,plain,
! [X0] :
( happens(pull,X0)
| pd0_0(X0,forwards,push) ),
inference(resolution,[status(thm)],[f277,f203]) ).
fof(f557,plain,
! [X0] :
( happens(pull,X0)
| initiates(push,forwards,X0) ),
inference(resolution,[status(thm)],[f463,f108]) ).
fof(f568,plain,
! [X0] :
( happens(pull,X0)
| ~ happens(push,X0)
| holdsAt(forwards,plus(X0,n1)) ),
inference(resolution,[status(thm)],[f557,f90]) ).
fof(f608,plain,
( spl0_31
<=> happens(pull,n0) ),
introduced(split_symbol_definition) ).
fof(f609,plain,
( happens(pull,n0)
| ~ spl0_31 ),
inference(component_clause,[status(thm)],[f608]) ).
fof(f611,plain,
( spl0_32
<=> holdsAt(forwards,plus(n0,n1)) ),
introduced(split_symbol_definition) ).
fof(f612,plain,
( holdsAt(forwards,plus(n0,n1))
| ~ spl0_32 ),
inference(component_clause,[status(thm)],[f611]) ).
fof(f614,plain,
( happens(pull,n0)
| holdsAt(forwards,plus(n0,n1)) ),
inference(resolution,[status(thm)],[f568,f286]) ).
fof(f615,plain,
( spl0_31
| spl0_32 ),
inference(split_clause,[status(thm)],[f614,f608,f611]) ).
fof(f644,plain,
( spl0_35
<=> pd0_2(n0,pull) ),
introduced(split_symbol_definition) ).
fof(f645,plain,
( pd0_2(n0,pull)
| ~ spl0_35 ),
inference(component_clause,[status(thm)],[f644]) ).
fof(f647,plain,
( pd0_2(n0,pull)
| n0 = n2
| ~ spl0_31 ),
inference(resolution,[status(thm)],[f609,f125]) ).
fof(f648,plain,
( spl0_35
| spl0_6
| ~ spl0_31 ),
inference(split_clause,[status(thm)],[f647,f644,f324,f608]) ).
fof(f651,plain,
( holdsAt(forwards,n1)
| ~ spl0_32 ),
inference(forward_demodulation,[status(thm)],[f133,f612]) ).
fof(f652,plain,
( $false
| ~ spl0_32 ),
inference(forward_subsumption_resolution,[status(thm)],[f651,f195]) ).
fof(f653,plain,
~ spl0_32,
inference(contradiction_clause,[status(thm)],[f652]) ).
fof(f655,plain,
( spl0_36
<=> pd0_5(n0,pull) ),
introduced(split_symbol_definition) ).
fof(f656,plain,
( pd0_5(n0,pull)
| ~ spl0_36 ),
inference(component_clause,[status(thm)],[f655]) ).
fof(f658,plain,
( pd0_5(n0,pull)
| n0 = n2
| ~ spl0_35 ),
inference(resolution,[status(thm)],[f645,f219]) ).
fof(f659,plain,
( spl0_36
| spl0_6
| ~ spl0_35 ),
inference(split_clause,[status(thm)],[f658,f655,f324,f644]) ).
fof(f663,plain,
( $false
| ~ spl0_6 ),
inference(resolution,[status(thm)],[f360,f272]) ).
fof(f664,plain,
~ spl0_6,
inference(contradiction_clause,[status(thm)],[f663]) ).
fof(f669,plain,
( pull = push
| n0 = n1
| ~ spl0_36 ),
inference(resolution,[status(thm)],[f656,f240]) ).
fof(f670,plain,
( spl0_1
| spl0_2
| ~ spl0_36 ),
inference(split_clause,[status(thm)],[f669,f294,f299,f655]) ).
fof(f675,plain,
( plus(n1,n0) = n2
| ~ spl0_2 ),
inference(backward_demodulation,[status(thm)],[f300,f136]) ).
fof(f676,plain,
( plus(n0,n0) = n2
| ~ spl0_2 ),
inference(forward_demodulation,[status(thm)],[f300,f675]) ).
fof(f677,plain,
( n0 = n2
| ~ spl0_2 ),
inference(forward_demodulation,[status(thm)],[f132,f676]) ).
fof(f678,plain,
( $false
| spl0_6
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f677,f326]) ).
fof(f679,plain,
( spl0_6
| ~ spl0_2 ),
inference(contradiction_clause,[status(thm)],[f678]) ).
fof(f680,plain,
$false,
inference(sat_refutation,[status(thm)],[f430,f615,f648,f653,f659,f664,f670,f679]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.18 % Problem : CSR016+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.11/0.19 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.40 % Computer : n012.cluster.edu
% 0.12/0.40 % Model : x86_64 x86_64
% 0.12/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40 % Memory : 8042.1875MB
% 0.12/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.40 % CPULimit : 300
% 0.12/0.40 % WCLimit : 300
% 0.12/0.40 % DateTime : Mon Apr 29 23:35:57 EDT 2024
% 0.12/0.40 % CPUTime :
% 0.18/0.41 % Drodi V3.6.0
% 0.18/0.50 % Refutation found
% 0.18/0.50 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.18/0.50 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.18/0.52 % Elapsed time: 0.113879 seconds
% 0.18/0.52 % CPU time: 0.785210 seconds
% 0.18/0.52 % Total memory used: 72.907 MB
% 0.18/0.52 % Net memory used: 71.723 MB
%------------------------------------------------------------------------------