%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR020+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 : n014.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.10s 0.45s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 51 ( 19 unt; 0 def)
% Number of atoms : 409 ( 207 equ)
% Maximal formula atoms : 149 ( 8 avg)
% Number of connectives : 495 ( 137 ~; 247 |; 99 &)
% ( 10 <=>; 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 : 73 ( 0 sgn 46 !; 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/sandbox/benchmark/Axioms/CSR001+0.ax',happens_terminates_not_holds) ).
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/sandbox/benchmark/Axioms/CSR001+2.ax',terminates_all_defn) ).
fof(plus1_1,axiom,
plus(n1,n1) = n2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_1) ).
fof(not_spinning_2,conjecture,
~ holdsAt(spinning,n2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_spinning_2) ).
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(push_not_pull,axiom,
push != pull,
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',push_not_pull) ).
fof(less_or_equal,axiom,
! [X9,X10] :
( less_or_equal(X9,X10)
<=> ( X9 = X10
| less(X9,X10) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal) ).
fof(less_property,axiom,
! [X9,X10] :
( less(X9,X10)
<=> ( X10 != X9
& ~ less(X10,X9) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property) ).
fof(less2,axiom,
! [X9] :
( less(X9,n2)
<=> less_or_equal(X9,n1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less2) ).
fof(plus0_0,axiom,
plus(n0,n0) = n0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus0_0) ).
fof(c_0_10,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_11,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_12,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) ).
fof(c_0_13,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_10])])]) ).
fof(c_0_14,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_11]) ).
fof(c_0_15,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_11,c_0_12]) ).
cnf(c_0_16,plain,
( ~ holdsAt(X3,plus(X2,n1))
| ~ terminates(X1,X3,X2)
| ~ happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
plus(n1,n1) = n2,
inference(split_conjunct,[status(thm)],[plus1_1]) ).
fof(c_0_18,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_14])])]) ).
fof(c_0_19,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_15])])])]) ).
fof(c_0_20,negated_conjecture,
~ ~ holdsAt(spinning,n2),
inference(assume_negation,[status(cth)],[not_spinning_2]) ).
fof(c_0_21,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])])])]) ).
cnf(c_0_22,plain,
( ~ happens(X2,n1)
| ~ terminates(X2,X1,n1)
| ~ holdsAt(X1,n2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( ~ epred3_3(X1,X2,X3)
| terminates(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( X2 != spinning
| X1 != pull
| epred3_3(X3,X1,X2)
| happens(push,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_25,negated_conjecture,
holdsAt(spinning,n2),
inference(fof_simplification,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( X2 != n1
| X1 != pull
| happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_27,plain,
push != pull,
inference(fof_simplification,[status(thm)],[push_not_pull]) ).
fof(c_0_28,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_29,plain,
( ~ happens(X2,X1)
| X1 = n0
| X2 = pull
| X1 = n2
| X1 = n2 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
( ~ happens(X1,n1)
| ~ holdsAt(X2,n2)
| ~ epred3_3(n1,X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
( happens(push,X1)
| epred3_3(X1,pull,spinning) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_24])]) ).
cnf(c_0_32,negated_conjecture,
holdsAt(spinning,n2),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
happens(pull,n1),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_26])]) ).
fof(c_0_34,plain,
push != pull,
inference(fof_nnf,[status(thm)],[c_0_27]) ).
fof(c_0_35,plain,
! [X9,X10] :
( less(X9,X10)
<=> ( X10 != X9
& ~ less(X10,X9) ) ),
inference(fof_simplification,[status(thm)],[less_property]) ).
fof(c_0_36,plain,
! [X39] :
( ( less(X39,n2)
| ~ less_or_equal(X39,n1) )
& ( less_or_equal(X39,n1)
| ~ less(X39,n2) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less2])])]) ).
cnf(c_0_37,plain,
( X1 != X2
| less_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,plain,
( ~ happens(X2,X1)
| X1 = n2
| X1 = n0
| X2 = pull ),
inference(cn,[status(thm)],[c_0_29]) ).
cnf(c_0_39,plain,
happens(push,n1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_40,plain,
push != pull,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_41,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_35])])])]) ).
cnf(c_0_42,plain,
( ~ less_or_equal(X1,n1)
| less(X1,n2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,plain,
less_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_44,plain,
plus(n0,n0) = n0,
inference(split_conjunct,[status(thm)],[plus0_0]) ).
cnf(c_0_45,plain,
( n2 = n1
| n0 = n1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_46,plain,
( ~ less(X2,X1)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_47,plain,
less(n1,n2),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
n2 = n1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_17])]) ).
cnf(c_0_49,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_50,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR020+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n014.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 14:24:34 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.45 % Version: 3.5.1
% 0.10/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % Starting sh5l with 300s (1) cores
% 0.10/0.45 % new_bool_1 with pid 105678 completed with status 0
% 0.10/0.45 % Result found by new_bool_1
% 0.10/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.45 % Search class: FGHSF-FSLM22-SFFFFFNN
% 0.10/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.45 % SubtermCWHack with pid 105681 completed with status 0
% 0.10/0.45 % Result found by SubtermCWHack
% 0.10/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.45 % Search class: FGHSF-FSLM22-SFFFFFNN
% 0.10/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.45 % Preprocessing time : 0.002 s
% 0.10/0.45
% 0.10/0.45 % Proof found!
% 0.10/0.45 % SZS status Theorem
% 0.10/0.45 % SZS output start CNFRefutation
% See solution above
% 0.10/0.45 % Parsed axioms : 48
% 0.10/0.45 % Removed by relevancy pruning/SinE : 17
% 0.10/0.45 % Initial clauses : 154
% 0.10/0.45 % Removed in clause preprocessing : 9
% 0.10/0.45 % Initial clauses in saturation : 145
% 0.10/0.45 % Processed clauses : 180
% 0.10/0.45 % ...of these trivial : 0
% 0.10/0.45 % ...subsumed : 68
% 0.10/0.45 % ...remaining for further processing : 112
% 0.10/0.45 % Other redundant clauses eliminated : 16
% 0.10/0.45 % Clauses deleted for lack of memory : 0
% 0.10/0.45 % Backward-subsumed : 0
% 0.10/0.45 % Backward-rewritten : 45
% 0.10/0.45 % Generated clauses : 163
% 0.10/0.45 % ...of the previous two non-redundant : 142
% 0.10/0.45 % ...aggressively subsumed : 0
% 0.10/0.45 % Contextual simplify-reflections : 0
% 0.10/0.45 % Paramodulations : 152
% 0.10/0.45 % Factorizations : 2
% 0.10/0.45 % NegExts : 0
% 0.10/0.45 % Equation resolutions : 16
% 0.10/0.45 % Disequality decompositions : 0
% 0.10/0.45 % Total rewrite steps : 71
% 0.10/0.45 % ...of those cached : 54
% 0.10/0.45 % Propositional unsat checks : 0
% 0.10/0.45 % Propositional check models : 0
% 0.10/0.45 % Propositional check unsatisfiable : 0
% 0.10/0.45 % Propositional clauses : 0
% 0.10/0.45 % Propositional clauses after purity: 0
% 0.10/0.45 % Propositional unsat core size : 0
% 0.10/0.45 % Propositional preprocessing time : 0.000
% 0.10/0.45 % Propositional encoding time : 0.000
% 0.10/0.45 % Propositional solver time : 0.000
% 0.10/0.45 % Success case prop preproc time : 0.000
% 0.10/0.45 % Success case prop encoding time : 0.000
% 0.10/0.45 % Success case prop solver time : 0.000
% 0.10/0.45 % Current number of processed clauses : 58
% 0.10/0.45 % Positive orientable unit clauses : 9
% 0.10/0.45 % Positive unorientable unit clauses: 1
% 0.10/0.45 % Negative unit clauses : 11
% 0.10/0.45 % Non-unit-clauses : 37
% 0.10/0.45 % Current number of unprocessed clauses: 94
% 0.10/0.45 % ...number of literals in the above : 375
% 0.10/0.45 % Current number of archived formulas : 0
% 0.10/0.45 % Current number of archived clauses : 45
% 0.10/0.45 % Clause-clause subsumption calls (NU) : 701
% 0.10/0.45 % Rec. Clause-clause subsumption calls : 484
% 0.10/0.45 % Non-unit clause-clause subsumptions : 47
% 0.10/0.45 % Unit Clause-clause subsumption calls : 15
% 0.10/0.45 % Rewrite failures with RHS unbound : 0
% 0.10/0.45 % BW rewrite match attempts : 14
% 0.10/0.45 % BW rewrite match successes : 14
% 0.10/0.45 % Condensation attempts : 0
% 0.10/0.45 % Condensation successes : 0
% 0.10/0.45 % Termbank termtop insertions : 8152
% 0.10/0.45 % Search garbage collected termcells : 1355
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.010 s
% 0.10/0.45 % System time : 0.005 s
% 0.10/0.45 % Total time : 0.015 s
% 0.10/0.45 % Maximum resident set size: 3940 pages
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.011 s
% 0.10/0.45 % System time : 0.011 s
% 0.10/0.45 % Total time : 0.022 s
% 0.10/0.45 % Maximum resident set size: 4864 pages
% 0.10/0.45 % E exiting
%------------------------------------------------------------------------------