%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR080+4 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:37 PM UTC 2026
% Result : Theorem 23.86s 4.75s
% Output : CNFRefutation 23.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 11
% Syntax : Number of formulae : 53 ( 25 unt; 0 def)
% Number of atoms : 171 ( 25 equ)
% Maximal formula atoms : 45 ( 3 avg)
% Number of connectives : 189 ( 71 ~; 79 |; 27 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-3 aty)
% Number of variables : 86 ( 27 sgn 35 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_SUMO,conjecture,
s__part(s__Object6_1,s__Object6_3),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3496) ).
fof(kb_SUMO_100,axiom,
! [X15,X16] :
( ( s__instance(X15,s__Substance)
& s__instance(X16,s__Substance) )
=> ( s__piece(X15,X16)
=> s__part(X15,X16) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_100) ).
fof(local_5,axiom,
s__piece(s__Object6_2,s__Object6_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_5) ).
fof(local_2,axiom,
s__instance(s__Object6_2,s__Substance),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_2) ).
fof(local_3,axiom,
s__instance(s__Object6_3,s__Substance),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_3) ).
fof(kb_SUMO_3533,axiom,
! [X168] :
( s__instance(X168,s__SetOrClass)
=> ( s__instance(X168,s__NullSet)
=> ~ ? [X48] : s__instance(X48,X168) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3533) ).
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/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_276) ).
fof(local_4,axiom,
s__piece(s__Object6_1,s__Object6_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_4) ).
fof(local_1,axiom,
s__instance(s__Object6_1,s__Substance),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_1) ).
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/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3489) ).
fof(c_0_11,negated_conjecture,
~ s__part(s__Object6_1,s__Object6_3),
inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).
fof(c_0_12,negated_conjecture,
~ s__part(s__Object6_1,s__Object6_3),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_13,negated_conjecture,
~ s__part(s__Object6_1,s__Object6_3),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
fof(c_0_14,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])])])])])])]) ).
cnf(c_0_15,negated_conjecture,
~ s__part(s__Object6_1,s__Object6_3),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
( X2 = s__UnionFn(X3,X1)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X738,X739] :
( s__part(X738,X739)
| ~ s__piece(X738,X739)
| ~ s__instance(X738,s__Substance)
| ~ s__instance(X739,s__Substance) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_100])])]) ).
cnf(c_0_18,negated_conjecture,
( ~ s__part(s__UnionFn(X2,X1),s__Object6_3)
| s__instance(X1,s__SetOrClass) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( ~ s__piece(X2,X1)
| ~ s__instance(X2,s__Substance)
| ~ s__instance(X1,s__Substance)
| s__part(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,plain,
s__piece(s__Object6_2,s__Object6_3),
inference(split_conjunct,[status(thm)],[local_5]) ).
cnf(c_0_21,plain,
s__instance(s__Object6_2,s__Substance),
inference(split_conjunct,[status(thm)],[local_2]) ).
cnf(c_0_22,plain,
s__instance(s__Object6_3,s__Substance),
inference(split_conjunct,[status(thm)],[local_3]) ).
fof(c_0_23,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_24,negated_conjecture,
( ~ s__part(X2,s__Object6_3)
| s__instance(X1,s__SetOrClass) ),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_25,plain,
s__part(s__Object6_2,s__Object6_3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_26,plain,
( ~ s__instance(X2,X1)
| ~ s__instance(X1,s__NullSet)
| ~ s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,negated_conjecture,
s__instance(X1,s__SetOrClass),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_28,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_29,plain,
( ~ s__instance(X2,X1)
| ~ s__instance(X1,s__NullSet) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_30,plain,
( s__disjoint(X1,X2)
| s__instance(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_31,plain,
( ~ s__instance(X2,esk1_2(s__NullSet,X1))
| s__disjoint(s__NullSet,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
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_14]) ).
cnf(c_0_33,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_34,plain,
( s__disjoint(s__NullSet,X3)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_33,c_0_33]) ).
cnf(c_0_35,plain,
s__piece(s__Object6_1,s__Object6_2),
inference(split_conjunct,[status(thm)],[local_4]) ).
cnf(c_0_36,plain,
s__instance(s__Object6_1,s__Substance),
inference(split_conjunct,[status(thm)],[local_1]) ).
fof(c_0_37,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_38,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_28]) ).
cnf(c_0_39,negated_conjecture,
( ~ s__part(s__Object6_1,X2)
| s__disjoint(s__NullSet,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_34]) ).
cnf(c_0_40,plain,
s__part(s__Object6_1,s__Object6_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_35]),c_0_36]),c_0_21])]) ).
cnf(c_0_41,plain,
( X2 = X1
| s__instance(X1,s__Set) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,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_38,c_0_27]),c_0_27])]) ).
cnf(c_0_43,negated_conjecture,
s__disjoint(s__NullSet,X1),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
( ~ s__part(X1,s__Object6_3)
| s__instance(s__Object6_1,s__Set) ),
inference(spm,[status(thm)],[c_0_15,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( ~ s__instance(X1,X2)
| ~ s__instance(X1,s__NullSet) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
s__instance(s__Object6_1,s__Set),
inference(spm,[status(thm)],[c_0_44,c_0_25]) ).
cnf(c_0_47,negated_conjecture,
( ~ 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__part(s__Object6_1,X1),
inference(spm,[status(thm)],[c_0_15,c_0_50]) ).
cnf(c_0_52,plain,
$false,
inference(sr,[status(thm)],[c_0_40,c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR080+4 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n007.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 14:48:06 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 23.86/4.75 % Version: 3.5.1
% 23.86/4.75 % Preprocessing class: FMLLSMSLSSSNFFN.
% 23.86/4.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.86/4.75 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 23.86/4.75 % Starting new_bool_3 with 300s (1) cores
% 23.86/4.75 % Starting new_bool_1 with 300s (1) cores
% 23.86/4.75 % Starting sh5l with 300s (1) cores
% 23.86/4.75 % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 1349190 completed with status 0
% 23.86/4.75 % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 23.86/4.75 % Preprocessing class: FMLLSMSLSSSNFFN.
% 23.86/4.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.86/4.75 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 23.86/4.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 23.86/4.75 % No SInE strategy applied
% 23.86/4.75 % Search class: FGHSM-SMLM31-MFFFFFNN
% 23.86/4.75 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 23.86/4.75 % Starting SubtermCWHack with 136s (1) cores
% 23.86/4.75 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 23.86/4.75 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 23.86/4.75 % Starting new_bool_3 with 136s (1) cores
% 23.86/4.75 % Starting new_bool_1 with 136s (1) cores
% 23.86/4.75 % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 1349206 completed with status 0
% 23.86/4.75 % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 23.86/4.75 % Preprocessing class: FMLLSMSLSSSNFFN.
% 23.86/4.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.86/4.75 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 23.86/4.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 23.86/4.75 % No SInE strategy applied
% 23.86/4.75 % Search class: FGHSM-SMLM31-MFFFFFNN
% 23.86/4.75 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 23.86/4.75 % Starting SubtermCWHack with 136s (1) cores
% 23.86/4.75 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 23.86/4.75 % Preprocessing time : 0.114 s
% 23.86/4.75 % Presaturation interreduction done
% 23.86/4.75
% 23.86/4.75 % Proof found!
% 23.86/4.75 % SZS status Theorem
% 23.86/4.75 % SZS output start CNFRefutation
% See solution above
% 23.86/4.75 % Parsed axioms : 7223
% 23.86/4.75 % Removed by relevancy pruning/SinE : 0
% 23.86/4.75 % Initial clauses : 8414
% 23.86/4.75 % Removed in clause preprocessing : 63
% 23.86/4.75 % Initial clauses in saturation : 8351
% 23.86/4.75 % Processed clauses : 17448
% 23.86/4.75 % ...of these trivial : 933
% 23.86/4.75 % ...subsumed : 294
% 23.86/4.75 % ...remaining for further processing : 16221
% 23.86/4.75 % Other redundant clauses eliminated : 35
% 23.86/4.75 % Clauses deleted for lack of memory : 0
% 23.86/4.75 % Backward-subsumed : 1116
% 23.86/4.75 % Backward-rewritten : 1459
% 23.86/4.75 % Generated clauses : 106726
% 23.86/4.75 % ...of the previous two non-redundant : 102881
% 23.86/4.75 % ...aggressively subsumed : 0
% 23.86/4.75 % Contextual simplify-reflections : 678
% 23.86/4.75 % Paramodulations : 106646
% 23.86/4.75 % Factorizations : 1
% 23.86/4.75 % NegExts : 0
% 23.86/4.75 % Equation resolutions : 50
% 23.86/4.75 % Disequality decompositions : 0
% 23.86/4.75 % Total rewrite steps : 6448
% 23.86/4.75 % ...of those cached : 3343
% 23.86/4.75 % Propositional unsat checks : 0
% 23.86/4.75 % Propositional check models : 0
% 23.86/4.75 % Propositional check unsatisfiable : 0
% 23.86/4.75 % Propositional clauses : 0
% 23.86/4.75 % Propositional clauses after purity: 0
% 23.86/4.75 % Propositional unsat core size : 0
% 23.86/4.75 % Propositional preprocessing time : 0.000
% 23.86/4.75 % Propositional encoding time : 0.000
% 23.86/4.75 % Propositional solver time : 0.000
% 23.86/4.75 % Success case prop preproc time : 0.000
% 23.86/4.75 % Success case prop encoding time : 0.000
% 23.86/4.75 % Success case prop solver time : 0.000
% 23.86/4.75 % Current number of processed clauses : 5454
% 23.86/4.75 % Positive orientable unit clauses : 3946
% 23.86/4.75 % Positive unorientable unit clauses: 1
% 23.86/4.75 % Negative unit clauses : 19
% 23.86/4.75 % Non-unit-clauses : 1488
% 23.86/4.75 % Current number of unprocessed clauses: 68876
% 23.86/4.75 % ...number of literals in the above : 136308
% 23.86/4.75 % Current number of archived formulas : 0
% 23.86/4.75 % Current number of archived clauses : 10759
% 23.86/4.75 % Clause-clause subsumption calls (NU) : 2813033
% 23.86/4.75 % Rec. Clause-clause subsumption calls : 817168
% 23.86/4.75 % Non-unit clause-clause subsumptions : 980
% 23.86/4.75 % Unit Clause-clause subsumption calls : 279431
% 23.86/4.75 % Rewrite failures with RHS unbound : 10053
% 23.86/4.75 % BW rewrite match attempts : 33326
% 23.86/4.75 % BW rewrite match successes : 11012
% 23.86/4.75 % Condensation attempts : 0
% 23.86/4.75 % Condensation successes : 0
% 23.86/4.75 % Termbank termtop insertions : 1205939
% 23.86/4.75 % Search garbage collected termcells : 89720
% 23.86/4.75
% 23.86/4.75 % -------------------------------------------------
% 23.86/4.75 % User time : 3.275 s
% 23.86/4.75 % System time : 0.174 s
% 23.86/4.75 % Total time : 3.449 s
% 23.86/4.75 % Maximum resident set size: 31792 pages
% 23.86/4.75
% 23.86/4.75 % -------------------------------------------------
% 23.86/4.75 % User time : 14.525 s
% 23.86/4.75 % System time : 0.749 s
% 23.86/4.75 % Total time : 15.274 s
% 23.86/4.75 % Maximum resident set size: 12288 pages
% 23.86/4.75 % E exiting
%------------------------------------------------------------------------------