%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR106+4 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:16:55 PM UTC 2026
% Result : Theorem 52.23s 8.01s
% Output : CNFRefutation 52.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of formulae : 53 ( 23 unt; 0 def)
% Number of atoms : 167 ( 26 equ)
% Maximal formula atoms : 45 ( 3 avg)
% Number of connectives : 183 ( 69 ~; 76 |; 26 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 10 con; 0-3 aty)
% Number of variables : 86 ( 29 sgn 34 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_SUMO,conjecture,
~ s__before(s__TimePoint37_2,s__TimePoint37_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_SUMO) ).
fof(kb_SUMO_3496,axiom,
! [X171,X172,X173] :
( X172 = s__UnionFn(X173,X171)
<=> ! [X174,X175,X176] :
( ( s__instance(X171,s__SetOrClass)
& s__instance(X172,s__SetOrClass)
& s__instance(X173,s__SetOrClass) )
=> ( ( s__instance(X176,X172)
& s__instance(X175,X171)
& s__instance(X174,X173) )
=> ( ( s__instance(X176,X171)
| s__instance(X176,X173) )
& s__instance(X175,X172)
& s__instance(X174,X172) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3496) ).
fof(kb_SUMO_1012,axiom,
! [X48] :
( s__instance(X48,s__TimePoint)
=> ~ s__before(X48,X48) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_1012) ).
fof(kb_SUMO_3533,axiom,
! [X168] :
( s__instance(X168,s__SetOrClass)
=> ( s__instance(X168,s__NullSet)
=> ~ ? [X48] : s__instance(X48,X168) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3533) ).
fof(local_4,axiom,
s__instance(s__TimePoint37_1,s__TimePoint),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_4) ).
fof(kb_SUMO_276,axiom,
! [X9,X10] :
( s__disjoint(X9,X10)
<=> ! [X48] :
( ( s__instance(X9,s__SetOrClass)
& s__instance(X10,s__SetOrClass) )
=> ~ ( s__instance(X48,X10)
& s__instance(X48,X9) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_276) ).
fof(kb_SUMO_1459,axiom,
s__disjoint(s__ObjectAttitude,s__PropositionalAttitude),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_1459) ).
fof(kb_SUMO_1476,axiom,
s__instance(s__wants__m,s__ObjectAttitude),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_1476) ).
fof(kb_SUMO_3489,axiom,
! [X169,X170] :
( ! [X49] :
( ( s__instance(X169,s__Set)
& s__instance(X170,s__Set) )
=> ( s__element(X49,X170)
<=> s__element(X49,X169) ) )
=> X170 = X169 ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3489) ).
fof(kb_SUMO_1506,axiom,
s__instance(s__knows__m,s__PropositionalAttitude),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_1506) ).
fof(local_5,axiom,
s__instance(s__TimePoint37_2,s__TimePoint),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_5) ).
fof(c_0_11,negated_conjecture,
~ ~ s__before(s__TimePoint37_2,s__TimePoint37_1),
inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).
fof(c_0_12,plain,
! [X6422,X6423,X6424,X6425,X6426,X6427,X6428,X6429,X6430] :
( ( X6429 = s__UnionFn(X6430,X6428)
| ~ s__instance(esk159_3(X6428,X6429,X6430),X6429)
| ~ s__instance(esk158_3(X6428,X6429,X6430),X6429)
| ~ s__instance(esk160_3(X6428,X6429,X6430),X6428) )
& ( X6429 = s__UnionFn(X6430,X6428)
| ~ s__instance(esk159_3(X6428,X6429,X6430),X6429)
| ~ s__instance(esk158_3(X6428,X6429,X6430),X6429)
| ~ s__instance(esk160_3(X6428,X6429,X6430),X6430) )
& ( X6429 = s__UnionFn(X6430,X6428)
| s__instance(esk160_3(X6428,X6429,X6430),X6429) )
& ( X6429 = s__UnionFn(X6430,X6428)
| s__instance(esk159_3(X6428,X6429,X6430),X6428) )
& ( X6429 = s__UnionFn(X6430,X6428)
| s__instance(esk158_3(X6428,X6429,X6430),X6430) )
& ( X6429 = s__UnionFn(X6430,X6428)
| s__instance(X6428,s__SetOrClass) )
& ( X6429 = s__UnionFn(X6430,X6428)
| s__instance(X6429,s__SetOrClass) )
& ( X6429 = s__UnionFn(X6430,X6428)
| s__instance(X6430,s__SetOrClass) )
& ( X6423 != s__UnionFn(X6424,X6422)
| ~ s__instance(X6422,s__SetOrClass)
| ~ s__instance(X6423,s__SetOrClass)
| ~ s__instance(X6424,s__SetOrClass)
| ~ s__instance(X6427,X6423)
| ~ s__instance(X6426,X6422)
| ~ s__instance(X6425,X6424)
| s__instance(X6427,X6422)
| s__instance(X6427,X6424) )
& ( X6423 != s__UnionFn(X6424,X6422)
| ~ s__instance(X6422,s__SetOrClass)
| ~ s__instance(X6423,s__SetOrClass)
| ~ s__instance(X6424,s__SetOrClass)
| ~ s__instance(X6427,X6423)
| ~ s__instance(X6426,X6422)
| ~ s__instance(X6425,X6424)
| s__instance(X6426,X6423) )
& ( X6423 != s__UnionFn(X6424,X6422)
| ~ s__instance(X6422,s__SetOrClass)
| ~ s__instance(X6423,s__SetOrClass)
| ~ s__instance(X6424,s__SetOrClass)
| ~ s__instance(X6427,X6423)
| ~ s__instance(X6426,X6422)
| ~ s__instance(X6425,X6424)
| s__instance(X6425,X6423) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3496])])])])])])]) ).
fof(c_0_13,plain,
! [X48] :
( s__instance(X48,s__TimePoint)
=> ~ s__before(X48,X48) ),
inference(fof_simplification,[status(thm)],[kb_SUMO_1012]) ).
fof(c_0_14,negated_conjecture,
s__before(s__TimePoint37_2,s__TimePoint37_1),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( X2 = s__UnionFn(X3,X1)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X2587] :
( ~ s__before(X2587,X2587)
| ~ s__instance(X2587,s__TimePoint) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
cnf(c_0_17,negated_conjecture,
s__before(s__TimePoint37_2,s__TimePoint37_1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( s__instance(X3,s__SetOrClass)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_15,c_0_15]) ).
fof(c_0_19,plain,
! [X6434,X6435] :
( ~ s__instance(X6435,X6434)
| ~ s__instance(X6434,s__NullSet)
| ~ s__instance(X6434,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3533])])])]) ).
cnf(c_0_20,plain,
( ~ s__before(X1,X1)
| ~ s__instance(X1,s__TimePoint) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( s__instance(X2,s__SetOrClass)
| s__before(X1,s__TimePoint37_1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
s__instance(s__TimePoint37_1,s__TimePoint),
inference(split_conjunct,[status(thm)],[local_4]) ).
fof(c_0_23,plain,
! [X1512,X1513,X1514,X1515,X1516] :
( ( s__disjoint(X1515,X1516)
| s__instance(esk1_2(X1515,X1516),X1516) )
& ( s__disjoint(X1515,X1516)
| s__instance(esk1_2(X1515,X1516),X1515) )
& ( s__disjoint(X1515,X1516)
| s__instance(X1515,s__SetOrClass) )
& ( s__disjoint(X1515,X1516)
| s__instance(X1516,s__SetOrClass) )
& ( ~ s__instance(X1514,X1513)
| ~ s__instance(X1514,X1512)
| ~ s__instance(X1512,s__SetOrClass)
| ~ s__instance(X1513,s__SetOrClass)
| ~ s__disjoint(X1512,X1513) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_276])])])])])])]) ).
cnf(c_0_24,plain,
( ~ s__instance(X2,X1)
| ~ s__instance(X1,s__NullSet)
| ~ s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
s__instance(X1,s__SetOrClass),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_26,plain,
( ~ s__instance(X3,X2)
| ~ s__instance(X3,X1)
| ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,plain,
( ~ s__instance(X2,X1)
| ~ s__instance(X1,s__NullSet) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_28,plain,
( s__disjoint(X1,X2)
| s__instance(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
( ~ s__instance(X3,X1)
| ~ s__instance(X3,X2)
| ~ s__disjoint(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_25]),c_0_25])]) ).
cnf(c_0_30,plain,
s__disjoint(s__ObjectAttitude,s__PropositionalAttitude),
inference(split_conjunct,[status(thm)],[kb_SUMO_1459]) ).
cnf(c_0_31,plain,
( ~ s__instance(X2,esk1_2(s__NullSet,X1))
| s__disjoint(s__NullSet,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( X2 = s__UnionFn(X3,X1)
| s__instance(esk158_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_33,plain,
( ~ s__instance(X1,s__ObjectAttitude)
| ~ s__instance(X1,s__PropositionalAttitude) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
s__instance(s__wants__m,s__ObjectAttitude),
inference(split_conjunct,[status(thm)],[kb_SUMO_1476]) ).
cnf(c_0_35,plain,
( s__disjoint(s__NullSet,X2)
| X1 = s__UnionFn(esk1_2(s__NullSet,X2),X3) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
~ s__instance(s__wants__m,s__PropositionalAttitude),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( s__disjoint(s__NullSet,X3)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_35,c_0_35]) ).
fof(c_0_38,plain,
! [X6419,X6420] :
( ( X6420 = X6419
| s__element(esk157_2(X6419,X6420),X6419)
| s__element(esk157_2(X6419,X6420),X6420) )
& ( X6420 = X6419
| ~ s__element(esk157_2(X6419,X6420),X6419)
| ~ s__element(esk157_2(X6419,X6420),X6420) )
& ( X6420 = X6419
| s__instance(X6419,s__Set) )
& ( X6420 = X6419
| s__instance(X6420,s__Set) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3489])])])])])]) ).
cnf(c_0_39,plain,
( ~ s__instance(X2,s__PropositionalAttitude)
| s__disjoint(s__NullSet,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
s__instance(s__knows__m,s__PropositionalAttitude),
inference(split_conjunct,[status(thm)],[kb_SUMO_1506]) ).
cnf(c_0_41,plain,
( X2 = X1
| s__instance(X1,s__Set) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_42,plain,
s__disjoint(s__NullSet,X1),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( s__instance(s__TimePoint37_1,s__Set)
| s__before(s__TimePoint37_2,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_41]) ).
cnf(c_0_44,plain,
s__instance(s__TimePoint37_2,s__TimePoint),
inference(split_conjunct,[status(thm)],[local_5]) ).
cnf(c_0_45,plain,
( ~ s__instance(X1,X2)
| ~ s__instance(X1,s__NullSet) ),
inference(spm,[status(thm)],[c_0_29,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
s__instance(s__TimePoint37_1,s__Set),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_43]),c_0_44])]) ).
cnf(c_0_47,plain,
( ~ s__instance(esk158_3(X2,X1,s__NullSet),X3)
| X1 = s__UnionFn(s__NullSet,X2) ),
inference(spm,[status(thm)],[c_0_45,c_0_32]) ).
cnf(c_0_48,negated_conjecture,
s__instance(X1,s__Set),
inference(spm,[status(thm)],[c_0_46,c_0_41]) ).
cnf(c_0_49,negated_conjecture,
X1 = s__UnionFn(s__NullSet,X2),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_50,negated_conjecture,
X1 = X2,
inference(spm,[status(thm)],[c_0_49,c_0_49]) ).
cnf(c_0_51,negated_conjecture,
s__before(X1,s__TimePoint37_1),
inference(spm,[status(thm)],[c_0_17,c_0_50]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_51]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : CSR106+4 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 % Computer : n007.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.45 % CPULimit : 300
% 0.17/0.45 % WCLimit : 300
% 0.17/0.45 % DateTime : Mon Sep 21 14:58:05 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.52 Running first-order theorem proving
% 0.26/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
% 52.23/8.01 % Version: 3.5.1
% 52.23/8.01 % Preprocessing class: FMLLSMSLSSSNFFN.
% 52.23/8.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 52.23/8.01 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 52.23/8.01 % Starting new_bool_3 with 300s (1) cores
% 52.23/8.01 % Starting new_bool_1 with 300s (1) cores
% 52.23/8.01 % Starting sh5l with 300s (1) cores
% 52.23/8.01 % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 1360823 completed with status 0
% 52.23/8.01 % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 52.23/8.01 % Preprocessing class: FMLLSMSLSSSNFFN.
% 52.23/8.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 52.23/8.01 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 52.23/8.01 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 52.23/8.01 % No SInE strategy applied
% 52.23/8.01 % Search class: FGHSM-SMLM31-MFFFFFNN
% 52.23/8.01 % Scheduled 7 strats onto 5 cores with 1499 seconds (1499 total)
% 52.23/8.01 % Starting SubtermCWHack with 135s (1) cores
% 52.23/8.01 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 150s (1) cores
% 52.23/8.01 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 135s (1) cores
% 52.23/8.01 % Starting new_bool_3 with 135s (1) cores
% 52.23/8.01 % Starting new_bool_1 with 135s (1) cores
% 52.23/8.01 % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 1360831 completed with status 0
% 52.23/8.01 % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 52.23/8.01 % Preprocessing class: FMLLSMSLSSSNFFN.
% 52.23/8.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 52.23/8.01 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 52.23/8.01 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 52.23/8.01 % No SInE strategy applied
% 52.23/8.01 % Search class: FGHSM-SMLM31-MFFFFFNN
% 52.23/8.01 % Scheduled 7 strats onto 5 cores with 1499 seconds (1499 total)
% 52.23/8.01 % Starting SubtermCWHack with 135s (1) cores
% 52.23/8.01 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 150s (1) cores
% 52.23/8.01 % Preprocessing time : 0.171 s
% 52.23/8.01 % Presaturation interreduction done
% 52.23/8.01
% 52.23/8.01 % Proof found!
% 52.23/8.01 % SZS status Theorem
% 52.23/8.01 % SZS output start CNFRefutation
% See solution above
% 52.23/8.01 % Parsed axioms : 7225
% 52.23/8.01 % Removed by relevancy pruning/SinE : 0
% 52.23/8.01 % Initial clauses : 8416
% 52.23/8.01 % Removed in clause preprocessing : 63
% 52.23/8.01 % Initial clauses in saturation : 8353
% 52.23/8.01 % Processed clauses : 17382
% 52.23/8.01 % ...of these trivial : 924
% 52.23/8.01 % ...subsumed : 250
% 52.23/8.01 % ...remaining for further processing : 16208
% 52.23/8.01 % Other redundant clauses eliminated : 63
% 52.23/8.01 % Clauses deleted for lack of memory : 0
% 52.23/8.01 % Backward-subsumed : 1086
% 52.23/8.01 % Backward-rewritten : 1427
% 52.23/8.01 % Generated clauses : 159534
% 52.23/8.01 % ...of the previous two non-redundant : 155620
% 52.23/8.01 % ...aggressively subsumed : 0
% 52.23/8.01 % Contextual simplify-reflections : 664
% 52.23/8.01 % Paramodulations : 159422
% 52.23/8.01 % Factorizations : 1
% 52.23/8.01 % NegExts : 0
% 52.23/8.01 % Equation resolutions : 78
% 52.23/8.01 % Disequality decompositions : 0
% 52.23/8.01 % Total rewrite steps : 6456
% 52.23/8.01 % ...of those cached : 3345
% 52.23/8.01 % Propositional unsat checks : 0
% 52.23/8.01 % Propositional check models : 0
% 52.23/8.01 % Propositional check unsatisfiable : 0
% 52.23/8.01 % Propositional clauses : 0
% 52.23/8.01 % Propositional clauses after purity: 0
% 52.23/8.01 % Propositional unsat core size : 0
% 52.23/8.01 % Propositional preprocessing time : 0.000
% 52.23/8.01 % Propositional encoding time : 0.000
% 52.23/8.01 % Propositional solver time : 0.000
% 52.23/8.01 % Success case prop preproc time : 0.000
% 52.23/8.01 % Success case prop encoding time : 0.000
% 52.23/8.01 % Success case prop solver time : 0.000
% 52.23/8.01 % Current number of processed clauses : 5497
% 52.23/8.01 % Positive orientable unit clauses : 3950
% 52.23/8.01 % Positive unorientable unit clauses: 1
% 52.23/8.01 % Negative unit clauses : 14
% 52.23/8.01 % Non-unit-clauses : 1532
% 52.23/8.01 % Current number of unprocessed clauses: 137039
% 52.23/8.01 % ...number of literals in the above : 277721
% 52.23/8.01 % Current number of archived formulas : 0
% 52.23/8.01 % Current number of archived clauses : 10703
% 52.23/8.01 % Clause-clause subsumption calls (NU) : 3239885
% 52.23/8.01 % Rec. Clause-clause subsumption calls : 931335
% 52.23/8.01 % Non-unit clause-clause subsumptions : 922
% 52.23/8.01 % Unit Clause-clause subsumption calls : 238486
% 52.23/8.01 % Rewrite failures with RHS unbound : 10135
% 52.23/8.01 % BW rewrite match attempts : 33519
% 52.23/8.01 % BW rewrite match successes : 11064
% 52.23/8.01 % Condensation attempts : 0
% 52.23/8.01 % Condensation successes : 0
% 52.23/8.01 % Termbank termtop insertions : 1460266
% 52.23/8.01 % Search garbage collected termcells : 89722
% 52.23/8.01
% 52.23/8.01 % -------------------------------------------------
% 52.23/8.01 % User time : 6.695 s
% 52.23/8.01 % System time : 0.315 s
% 52.23/8.01 % Total time : 7.010 s
% 52.23/8.01 % Maximum resident set size: 31792 pages
% 52.23/8.01
% 52.23/8.01 % -------------------------------------------------
% 52.23/8.01 % User time : 29.336 s
% 52.23/8.01 % System time : 1.156 s
% 52.23/8.01 % Total time : 30.492 s
% 52.23/8.01 % Maximum resident set size: 12032 pages
% 52.23/8.01 % E exiting
%------------------------------------------------------------------------------