%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL650+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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 01:21:41 PM UTC 2026
% Result : Theorem 0.45s 0.58s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 36 ( 6 unt; 0 def)
% Number of atoms : 310 ( 0 equ)
% Maximal formula atoms : 64 ( 8 avg)
% Number of connectives : 538 ( 264 ~; 217 |; 57 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 135 ( 1 sgn 69 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X1] :
~ ( ! [X2] :
( ! [X1] :
( ! [X2] :
( ! [X1] :
( ( p1(X1)
& p2(X1)
& p3(X1)
& p4(X1) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ( ~ ! [X1] :
( ~ ( ~ ! [X2] :
( ~ ~ ! [X1] :
( ~ ( ( p1(X1)
& p2(X1) )
| ( ~ p2(X1)
& ~ p1(X1) ) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ! [X2] :
( p3(X2)
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ! [X1] :
( ~ ( ( p2(X1)
& p3(X1) )
| ( ~ p3(X1)
& ~ p2(X1) ) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) ) )
| ~ r1(X2,X1) )
| ! [X1] :
( p4(X1)
| ~ r1(X2,X1) )
| ~ ! [X1] :
( ! [X2] :
( ! [X1] :
( ~ ( ( p3(X1)
& p1(X1) )
| ( ~ p1(X1)
& ~ p3(X1) ) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
| ! [X2] :
( p5(X2)
| ~ r1(X1,X2) )
| ! [X2] :
( ! [X1] :
( ! [X2] :
( ! [X1] :
( ( ~ p2(X1)
& ~ p4(X1)
& ~ p6(X1)
& ~ p8(X1) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
fof(c_0_1,negated_conjecture,
~ ~ ? [X1] :
~ ( ! [X2] :
( ! [X1] :
( ! [X2] :
( ! [X1] :
( ( p1(X1)
& p2(X1)
& p3(X1)
& p4(X1) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ( ~ ! [X1] :
( ~ ( ~ ! [X2] :
( ~ ~ ! [X1] :
( ~ ( ( p1(X1)
& p2(X1) )
| ( ~ p2(X1)
& ~ p1(X1) ) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ! [X2] :
( p3(X2)
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ! [X1] :
( ~ ( ( p2(X1)
& p3(X1) )
| ( ~ p3(X1)
& ~ p2(X1) ) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) ) )
| ~ r1(X2,X1) )
| ! [X1] :
( p4(X1)
| ~ r1(X2,X1) )
| ~ ! [X1] :
( ! [X2] :
( ! [X1] :
( ~ ( ( p3(X1)
& p1(X1) )
| ( ~ p1(X1)
& ~ p3(X1) ) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
| ! [X2] :
( p5(X2)
| ~ r1(X1,X2) )
| ! [X2] :
( ! [X1] :
( ! [X2] :
( ! [X1] :
( ( ~ p2(X1)
& ~ p4(X1)
& ~ p6(X1)
& ~ p8(X1) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) ) ),
inference(assume_negation,[status(cth)],[main]) ).
fof(c_0_2,negated_conjecture,
~ ~ ? [X1] :
~ ( ! [X2] :
( ! [X1] :
( ! [X2] :
( ! [X1] :
( ( p1(X1)
& p2(X1)
& p3(X1)
& p4(X1) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ~ ( ~ ! [X1] :
( ~ ( ~ ! [X2] :
( ~ ~ ! [X1] :
( ~ ( ( p1(X1)
& p2(X1) )
| ( ~ p2(X1)
& ~ p1(X1) ) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ! [X2] :
( p3(X2)
| ~ r1(X1,X2) )
| ~ ! [X2] :
( ! [X1] :
( ~ ( ( p2(X1)
& p3(X1) )
| ( ~ p3(X1)
& ~ p2(X1) ) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) ) )
| ~ r1(X2,X1) )
| ! [X1] :
( p4(X1)
| ~ r1(X2,X1) )
| ~ ! [X1] :
( ! [X2] :
( ! [X1] :
( ~ ( ( p3(X1)
& p1(X1) )
| ( ~ p1(X1)
& ~ p3(X1) ) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ r1(X2,X1) ) )
| ~ r1(X1,X2) )
| ! [X2] :
( p5(X2)
| ~ r1(X1,X2) )
| ! [X2] :
( ! [X1] :
( ! [X2] :
( ! [X1] :
( ( ~ p2(X1)
& ~ p4(X1)
& ~ p6(X1)
& ~ p8(X1) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
! [X9,X10,X11,X12,X14,X15,X16,X18,X19] :
( ( ~ p1(esk12_0)
| ~ p2(esk12_0)
| ~ p3(esk12_0)
| ~ p4(esk12_0) )
& r1(esk11_0,esk12_0)
& r1(esk10_0,esk11_0)
& r1(esk9_0,esk10_0)
& r1(esk1_0,esk9_0)
& ( ~ r1(esk1_0,X9)
| ~ r1(X9,X14)
| ~ r1(X14,X18)
| ~ r1(X18,X19)
| ~ p1(X19)
| ~ p2(X19) )
& ( ~ r1(esk1_0,X9)
| ~ r1(X9,X14)
| ~ r1(X14,X18)
| ~ r1(X18,X19)
| p2(X19)
| p1(X19) )
& ( ~ r1(esk1_0,X9)
| ~ r1(X9,X14)
| ~ p3(esk8_2(X9,X14)) )
& ( ~ r1(esk1_0,X9)
| ~ r1(X9,X14)
| r1(X14,esk8_2(X9,X14)) )
& ( ~ r1(esk1_0,X9)
| ~ r1(X9,X14)
| ~ r1(X14,X15)
| ~ r1(X15,X16)
| ~ p2(X16)
| ~ p3(X16) )
& ( ~ r1(esk1_0,X9)
| ~ r1(X9,X14)
| ~ r1(X14,X15)
| ~ r1(X15,X16)
| p3(X16)
| p2(X16) )
& ( ~ r1(esk1_0,X9)
| ~ p4(esk7_1(X9)) )
& ( ~ r1(esk1_0,X9)
| r1(X9,esk7_1(X9)) )
& ( ~ r1(esk1_0,X9)
| ~ r1(X9,X10)
| ~ r1(X10,X11)
| ~ r1(X11,X12)
| ~ p3(X12)
| ~ p1(X12) )
& ( ~ r1(esk1_0,X9)
| ~ r1(X9,X10)
| ~ r1(X10,X11)
| ~ r1(X11,X12)
| p1(X12)
| p3(X12) )
& ~ p5(esk6_0)
& r1(esk1_0,esk6_0)
& ( p2(esk5_0)
| p4(esk5_0)
| p6(esk5_0)
| p8(esk5_0) )
& r1(esk4_0,esk5_0)
& r1(esk3_0,esk4_0)
& r1(esk2_0,esk3_0)
& r1(esk1_0,esk2_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])]) ).
cnf(c_0_4,negated_conjecture,
( ~ r1(esk1_0,X4)
| ~ r1(X4,X3)
| ~ r1(X3,X2)
| ~ r1(X2,X1)
| ~ p1(X1)
| ~ p2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
r1(esk1_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( ~ r1(esk1_0,X4)
| ~ r1(X4,X3)
| ~ r1(X3,X2)
| ~ r1(X2,X1)
| p1(X1)
| p3(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
( ~ r1(esk1_0,X4)
| ~ r1(X4,X3)
| ~ r1(X3,X2)
| ~ r1(X2,X1)
| p3(X1)
| p2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
( ~ r1(X3,X1)
| ~ r1(X2,X3)
| ~ r1(esk9_0,X2)
| ~ p2(X1)
| ~ p1(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_9,negated_conjecture,
r1(esk9_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
( ~ r1(X3,X1)
| ~ r1(X2,X3)
| ~ r1(esk9_0,X2)
| p3(X1)
| p1(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_11,negated_conjecture,
( ~ r1(X3,X1)
| ~ r1(X2,X3)
| ~ r1(esk9_0,X2)
| p2(X1)
| p3(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_12,negated_conjecture,
( ~ r1(esk1_0,X4)
| ~ r1(X4,X3)
| ~ r1(X3,X2)
| ~ r1(X2,X1)
| ~ p2(X1)
| ~ p3(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,negated_conjecture,
( ~ r1(esk1_0,X4)
| ~ r1(X4,X3)
| ~ r1(X3,X2)
| ~ r1(X2,X1)
| ~ p3(X1)
| ~ p1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
( ~ r1(X2,X1)
| ~ r1(esk10_0,X2)
| ~ p2(X1)
| ~ p1(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,negated_conjecture,
r1(esk10_0,esk11_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_16,negated_conjecture,
( ~ r1(X2,X1)
| ~ r1(esk10_0,X2)
| p3(X1)
| p1(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( ~ r1(X2,X1)
| ~ r1(esk10_0,X2)
| p2(X1)
| p3(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_18,negated_conjecture,
( ~ r1(esk1_0,X4)
| ~ r1(X4,X3)
| ~ r1(X3,X2)
| ~ r1(X2,X1)
| p2(X1)
| p1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_19,negated_conjecture,
( ~ r1(X3,X1)
| ~ r1(X2,X3)
| ~ r1(esk9_0,X2)
| ~ p2(X1)
| ~ p3(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_5]) ).
cnf(c_0_20,negated_conjecture,
( ~ r1(X3,X1)
| ~ r1(X2,X3)
| ~ r1(esk9_0,X2)
| ~ p3(X1)
| ~ p1(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_5]) ).
cnf(c_0_21,negated_conjecture,
( ~ r1(esk11_0,X1)
| ~ p2(X1)
| ~ p1(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( ~ r1(esk11_0,X1)
| p3(X1)
| p1(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_23,negated_conjecture,
( ~ r1(esk11_0,X1)
| p2(X1)
| p3(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_24,negated_conjecture,
( ~ r1(X3,X1)
| ~ r1(X2,X3)
| ~ r1(esk9_0,X2)
| p2(X1)
| p1(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_5]) ).
cnf(c_0_25,negated_conjecture,
( ~ r1(X2,X1)
| ~ r1(esk10_0,X2)
| ~ p2(X1)
| ~ p3(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_9]) ).
cnf(c_0_26,negated_conjecture,
( ~ r1(X2,X1)
| ~ r1(esk10_0,X2)
| ~ p3(X1)
| ~ p1(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_9]) ).
cnf(c_0_27,negated_conjecture,
( ~ r1(esk11_0,X1)
| p3(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( ~ r1(X2,X1)
| ~ r1(esk10_0,X2)
| p2(X1)
| p1(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_9]) ).
cnf(c_0_29,negated_conjecture,
( ~ r1(esk11_0,X1)
| ~ p2(X1)
| ~ p3(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_15]) ).
cnf(c_0_30,negated_conjecture,
( ~ r1(esk11_0,X1)
| ~ p1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_15]),c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( ~ r1(esk11_0,X1)
| p2(X1)
| p1(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_15]) ).
cnf(c_0_32,negated_conjecture,
( ~ r1(esk11_0,X1)
| ~ p2(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
r1(esk11_0,esk12_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_34,negated_conjecture,
~ r1(esk11_0,X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_33,c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL650+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.40 % Computer : n008.cluster.edu
% 0.16/0.40 % Model : x86_64 x86_64
% 0.16/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.40 % Memory : 8046.5625MB
% 0.16/0.40 % OS : Linux 6.8.0-71-generic
% 0.16/0.40 % CPULimit : 300
% 0.16/0.40 % WCLimit : 300
% 0.16/0.40 % DateTime : Mon Sep 21 00:46:23 UTC 2026
% 0.16/0.41 % CPUTime :
% 0.16/0.41 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.52 Running first-order theorem proving
% 0.20/0.52 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.45/0.58 % Version: 3.5.1
% 0.45/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.45/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.45/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.45/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.45/0.58 % Starting sh5l with 300s (1) cores
% 0.45/0.58 % new_bool_1 with pid 3987375 completed with status 0
% 0.45/0.58 % Result found by new_bool_1
% 0.45/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.45/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.45/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.45/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.45/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.45/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.45/0.58 % Search class: FGHNF-FFSM21-SFFFFFNN
% 0.45/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.45/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.45/0.58 % SubtermCWHack with pid 3987379 completed with status 0
% 0.45/0.58 % Result found by SubtermCWHack
% 0.45/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.45/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.45/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.45/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.45/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.45/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.45/0.58 % Search class: FGHNF-FFSM21-SFFFFFNN
% 0.45/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.45/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.45/0.58 % Preprocessing time : 0.002 s
% 0.45/0.58
% 0.45/0.58 % Proof found!
% 0.45/0.58 % SZS status Theorem
% 0.45/0.58 % SZS output start CNFRefutation
% See solution above
% 0.45/0.58 % Parsed axioms : 1
% 0.45/0.58 % Removed by relevancy pruning/SinE : 0
% 0.45/0.58 % Initial clauses : 22
% 0.45/0.58 % Removed in clause preprocessing : 0
% 0.45/0.58 % Initial clauses in saturation : 22
% 0.45/0.58 % Processed clauses : 118
% 0.45/0.58 % ...of these trivial : 0
% 0.45/0.58 % ...subsumed : 1
% 0.45/0.58 % ...remaining for further processing : 117
% 0.45/0.58 % Other redundant clauses eliminated : 0
% 0.45/0.58 % Clauses deleted for lack of memory : 0
% 0.45/0.58 % Backward-subsumed : 13
% 0.45/0.58 % Backward-rewritten : 0
% 0.45/0.58 % Generated clauses : 217
% 0.45/0.58 % ...of the previous two non-redundant : 206
% 0.45/0.58 % ...aggressively subsumed : 0
% 0.45/0.58 % Contextual simplify-reflections : 4
% 0.45/0.58 % Paramodulations : 216
% 0.45/0.58 % Factorizations : 0
% 0.45/0.58 % NegExts : 0
% 0.45/0.58 % Equation resolutions : 0
% 0.45/0.58 % Disequality decompositions : 0
% 0.45/0.58 % Total rewrite steps : 16
% 0.45/0.58 % ...of those cached : 13
% 0.45/0.58 % Propositional unsat checks : 0
% 0.45/0.58 % Propositional check models : 0
% 0.45/0.58 % Propositional check unsatisfiable : 0
% 0.45/0.58 % Propositional clauses : 0
% 0.45/0.58 % Propositional clauses after purity: 0
% 0.45/0.58 % Propositional unsat core size : 0
% 0.45/0.58 % Propositional preprocessing time : 0.000
% 0.45/0.58 % Propositional encoding time : 0.000
% 0.45/0.58 % Propositional solver time : 0.000
% 0.45/0.58 % Success case prop preproc time : 0.000
% 0.45/0.58 % Success case prop encoding time : 0.000
% 0.45/0.58 % Success case prop solver time : 0.000
% 0.45/0.58 % Current number of processed clauses : 103
% 0.45/0.58 % Positive orientable unit clauses : 8
% 0.45/0.58 % Positive unorientable unit clauses: 0
% 0.45/0.58 % Negative unit clauses : 8
% 0.45/0.58 % Non-unit-clauses : 87
% 0.45/0.58 % Current number of unprocessed clauses: 109
% 0.45/0.58 % ...number of literals in the above : 556
% 0.45/0.58 % Current number of archived formulas : 0
% 0.45/0.58 % Current number of archived clauses : 14
% 0.45/0.58 % Clause-clause subsumption calls (NU) : 2924
% 0.45/0.58 % Rec. Clause-clause subsumption calls : 745
% 0.45/0.58 % Non-unit clause-clause subsumptions : 13
% 0.45/0.58 % Unit Clause-clause subsumption calls : 580
% 0.45/0.58 % Rewrite failures with RHS unbound : 0
% 0.45/0.58 % BW rewrite match attempts : 0
% 0.45/0.58 % BW rewrite match successes : 0
% 0.45/0.58 % Condensation attempts : 0
% 0.45/0.58 % Condensation successes : 0
% 0.45/0.58 % Termbank termtop insertions : 5964
% 0.45/0.58 % Search garbage collected termcells : 417
% 0.45/0.58
% 0.45/0.58 % -------------------------------------------------
% 0.45/0.58 % User time : 0.019 s
% 0.45/0.58 % System time : 0.005 s
% 0.45/0.58 % Total time : 0.025 s
% 0.45/0.58 % Maximum resident set size: 3636 pages
% 0.45/0.58
% 0.45/0.58 % -------------------------------------------------
% 0.45/0.58 % User time : 0.020 s
% 0.45/0.58 % System time : 0.014 s
% 0.45/0.58 % Total time : 0.035 s
% 0.45/0.58 % Maximum resident set size: 4864 pages
% 0.45/0.58 % E exiting
%------------------------------------------------------------------------------