%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP004+2 : TPTP v9.3.1. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:53:27 PM UTC 2026
% Result : Theorem 3.80s 0.93s
% Output : CNFRefutation 3.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 4 unt; 0 def)
% Number of atoms : 150 ( 7 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 197 ( 81 ~; 81 |; 9 &)
% ( 3 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 77 ( 0 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ap_tp,axiom,
! [X1,X2,X3] :
( mem(X3,arr(X1,X2))
=> ! [X4] :
( mem(X4,X1)
=> mem(ap(X3,X4),X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/ITP001/ITP001+2.ax',ap_tp) ).
fof(mem_c_2Epred__set_2EDELETE,axiom,
! [X9] :
( ne(X9)
=> mem(c_2Epred__set_2EDELETE(X9),arr(arr(X9,bool),arr(X9,arr(X9,bool)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mem_c_2Epred__set_2EDELETE) ).
fof(conj_thm_2Epred__set_2EIN__DELETE,axiom,
! [X9] :
( ne(X9)
=> ! [X10] :
( mem(X10,arr(X9,bool))
=> ! [X13] :
( mem(X13,X9)
=> ! [X14] :
( mem(X14,X9)
=> ( p(ap(ap(c_2Ebool_2EIN(X9),X13),ap(ap(c_2Epred__set_2EDELETE(X9),X10),X14)))
<=> ( X13 != X14
& p(ap(ap(c_2Ebool_2EIN(X9),X13),X10)) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_thm_2Epred__set_2EIN__DELETE) ).
fof(ax_thm_2Epred__set_2ESUBSET__DEF,axiom,
! [X9] :
( ne(X9)
=> ! [X10] :
( mem(X10,arr(X9,bool))
=> ! [X11] :
( mem(X11,arr(X9,bool))
=> ( p(ap(ap(c_2Epred__set_2ESUBSET(X9),X10),X11))
<=> ! [X12] :
( mem(X12,X9)
=> ( p(ap(ap(c_2Ebool_2EIN(X9),X12),X10))
=> p(ap(ap(c_2Ebool_2EIN(X9),X12),X11)) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_thm_2Epred__set_2ESUBSET__DEF) ).
fof(mem_c_2Epred__set_2ECHOICE,axiom,
! [X9] :
( ne(X9)
=> mem(c_2Epred__set_2ECHOICE(X9),arr(arr(X9,bool),X9)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mem_c_2Epred__set_2ECHOICE) ).
fof(conj_thm_2Epred__set_2EREST__SUBSET,conjecture,
! [X9] :
( ne(X9)
=> ! [X10] :
( mem(X10,arr(X9,bool))
=> p(ap(ap(c_2Epred__set_2ESUBSET(X9),ap(c_2Epred__set_2EREST(X9),X10)),X10)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_thm_2Epred__set_2EREST__SUBSET) ).
fof(ax_thm_2Epred__set_2EREST__DEF,axiom,
! [X9] :
( ne(X9)
=> ! [X10] :
( mem(X10,arr(X9,bool))
=> ap(c_2Epred__set_2EREST(X9),X10) = ap(ap(c_2Epred__set_2EDELETE(X9),X10),ap(c_2Epred__set_2ECHOICE(X9),X10)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_thm_2Epred__set_2EREST__DEF) ).
fof(c_0_7,plain,
! [X19,X20,X21,X22] :
( mem(ap(X21,X22),X20)
| ~ mem(X22,X19)
| ~ mem(X21,arr(X19,X20)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ap_tp])])])]) ).
fof(c_0_8,plain,
! [X40] :
( mem(c_2Epred__set_2EDELETE(X40),arr(arr(X40,bool),arr(X40,arr(X40,bool))))
| ~ ne(X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mem_c_2Epred__set_2EDELETE])])]) ).
fof(c_0_9,plain,
! [X9] :
( ne(X9)
=> ! [X10] :
( mem(X10,arr(X9,bool))
=> ! [X13] :
( mem(X13,X9)
=> ! [X14] :
( mem(X14,X9)
=> ( p(ap(ap(c_2Ebool_2EIN(X9),X13),ap(ap(c_2Epred__set_2EDELETE(X9),X10),X14)))
<=> ( X13 != X14
& p(ap(ap(c_2Ebool_2EIN(X9),X13),X10)) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[conj_thm_2Epred__set_2EIN__DELETE]) ).
cnf(c_0_10,plain,
( ~ mem(X4,X2)
| ~ mem(X1,arr(X2,X3))
| mem(ap(X1,X4),X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ ne(X1)
| mem(c_2Epred__set_2EDELETE(X1),arr(arr(X1,bool),arr(X1,arr(X1,bool)))) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X41,X42,X43,X44] :
( ( ~ ne(X41)
| ~ mem(X42,arr(X41,bool))
| ~ mem(X43,X41)
| ~ mem(X44,X41)
| p(ap(ap(c_2Ebool_2EIN(X41),X43),ap(ap(c_2Epred__set_2EDELETE(X41),X42),X44)))
| X43 = X44
| ~ p(ap(ap(c_2Ebool_2EIN(X41),X43),X42)) )
& ( ~ ne(X41)
| ~ mem(X42,arr(X41,bool))
| ~ mem(X43,X41)
| ~ mem(X44,X41)
| ~ p(ap(ap(c_2Ebool_2EIN(X41),X43),ap(ap(c_2Epred__set_2EDELETE(X41),X42),X44)))
| X43 != X44 )
& ( ~ ne(X41)
| ~ mem(X42,arr(X41,bool))
| ~ mem(X43,X41)
| ~ mem(X44,X41)
| ~ p(ap(ap(c_2Ebool_2EIN(X41),X43),ap(ap(c_2Epred__set_2EDELETE(X41),X42),X44)))
| p(ap(ap(c_2Ebool_2EIN(X41),X43),X42)) ) ),
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_9])])])])]) ).
fof(c_0_13,plain,
! [X32,X33,X34,X35] :
( ( ~ ne(X32)
| ~ mem(X33,arr(X32,bool))
| ~ mem(X34,arr(X32,bool))
| p(ap(ap(c_2Epred__set_2ESUBSET(X32),X33),X34))
| ~ p(ap(ap(c_2Ebool_2EIN(X32),esk4_3(X32,X33,X34)),X34)) )
& ( ~ ne(X32)
| ~ mem(X33,arr(X32,bool))
| ~ mem(X34,arr(X32,bool))
| p(ap(ap(c_2Epred__set_2ESUBSET(X32),X33),X34))
| p(ap(ap(c_2Ebool_2EIN(X32),esk4_3(X32,X33,X34)),X33)) )
& ( ~ ne(X32)
| ~ mem(X33,arr(X32,bool))
| ~ mem(X34,arr(X32,bool))
| p(ap(ap(c_2Epred__set_2ESUBSET(X32),X33),X34))
| mem(esk4_3(X32,X33,X34),X32) )
& ( ~ ne(X32)
| ~ mem(X33,arr(X32,bool))
| ~ mem(X34,arr(X32,bool))
| p(ap(ap(c_2Ebool_2EIN(X32),X35),X34))
| ~ p(ap(ap(c_2Ebool_2EIN(X32),X35),X33))
| ~ mem(X35,X32)
| ~ p(ap(ap(c_2Epred__set_2ESUBSET(X32),X33),X34)) ) ),
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)],[ax_thm_2Epred__set_2ESUBSET__DEF])])])])])]) ).
cnf(c_0_14,plain,
( ~ ne(X1)
| ~ mem(X2,arr(X1,bool))
| mem(ap(c_2Epred__set_2EDELETE(X1),X2),arr(X1,arr(X1,bool))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( ~ ne(X1)
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,X1)
| ~ mem(X4,X1)
| ~ p(ap(ap(c_2Ebool_2EIN(X1),X2),ap(ap(c_2Epred__set_2EDELETE(X1),X3),X4)))
| p(ap(ap(c_2Ebool_2EIN(X1),X2),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( ~ ne(X1)
| ~ mem(X2,arr(X1,bool))
| ~ mem(X3,arr(X1,bool))
| p(ap(ap(c_2Epred__set_2ESUBSET(X1),X2),X3))
| p(ap(ap(c_2Ebool_2EIN(X1),esk4_3(X1,X2,X3)),X2)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( ~ ne(X1)
| ~ mem(X3,X1)
| ~ mem(X2,arr(X1,bool))
| mem(ap(ap(c_2Epred__set_2EDELETE(X1),X2),X3),arr(X1,bool)) ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
fof(c_0_18,plain,
! [X39] :
( mem(c_2Epred__set_2ECHOICE(X39),arr(arr(X39,bool),X39))
| ~ ne(X39) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mem_c_2Epred__set_2ECHOICE])])]) ).
fof(c_0_19,negated_conjecture,
~ ! [X9] :
( ne(X9)
=> ! [X10] :
( mem(X10,arr(X9,bool))
=> p(ap(ap(c_2Epred__set_2ESUBSET(X9),ap(c_2Epred__set_2EREST(X9),X10)),X10)) ) ),
inference(assume_negation,[status(cth)],[conj_thm_2Epred__set_2EREST__SUBSET]) ).
cnf(c_0_20,plain,
( ~ ne(X1)
| ~ mem(X2,arr(X1,bool))
| ~ mem(X3,arr(X1,bool))
| ~ p(ap(ap(c_2Ebool_2EIN(X1),esk4_3(X1,X2,X3)),X3))
| p(ap(ap(c_2Epred__set_2ESUBSET(X1),X2),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( ~ ne(X1)
| ~ mem(X3,X1)
| ~ mem(X4,arr(X1,bool))
| ~ mem(X2,arr(X1,bool))
| ~ mem(esk4_3(X1,ap(ap(c_2Epred__set_2EDELETE(X1),X2),X3),X4),X1)
| p(ap(ap(c_2Epred__set_2ESUBSET(X1),ap(ap(c_2Epred__set_2EDELETE(X1),X2),X3)),X4))
| p(ap(ap(c_2Ebool_2EIN(X1),esk4_3(X1,ap(ap(c_2Epred__set_2EDELETE(X1),X2),X3),X4)),X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_22,plain,
( ~ ne(X1)
| ~ mem(X2,arr(X1,bool))
| ~ mem(X3,arr(X1,bool))
| p(ap(ap(c_2Epred__set_2ESUBSET(X1),X2),X3))
| mem(esk4_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_23,plain,
! [X29,X30] :
( ap(c_2Epred__set_2EREST(X29),X30) = ap(ap(c_2Epred__set_2EDELETE(X29),X30),ap(c_2Epred__set_2ECHOICE(X29),X30))
| ~ mem(X30,arr(X29,bool))
| ~ ne(X29) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax_thm_2Epred__set_2EREST__DEF])])])]) ).
cnf(c_0_24,plain,
( ~ ne(X1)
| mem(c_2Epred__set_2ECHOICE(X1),arr(arr(X1,bool),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_25,negated_conjecture,
( ~ p(ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),esk2_0)),esk2_0))
& mem(esk2_0,arr(esk1_0,bool))
& ne(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
cnf(c_0_26,plain,
( ~ ne(X1)
| ~ mem(X3,X1)
| ~ mem(X2,arr(X1,bool))
| p(ap(ap(c_2Epred__set_2ESUBSET(X1),ap(ap(c_2Epred__set_2EDELETE(X1),X2),X3)),X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_17]) ).
cnf(c_0_27,plain,
( ~ mem(X2,arr(X1,bool))
| ~ ne(X1)
| ap(c_2Epred__set_2EREST(X1),X2) = ap(ap(c_2Epred__set_2EDELETE(X1),X2),ap(c_2Epred__set_2ECHOICE(X1),X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
( ~ ne(X1)
| ~ mem(X2,arr(X1,bool))
| mem(ap(c_2Epred__set_2ECHOICE(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
~ p(ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),esk2_0)),esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
( ~ ne(X1)
| ~ mem(X2,arr(X1,bool))
| p(ap(ap(c_2Epred__set_2ESUBSET(X1),ap(c_2Epred__set_2EREST(X1),X2)),X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_31,negated_conjecture,
mem(esk2_0,arr(esk1_0,bool)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,negated_conjecture,
ne(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP004+2 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n019.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 20 21:40:37 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 3.80/0.93 % Version: 3.5.1
% 3.80/0.93 % Preprocessing class: FSMSSMSSSSSNFFN.
% 3.80/0.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.80/0.93 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.80/0.93 % Starting new_bool_3 with 300s (1) cores
% 3.80/0.93 % Starting new_bool_1 with 300s (1) cores
% 3.80/0.93 % Starting sh5l with 300s (1) cores
% 3.80/0.93 % new_bool_3 with pid 941447 completed with status 0
% 3.80/0.93 % Result found by new_bool_3
% 3.80/0.93 % Preprocessing class: FSMSSMSSSSSNFFN.
% 3.80/0.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.80/0.93 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.80/0.93 % Starting new_bool_3 with 300s (1) cores
% 3.80/0.93 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.80/0.93 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.80/0.93 % Search class: FGHSF-FFMS31-MFFFFFNN
% 3.80/0.93 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.80/0.93 % Starting SubtermCWHack with 31s (1) cores
% 3.80/0.93 % SubtermCWHack with pid 941450 completed with status 0
% 3.80/0.93 % Result found by SubtermCWHack
% 3.80/0.93 % Preprocessing class: FSMSSMSSSSSNFFN.
% 3.80/0.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.80/0.93 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.80/0.93 % Starting new_bool_3 with 300s (1) cores
% 3.80/0.93 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.80/0.93 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.80/0.93 % Search class: FGHSF-FFMS31-MFFFFFNN
% 3.80/0.93 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.80/0.93 % Starting SubtermCWHack with 31s (1) cores
% 3.80/0.93 % Preprocessing time : 0.002 s
% 3.80/0.93
% 3.80/0.93 % Proof found!
% 3.80/0.93 % SZS status Theorem
% 3.80/0.93 % SZS output start CNFRefutation
% See solution above
% 3.80/0.93 % Parsed axioms : 27
% 3.80/0.93 % Removed by relevancy pruning/SinE : 13
% 3.80/0.93 % Initial clauses : 23
% 3.80/0.93 % Removed in clause preprocessing : 0
% 3.80/0.93 % Initial clauses in saturation : 23
% 3.80/0.93 % Processed clauses : 1828
% 3.80/0.93 % ...of these trivial : 0
% 3.80/0.93 % ...subsumed : 977
% 3.80/0.93 % ...remaining for further processing : 851
% 3.80/0.93 % Other redundant clauses eliminated : 1
% 3.80/0.93 % Clauses deleted for lack of memory : 0
% 3.80/0.93 % Backward-subsumed : 67
% 3.80/0.93 % Backward-rewritten : 4
% 3.80/0.93 % Generated clauses : 11014
% 3.80/0.93 % ...of the previous two non-redundant : 10472
% 3.80/0.93 % ...aggressively subsumed : 0
% 3.80/0.93 % Contextual simplify-reflections : 21
% 3.80/0.93 % Paramodulations : 11012
% 3.80/0.93 % Factorizations : 0
% 3.80/0.93 % NegExts : 0
% 3.80/0.93 % Equation resolutions : 2
% 3.80/0.93 % Disequality decompositions : 0
% 3.80/0.93 % Total rewrite steps : 3060
% 3.80/0.93 % ...of those cached : 3055
% 3.80/0.93 % Propositional unsat checks : 0
% 3.80/0.93 % Propositional check models : 0
% 3.80/0.93 % Propositional check unsatisfiable : 0
% 3.80/0.93 % Propositional clauses : 0
% 3.80/0.93 % Propositional clauses after purity: 0
% 3.80/0.93 % Propositional unsat core size : 0
% 3.80/0.93 % Propositional preprocessing time : 0.000
% 3.80/0.93 % Propositional encoding time : 0.000
% 3.80/0.93 % Propositional solver time : 0.000
% 3.80/0.93 % Success case prop preproc time : 0.000
% 3.80/0.93 % Success case prop encoding time : 0.000
% 3.80/0.93 % Success case prop solver time : 0.000
% 3.80/0.93 % Current number of processed clauses : 779
% 3.80/0.93 % Positive orientable unit clauses : 5
% 3.80/0.93 % Positive unorientable unit clauses: 0
% 3.80/0.93 % Negative unit clauses : 1
% 3.80/0.93 % Non-unit-clauses : 773
% 3.80/0.93 % Current number of unprocessed clauses: 8549
% 3.80/0.93 % ...number of literals in the above : 63990
% 3.80/0.93 % Current number of archived formulas : 0
% 3.80/0.93 % Current number of archived clauses : 71
% 3.80/0.93 % Clause-clause subsumption calls (NU) : 71921
% 3.80/0.93 % Rec. Clause-clause subsumption calls : 7565
% 3.80/0.93 % Non-unit clause-clause subsumptions : 1030
% 3.80/0.93 % Unit Clause-clause subsumption calls : 78
% 3.80/0.93 % Rewrite failures with RHS unbound : 0
% 3.80/0.93 % BW rewrite match attempts : 7
% 3.80/0.93 % BW rewrite match successes : 2
% 3.80/0.93 % Condensation attempts : 0
% 3.80/0.93 % Condensation successes : 0
% 3.80/0.93 % Termbank termtop insertions : 580777
% 3.80/0.93 % Search garbage collected termcells : 621
% 3.80/0.93
% 3.80/0.93 % -------------------------------------------------
% 3.80/0.93 % User time : 0.477 s
% 3.80/0.93 % System time : 0.015 s
% 3.80/0.93 % Total time : 0.492 s
% 3.80/0.93 % Maximum resident set size: 3676 pages
% 3.80/0.93
% 3.80/0.93 % -------------------------------------------------
% 3.80/0.93 % User time : 0.480 s
% 3.80/0.93 % System time : 0.019 s
% 3.80/0.93 % Total time : 0.499 s
% 3.80/0.93 % Maximum resident set size: 4608 pages
% 3.80/0.93 % E exiting
%------------------------------------------------------------------------------