%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : CSR016+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 : n016.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:17:55 PM UTC 2026
% Result : Theorem 0.14s 0.64s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 58 ( 24 unt; 0 def)
% Number of atoms : 356 ( 185 equ)
% Maximal formula atoms : 120 ( 6 avg)
% Number of connectives : 427 ( 129 ~; 214 |; 74 &)
% ( 9 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 76 ( 0 sgn 43 !; 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(forwards_1,conjecture,
holdsAt(forwards,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',forwards_1) ).
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(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(plus0_1,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus0_1) ).
fof(push_not_pull,axiom,
push != pull,
file('/export/starexec/sandbox/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/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(less1,axiom,
! [X9] :
( less(X9,n1)
<=> less_or_equal(X9,n0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less1) ).
fof(c_0_11,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_12,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_11]) ).
fof(c_0_13,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_14,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_12])])]) ).
fof(c_0_15,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_11])])])]) ).
cnf(c_0_16,plain,
( ~ initiates(X1,X3,X2)
| ~ happens(X1,X2)
| holdsAt(X3,plus(X2,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( ~ epred1_3(X1,X2,X3)
| initiates(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( X2 != forwards
| X1 != push
| epred1_3(X3,X1,X2)
| happens(pull,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,negated_conjecture,
~ holdsAt(forwards,n1),
inference(assume_negation,[status(cth)],[forwards_1]) ).
cnf(c_0_20,plain,
( ~ happens(X3,X2)
| ~ epred1_3(X2,X3,X1)
| holdsAt(X1,plus(X2,n1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( happens(pull,X1)
| epred1_3(X1,push,forwards) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_18])]) ).
fof(c_0_22,plain,
! [X39,X40] : plus(X39,X40) = plus(X40,X39),
inference(variable_rename,[status(thm)],[symmetry_of_plus]) ).
fof(c_0_23,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_24,negated_conjecture,
~ holdsAt(forwards,n1),
inference(fof_simplification,[status(thm)],[c_0_19]) ).
fof(c_0_25,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_26,plain,
( ~ happens(push,X1)
| happens(pull,X1)
| holdsAt(forwards,plus(X1,n1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
plus(n0,n1) = n1,
inference(split_conjunct,[status(thm)],[plus0_1]) ).
cnf(c_0_29,plain,
( X2 != n0
| X1 != push
| happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_30,negated_conjecture,
~ holdsAt(forwards,n1),
inference(fof_nnf,[status(thm)],[c_0_24]) ).
fof(c_0_31,plain,
push != pull,
inference(fof_simplification,[status(thm)],[push_not_pull]) ).
fof(c_0_32,plain,
! [X9,X10] :
( less(X9,X10)
<=> ( X10 != X9
& ~ less(X10,X9) ) ),
inference(fof_simplification,[status(thm)],[less_property]) ).
fof(c_0_33,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_34,plain,
( X1 != X2
| less_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_35,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_36,plain,
( ~ happens(X1,X2)
| X1 = push
| X2 = n1
| X2 = n2
| X1 = push ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_37,plain,
( ~ happens(push,X1)
| happens(pull,X1)
| holdsAt(forwards,plus(n1,X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_38,plain,
plus(n1,n0) = n1,
inference(rw,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_39,plain,
happens(push,n0),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_29])]) ).
cnf(c_0_40,negated_conjecture,
~ holdsAt(forwards,n1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_41,plain,
push != pull,
inference(fof_nnf,[status(thm)],[c_0_31]) ).
fof(c_0_42,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_32])])])]) ).
cnf(c_0_43,plain,
( ~ less_or_equal(X1,n1)
| less(X1,n2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_44,plain,
less_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_45,plain,
( ~ less_or_equal(X1,n0)
| less(X1,n1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_46,plain,
( ~ happens(X1,X2)
| X1 = push
| X2 = n2
| X2 = n1 ),
inference(cn,[status(thm)],[c_0_36]) ).
cnf(c_0_47,plain,
happens(pull,n0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]),c_0_40]) ).
cnf(c_0_48,plain,
push != pull,
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,plain,
( ~ less(X2,X1)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_50,plain,
less(n1,n2),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,plain,
less(n0,n1),
inference(spm,[status(thm)],[c_0_45,c_0_44]) ).
cnf(c_0_52,plain,
( n0 = n2
| n0 = n1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_53,plain,
~ less(n2,n1),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,plain,
( ~ less(X2,X1)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_55,plain,
n0 = n1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_56,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_54]) ).
cnf(c_0_57,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_55]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR016+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.56 % Computer : n016.cluster.edu
% 0.10/0.56 % Model : x86_64 x86_64
% 0.10/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.56 % Memory : 8046.5625MB
% 0.10/0.56 % OS : Linux 6.8.0-71-generic
% 0.10/0.56 % CPULimit : 300
% 0.10/0.56 % WCLimit : 300
% 0.10/0.56 % DateTime : Mon Sep 21 14:28:53 UTC 2026
% 0.10/0.57 % CPUTime :
% 0.10/0.57 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.60 Running first-order theorem proving
% 0.14/0.60 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.14/0.64 % Version: 3.5.1
% 0.14/0.64 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.64 % Starting sh5l with 300s (1) cores
% 0.14/0.64 % new_bool_3 with pid 2662338 completed with status 0
% 0.14/0.64 % Result found by new_bool_3
% 0.14/0.64 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.64 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.64 % Search class: FGHSF-FSLM22-SFFFFFNN
% 0.14/0.64 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.64 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.64 % SubtermCWHack with pid 2662341 completed with status 0
% 0.14/0.64 % Result found by SubtermCWHack
% 0.14/0.64 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.64 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.64 % Search class: FGHSF-FSLM22-SFFFFFNN
% 0.14/0.64 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.64 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.64 % Preprocessing time : 0.002 s
% 0.14/0.64
% 0.14/0.64 % Proof found!
% 0.14/0.64 % SZS status Theorem
% 0.14/0.64 % SZS output start CNFRefutation
% See solution above
% 0.14/0.64 % Parsed axioms : 48
% 0.14/0.64 % Removed by relevancy pruning/SinE : 17
% 0.14/0.64 % Initial clauses : 154
% 0.14/0.64 % Removed in clause preprocessing : 9
% 0.14/0.64 % Initial clauses in saturation : 145
% 0.14/0.64 % Processed clauses : 185
% 0.14/0.64 % ...of these trivial : 0
% 0.14/0.64 % ...subsumed : 68
% 0.14/0.64 % ...remaining for further processing : 117
% 0.14/0.64 % Other redundant clauses eliminated : 18
% 0.14/0.64 % Clauses deleted for lack of memory : 0
% 0.14/0.64 % Backward-subsumed : 0
% 0.14/0.64 % Backward-rewritten : 26
% 0.14/0.64 % Generated clauses : 180
% 0.14/0.64 % ...of the previous two non-redundant : 148
% 0.14/0.64 % ...aggressively subsumed : 0
% 0.14/0.64 % Contextual simplify-reflections : 0
% 0.14/0.64 % Paramodulations : 167
% 0.14/0.64 % Factorizations : 3
% 0.14/0.64 % NegExts : 0
% 0.14/0.64 % Equation resolutions : 18
% 0.14/0.64 % Disequality decompositions : 0
% 0.14/0.64 % Total rewrite steps : 63
% 0.14/0.64 % ...of those cached : 47
% 0.14/0.64 % Propositional unsat checks : 0
% 0.14/0.64 % Propositional check models : 0
% 0.14/0.64 % Propositional check unsatisfiable : 0
% 0.14/0.64 % Propositional clauses : 0
% 0.14/0.64 % Propositional clauses after purity: 0
% 0.14/0.64 % Propositional unsat core size : 0
% 0.14/0.64 % Propositional preprocessing time : 0.000
% 0.14/0.64 % Propositional encoding time : 0.000
% 0.14/0.64 % Propositional solver time : 0.000
% 0.14/0.64 % Success case prop preproc time : 0.000
% 0.14/0.64 % Success case prop encoding time : 0.000
% 0.14/0.64 % Success case prop solver time : 0.000
% 0.14/0.64 % Current number of processed clauses : 81
% 0.14/0.64 % Positive orientable unit clauses : 9
% 0.14/0.64 % Positive unorientable unit clauses: 1
% 0.14/0.64 % Negative unit clauses : 10
% 0.14/0.64 % Non-unit-clauses : 61
% 0.14/0.64 % Current number of unprocessed clauses: 99
% 0.14/0.64 % ...number of literals in the above : 392
% 0.14/0.64 % Current number of archived formulas : 0
% 0.14/0.64 % Current number of archived clauses : 26
% 0.14/0.64 % Clause-clause subsumption calls (NU) : 744
% 0.14/0.64 % Rec. Clause-clause subsumption calls : 515
% 0.14/0.64 % Non-unit clause-clause subsumptions : 47
% 0.14/0.64 % Unit Clause-clause subsumption calls : 10
% 0.14/0.64 % Rewrite failures with RHS unbound : 0
% 0.14/0.64 % BW rewrite match attempts : 13
% 0.14/0.64 % BW rewrite match successes : 13
% 0.14/0.64 % Condensation attempts : 0
% 0.14/0.64 % Condensation successes : 0
% 0.14/0.64 % Termbank termtop insertions : 8355
% 0.14/0.64 % Search garbage collected termcells : 1353
% 0.14/0.64
% 0.14/0.64 % -------------------------------------------------
% 0.14/0.64 % User time : 0.014 s
% 0.14/0.64 % System time : 0.005 s
% 0.14/0.64 % Total time : 0.019 s
% 0.14/0.64 % Maximum resident set size: 3940 pages
% 0.14/0.64
% 0.14/0.64 % -------------------------------------------------
% 0.14/0.64 % User time : 0.015 s
% 0.14/0.64 % System time : 0.010 s
% 0.14/0.64 % Total time : 0.026 s
% 0.14/0.64 % Maximum resident set size: 4864 pages
% 0.14/0.64 % E exiting
%------------------------------------------------------------------------------