TSTP Solution File: CSR023+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : CSR023+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n025.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:20 EDT 2024
% Result : Theorem 0.21s 0.41s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 47 ( 14 unt; 0 def)
% Number of atoms : 163 ( 68 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 171 ( 55 ~; 61 |; 44 &)
% ( 10 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 3 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 66 ( 66 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [Event,Time,Fluent] :
( ( happens(Event,Time)
& initiates(Event,Fluent,Time) )
=> holdsAt(Fluent,plus(Time,n1)) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p') ).
fof(f26,axiom,
plus(n1,n2) = n3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f31,axiom,
! [X,Y] : plus(X,Y) = plus(Y,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f48,conjecture,
holdsAt(spinning,n3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f49,negated_conjecture,
~ holdsAt(spinning,n3),
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(f109,plain,
! [X0,X1,X2] :
( initiates(X0,X1,X2)
| X0 != pull
| X1 != spinning
| ~ happens(push,X2) ),
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(f126,plain,
! [X0,X1] :
( happens(X0,X1)
| ~ pd0_2(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f123]) ).
fof(f127,plain,
! [X0,X1] :
( happens(X0,X1)
| X0 != push
| X1 != n2 ),
inference(cnf_transformation,[status(esa)],[f123]) ).
fof(f137,plain,
plus(n1,n2) = n3,
inference(cnf_transformation,[status(esa)],[f26]) ).
fof(f142,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[status(esa)],[f31]) ).
fof(f195,plain,
~ holdsAt(spinning,n3),
inference(cnf_transformation,[status(esa)],[f49]) ).
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(f221,plain,
! [X0,X1] :
( pd0_2(X0,X1)
| X1 != pull
| X0 != n2 ),
inference(cnf_transformation,[status(esa)],[f217]) ).
fof(f269,plain,
! [X0] :
( initiates(pull,spinning,X0)
| ~ happens(push,X0) ),
inference(destructive_equality_resolution,[status(esa)],[f109]) ).
fof(f271,plain,
happens(push,n2),
inference(destructive_equality_resolution,[status(esa)],[f127]) ).
fof(f276,plain,
pd0_2(n2,pull),
inference(destructive_equality_resolution,[status(esa)],[f221]) ).
fof(f286,plain,
initiates(pull,spinning,n2),
inference(resolution,[status(thm)],[f271,f269]) ).
fof(f287,plain,
happens(pull,n2),
inference(resolution,[status(thm)],[f126,f276]) ).
fof(f476,plain,
( spl0_22
<=> happens(pull,n2) ),
introduced(split_symbol_definition) ).
fof(f478,plain,
( ~ happens(pull,n2)
| spl0_22 ),
inference(component_clause,[status(thm)],[f476]) ).
fof(f484,plain,
( $false
| spl0_22 ),
inference(forward_subsumption_resolution,[status(thm)],[f478,f287]) ).
fof(f485,plain,
spl0_22,
inference(contradiction_clause,[status(thm)],[f484]) ).
fof(f1128,plain,
( spl0_102
<=> holdsAt(spinning,plus(n2,n1)) ),
introduced(split_symbol_definition) ).
fof(f1129,plain,
( holdsAt(spinning,plus(n2,n1))
| ~ spl0_102 ),
inference(component_clause,[status(thm)],[f1128]) ).
fof(f1131,plain,
( ~ happens(pull,n2)
| holdsAt(spinning,plus(n2,n1)) ),
inference(resolution,[status(thm)],[f90,f286]) ).
fof(f1132,plain,
( ~ spl0_22
| spl0_102 ),
inference(split_clause,[status(thm)],[f1131,f476,f1128]) ).
fof(f1133,plain,
( holdsAt(spinning,plus(n1,n2))
| ~ spl0_102 ),
inference(forward_demodulation,[status(thm)],[f142,f1129]) ).
fof(f1134,plain,
( holdsAt(spinning,n3)
| ~ spl0_102 ),
inference(forward_demodulation,[status(thm)],[f137,f1133]) ).
fof(f1135,plain,
( $false
| ~ spl0_102 ),
inference(forward_subsumption_resolution,[status(thm)],[f1134,f195]) ).
fof(f1136,plain,
~ spl0_102,
inference(contradiction_clause,[status(thm)],[f1135]) ).
fof(f1137,plain,
$false,
inference(sat_refutation,[status(thm)],[f485,f1132,f1136]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR023+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.13/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Apr 29 23:56:26 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.37 % Drodi V3.6.0
% 0.21/0.41 % Refutation found
% 0.21/0.41 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.21/0.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.21/0.44 % Elapsed time: 0.076700 seconds
% 0.21/0.44 % CPU time: 0.408217 seconds
% 0.21/0.44 % Total memory used: 64.833 MB
% 0.21/0.44 % Net memory used: 64.526 MB
%------------------------------------------------------------------------------