%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR017+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 : n015.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.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 60 ( 23 unt; 0 def)
% Number of atoms : 426 ( 209 equ)
% Maximal formula atoms : 149 ( 7 avg)
% Number of connectives : 512 ( 146 ~; 253 |; 100 &)
% ( 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 : 87 ( 0 sgn 52 !; 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_spinning_1,conjecture,
~ holdsAt(spinning,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_spinning_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,
! [X22,X23,X24] :
( ~ holdsAt(X24,plus(X23,n1))
| ~ terminates(X22,X24,X23)
| ~ happens(X22,X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_13,plain,
! [X39,X40] : plus(X39,X40) = plus(X40,X39),
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) ).
fof(c_0_15,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_16,plain,
( ~ holdsAt(X3,plus(X2,n1))
| ~ terminates(X1,X3,X2)
| ~ happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
plus(n0,n1) = n1,
inference(split_conjunct,[status(thm)],[plus0_1]) ).
fof(c_0_19,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_20,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_15]) ).
cnf(c_0_21,plain,
( ~ happens(X3,X2)
| ~ terminates(X3,X1,X2)
| ~ holdsAt(X1,plus(n1,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
plus(n1,n0) = n1,
inference(rw,[status(thm)],[c_0_18,c_0_17]) ).
fof(c_0_23,plain,
! [X30,X31,X32] :
( ( terminates(X30,X31,X32)
| ~ epred3_3(X32,X30,X31) )
& ( epred3_3(X32,X30,X31)
| ~ terminates(X30,X31,X32) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
fof(c_0_24,plain,
! [X55,X56,X57] :
( ( epred3_3(X57,X56,X55)
| happens(push,X57)
| X55 != spinning
| X56 != pull )
& ( epred3_3(X57,X56,X55)
| happens(pull,X57)
| X55 != spinning
| X56 != push )
& ( epred3_3(X57,X56,X55)
| ~ happens(push,X57)
| X55 != backwards
| X56 != pull )
& ( epred3_3(X57,X56,X55)
| ~ epred2_3(X57,X56,X55) )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| happens(push,X57)
| ~ happens(pull,X57)
| ~ happens(push,X57) )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| happens(push,X57)
| ~ happens(pull,X57)
| X55 = spinning )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| happens(push,X57)
| ~ happens(pull,X57)
| X56 = pull )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| happens(push,X57)
| X55 = spinning
| ~ happens(push,X57) )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| happens(push,X57)
| X55 = spinning
| X55 = spinning )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| happens(push,X57)
| X55 = spinning
| X56 = pull )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| happens(push,X57)
| X56 = push
| ~ happens(push,X57) )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| happens(push,X57)
| X56 = push
| X55 = spinning )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| happens(push,X57)
| X56 = push
| X56 = pull )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X55 = backwards
| ~ happens(pull,X57)
| ~ happens(push,X57) )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X55 = backwards
| ~ happens(pull,X57)
| X55 = spinning )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X55 = backwards
| ~ happens(pull,X57)
| X56 = pull )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X55 = backwards
| X55 = spinning
| ~ happens(push,X57) )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X55 = backwards
| X55 = spinning
| X55 = spinning )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X55 = backwards
| X55 = spinning
| X56 = pull )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X55 = backwards
| X56 = push
| ~ happens(push,X57) )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X55 = backwards
| X56 = push
| X55 = spinning )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X55 = backwards
| X56 = push
| X56 = pull )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X56 = pull
| ~ happens(pull,X57)
| ~ happens(push,X57) )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X56 = pull
| ~ happens(pull,X57)
| X55 = spinning )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X56 = pull
| ~ happens(pull,X57)
| X56 = pull )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X56 = pull
| X55 = spinning
| ~ happens(push,X57) )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X56 = pull
| X55 = spinning
| X55 = spinning )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X56 = pull
| X55 = spinning
| X56 = pull )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X56 = pull
| X56 = push
| ~ happens(push,X57) )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X56 = pull
| X56 = push
| X55 = spinning )
& ( ~ epred3_3(X57,X56,X55)
| epred2_3(X57,X56,X55)
| X56 = pull
| X56 = push
| X56 = pull ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
fof(c_0_25,negated_conjecture,
~ ~ holdsAt(spinning,n1),
inference(assume_negation,[status(cth)],[not_spinning_1]) ).
fof(c_0_26,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_27,plain,
! [X45,X46] :
( ( less_or_equal(X45,X46)
| X45 != X46 )
& ( less_or_equal(X45,X46)
| ~ less(X45,X46) )
& ( X45 = X46
| less(X45,X46)
| ~ less_or_equal(X45,X46) ) ),
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_28,plain,
( ~ happens(X2,n0)
| ~ terminates(X2,X1,n0)
| ~ holdsAt(X1,n1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( ~ epred3_3(X1,X2,X3)
| terminates(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
( X2 != spinning
| X1 != push
| epred3_3(X3,X1,X2)
| happens(pull,X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_31,negated_conjecture,
holdsAt(spinning,n1),
inference(fof_simplification,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
( X2 != n0
| X1 != push
| happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_33,plain,
push != pull,
inference(fof_simplification,[status(thm)],[push_not_pull]) ).
fof(c_0_34,plain,
! [X9,X10] :
( less(X9,X10)
<=> ( X10 != X9
& ~ less(X10,X9) ) ),
inference(fof_simplification,[status(thm)],[less_property]) ).
fof(c_0_35,plain,
! [X41] :
( ( less(X41,n2)
| ~ less_or_equal(X41,n1) )
& ( less_or_equal(X41,n1)
| ~ less(X41,n2) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less2])])]) ).
cnf(c_0_36,plain,
( X1 != X2
| less_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_37,plain,
! [X26] :
( ( less(X26,n1)
| ~ less_or_equal(X26,n0) )
& ( less_or_equal(X26,n0)
| ~ less(X26,n1) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less1])])]) ).
cnf(c_0_38,plain,
( ~ happens(X1,X2)
| X1 = push
| X2 = n1
| X2 = n2
| X1 = push ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_39,plain,
( ~ happens(X1,n0)
| ~ holdsAt(X2,n1)
| ~ epred3_3(n0,X1,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_40,plain,
( happens(pull,X1)
| epred3_3(X1,push,spinning) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_30])]) ).
cnf(c_0_41,negated_conjecture,
holdsAt(spinning,n1),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_42,plain,
happens(push,n0),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_32])]) ).
fof(c_0_43,plain,
push != pull,
inference(fof_nnf,[status(thm)],[c_0_33]) ).
fof(c_0_44,plain,
! [X43,X44] :
( ( less(X43,X44)
| X44 = X43
| less(X44,X43) )
& ( ~ less(X43,X44)
| X44 != X43 )
& ( ~ less(X43,X44)
| ~ less(X44,X43) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])]) ).
cnf(c_0_45,plain,
( ~ less_or_equal(X1,n1)
| less(X1,n2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_46,plain,
less_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_47,plain,
( ~ less_or_equal(X1,n0)
| less(X1,n1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_48,plain,
( ~ happens(X1,X2)
| X1 = push
| X2 = n2
| X2 = n1 ),
inference(cn,[status(thm)],[c_0_38]) ).
cnf(c_0_49,plain,
happens(pull,n0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42])]) ).
cnf(c_0_50,plain,
push != pull,
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_51,plain,
( ~ less(X2,X1)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_52,plain,
less(n1,n2),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_53,plain,
less(n0,n1),
inference(spm,[status(thm)],[c_0_47,c_0_46]) ).
cnf(c_0_54,plain,
( n0 = n2
| n0 = n1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]) ).
cnf(c_0_55,plain,
~ less(n2,n1),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,plain,
( ~ less(X2,X1)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_57,plain,
n0 = n1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]) ).
cnf(c_0_58,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_56]) ).
cnf(c_0_59,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_57]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR017+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.36 % Computer : n015.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Mon Sep 21 14:27:21 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.14/0.44 % Version: 3.5.1
% 0.14/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % Starting sh5l with 300s (1) cores
% 0.14/0.44 % new_bool_1 with pid 1694268 completed with status 0
% 0.14/0.44 % Result found by new_bool_1
% 0.14/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 % Search class: FGHSF-FSLM22-SFFFFFNN
% 0.14/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.44 % SubtermCWHack with pid 1694270 completed with status 0
% 0.14/0.44 % Result found by SubtermCWHack
% 0.14/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 % Search class: FGHSF-FSLM22-SFFFFFNN
% 0.14/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.44 % Preprocessing time : 0.002 s
% 0.14/0.44
% 0.14/0.44 % Proof found!
% 0.14/0.44 % SZS status Theorem
% 0.14/0.44 % SZS output start CNFRefutation
% See solution above
% 0.14/0.44 % Parsed axioms : 48
% 0.14/0.44 % Removed by relevancy pruning/SinE : 17
% 0.14/0.44 % Initial clauses : 154
% 0.14/0.44 % Removed in clause preprocessing : 9
% 0.14/0.44 % Initial clauses in saturation : 145
% 0.14/0.44 % Processed clauses : 194
% 0.14/0.44 % ...of these trivial : 0
% 0.14/0.44 % ...subsumed : 71
% 0.14/0.44 % ...remaining for further processing : 123
% 0.14/0.44 % Other redundant clauses eliminated : 22
% 0.14/0.44 % Clauses deleted for lack of memory : 0
% 0.14/0.44 % Backward-subsumed : 0
% 0.14/0.44 % Backward-rewritten : 28
% 0.14/0.44 % Generated clauses : 191
% 0.14/0.44 % ...of the previous two non-redundant : 152
% 0.14/0.44 % ...aggressively subsumed : 0
% 0.14/0.44 % Contextual simplify-reflections : 0
% 0.14/0.44 % Paramodulations : 176
% 0.14/0.44 % Factorizations : 3
% 0.14/0.44 % NegExts : 0
% 0.14/0.44 % Equation resolutions : 22
% 0.14/0.44 % Disequality decompositions : 0
% 0.14/0.44 % Total rewrite steps : 74
% 0.14/0.44 % ...of those cached : 56
% 0.14/0.44 % Propositional unsat checks : 0
% 0.14/0.44 % Propositional check models : 0
% 0.14/0.44 % Propositional check unsatisfiable : 0
% 0.14/0.44 % Propositional clauses : 0
% 0.14/0.44 % Propositional clauses after purity: 0
% 0.14/0.44 % Propositional unsat core size : 0
% 0.14/0.44 % Propositional preprocessing time : 0.000
% 0.14/0.44 % Propositional encoding time : 0.000
% 0.14/0.44 % Propositional solver time : 0.000
% 0.14/0.44 % Success case prop preproc time : 0.000
% 0.14/0.44 % Success case prop encoding time : 0.000
% 0.14/0.44 % Success case prop solver time : 0.000
% 0.14/0.44 % Current number of processed clauses : 83
% 0.14/0.44 % Positive orientable unit clauses : 10
% 0.14/0.44 % Positive unorientable unit clauses: 1
% 0.14/0.44 % Negative unit clauses : 9
% 0.14/0.44 % Non-unit-clauses : 63
% 0.14/0.44 % Current number of unprocessed clauses: 94
% 0.14/0.44 % ...number of literals in the above : 375
% 0.14/0.44 % Current number of archived formulas : 0
% 0.14/0.44 % Current number of archived clauses : 28
% 0.14/0.44 % Clause-clause subsumption calls (NU) : 777
% 0.14/0.44 % Rec. Clause-clause subsumption calls : 542
% 0.14/0.44 % Non-unit clause-clause subsumptions : 50
% 0.14/0.44 % Unit Clause-clause subsumption calls : 9
% 0.14/0.44 % Rewrite failures with RHS unbound : 0
% 0.14/0.44 % BW rewrite match attempts : 14
% 0.14/0.44 % BW rewrite match successes : 14
% 0.14/0.44 % Condensation attempts : 0
% 0.14/0.44 % Condensation successes : 0
% 0.14/0.44 % Termbank termtop insertions : 8498
% 0.14/0.44 % Search garbage collected termcells : 1355
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.011 s
% 0.14/0.44 % System time : 0.005 s
% 0.14/0.44 % Total time : 0.016 s
% 0.14/0.44 % Maximum resident set size: 3940 pages
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.012 s
% 0.14/0.44 % System time : 0.011 s
% 0.14/0.44 % Total time : 0.023 s
% 0.14/0.44 % Maximum resident set size: 4608 pages
% 0.14/0.44 % E exiting
%------------------------------------------------------------------------------