%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR015+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:54 PM UTC 2026
% Result : Theorem 0.21s 0.59s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 64 ( 22 unt; 0 def)
% Number of atoms : 558 ( 273 equ)
% Maximal formula atoms : 149 ( 8 avg)
% Number of connectives : 703 ( 209 ~; 352 |; 129 &)
% ( 11 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 98 ( 1 sgn 55 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(happens_terminates_not_holds,axiom,
! [X4,X5,X2] :
( ( terminates(X4,X2,X5)
& happens(X4,X5) )
=> ~ holdsAt(X2,plus(X5,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+0.ax',happens_terminates_not_holds) ).
fof(symmetry_of_plus,axiom,
! [X9,X10] : plus(X9,X10) = plus(X10,X9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_plus) ).
fof(plus0_1,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus0_1) ).
fof(terminates_all_defn,axiom,
! [X4,X2,X5] :
( terminates(X4,X2,X5)
<=> ( ( ~ happens(push,X5)
& X2 = spinning
& X4 = pull )
| ( ~ happens(pull,X5)
& X2 = spinning
& X4 = push )
| ( happens(push,X5)
& X2 = backwards
& X4 = pull )
| ( happens(push,X5)
& X2 = forwards
& X4 = pull )
| ( ~ happens(push,X5)
& X2 = forwards
& X4 = pull )
| ( ~ happens(pull,X5)
& X2 = backwards
& X4 = push ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',terminates_all_defn) ).
fof(not_backwards_1,conjecture,
~ holdsAt(backwards,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_backwards_1) ).
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/sandbox2/benchmark/Axioms/CSR001+2.ax',happens_all_defn) ).
fof(less_or_equal,axiom,
! [X9,X10] :
( less_or_equal(X9,X10)
<=> ( X9 = X10
| less(X9,X10) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal) ).
fof(push_not_pull,axiom,
push != pull,
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',push_not_pull) ).
fof(less_property,axiom,
! [X9,X10] :
( less(X9,X10)
<=> ( X10 != X9
& ~ less(X10,X9) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_property) ).
fof(less2,axiom,
! [X9] :
( less(X9,n2)
<=> less_or_equal(X9,n1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less2) ).
fof(less1,axiom,
! [X9] :
( less(X9,n1)
<=> less_or_equal(X9,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less1) ).
fof(c_0_11,plain,
! [X4,X5,X2] :
( ( terminates(X4,X2,X5)
& happens(X4,X5) )
=> ~ holdsAt(X2,plus(X5,n1)) ),
inference(fof_simplification,[status(thm)],[happens_terminates_not_holds]) ).
fof(c_0_12,plain,
! [X56,X57,X58] :
( ~ holdsAt(X58,plus(X57,n1))
| ~ terminates(X56,X58,X57)
| ~ happens(X56,X57) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_13,plain,
! [X76,X77] : plus(X76,X77) = plus(X77,X76),
inference(variable_rename,[status(thm)],[symmetry_of_plus]) ).
fof(c_0_14,plain,
! [X2,X4,X5] :
( epred3_3(X5,X4,X2)
<=> ( ( ~ happens(push,X5)
& X2 = spinning
& X4 = pull )
| ( ~ happens(pull,X5)
& X2 = spinning
& X4 = push )
| ( happens(push,X5)
& X2 = backwards
& X4 = pull )
| ( happens(push,X5)
& X2 = forwards
& X4 = pull )
| ( ~ happens(push,X5)
& X2 = forwards
& X4 = pull )
| ( ~ happens(pull,X5)
& X2 = backwards
& X4 = push ) ) ),
introduced(definition) ).
cnf(c_0_15,plain,
( ~ holdsAt(X3,plus(X2,n1))
| ~ terminates(X1,X3,X2)
| ~ happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
plus(n0,n1) = n1,
inference(split_conjunct,[status(thm)],[plus0_1]) ).
fof(c_0_18,plain,
! [X4,X2,X5] :
( terminates(X4,X2,X5)
<=> epred3_3(X5,X4,X2) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[terminates_all_defn]),c_0_14]) ).
fof(c_0_19,plain,
! [X2,X4,X5] :
( epred2_3(X5,X4,X2)
<=> ( ( happens(push,X5)
& X2 = forwards
& X4 = pull )
| ( ~ happens(push,X5)
& X2 = forwards
& X4 = pull )
| ( ~ happens(pull,X5)
& X2 = backwards
& X4 = push ) ) ),
introduced(definition) ).
cnf(c_0_20,plain,
( ~ happens(X3,X2)
| ~ terminates(X3,X1,X2)
| ~ holdsAt(X1,plus(n1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
plus(n1,n0) = n1,
inference(rw,[status(thm)],[c_0_17,c_0_16]) ).
fof(c_0_22,plain,
! [X68,X69,X70] :
( ( terminates(X68,X69,X70)
| ~ epred3_3(X70,X68,X69) )
& ( epred3_3(X70,X68,X69)
| ~ terminates(X68,X69,X70) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])]) ).
fof(c_0_23,plain,
! [X2,X4,X5] :
( epred3_3(X5,X4,X2)
<=> ( ( ~ happens(push,X5)
& X2 = spinning
& X4 = pull )
| ( ~ happens(pull,X5)
& X2 = spinning
& X4 = push )
| ( happens(push,X5)
& X2 = backwards
& X4 = pull )
| epred2_3(X5,X4,X2) ) ),
inference(apply_def,[status(thm)],[c_0_14,c_0_19]) ).
cnf(c_0_24,plain,
( ~ happens(X2,n0)
| ~ terminates(X2,X1,n0)
| ~ holdsAt(X1,n1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( ~ epred3_3(X1,X2,X3)
| terminates(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_26,plain,
! [X100,X101,X102] :
( ( epred3_3(X102,X101,X100)
| happens(push,X102)
| X100 != spinning
| X101 != pull )
& ( epred3_3(X102,X101,X100)
| happens(pull,X102)
| X100 != spinning
| X101 != push )
& ( epred3_3(X102,X101,X100)
| ~ happens(push,X102)
| X100 != backwards
| X101 != pull )
& ( epred3_3(X102,X101,X100)
| ~ epred2_3(X102,X101,X100) )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| happens(push,X102)
| ~ happens(pull,X102)
| ~ happens(push,X102) )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| happens(push,X102)
| ~ happens(pull,X102)
| X100 = spinning )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| happens(push,X102)
| ~ happens(pull,X102)
| X101 = pull )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| happens(push,X102)
| X100 = spinning
| ~ happens(push,X102) )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| happens(push,X102)
| X100 = spinning
| X100 = spinning )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| happens(push,X102)
| X100 = spinning
| X101 = pull )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| happens(push,X102)
| X101 = push
| ~ happens(push,X102) )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| happens(push,X102)
| X101 = push
| X100 = spinning )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| happens(push,X102)
| X101 = push
| X101 = pull )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| X100 = backwards
| ~ happens(pull,X102)
| ~ happens(push,X102) )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| X100 = backwards
| ~ happens(pull,X102)
| X100 = spinning )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| X100 = backwards
| ~ happens(pull,X102)
| X101 = pull )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| X100 = backwards
| X100 = spinning
| ~ happens(push,X102) )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| X100 = backwards
| X100 = spinning
| X100 = spinning )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| X100 = backwards
| X100 = spinning
| X101 = pull )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| X100 = backwards
| X101 = push
| ~ happens(push,X102) )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| X100 = backwards
| X101 = push
| X100 = spinning )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| X100 = backwards
| X101 = push
| X101 = pull )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| X101 = pull
| ~ happens(pull,X102)
| ~ happens(push,X102) )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| X101 = pull
| ~ happens(pull,X102)
| X100 = spinning )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| X101 = pull
| ~ happens(pull,X102)
| X101 = pull )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| X101 = pull
| X100 = spinning
| ~ happens(push,X102) )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| X101 = pull
| X100 = spinning
| X100 = spinning )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| X101 = pull
| X100 = spinning
| X101 = pull )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| X101 = pull
| X101 = push
| ~ happens(push,X102) )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| X101 = pull
| X101 = push
| X100 = spinning )
& ( ~ epred3_3(X102,X101,X100)
| epred2_3(X102,X101,X100)
| X101 = pull
| X101 = push
| X101 = pull ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])]) ).
cnf(c_0_27,plain,
( ~ happens(X1,n0)
| ~ holdsAt(X2,n1)
| ~ epred3_3(n0,X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( ~ epred2_3(X1,X2,X3)
| epred3_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_29,plain,
! [X97,X98,X99] :
( ( epred2_3(X99,X98,X97)
| ~ happens(push,X99)
| X97 != forwards
| X98 != pull )
& ( epred2_3(X99,X98,X97)
| happens(push,X99)
| X97 != forwards
| X98 != pull )
& ( epred2_3(X99,X98,X97)
| happens(pull,X99)
| X97 != backwards
| X98 != push )
& ( ~ epred2_3(X99,X98,X97)
| ~ happens(pull,X99)
| ~ happens(push,X99)
| happens(push,X99) )
& ( ~ epred2_3(X99,X98,X97)
| ~ happens(pull,X99)
| ~ happens(push,X99)
| X97 = forwards )
& ( ~ epred2_3(X99,X98,X97)
| ~ happens(pull,X99)
| ~ happens(push,X99)
| X98 = pull )
& ( ~ epred2_3(X99,X98,X97)
| ~ happens(pull,X99)
| X97 = forwards
| happens(push,X99) )
& ( ~ epred2_3(X99,X98,X97)
| ~ happens(pull,X99)
| X97 = forwards
| X97 = forwards )
& ( ~ epred2_3(X99,X98,X97)
| ~ happens(pull,X99)
| X97 = forwards
| X98 = pull )
& ( ~ epred2_3(X99,X98,X97)
| ~ happens(pull,X99)
| X98 = pull
| happens(push,X99) )
& ( ~ epred2_3(X99,X98,X97)
| ~ happens(pull,X99)
| X98 = pull
| X97 = forwards )
& ( ~ epred2_3(X99,X98,X97)
| ~ happens(pull,X99)
| X98 = pull
| X98 = pull )
& ( ~ epred2_3(X99,X98,X97)
| X97 = backwards
| ~ happens(push,X99)
| happens(push,X99) )
& ( ~ epred2_3(X99,X98,X97)
| X97 = backwards
| ~ happens(push,X99)
| X97 = forwards )
& ( ~ epred2_3(X99,X98,X97)
| X97 = backwards
| ~ happens(push,X99)
| X98 = pull )
& ( ~ epred2_3(X99,X98,X97)
| X97 = backwards
| X97 = forwards
| happens(push,X99) )
& ( ~ epred2_3(X99,X98,X97)
| X97 = backwards
| X97 = forwards
| X97 = forwards )
& ( ~ epred2_3(X99,X98,X97)
| X97 = backwards
| X97 = forwards
| X98 = pull )
& ( ~ epred2_3(X99,X98,X97)
| X97 = backwards
| X98 = pull
| happens(push,X99) )
& ( ~ epred2_3(X99,X98,X97)
| X97 = backwards
| X98 = pull
| X97 = forwards )
& ( ~ epred2_3(X99,X98,X97)
| X97 = backwards
| X98 = pull
| X98 = pull )
& ( ~ epred2_3(X99,X98,X97)
| X98 = push
| ~ happens(push,X99)
| happens(push,X99) )
& ( ~ epred2_3(X99,X98,X97)
| X98 = push
| ~ happens(push,X99)
| X97 = forwards )
& ( ~ epred2_3(X99,X98,X97)
| X98 = push
| ~ happens(push,X99)
| X98 = pull )
& ( ~ epred2_3(X99,X98,X97)
| X98 = push
| X97 = forwards
| happens(push,X99) )
& ( ~ epred2_3(X99,X98,X97)
| X98 = push
| X97 = forwards
| X97 = forwards )
& ( ~ epred2_3(X99,X98,X97)
| X98 = push
| X97 = forwards
| X98 = pull )
& ( ~ epred2_3(X99,X98,X97)
| X98 = push
| X98 = pull
| happens(push,X99) )
& ( ~ epred2_3(X99,X98,X97)
| X98 = push
| X98 = pull
| X97 = forwards )
& ( ~ epred2_3(X99,X98,X97)
| X98 = push
| X98 = pull
| X98 = pull ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
fof(c_0_30,negated_conjecture,
~ ~ holdsAt(backwards,n1),
inference(assume_negation,[status(cth)],[not_backwards_1]) ).
cnf(c_0_31,plain,
( ~ happens(X1,n0)
| ~ holdsAt(X2,n1)
| ~ epred2_3(n0,X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( X2 != backwards
| X1 != push
| epred2_3(X3,X1,X2)
| happens(pull,X3) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_33,negated_conjecture,
holdsAt(backwards,n1),
inference(fof_simplification,[status(thm)],[c_0_30]) ).
cnf(c_0_34,plain,
( ~ happens(X2,n0)
| ~ holdsAt(X1,n1)
| X2 != push
| X1 != backwards
| happens(pull,n0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
holdsAt(backwards,n1),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_36,plain,
! [X74,X75] :
( ( happens(X74,X75)
| X75 != n2
| X74 != push )
& ( happens(X74,X75)
| X75 != n2
| X74 != pull )
& ( happens(X74,X75)
| X75 != n1
| X74 != pull )
& ( happens(X74,X75)
| X75 != n0
| X74 != push )
& ( ~ happens(X74,X75)
| X75 = n0
| X75 = n1
| X75 = n2
| X75 = n2 )
& ( ~ happens(X74,X75)
| X75 = n0
| X75 = n1
| X75 = n2
| X74 = push )
& ( ~ happens(X74,X75)
| X75 = n0
| X75 = n1
| X74 = pull
| X75 = n2 )
& ( ~ happens(X74,X75)
| X75 = n0
| X75 = n1
| X74 = pull
| X74 = push )
& ( ~ happens(X74,X75)
| X75 = n0
| X74 = pull
| X75 = n2
| X75 = n2 )
& ( ~ happens(X74,X75)
| X75 = n0
| X74 = pull
| X75 = n2
| X74 = push )
& ( ~ happens(X74,X75)
| X75 = n0
| X74 = pull
| X74 = pull
| X75 = n2 )
& ( ~ happens(X74,X75)
| X75 = n0
| X74 = pull
| X74 = pull
| X74 = push )
& ( ~ happens(X74,X75)
| X74 = push
| X75 = n1
| X75 = n2
| X75 = n2 )
& ( ~ happens(X74,X75)
| X74 = push
| X75 = n1
| X75 = n2
| X74 = push )
& ( ~ happens(X74,X75)
| X74 = push
| X75 = n1
| X74 = pull
| X75 = n2 )
& ( ~ happens(X74,X75)
| X74 = push
| X75 = n1
| X74 = pull
| X74 = push )
& ( ~ happens(X74,X75)
| X74 = push
| X74 = pull
| X75 = n2
| X75 = n2 )
& ( ~ happens(X74,X75)
| X74 = push
| X74 = pull
| X75 = n2
| X74 = push )
& ( ~ happens(X74,X75)
| X74 = push
| X74 = pull
| X74 = pull
| X75 = n2 )
& ( ~ happens(X74,X75)
| X74 = push
| X74 = pull
| X74 = pull
| X74 = 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_37,plain,
! [X78,X79] :
( ( less_or_equal(X78,X79)
| X78 != X79 )
& ( less_or_equal(X78,X79)
| ~ less(X78,X79) )
& ( X78 = X79
| less(X78,X79)
| ~ less_or_equal(X78,X79) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_or_equal])])])]) ).
cnf(c_0_38,negated_conjecture,
( ~ happens(X1,n0)
| X1 != push
| happens(pull,n0) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
( X2 != n0
| X1 != push
| happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
fof(c_0_40,plain,
push != pull,
inference(fof_simplification,[status(thm)],[push_not_pull]) ).
fof(c_0_41,plain,
! [X9,X10] :
( less(X9,X10)
<=> ( X10 != X9
& ~ less(X10,X9) ) ),
inference(fof_simplification,[status(thm)],[less_property]) ).
fof(c_0_42,plain,
! [X82] :
( ( less(X82,n2)
| ~ less_or_equal(X82,n1) )
& ( less_or_equal(X82,n1)
| ~ less(X82,n2) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less2])])]) ).
cnf(c_0_43,plain,
( X1 != X2
| less_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
fof(c_0_44,plain,
! [X81] :
( ( less(X81,n1)
| ~ less_or_equal(X81,n0) )
& ( less_or_equal(X81,n0)
| ~ less(X81,n1) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less1])])]) ).
cnf(c_0_45,plain,
( ~ happens(X1,X2)
| X1 = push
| X2 = n1
| X2 = n2
| X1 = push ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_46,negated_conjecture,
( X1 != push
| happens(pull,n0) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
fof(c_0_47,plain,
push != pull,
inference(fof_nnf,[status(thm)],[c_0_40]) ).
fof(c_0_48,plain,
! [X90,X91] :
( ( less(X90,X91)
| X91 = X90
| less(X91,X90) )
& ( ~ less(X90,X91)
| X91 != X90 )
& ( ~ less(X90,X91)
| ~ less(X91,X90) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])])]) ).
cnf(c_0_49,plain,
( ~ less_or_equal(X1,n1)
| less(X1,n2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_50,plain,
less_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_51,plain,
( ~ less_or_equal(X1,n0)
| less(X1,n1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_52,plain,
( ~ happens(X1,X2)
| X1 = push
| X2 = n2
| X2 = n1 ),
inference(cn,[status(thm)],[c_0_45]) ).
cnf(c_0_53,negated_conjecture,
happens(pull,n0),
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_54,plain,
push != pull,
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_55,plain,
( ~ less(X2,X1)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_56,plain,
less(n1,n2),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_57,plain,
less(n0,n1),
inference(spm,[status(thm)],[c_0_51,c_0_50]) ).
cnf(c_0_58,negated_conjecture,
( n0 = n1
| n0 = n2 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_59,plain,
~ less(n2,n1),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_60,plain,
( ~ less(X2,X1)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_61,negated_conjecture,
n0 = n1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]) ).
cnf(c_0_62,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_60]) ).
cnf(c_0_63,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_61]),c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : CSR015+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n013.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Mon Sep 21 14:23:20 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.21/0.59 % Version: 3.5.1
% 0.21/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.59 % Starting sh5l with 300s (1) cores
% 0.21/0.59 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 990364 completed with status 0
% 0.21/0.59 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.21/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.59 % No SInE strategy applied
% 0.21/0.59 % Search class: FGHSF-FSLM32-SFFFFFNN
% 0.21/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.59 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.21/0.59 % Starting new_bool_3 with 136s (1) cores
% 0.21/0.59 % Starting U----_116_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN1 with 136s (1) cores
% 0.21/0.59 % G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 990372 completed with status 0
% 0.21/0.59 % Result found by G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.21/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.59 % No SInE strategy applied
% 0.21/0.59 % Search class: FGHSF-FSLM32-SFFFFFNN
% 0.21/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.59 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.21/0.59 % Preprocessing time : 0.003 s
% 0.21/0.59 % Presaturation interreduction done
% 0.21/0.59
% 0.21/0.59 % Proof found!
% 0.21/0.59 % SZS status Theorem
% 0.21/0.59 % SZS output start CNFRefutation
% See solution above
% 0.21/0.59 % Parsed axioms : 48
% 0.21/0.59 % Removed by relevancy pruning/SinE : 0
% 0.21/0.59 % Initial clauses : 186
% 0.21/0.59 % Removed in clause preprocessing : 9
% 0.21/0.59 % Initial clauses in saturation : 177
% 0.21/0.59 % Processed clauses : 724
% 0.21/0.59 % ...of these trivial : 0
% 0.21/0.59 % ...subsumed : 298
% 0.21/0.59 % ...remaining for further processing : 426
% 0.21/0.59 % Other redundant clauses eliminated : 2
% 0.21/0.59 % Clauses deleted for lack of memory : 0
% 0.21/0.59 % Backward-subsumed : 5
% 0.21/0.59 % Backward-rewritten : 58
% 0.21/0.59 % Generated clauses : 903
% 0.21/0.59 % ...of the previous two non-redundant : 769
% 0.21/0.59 % ...aggressively subsumed : 0
% 0.21/0.59 % Contextual simplify-reflections : 5
% 0.21/0.59 % Paramodulations : 874
% 0.21/0.59 % Factorizations : 11
% 0.21/0.59 % NegExts : 0
% 0.21/0.59 % Equation resolutions : 6
% 0.21/0.59 % Disequality decompositions : 0
% 0.21/0.59 % Total rewrite steps : 127
% 0.21/0.59 % ...of those cached : 100
% 0.21/0.59 % Propositional unsat checks : 0
% 0.21/0.59 % Propositional check models : 0
% 0.21/0.59 % Propositional check unsatisfiable : 0
% 0.21/0.59 % Propositional clauses : 0
% 0.21/0.59 % Propositional clauses after purity: 0
% 0.21/0.59 % Propositional unsat core size : 0
% 0.21/0.59 % Propositional preprocessing time : 0.000
% 0.21/0.59 % Propositional encoding time : 0.000
% 0.21/0.59 % Propositional solver time : 0.000
% 0.21/0.59 % Success case prop preproc time : 0.000
% 0.21/0.59 % Success case prop encoding time : 0.000
% 0.21/0.59 % Success case prop solver time : 0.000
% 0.21/0.59 % Current number of processed clauses : 247
% 0.21/0.59 % Positive orientable unit clauses : 20
% 0.21/0.59 % Positive unorientable unit clauses: 1
% 0.21/0.59 % Negative unit clauses : 50
% 0.21/0.59 % Non-unit-clauses : 176
% 0.21/0.59 % Current number of unprocessed clauses: 297
% 0.21/0.59 % ...number of literals in the above : 1143
% 0.21/0.59 % Current number of archived formulas : 0
% 0.21/0.59 % Current number of archived clauses : 173
% 0.21/0.59 % Clause-clause subsumption calls (NU) : 6674
% 0.21/0.59 % Rec. Clause-clause subsumption calls : 3228
% 0.21/0.59 % Non-unit clause-clause subsumptions : 168
% 0.21/0.59 % Unit Clause-clause subsumption calls : 2239
% 0.21/0.59 % Rewrite failures with RHS unbound : 0
% 0.21/0.59 % BW rewrite match attempts : 55
% 0.21/0.59 % BW rewrite match successes : 45
% 0.21/0.59 % Condensation attempts : 0
% 0.21/0.59 % Condensation successes : 0
% 0.21/0.59 % Termbank termtop insertions : 17727
% 0.21/0.59 % Search garbage collected termcells : 1706
% 0.21/0.59
% 0.21/0.59 % -------------------------------------------------
% 0.21/0.59 % User time : 0.041 s
% 0.21/0.59 % System time : 0.007 s
% 0.21/0.59 % Total time : 0.048 s
% 0.21/0.59 % Maximum resident set size: 3940 pages
% 0.21/0.59
% 0.21/0.59 % -------------------------------------------------
% 0.21/0.59 % User time : 0.091 s
% 0.21/0.59 % System time : 0.023 s
% 0.21/0.59 % Total time : 0.113 s
% 0.21/0.59 % Maximum resident set size: 4608 pages
% 0.21/0.59 % E exiting
%------------------------------------------------------------------------------