%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CSR015+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 07:06:32 AM UTC 2026
% Result : Theorem 1.47s 0.61s
% Output : CNFRefutation 1.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 10 unt; 0 def)
% Number of atoms : 79 ( 33 equ)
% Maximal formula atoms : 19 ( 2 avg)
% Number of connectives : 87 ( 35 ~; 32 |; 17 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(happens_terminates_not_holds,axiom,
! [Event,Time,Fluent] :
( ( terminates(Event,Fluent,Time)
& happens(Event,Time) )
=> ~ holdsAt(Fluent,plus(Time,n1)) ),
file('theBenchmark.p',happens_terminates_not_holds) ).
fof(terminates_all_defn,axiom,
! [Event,Fluent,Time] :
( terminates(Event,Fluent,Time)
<=> ( ( ~ happens(push,Time)
& Fluent = spinning
& Event = pull )
| ( ~ happens(pull,Time)
& Fluent = spinning
& Event = push )
| ( happens(push,Time)
& Fluent = backwards
& Event = pull )
| ( happens(push,Time)
& Fluent = forwards
& Event = pull )
| ( ~ happens(push,Time)
& Fluent = forwards
& Event = pull )
| ( ~ happens(pull,Time)
& Fluent = backwards
& Event = push ) ) ),
file('theBenchmark.p',terminates_all_defn) ).
fof(happens_all_defn,axiom,
! [Event,Time] :
( happens(Event,Time)
<=> ( ( Time = n2
& Event = push )
| ( Time = n2
& Event = pull )
| ( Time = n1
& Event = pull )
| ( Time = n0
& Event = push ) ) ),
file('theBenchmark.p',happens_all_defn) ).
fof(not_backwards_1,conjecture,
~ holdsAt(backwards,n1),
file('theBenchmark.p',not_backwards_1) ).
fof(not_backwards_1_neg,negated_conjecture,
~ ~ holdsAt(backwards,n1),
inference(assume_negation,[status(cth)],[not_backwards_1]) ).
cnf(c_51,negated_conjecture,
holdsAt(backwards,n1),
inference(clausify,[status(thm)],[not_backwards_1_neg]) ).
fof(plus0_1,axiom,
plus(n0,n1) = n1,
file('theBenchmark.p',plus0_1) ).
cnf(c_90,plain,
plus(n0,n1) = n1,
inference(clausify,[status(thm)],[plus0_1]) ).
cnf(c_100,plain,
( n0 != B
| push != A
| happens(A,B) ),
inference(clausify,[status(thm)],[happens_all_defn]) ).
cnf(c_107,plain,
( ~ happens(push,C)
| backwards != B
| pull != A
| terminates(A,B,C) ),
inference(clausify,[status(thm)],[terminates_all_defn]) ).
cnf(c_110,plain,
( happens(pull,C)
| backwards != B
| push != A
| terminates(A,B,C) ),
inference(clausify,[status(thm)],[terminates_all_defn]) ).
cnf(c_134,plain,
( ~ holdsAt(C,plus(B,n1))
| ~ terminates(A,C,B)
| ~ happens(A,B) ),
inference(clausify,[status(thm)],[happens_terminates_not_holds]) ).
cnf(c_208,plain,
( n0 != A
| happens(push,A) ),
inference(xxres,[status(thm)],[c_100]) ).
cnf(c_217,plain,
( happens(pull,B)
| backwards != A
| terminates(push,A,B) ),
inference(xxres,[status(thm)],[c_110]) ).
cnf(c_462,plain,
happens(push,n0),
inference(xxres,[status(thm)],[c_208]) ).
cnf(c_468,plain,
( backwards != B
| pull != A
| terminates(A,B,n0) ),
inference(resolve,[status(thm)],[c_462,c_107]) ).
cnf(c_510,plain,
( happens(pull,A)
| terminates(push,backwards,A) ),
inference(xxres,[status(thm)],[c_217]) ).
cnf(c_512,plain,
( ~ holdsAt(backwards,plus(A,n1))
| ~ happens(push,A)
| happens(pull,A) ),
inference(resolve,[status(thm)],[c_510,c_134]) ).
cnf(c_901,plain,
( backwards != A
| terminates(pull,A,n0) ),
inference(xxres,[status(thm)],[c_468]) ).
cnf(c_1324,plain,
terminates(pull,backwards,n0),
inference(xxres,[status(thm)],[c_901]) ).
cnf(c_1325,plain,
( ~ holdsAt(backwards,plus(n0,n1))
| ~ happens(pull,n0) ),
inference(resolve,[status(thm)],[c_1324,c_134]) ).
cnf(c_3612,plain,
( ~ holdsAt(backwards,n1)
| ~ happens(pull,n0) ),
inference(paramod,[status(thm)],[c_90,c_1325]) ).
cnf(c_1740,negated_conjecture,
~ happens(pull,n0),
inference(resolve,[status(thm)],[c_51,c_3612]) ).
cnf(c_3613,plain,
( ~ holdsAt(backwards,n1)
| ~ happens(push,n0)
| happens(pull,n0) ),
inference(paramod,[status(thm)],[c_90,c_512]) ).
cnf(c_3614,plain,
( ~ holdsAt(backwards,n1)
| ~ happens(push,n0) ),
inference(resolve,[status(thm)],[c_1740,c_3613]) ).
cnf(c_3615,plain,
~ holdsAt(backwards,n1),
inference(resolve,[status(thm)],[c_462,c_3614]) ).
cnf(c_3611,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_51,c_3615]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR015+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n020.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sat Sep 26 23:56:50 UTC 2026
% 0.02/0.36 % CPUTime :
% 0.02/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.02/0.36 % Process 2819092 was started by sandbox2 on n020,
% 0.02/0.36 % Sat Sep 26 23:56:50 2026
% 0.02/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.02/0.37
% 0.02/0.37 % From the command line: assign(max_seconds, 300).
% 1.47/0.61
% 1.47/0.61 % given #500 (T,wt=14): 668 less(n7,A) | n7 = A | -less(n9,A). [resolve(619,c,58,b)].
% 1.47/0.61
% 1.47/0.61 % SZS status Theorem for theBenchmark
% 1.47/0.61
% 1.47/0.61 % Proof 1 at 0.16 (+ 0.06) seconds.
% 1.47/0.61 % Length of proof is 21.
% 1.47/0.61 % Level of proof is 9.
% 1.47/0.61 % Maximum clause weight is 22.000.
% 1.47/0.61 % Given clauses 630.
% 1.47/0.61
% 1.47/0.61 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------