%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR021+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 : n020.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.23s 0.60s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 12 unt; 0 def)
% Number of atoms : 361 ( 187 equ)
% Maximal formula atoms : 149 ( 10 avg)
% Number of connectives : 446 ( 118 ~; 228 |; 92 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn 38 !; 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(symmetry_of_plus,axiom,
! [X9,X10] : plus(X9,X10) = plus(X10,X9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_plus) ).
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(not_backwards_3,conjecture,
~ holdsAt(backwards,n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_backwards_3) ).
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] :
( 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_7,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_8,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_9,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_6,c_0_7]) ).
fof(c_0_10,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_8])])]) ).
fof(c_0_11,plain,
! [X76,X77] : plus(X76,X77) = plus(X77,X76),
inference(variable_rename,[status(thm)],[symmetry_of_plus]) ).
fof(c_0_12,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_6]) ).
fof(c_0_13,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_9])])])]) ).
cnf(c_0_14,plain,
( ~ holdsAt(X3,plus(X2,n1))
| ~ terminates(X1,X3,X2)
| ~ happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,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_12])])]) ).
cnf(c_0_17,plain,
( ~ happens(push,X3)
| X2 != backwards
| X1 != pull
| epred3_3(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,negated_conjecture,
~ ~ holdsAt(backwards,n3),
inference(assume_negation,[status(cth)],[not_backwards_3]) ).
fof(c_0_19,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])])])]) ).
cnf(c_0_20,plain,
( ~ happens(X3,X2)
| ~ terminates(X3,X1,X2)
| ~ holdsAt(X1,plus(n1,X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
plus(n1,n2) = n3,
inference(split_conjunct,[status(thm)],[plus1_2]) ).
cnf(c_0_22,plain,
( ~ epred3_3(X1,X2,X3)
| terminates(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( ~ happens(push,X1)
| epred3_3(X1,pull,backwards) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_17])]) ).
fof(c_0_24,negated_conjecture,
holdsAt(backwards,n3),
inference(fof_simplification,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( X2 != n2
| X1 != pull
| happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( X2 != n2
| X1 != push
| happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( ~ happens(X2,n2)
| ~ terminates(X2,X1,n2)
| ~ holdsAt(X1,n3) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( ~ happens(push,X1)
| terminates(pull,backwards,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
holdsAt(backwards,n3),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
happens(pull,n2),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_25])]) ).
cnf(c_0_31,plain,
happens(push,n2),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_26])]) ).
cnf(c_0_32,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : CSR021+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n020.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 14:25:17 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 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.23/0.60 % Version: 3.5.1
% 0.23/0.60 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.60 % Starting sh5l with 300s (1) cores
% 0.23/0.60 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3169193 completed with status 0
% 0.23/0.60 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.23/0.60 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.60 % No SInE strategy applied
% 0.23/0.60 % Search class: FGHSF-FSLM32-SFFFFFNN
% 0.23/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/0.60 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.23/0.60 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.60 % Starting U----_116_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN1 with 136s (1) cores
% 0.23/0.60 % U----_116_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN1 with pid 3169201 completed with status 0
% 0.23/0.60 % Result found by U----_116_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN1
% 0.23/0.60 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.60 % No SInE strategy applied
% 0.23/0.60 % Search class: FGHSF-FSLM32-SFFFFFNN
% 0.23/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/0.60 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.23/0.60 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.60 % Starting U----_116_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN1 with 136s (1) cores
% 0.23/0.60 % Preprocessing time : 0.002 s
% 0.23/0.60 % Presaturation interreduction done
% 0.23/0.60
% 0.23/0.60 % Proof found!
% 0.23/0.60 % SZS status Theorem
% 0.23/0.60 % SZS output start CNFRefutation
% See solution above
% 0.23/0.60 % Parsed axioms : 48
% 0.23/0.60 % Removed by relevancy pruning/SinE : 0
% 0.23/0.60 % Initial clauses : 186
% 0.23/0.60 % Removed in clause preprocessing : 9
% 0.23/0.60 % Initial clauses in saturation : 177
% 0.23/0.60 % Processed clauses : 331
% 0.23/0.60 % ...of these trivial : 0
% 0.23/0.60 % ...subsumed : 83
% 0.23/0.60 % ...remaining for further processing : 248
% 0.23/0.60 % Other redundant clauses eliminated : 28
% 0.23/0.60 % Clauses deleted for lack of memory : 0
% 0.23/0.60 % Backward-subsumed : 1
% 0.23/0.60 % Backward-rewritten : 0
% 0.23/0.60 % Generated clauses : 135
% 0.23/0.60 % ...of the previous two non-redundant : 115
% 0.23/0.60 % ...aggressively subsumed : 0
% 0.23/0.60 % Contextual simplify-reflections : 3
% 0.23/0.60 % Paramodulations : 120
% 0.23/0.60 % Factorizations : 0
% 0.23/0.60 % NegExts : 0
% 0.23/0.60 % Equation resolutions : 28
% 0.23/0.60 % Disequality decompositions : 0
% 0.23/0.60 % Total rewrite steps : 19
% 0.23/0.60 % ...of those cached : 7
% 0.23/0.60 % Propositional unsat checks : 0
% 0.23/0.60 % Propositional check models : 0
% 0.23/0.60 % Propositional check unsatisfiable : 0
% 0.23/0.60 % Propositional clauses : 0
% 0.23/0.60 % Propositional clauses after purity: 0
% 0.23/0.60 % Propositional unsat core size : 0
% 0.23/0.60 % Propositional preprocessing time : 0.000
% 0.23/0.60 % Propositional encoding time : 0.000
% 0.23/0.60 % Propositional solver time : 0.000
% 0.23/0.60 % Success case prop preproc time : 0.000
% 0.23/0.60 % Success case prop encoding time : 0.000
% 0.23/0.60 % Success case prop solver time : 0.000
% 0.23/0.60 % Current number of processed clauses : 122
% 0.23/0.60 % Positive orientable unit clauses : 26
% 0.23/0.60 % Positive unorientable unit clauses: 1
% 0.23/0.60 % Negative unit clauses : 47
% 0.23/0.60 % Non-unit-clauses : 48
% 0.23/0.60 % Current number of unprocessed clauses: 68
% 0.23/0.60 % ...number of literals in the above : 204
% 0.23/0.60 % Current number of archived formulas : 0
% 0.23/0.60 % Current number of archived clauses : 111
% 0.23/0.60 % Clause-clause subsumption calls (NU) : 1201
% 0.23/0.60 % Rec. Clause-clause subsumption calls : 729
% 0.23/0.60 % Non-unit clause-clause subsumptions : 66
% 0.23/0.60 % Unit Clause-clause subsumption calls : 844
% 0.23/0.60 % Rewrite failures with RHS unbound : 0
% 0.23/0.60 % BW rewrite match attempts : 45
% 0.23/0.60 % BW rewrite match successes : 45
% 0.23/0.60 % Condensation attempts : 0
% 0.23/0.60 % Condensation successes : 0
% 0.23/0.60 % Termbank termtop insertions : 9739
% 0.23/0.60 % Search garbage collected termcells : 1706
% 0.23/0.60
% 0.23/0.60 % -------------------------------------------------
% 0.23/0.60 % User time : 0.020 s
% 0.23/0.60 % System time : 0.004 s
% 0.23/0.60 % Total time : 0.023 s
% 0.23/0.60 % Maximum resident set size: 3684 pages
% 0.23/0.60
% 0.23/0.60 % -------------------------------------------------
% 0.23/0.60 % User time : 0.072 s
% 0.23/0.60 % System time : 0.023 s
% 0.23/0.60 % Total time : 0.095 s
% 0.23/0.60 % Maximum resident set size: 4608 pages
% 0.23/0.60 % E exiting
%------------------------------------------------------------------------------