%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWB029+3 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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 02:38:27 PM UTC 2026
% Result : ContradictoryAxioms 0.22s 0.69s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 35 ( 11 unt; 0 def)
% Number of atoms : 198 ( 0 equ)
% Maximal formula atoms : 71 ( 5 avg)
% Number of connectives : 279 ( 116 ~; 116 |; 39 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 14 con; 0-5 aty)
% Number of variables : 78 ( 8 sgn 26 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(owl_bool_intersectionof_class_002,axiom,
! [X1,X4,X5,X6,X7] :
( ( iext(uri_rdf_rest,X6,uri_rdf_nil)
& iext(uri_rdf_first,X6,X7)
& iext(uri_rdf_rest,X4,X6)
& iext(uri_rdf_first,X4,X5) )
=> ( iext(uri_owl_intersectionOf,X1,X4)
<=> ( ! [X3] :
( icext(X1,X3)
<=> ( icext(X7,X3)
& icext(X5,X3) ) )
& ic(X7)
& ic(X5)
& ic(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWB002+0.ax',owl_bool_intersectionof_class_002) ).
fof(testcase_premise_fullish_029_Ex_Falso_Quodlibet,axiom,
? [X21,X22,X23,X24] :
( iext(uri_owl_complementOf,X22,uri_ex_A)
& iext(uri_rdf_rest,X24,uri_rdf_nil)
& iext(uri_rdf_first,X24,X22)
& iext(uri_rdf_rest,X23,X24)
& iext(uri_rdf_first,X23,uri_ex_A)
& iext(uri_owl_intersectionOf,X21,X23)
& iext(uri_rdf_type,uri_ex_w,X21)
& iext(uri_rdf_type,uri_ex_B,uri_owl_Class)
& iext(uri_rdf_type,uri_ex_A,uri_owl_Class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_029_Ex_Falso_Quodlibet) ).
fof(rdfs_cext_def,axiom,
! [X3,X2] :
( iext(uri_rdf_type,X3,X2)
<=> icext(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWB002+0.ax',rdfs_cext_def) ).
fof(owl_bool_complementof_class,axiom,
! [X1,X2] :
( iext(uri_owl_complementOf,X1,X2)
=> ( ! [X3] :
( icext(X1,X3)
<=> ~ icext(X2,X3) )
& ic(X2)
& ic(X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWB002+0.ax',owl_bool_complementof_class) ).
fof(c_0_4,plain,
! [X39,X40,X41,X42,X43,X44,X45] :
( ( ~ iext(uri_rdf_rest,X42,uri_rdf_nil)
| ~ iext(uri_rdf_first,X42,X43)
| ~ iext(uri_rdf_rest,X40,X42)
| ~ iext(uri_rdf_first,X40,X41)
| iext(uri_owl_intersectionOf,X39,X40)
| ~ ic(X43)
| ~ ic(X41)
| ~ ic(X39)
| icext(X39,esk3_5(X39,X40,X41,X42,X43))
| icext(X43,esk3_5(X39,X40,X41,X42,X43)) )
& ( ~ iext(uri_rdf_rest,X42,uri_rdf_nil)
| ~ iext(uri_rdf_first,X42,X43)
| ~ iext(uri_rdf_rest,X40,X42)
| ~ iext(uri_rdf_first,X40,X41)
| iext(uri_owl_intersectionOf,X39,X40)
| ~ ic(X43)
| ~ ic(X41)
| ~ ic(X39)
| icext(X39,esk3_5(X39,X40,X41,X42,X43))
| icext(X41,esk3_5(X39,X40,X41,X42,X43)) )
& ( ~ iext(uri_rdf_rest,X42,uri_rdf_nil)
| ~ iext(uri_rdf_first,X42,X43)
| ~ iext(uri_rdf_rest,X40,X42)
| ~ iext(uri_rdf_first,X40,X41)
| iext(uri_owl_intersectionOf,X39,X40)
| ~ ic(X43)
| ~ ic(X41)
| ~ ic(X39)
| ~ icext(X43,esk3_5(X39,X40,X41,X42,X43))
| ~ icext(X41,esk3_5(X39,X40,X41,X42,X43))
| ~ icext(X39,esk3_5(X39,X40,X41,X42,X43)) )
& ( ~ iext(uri_rdf_rest,X42,uri_rdf_nil)
| ~ iext(uri_rdf_first,X42,X43)
| ~ iext(uri_rdf_rest,X40,X42)
| ~ iext(uri_rdf_first,X40,X41)
| ~ iext(uri_owl_intersectionOf,X39,X40)
| icext(X39,X45)
| ~ icext(X43,X45)
| ~ icext(X41,X45) )
& ( ~ iext(uri_rdf_rest,X42,uri_rdf_nil)
| ~ iext(uri_rdf_first,X42,X43)
| ~ iext(uri_rdf_rest,X40,X42)
| ~ iext(uri_rdf_first,X40,X41)
| ~ iext(uri_owl_intersectionOf,X39,X40)
| ~ icext(X39,X44)
| icext(X43,X44) )
& ( ~ iext(uri_rdf_rest,X42,uri_rdf_nil)
| ~ iext(uri_rdf_first,X42,X43)
| ~ iext(uri_rdf_rest,X40,X42)
| ~ iext(uri_rdf_first,X40,X41)
| ~ iext(uri_owl_intersectionOf,X39,X40)
| ~ icext(X39,X44)
| icext(X41,X44) )
& ( ~ iext(uri_rdf_rest,X42,uri_rdf_nil)
| ~ iext(uri_rdf_first,X42,X43)
| ~ iext(uri_rdf_rest,X40,X42)
| ~ iext(uri_rdf_first,X40,X41)
| ~ iext(uri_owl_intersectionOf,X39,X40)
| ic(X43) )
& ( ~ iext(uri_rdf_rest,X42,uri_rdf_nil)
| ~ iext(uri_rdf_first,X42,X43)
| ~ iext(uri_rdf_rest,X40,X42)
| ~ iext(uri_rdf_first,X40,X41)
| ~ iext(uri_owl_intersectionOf,X39,X40)
| ic(X41) )
& ( ~ iext(uri_rdf_rest,X42,uri_rdf_nil)
| ~ iext(uri_rdf_first,X42,X43)
| ~ iext(uri_rdf_rest,X40,X42)
| ~ iext(uri_rdf_first,X40,X41)
| ~ iext(uri_owl_intersectionOf,X39,X40)
| ic(X39) ) ),
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)],[owl_bool_intersectionof_class_002])])])])])])]) ).
fof(c_0_5,plain,
( iext(uri_owl_complementOf,esk20_0,uri_ex_A)
& iext(uri_rdf_rest,esk22_0,uri_rdf_nil)
& iext(uri_rdf_first,esk22_0,esk20_0)
& iext(uri_rdf_rest,esk21_0,esk22_0)
& iext(uri_rdf_first,esk21_0,uri_ex_A)
& iext(uri_owl_intersectionOf,esk19_0,esk21_0)
& iext(uri_rdf_type,uri_ex_w,esk19_0)
& iext(uri_rdf_type,uri_ex_B,uri_owl_Class)
& iext(uri_rdf_type,uri_ex_A,uri_owl_Class) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_029_Ex_Falso_Quodlibet])]) ).
cnf(c_0_6,plain,
( ~ iext(uri_rdf_rest,X5,uri_rdf_nil)
| ~ iext(uri_rdf_first,X5,X6)
| ~ iext(uri_rdf_rest,X4,X5)
| ~ iext(uri_rdf_first,X4,X1)
| ~ iext(uri_owl_intersectionOf,X3,X4)
| ~ icext(X3,X2)
| icext(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
iext(uri_rdf_rest,esk22_0,uri_rdf_nil),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( ~ iext(uri_rdf_rest,X6,uri_rdf_nil)
| ~ iext(uri_rdf_first,X6,X1)
| ~ iext(uri_rdf_rest,X4,X6)
| ~ iext(uri_rdf_first,X4,X5)
| ~ iext(uri_owl_intersectionOf,X3,X4)
| ~ icext(X3,X2)
| icext(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( ~ iext(uri_rdf_first,X5,X1)
| ~ iext(uri_owl_intersectionOf,X3,X5)
| ~ iext(uri_rdf_rest,X5,esk22_0)
| ~ iext(uri_rdf_first,esk22_0,X4)
| ~ icext(X3,X2)
| icext(X1,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
iext(uri_rdf_first,esk22_0,esk20_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( ~ iext(uri_rdf_first,X4,X5)
| ~ iext(uri_owl_intersectionOf,X3,X4)
| ~ iext(uri_rdf_rest,X4,esk22_0)
| ~ iext(uri_rdf_first,esk22_0,X1)
| ~ icext(X3,X2)
| icext(X1,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_12,plain,
( ~ iext(uri_rdf_first,X4,X1)
| ~ iext(uri_owl_intersectionOf,X3,X4)
| ~ iext(uri_rdf_rest,X4,esk22_0)
| ~ icext(X3,X2)
| icext(X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
iext(uri_rdf_rest,esk21_0,esk22_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_14,plain,
! [X184,X185] :
( ( iext(uri_rdf_type,X184,X185)
| ~ icext(X185,X184) )
& ( icext(X185,X184)
| ~ iext(uri_rdf_type,X184,X185) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])])]) ).
cnf(c_0_15,plain,
( ~ iext(uri_rdf_first,X3,X4)
| ~ iext(uri_owl_intersectionOf,X2,X3)
| ~ iext(uri_rdf_rest,X3,esk22_0)
| ~ icext(X2,X1)
| icext(esk20_0,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
fof(c_0_16,plain,
! [X1,X2] :
( iext(uri_owl_complementOf,X1,X2)
=> ( ! [X3] :
( icext(X1,X3)
<=> ~ icext(X2,X3) )
& ic(X2)
& ic(X1) ) ),
inference(fof_simplification,[status(thm)],[owl_bool_complementof_class]) ).
cnf(c_0_17,plain,
( ~ iext(uri_rdf_first,esk21_0,X1)
| ~ iext(uri_owl_intersectionOf,X3,esk21_0)
| ~ icext(X3,X2)
| icext(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
iext(uri_owl_intersectionOf,esk19_0,esk21_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,plain,
( ~ iext(uri_rdf_type,X1,X2)
| icext(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
iext(uri_rdf_type,uri_ex_w,esk19_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,plain,
( ~ iext(uri_rdf_first,esk21_0,X3)
| ~ iext(uri_owl_intersectionOf,X2,esk21_0)
| ~ icext(X2,X1)
| icext(esk20_0,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
fof(c_0_22,plain,
! [X25,X26,X27] :
( ( ~ iext(uri_owl_complementOf,X25,X26)
| icext(X25,X27)
| icext(X26,X27) )
& ( ~ iext(uri_owl_complementOf,X25,X26)
| ~ icext(X26,X27)
| ~ icext(X25,X27) )
& ( ~ iext(uri_owl_complementOf,X25,X26)
| ic(X26) )
& ( ~ iext(uri_owl_complementOf,X25,X26)
| ic(X25) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])])]) ).
cnf(c_0_23,plain,
( ~ iext(uri_rdf_first,esk21_0,X1)
| ~ icext(esk19_0,X2)
| icext(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
icext(esk19_0,uri_ex_w),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( ~ iext(uri_rdf_first,esk21_0,X2)
| ~ icext(esk19_0,X1)
| icext(esk20_0,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_26,plain,
( ~ iext(uri_owl_complementOf,X1,X3)
| ~ icext(X3,X2)
| ~ icext(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
iext(uri_owl_complementOf,esk20_0,uri_ex_A),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_28,plain,
( ~ iext(uri_rdf_first,esk21_0,X1)
| icext(X1,uri_ex_w) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
iext(uri_rdf_first,esk21_0,uri_ex_A),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_30,plain,
( ~ iext(uri_rdf_first,esk21_0,X1)
| icext(esk20_0,uri_ex_w) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_31,plain,
( ~ icext(esk20_0,X1)
| ~ icext(uri_ex_A,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
icext(uri_ex_A,uri_ex_w),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
icext(esk20_0,uri_ex_w),
inference(spm,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_34,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWB029+3 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n013.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 07:41:51 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 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
% 0.22/0.69 % Version: 3.5.1
% 0.22/0.69 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.69 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.69 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.69 % Starting sh5l with 300s (1) cores
% 0.22/0.69 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 289296 completed with status 0
% 0.22/0.69 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.22/0.69 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.69 % No SInE strategy applied
% 0.22/0.69 % Search class: FGHNS-FSLM33-SFFFFFNN
% 0.22/0.69 % partial match(1): FGHNF-FSLM33-SFFFFFNN
% 0.22/0.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.69 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/0.69 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 0.22/0.69 % Starting new_bool_3 with 136s (1) cores
% 0.22/0.69 % Starting H----_042_B03_F1_AE_Q4_SP_S2S with 136s (1) cores
% 0.22/0.69 % H----_042_B03_F1_AE_Q4_SP_S2S with pid 289305 completed with status 0
% 0.22/0.69 % Result found by H----_042_B03_F1_AE_Q4_SP_S2S
% 0.22/0.69 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.69 % No SInE strategy applied
% 0.22/0.69 % Search class: FGHNS-FSLM33-SFFFFFNN
% 0.22/0.69 % partial match(1): FGHNF-FSLM33-SFFFFFNN
% 0.22/0.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.69 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/0.69 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 0.22/0.69 % Starting new_bool_3 with 136s (1) cores
% 0.22/0.69 % Starting H----_042_B03_F1_AE_Q4_SP_S2S with 136s (1) cores
% 0.22/0.69 % Preprocessing time : 0.008 s
% 0.22/0.69
% 0.22/0.69 % Proof found!
% 0.22/0.69 % SZS status ContradictoryAxioms
% 0.22/0.69 % SZS output start CNFRefutation
% See solution above
% 0.22/0.69 % Parsed axioms : 140
% 0.22/0.69 % Removed by relevancy pruning/SinE : 0
% 0.22/0.69 % Initial clauses : 256
% 0.22/0.69 % Removed in clause preprocessing : 19
% 0.22/0.69 % Initial clauses in saturation : 237
% 0.22/0.69 % Processed clauses : 2178
% 0.22/0.69 % ...of these trivial : 102
% 0.22/0.69 % ...subsumed : 937
% 0.22/0.69 % ...remaining for further processing : 1139
% 0.22/0.69 % Other redundant clauses eliminated : 0
% 0.22/0.69 % Clauses deleted for lack of memory : 0
% 0.22/0.69 % Backward-subsumed : 66
% 0.22/0.69 % Backward-rewritten : 39
% 0.22/0.69 % Generated clauses : 4016
% 0.22/0.69 % ...of the previous two non-redundant : 2542
% 0.22/0.69 % ...aggressively subsumed : 0
% 0.22/0.69 % Contextual simplify-reflections : 0
% 0.22/0.69 % Paramodulations : 4016
% 0.22/0.69 % Factorizations : 0
% 0.22/0.69 % NegExts : 0
% 0.22/0.69 % Equation resolutions : 0
% 0.22/0.69 % Disequality decompositions : 0
% 0.22/0.69 % Total rewrite steps : 2237
% 0.22/0.69 % ...of those cached : 2023
% 0.22/0.69 % Propositional unsat checks : 0
% 0.22/0.69 % Propositional check models : 0
% 0.22/0.69 % Propositional check unsatisfiable : 0
% 0.22/0.69 % Propositional clauses : 0
% 0.22/0.69 % Propositional clauses after purity: 0
% 0.22/0.69 % Propositional unsat core size : 0
% 0.22/0.69 % Propositional preprocessing time : 0.000
% 0.22/0.69 % Propositional encoding time : 0.000
% 0.22/0.69 % Propositional solver time : 0.000
% 0.22/0.69 % Success case prop preproc time : 0.000
% 0.22/0.69 % Success case prop encoding time : 0.000
% 0.22/0.69 % Success case prop solver time : 0.000
% 0.22/0.69 % Current number of processed clauses : 1034
% 0.22/0.69 % Positive orientable unit clauses : 309
% 0.22/0.69 % Positive unorientable unit clauses: 0
% 0.22/0.69 % Negative unit clauses : 2
% 0.22/0.69 % Non-unit-clauses : 723
% 0.22/0.69 % Current number of unprocessed clauses: 569
% 0.22/0.69 % ...number of literals in the above : 2173
% 0.22/0.69 % Current number of archived formulas : 0
% 0.22/0.69 % Current number of archived clauses : 106
% 0.22/0.69 % Clause-clause subsumption calls (NU) : 56987
% 0.22/0.69 % Rec. Clause-clause subsumption calls : 46332
% 0.22/0.69 % Non-unit clause-clause subsumptions : 980
% 0.22/0.69 % Unit Clause-clause subsumption calls : 4627
% 0.22/0.69 % Rewrite failures with RHS unbound : 0
% 0.22/0.69 % BW rewrite match attempts : 177
% 0.22/0.69 % BW rewrite match successes : 16
% 0.22/0.69 % Condensation attempts : 0
% 0.22/0.69 % Condensation successes : 0
% 0.22/0.69 % Termbank termtop insertions : 54251
% 0.22/0.69 % Search garbage collected termcells : 3149
% 0.22/0.69
% 0.22/0.69 % -------------------------------------------------
% 0.22/0.69 % User time : 0.198 s
% 0.22/0.69 % System time : 0.010 s
% 0.22/0.69 % Total time : 0.208 s
% 0.22/0.69 % Maximum resident set size: 4284 pages
% 0.22/0.69
% 0.22/0.69 % -------------------------------------------------
% 0.22/0.69 % User time : 0.816 s
% 0.22/0.69 % System time : 0.046 s
% 0.22/0.69 % Total time : 0.862 s
% 0.22/0.69 % Maximum resident set size: 4608 pages
% 0.22/0.69 % E exiting
%------------------------------------------------------------------------------