%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR023+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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 : Thu Sep 24 12:15:55 PM UTC 2026
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 13 unt; 0 def)
% Number of atoms : 292 ( 163 equ)
% Maximal formula atoms : 120 ( 9 avg)
% Number of connectives : 366 ( 105 ~; 190 |; 66 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(initiates_all_defn,axiom,
! [X4,X2,X5] :
( initiates(X4,X2,X5)
<=> ( ( happens(push,X5)
& X2 = spinning
& X4 = pull )
| ( ~ happens(push,X5)
& X2 = backwards
& X4 = pull )
| ( ~ happens(pull,X5)
& X2 = forwards
& X4 = push ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',initiates_all_defn) ).
fof(happens_holds,axiom,
! [X4,X5,X2] :
( ( initiates(X4,X2,X5)
& happens(X4,X5) )
=> holdsAt(X2,plus(X5,n1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',happens_holds) ).
fof(spinning_3,conjecture,
holdsAt(spinning,n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',spinning_3) ).
fof(symmetry_of_plus,axiom,
! [X9,X10] : plus(X9,X10) = plus(X10,X9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_plus) ).
fof(happens_all_defn,axiom,
! [X4,X5] :
( happens(X4,X5)
<=> ( ( X5 = n2
& X4 = push )
| ( X5 = n2
& X4 = pull )
| ( X5 = n1
& X4 = pull )
| ( X5 = n0
& X4 = push ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',happens_all_defn) ).
fof(plus1_2,axiom,
plus(n1,n2) = n3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_2) ).
fof(c_0_6,plain,
! [X2,X4,X5] :
( epred1_3(X5,X4,X2)
<=> ( ( happens(push,X5)
& X2 = spinning
& X4 = pull )
| ( ~ happens(push,X5)
& X2 = backwards
& X4 = pull )
| ( ~ happens(pull,X5)
& X2 = forwards
& X4 = push ) ) ),
introduced(definition) ).
fof(c_0_7,plain,
! [X4,X2,X5] :
( initiates(X4,X2,X5)
<=> epred1_3(X5,X4,X2) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[initiates_all_defn]),c_0_6]) ).
fof(c_0_8,plain,
! [X19,X20,X21] :
( holdsAt(X21,plus(X20,n1))
| ~ initiates(X19,X21,X20)
| ~ happens(X19,X20) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_holds])])]) ).
fof(c_0_9,plain,
! [X27,X28,X29] :
( ( initiates(X27,X28,X29)
| ~ epred1_3(X29,X27,X28) )
& ( epred1_3(X29,X27,X28)
| ~ initiates(X27,X28,X29) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_10,plain,
! [X49,X50,X51] :
( ( epred1_3(X51,X50,X49)
| ~ happens(push,X51)
| X49 != spinning
| X50 != pull )
& ( epred1_3(X51,X50,X49)
| happens(push,X51)
| X49 != backwards
| X50 != pull )
& ( epred1_3(X51,X50,X49)
| happens(pull,X51)
| X49 != forwards
| X50 != push )
& ( ~ epred1_3(X51,X50,X49)
| ~ happens(pull,X51)
| ~ happens(push,X51)
| happens(push,X51) )
& ( ~ epred1_3(X51,X50,X49)
| ~ happens(pull,X51)
| ~ happens(push,X51)
| X49 = spinning )
& ( ~ epred1_3(X51,X50,X49)
| ~ happens(pull,X51)
| ~ happens(push,X51)
| X50 = pull )
& ( ~ epred1_3(X51,X50,X49)
| ~ happens(pull,X51)
| X49 = backwards
| happens(push,X51) )
& ( ~ epred1_3(X51,X50,X49)
| ~ happens(pull,X51)
| X49 = backwards
| X49 = spinning )
& ( ~ epred1_3(X51,X50,X49)
| ~ happens(pull,X51)
| X49 = backwards
| X50 = pull )
& ( ~ epred1_3(X51,X50,X49)
| ~ happens(pull,X51)
| X50 = pull
| happens(push,X51) )
& ( ~ epred1_3(X51,X50,X49)
| ~ happens(pull,X51)
| X50 = pull
| X49 = spinning )
& ( ~ epred1_3(X51,X50,X49)
| ~ happens(pull,X51)
| X50 = pull
| X50 = pull )
& ( ~ epred1_3(X51,X50,X49)
| X49 = forwards
| ~ happens(push,X51)
| happens(push,X51) )
& ( ~ epred1_3(X51,X50,X49)
| X49 = forwards
| ~ happens(push,X51)
| X49 = spinning )
& ( ~ epred1_3(X51,X50,X49)
| X49 = forwards
| ~ happens(push,X51)
| X50 = pull )
& ( ~ epred1_3(X51,X50,X49)
| X49 = forwards
| X49 = backwards
| happens(push,X51) )
& ( ~ epred1_3(X51,X50,X49)
| X49 = forwards
| X49 = backwards
| X49 = spinning )
& ( ~ epred1_3(X51,X50,X49)
| X49 = forwards
| X49 = backwards
| X50 = pull )
& ( ~ epred1_3(X51,X50,X49)
| X49 = forwards
| X50 = pull
| happens(push,X51) )
& ( ~ epred1_3(X51,X50,X49)
| X49 = forwards
| X50 = pull
| X49 = spinning )
& ( ~ epred1_3(X51,X50,X49)
| X49 = forwards
| X50 = pull
| X50 = pull )
& ( ~ epred1_3(X51,X50,X49)
| X50 = push
| ~ happens(push,X51)
| happens(push,X51) )
& ( ~ epred1_3(X51,X50,X49)
| X50 = push
| ~ happens(push,X51)
| X49 = spinning )
& ( ~ epred1_3(X51,X50,X49)
| X50 = push
| ~ happens(push,X51)
| X50 = pull )
& ( ~ epred1_3(X51,X50,X49)
| X50 = push
| X49 = backwards
| happens(push,X51) )
& ( ~ epred1_3(X51,X50,X49)
| X50 = push
| X49 = backwards
| X49 = spinning )
& ( ~ epred1_3(X51,X50,X49)
| X50 = push
| X49 = backwards
| X50 = pull )
& ( ~ epred1_3(X51,X50,X49)
| X50 = push
| X50 = pull
| happens(push,X51) )
& ( ~ epred1_3(X51,X50,X49)
| X50 = push
| X50 = pull
| X49 = spinning )
& ( ~ epred1_3(X51,X50,X49)
| X50 = push
| X50 = pull
| X50 = pull ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_11,plain,
( ~ initiates(X1,X3,X2)
| ~ happens(X1,X2)
| holdsAt(X3,plus(X2,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( ~ epred1_3(X1,X2,X3)
| initiates(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( ~ happens(push,X3)
| X2 != spinning
| X1 != pull
| epred1_3(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,negated_conjecture,
~ holdsAt(spinning,n3),
inference(assume_negation,[status(cth)],[spinning_3]) ).
cnf(c_0_15,plain,
( ~ happens(X3,X2)
| ~ epred1_3(X2,X3,X1)
| holdsAt(X1,plus(X2,n1)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( ~ happens(push,X1)
| epred1_3(X1,pull,spinning) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_13])]) ).
fof(c_0_17,plain,
! [X40,X41] : plus(X40,X41) = plus(X41,X40),
inference(variable_rename,[status(thm)],[symmetry_of_plus]) ).
fof(c_0_18,plain,
! [X47,X48] :
( ( happens(X47,X48)
| X48 != n2
| X47 != push )
& ( happens(X47,X48)
| X48 != n2
| X47 != pull )
& ( happens(X47,X48)
| X48 != n1
| X47 != pull )
& ( happens(X47,X48)
| X48 != n0
| X47 != push )
& ( ~ happens(X47,X48)
| X48 = n0
| X48 = n1
| X48 = n2
| X48 = n2 )
& ( ~ happens(X47,X48)
| X48 = n0
| X48 = n1
| X48 = n2
| X47 = push )
& ( ~ happens(X47,X48)
| X48 = n0
| X48 = n1
| X47 = pull
| X48 = n2 )
& ( ~ happens(X47,X48)
| X48 = n0
| X48 = n1
| X47 = pull
| X47 = push )
& ( ~ happens(X47,X48)
| X48 = n0
| X47 = pull
| X48 = n2
| X48 = n2 )
& ( ~ happens(X47,X48)
| X48 = n0
| X47 = pull
| X48 = n2
| X47 = push )
& ( ~ happens(X47,X48)
| X48 = n0
| X47 = pull
| X47 = pull
| X48 = n2 )
& ( ~ happens(X47,X48)
| X48 = n0
| X47 = pull
| X47 = pull
| X47 = push )
& ( ~ happens(X47,X48)
| X47 = push
| X48 = n1
| X48 = n2
| X48 = n2 )
& ( ~ happens(X47,X48)
| X47 = push
| X48 = n1
| X48 = n2
| X47 = push )
& ( ~ happens(X47,X48)
| X47 = push
| X48 = n1
| X47 = pull
| X48 = n2 )
& ( ~ happens(X47,X48)
| X47 = push
| X48 = n1
| X47 = pull
| X47 = push )
& ( ~ happens(X47,X48)
| X47 = push
| X47 = pull
| X48 = n2
| X48 = n2 )
& ( ~ happens(X47,X48)
| X47 = push
| X47 = pull
| X48 = n2
| X47 = push )
& ( ~ happens(X47,X48)
| X47 = push
| X47 = pull
| X47 = pull
| X48 = n2 )
& ( ~ happens(X47,X48)
| X47 = push
| X47 = pull
| X47 = pull
| X47 = push ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_all_defn])])])]) ).
fof(c_0_19,negated_conjecture,
~ holdsAt(spinning,n3),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( ~ happens(push,X1)
| ~ happens(pull,X1)
| holdsAt(spinning,plus(X1,n1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( X2 != n2
| X1 != pull
| happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( X2 != n2
| X1 != push
| happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,negated_conjecture,
~ holdsAt(spinning,n3),
inference(fof_nnf,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( ~ happens(push,X1)
| ~ happens(pull,X1)
| holdsAt(spinning,plus(n1,X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
plus(n1,n2) = n3,
inference(split_conjunct,[status(thm)],[plus1_2]) ).
cnf(c_0_27,plain,
happens(pull,n2),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_22])]) ).
cnf(c_0_28,plain,
happens(push,n2),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_23])]) ).
cnf(c_0_29,negated_conjecture,
~ holdsAt(spinning,n3),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR023+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.02/0.36 % Computer : n004.cluster.edu
% 0.02/0.36 % Model : x86_64 x86_64
% 0.02/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.36 % Memory : 8046.5625MB
% 0.02/0.36 % OS : Linux 6.8.0-71-generic
% 0.02/0.36 % CPULimit : 300
% 0.02/0.36 % WCLimit : 300
% 0.02/0.36 % DateTime : Mon Sep 21 14:24:20 UTC 2026
% 0.02/0.36 % CPUTime :
% 0.02/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.02/0.42 Running first-order theorem proving
% 0.02/0.42 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.52 % Version: 3.5.1
% 0.21/0.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 % Starting sh5l with 300s (1) cores
% 0.21/0.52 % new_bool_3 with pid 3369835 completed with status 0
% 0.21/0.52 % Result found by new_bool_3
% 0.21/0.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 % Search class: FGHSF-FSLM22-SFFFFFNN
% 0.21/0.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.52 % SubtermCWHack with pid 3369839 completed with status 0
% 0.21/0.52 % Result found by SubtermCWHack
% 0.21/0.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 % Search class: FGHSF-FSLM22-SFFFFFNN
% 0.21/0.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.52 % Preprocessing time : 0.004 s
% 0.21/0.52
% 0.21/0.52 % Proof found!
% 0.21/0.52 % SZS status Theorem
% 0.21/0.52 % SZS output start CNFRefutation
% See solution above
% 0.21/0.52 % Parsed axioms : 48
% 0.21/0.52 % Removed by relevancy pruning/SinE : 17
% 0.21/0.52 % Initial clauses : 154
% 0.21/0.52 % Removed in clause preprocessing : 9
% 0.21/0.52 % Initial clauses in saturation : 145
% 0.21/0.52 % Processed clauses : 205
% 0.21/0.52 % ...of these trivial : 0
% 0.21/0.52 % ...subsumed : 71
% 0.21/0.52 % ...remaining for further processing : 134
% 0.21/0.52 % Other redundant clauses eliminated : 26
% 0.21/0.52 % Clauses deleted for lack of memory : 0
% 0.21/0.52 % Backward-subsumed : 2
% 0.21/0.52 % Backward-rewritten : 2
% 0.21/0.52 % Generated clauses : 196
% 0.21/0.52 % ...of the previous two non-redundant : 143
% 0.21/0.52 % ...aggressively subsumed : 0
% 0.21/0.52 % Contextual simplify-reflections : 1
% 0.21/0.52 % Paramodulations : 180
% 0.21/0.52 % Factorizations : 2
% 0.21/0.52 % NegExts : 0
% 0.21/0.52 % Equation resolutions : 26
% 0.21/0.52 % Disequality decompositions : 0
% 0.21/0.52 % Total rewrite steps : 58
% 0.21/0.52 % ...of those cached : 44
% 0.21/0.52 % Propositional unsat checks : 0
% 0.21/0.52 % Propositional check models : 0
% 0.21/0.52 % Propositional check unsatisfiable : 0
% 0.21/0.52 % Propositional clauses : 0
% 0.21/0.52 % Propositional clauses after purity: 0
% 0.21/0.52 % Propositional unsat core size : 0
% 0.21/0.52 % Propositional preprocessing time : 0.000
% 0.21/0.52 % Propositional encoding time : 0.000
% 0.21/0.52 % Propositional solver time : 0.000
% 0.21/0.52 % Success case prop preproc time : 0.000
% 0.21/0.52 % Success case prop encoding time : 0.000
% 0.21/0.52 % Success case prop solver time : 0.000
% 0.21/0.52 % Current number of processed clauses : 116
% 0.21/0.52 % Positive orientable unit clauses : 15
% 0.21/0.52 % Positive unorientable unit clauses: 1
% 0.21/0.52 % Negative unit clauses : 16
% 0.21/0.52 % Non-unit-clauses : 84
% 0.21/0.52 % Current number of unprocessed clauses: 79
% 0.21/0.52 % ...number of literals in the above : 335
% 0.21/0.52 % Current number of archived formulas : 0
% 0.21/0.52 % Current number of archived clauses : 4
% 0.21/0.52 % Clause-clause subsumption calls (NU) : 908
% 0.21/0.52 % Rec. Clause-clause subsumption calls : 644
% 0.21/0.52 % Non-unit clause-clause subsumptions : 51
% 0.21/0.52 % Unit Clause-clause subsumption calls : 127
% 0.21/0.52 % Rewrite failures with RHS unbound : 0
% 0.21/0.52 % BW rewrite match attempts : 13
% 0.21/0.52 % BW rewrite match successes : 13
% 0.21/0.52 % Condensation attempts : 0
% 0.21/0.52 % Condensation successes : 0
% 0.21/0.52 % Termbank termtop insertions : 8744
% 0.21/0.52 % Search garbage collected termcells : 1353
% 0.21/0.52
% 0.21/0.52 % -------------------------------------------------
% 0.21/0.52 % User time : 0.029 s
% 0.21/0.52 % System time : 0.005 s
% 0.21/0.52 % Total time : 0.033 s
% 0.21/0.52 % Maximum resident set size: 3684 pages
% 0.21/0.52
% 0.21/0.52 % -------------------------------------------------
% 0.21/0.52 % User time : 0.033 s
% 0.21/0.52 % System time : 0.011 s
% 0.21/0.52 % Total time : 0.044 s
% 0.21/0.52 % Maximum resident set size: 4864 pages
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------