%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ITP004+5 : TPTP v9.3.1. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:55:38 PM UTC 2026
% Result : Theorem 20.77s 3.61s
% Output : CNFRefutation 20.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 57 ( 22 unt; 0 def)
% Number of atoms : 129 ( 12 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 121 ( 49 ~; 47 |; 5 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 6 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_thm_2Epred__set_2EREST__SUBSET,conjecture,
! [X9] :
( ne(X9)
=> ! [X168] :
( mem(X168,arr(X9,bool))
=> p(ap(ap(c_2Epred__set_2ESUBSET(X9),ap(c_2Epred__set_2EREST(X9),X168)),X168)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Epred__set_2EREST__SUBSET) ).
fof(mem_c_2Epred__set_2EREST,axiom,
! [X9] :
( ne(X9)
=> mem(c_2Epred__set_2EREST(X9),arr(arr(X9,bool),arr(X9,bool))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mem_c_2Epred__set_2EREST) ).
fof(mem_c_2Epred__set_2ESUBSET,axiom,
! [X9] :
( ne(X9)
=> mem(c_2Epred__set_2ESUBSET(X9),arr(arr(X9,bool),arr(arr(X9,bool),bool))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mem_c_2Epred__set_2ESUBSET) ).
fof(ap_tp,axiom,
! [X1,X2,X3] :
( mem(X3,arr(X1,X2))
=> ! [X4] :
( mem(X4,X1)
=> mem(ap(X3,X4),X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/ITP001/ITP001+2.ax',ap_tp) ).
fof(mem_c_2Epred__set_2ECHOICE,axiom,
! [X9] :
( ne(X9)
=> mem(c_2Epred__set_2ECHOICE(X9),arr(arr(X9,bool),X9)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mem_c_2Epred__set_2ECHOICE) ).
fof(ax_thm_2Ebool_2EF__DEF,axiom,
( ~ $true
<=> ! [X16] :
( mem(X16,bool)
=> p(X16) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/ITP001/ITP003+5.ax',ax_thm_2Ebool_2EF__DEF) ).
fof(boolext,axiom,
! [X5] :
( mem(X5,bool)
=> ! [X6] :
( mem(X6,bool)
=> ( ( p(X5)
<=> p(X6) )
=> X5 = X6 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/ITP001/ITP001+2.ax',boolext) ).
fof(ax_false_p,axiom,
~ p(c_2Ebool_2EF),
file('/export/starexec/sandbox/benchmark/Axioms/ITP001/ITP003+5.ax',ax_false_p) ).
fof(conj_thm_2Epred__set_2EDELETE__SUBSET,axiom,
! [X9] :
( ne(X9)
=> ! [X32] :
( mem(X32,X9)
=> ! [X148] :
( mem(X148,arr(X9,bool))
=> p(ap(ap(c_2Epred__set_2ESUBSET(X9),ap(ap(c_2Epred__set_2EDELETE(X9),X148),X32)),X148)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Epred__set_2EDELETE__SUBSET) ).
fof(ax_thm_2Epred__set_2EREST__DEF,axiom,
! [X9] :
( ne(X9)
=> ! [X168] :
( mem(X168,arr(X9,bool))
=> ap(c_2Epred__set_2EREST(X9),X168) = ap(ap(c_2Epred__set_2EDELETE(X9),X168),ap(c_2Epred__set_2ECHOICE(X9),X168)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_thm_2Epred__set_2EREST__DEF) ).
fof(mem_c_2Ebool_2EF,axiom,
mem(c_2Ebool_2EF,bool),
file('/export/starexec/sandbox/benchmark/Axioms/ITP001/ITP003+5.ax',mem_c_2Ebool_2EF) ).
fof(c_0_11,negated_conjecture,
~ ! [X9] :
( ne(X9)
=> ! [X168] :
( mem(X168,arr(X9,bool))
=> p(ap(ap(c_2Epred__set_2ESUBSET(X9),ap(c_2Epred__set_2EREST(X9),X168)),X168)) ) ),
inference(assume_negation,[status(cth)],[conj_thm_2Epred__set_2EREST__SUBSET]) ).
fof(c_0_12,plain,
! [X924] :
( mem(c_2Epred__set_2EREST(X924),arr(arr(X924,bool),arr(X924,bool)))
| ~ ne(X924) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mem_c_2Epred__set_2EREST])])]) ).
fof(c_0_13,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_11])])])]) ).
fof(c_0_14,plain,
! [X937] :
( mem(c_2Epred__set_2ESUBSET(X937),arr(arr(X937,bool),arr(arr(X937,bool),bool)))
| ~ ne(X937) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mem_c_2Epred__set_2ESUBSET])])]) ).
fof(c_0_15,plain,
! [X915,X916,X917,X918] :
( mem(ap(X917,X918),X916)
| ~ mem(X918,X915)
| ~ mem(X917,arr(X915,X916)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ap_tp])])])]) ).
cnf(c_0_16,plain,
( ~ ne(X1)
| mem(c_2Epred__set_2EREST(X1),arr(arr(X1,bool),arr(X1,bool))) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
ne(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( ~ ne(X1)
| mem(c_2Epred__set_2ESUBSET(X1),arr(arr(X1,bool),arr(arr(X1,bool),bool))) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( ~ mem(X4,X2)
| ~ mem(X1,arr(X2,X3))
| mem(ap(X1,X4),X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
mem(c_2Epred__set_2EREST(esk1_0),arr(arr(esk1_0,bool),arr(esk1_0,bool))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
mem(c_2Epred__set_2ESUBSET(esk1_0),arr(arr(esk1_0,bool),arr(arr(esk1_0,bool),bool))),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( ~ mem(X1,arr(esk1_0,bool))
| mem(ap(c_2Epred__set_2EREST(esk1_0),X1),arr(esk1_0,bool)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
mem(esk2_0,arr(esk1_0,bool)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,negated_conjecture,
( ~ mem(X1,arr(esk1_0,bool))
| mem(ap(c_2Epred__set_2ESUBSET(esk1_0),X1),arr(arr(esk1_0,bool),bool)) ),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
mem(ap(c_2Epred__set_2EREST(esk1_0),esk2_0),arr(esk1_0,bool)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_26,plain,
! [X1039] :
( mem(c_2Epred__set_2ECHOICE(X1039),arr(arr(X1039,bool),X1039))
| ~ ne(X1039) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mem_c_2Epred__set_2ECHOICE])])]) ).
cnf(c_0_27,negated_conjecture,
mem(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),esk2_0)),arr(arr(esk1_0,bool),bool)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_28,plain,
! [X472] :
( ( ~ $true
| ~ p(esk3_0) )
& ( ~ $true
| mem(esk3_0,bool) )
& ( p(X472)
| ~ mem(X472,bool)
| $true ) ),
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_2Ebool_2EF__DEF])])])])])]) ).
cnf(c_0_29,plain,
( ~ ne(X1)
| mem(c_2Epred__set_2ECHOICE(X1),arr(arr(X1,bool),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_30,plain,
! [X470,X471] :
( ( ~ mem(X470,bool)
| ~ mem(X471,bool)
| X470 = X471
| p(X471)
| p(X470) )
& ( ~ mem(X470,bool)
| ~ mem(X471,bool)
| X470 = X471
| ~ p(X471)
| ~ p(X470) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[boolext])])])])]) ).
cnf(c_0_31,negated_conjecture,
( ~ mem(X1,arr(esk1_0,bool))
| mem(ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),esk2_0)),X1),bool) ),
inference(spm,[status(thm)],[c_0_19,c_0_27]) ).
cnf(c_0_32,plain,
( $false
| mem(esk3_0,bool) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
( $false
| ~ p(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_34,plain,
~ p(c_2Ebool_2EF),
inference(fof_simplification,[status(thm)],[ax_false_p]) ).
fof(c_0_35,plain,
! [X1076,X1077,X1078] :
( p(ap(ap(c_2Epred__set_2ESUBSET(X1076),ap(ap(c_2Epred__set_2EDELETE(X1076),X1078),X1077)),X1078))
| ~ mem(X1078,arr(X1076,bool))
| ~ mem(X1077,X1076)
| ~ ne(X1076) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_thm_2Epred__set_2EDELETE__SUBSET])])])]) ).
cnf(c_0_36,negated_conjecture,
mem(c_2Epred__set_2ECHOICE(esk1_0),arr(arr(esk1_0,bool),esk1_0)),
inference(spm,[status(thm)],[c_0_29,c_0_17]) ).
fof(c_0_37,plain,
! [X925,X926] :
( ap(c_2Epred__set_2EREST(X925),X926) = ap(ap(c_2Epred__set_2EDELETE(X925),X926),ap(c_2Epred__set_2ECHOICE(X925),X926))
| ~ mem(X926,arr(X925,bool))
| ~ ne(X925) ),
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_38,plain,
( ~ mem(X1,bool)
| ~ mem(X2,bool)
| X1 = X2
| p(X2)
| p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,negated_conjecture,
mem(ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),esk2_0)),esk2_0),bool),
inference(spm,[status(thm)],[c_0_31,c_0_23]) ).
cnf(c_0_40,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_13]) ).
cnf(c_0_41,plain,
mem(esk3_0,bool),
inference(cn,[status(thm)],[c_0_32]) ).
cnf(c_0_42,plain,
~ p(esk3_0),
inference(cn,[status(thm)],[c_0_33]) ).
fof(c_0_43,plain,
~ p(c_2Ebool_2EF),
inference(fof_nnf,[status(thm)],[c_0_34]) ).
cnf(c_0_44,plain,
( ~ mem(X3,arr(X1,bool))
| ~ mem(X2,X1)
| ~ ne(X1)
| p(ap(ap(c_2Epred__set_2ESUBSET(X1),ap(ap(c_2Epred__set_2EDELETE(X1),X3),X2)),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_45,negated_conjecture,
( ~ mem(X1,arr(esk1_0,bool))
| mem(ap(c_2Epred__set_2ECHOICE(esk1_0),X1),esk1_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_36]) ).
cnf(c_0_46,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_37]) ).
cnf(c_0_47,negated_conjecture,
( ~ mem(X1,bool)
| p(X1)
| X1 = ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),esk2_0)),esk2_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_48,plain,
( ~ mem(X1,bool)
| p(X1)
| X1 = esk3_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_41]),c_0_42]) ).
cnf(c_0_49,plain,
mem(c_2Ebool_2EF,bool),
inference(split_conjunct,[status(thm)],[mem_c_2Ebool_2EF]) ).
cnf(c_0_50,plain,
~ p(c_2Ebool_2EF),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_51,negated_conjecture,
( ~ mem(X1,esk1_0)
| p(ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(ap(c_2Epred__set_2EDELETE(esk1_0),esk2_0),X1)),esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_23]),c_0_17])]) ).
cnf(c_0_52,negated_conjecture,
mem(ap(c_2Epred__set_2ECHOICE(esk1_0),esk2_0),esk1_0),
inference(spm,[status(thm)],[c_0_45,c_0_23]) ).
cnf(c_0_53,negated_conjecture,
ap(ap(c_2Epred__set_2EDELETE(esk1_0),esk2_0),ap(c_2Epred__set_2ECHOICE(esk1_0),esk2_0)) = ap(c_2Epred__set_2EREST(esk1_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_23]),c_0_17])]) ).
cnf(c_0_54,negated_conjecture,
ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),esk2_0)),esk2_0) = esk3_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_41]),c_0_42]) ).
cnf(c_0_55,plain,
esk3_0 = c_2Ebool_2EF,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),c_0_54]),c_0_55]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP004+5 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n010.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 21:40:56 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 20.77/3.61 % Version: 3.5.1
% 20.77/3.61 % Preprocessing class: FMLMSMLLSSSNFFN.
% 20.77/3.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 20.77/3.61 % Starting new_bool_3 with 900s (3) cores
% 20.77/3.61 % Starting new_bool_1 with 900s (3) cores
% 20.77/3.61 % Starting sh5l with 300s (1) cores
% 20.77/3.61 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 20.77/3.61 % new_bool_3 with pid 3539503 completed with status 0
% 20.77/3.61 % Result found by new_bool_3
% 20.77/3.61 % Preprocessing class: FMLMSMLLSSSNFFN.
% 20.77/3.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 20.77/3.61 % Starting new_bool_3 with 900s (3) cores
% 20.77/3.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 20.77/3.61 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 20.77/3.61 % Search class: FGHSF-SMLM32-DFFFFFNN
% 20.77/3.61 % partial match(1): FGHSM-SMLM32-DFFFFFNN
% 20.77/3.61 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 20.77/3.61 % Starting SubtermCWHack with 82s (1) cores
% 20.77/3.61 % Starting new_bool_3 with 91s (1) cores
% 20.77/3.61 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 68s (1) cores
% 20.77/3.61 % G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 3539510 completed with status 0
% 20.77/3.61 % Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 20.77/3.61 % Preprocessing class: FMLMSMLLSSSNFFN.
% 20.77/3.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 20.77/3.61 % Starting new_bool_3 with 900s (3) cores
% 20.77/3.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 20.77/3.61 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 20.77/3.61 % Search class: FGHSF-SMLM32-DFFFFFNN
% 20.77/3.61 % partial match(1): FGHSM-SMLM32-DFFFFFNN
% 20.77/3.61 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 20.77/3.61 % Starting SubtermCWHack with 82s (1) cores
% 20.77/3.61 % Starting new_bool_3 with 91s (1) cores
% 20.77/3.61 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 68s (1) cores
% 20.77/3.61 % Preprocessing time : 0.036 s
% 20.77/3.61
% 20.77/3.61 % Proof found!
% 20.77/3.61 % SZS status Theorem
% 20.77/3.61 % SZS output start CNFRefutation
% See solution above
% 20.77/3.61 % Parsed axioms : 2447
% 20.77/3.61 % Removed by relevancy pruning/SinE : 1879
% 20.77/3.61 % Initial clauses : 2274
% 20.77/3.61 % Removed in clause preprocessing : 951
% 20.77/3.61 % Initial clauses in saturation : 1323
% 20.77/3.61 % Processed clauses : 4096
% 20.77/3.61 % ...of these trivial : 28
% 20.77/3.61 % ...subsumed : 278
% 20.77/3.61 % ...remaining for further processing : 3789
% 20.77/3.61 % Other redundant clauses eliminated : 88
% 20.77/3.61 % Clauses deleted for lack of memory : 0
% 20.77/3.61 % Backward-subsumed : 45
% 20.77/3.61 % Backward-rewritten : 151
% 20.77/3.61 % Generated clauses : 231640
% 20.77/3.61 % ...of the previous two non-redundant : 230820
% 20.77/3.61 % ...aggressively subsumed : 0
% 20.77/3.61 % Contextual simplify-reflections : 7
% 20.77/3.61 % Paramodulations : 231456
% 20.77/3.61 % Factorizations : 95
% 20.77/3.61 % NegExts : 0
% 20.77/3.61 % Equation resolutions : 88
% 20.77/3.61 % Disequality decompositions : 0
% 20.77/3.61 % Total rewrite steps : 64819
% 20.77/3.61 % ...of those cached : 64609
% 20.77/3.61 % Propositional unsat checks : 0
% 20.77/3.61 % Propositional check models : 0
% 20.77/3.61 % Propositional check unsatisfiable : 0
% 20.77/3.61 % Propositional clauses : 0
% 20.77/3.61 % Propositional clauses after purity: 0
% 20.77/3.61 % Propositional unsat core size : 0
% 20.77/3.61 % Propositional preprocessing time : 0.000
% 20.77/3.61 % Propositional encoding time : 0.000
% 20.77/3.61 % Propositional solver time : 0.000
% 20.77/3.61 % Success case prop preproc time : 0.000
% 20.77/3.61 % Success case prop encoding time : 0.000
% 20.77/3.61 % Success case prop solver time : 0.000
% 20.77/3.61 % Current number of processed clauses : 3509
% 20.77/3.61 % Positive orientable unit clauses : 889
% 20.77/3.61 % Positive unorientable unit clauses: 0
% 20.77/3.61 % Negative unit clauses : 262
% 20.77/3.61 % Non-unit-clauses : 2358
% 20.77/3.61 % Current number of unprocessed clauses: 227895
% 20.77/3.61 % ...number of literals in the above : 896200
% 20.77/3.61 % Current number of archived formulas : 0
% 20.77/3.61 % Current number of archived clauses : 196
% 20.77/3.61 % Clause-clause subsumption calls (NU) : 479782
% 20.77/3.61 % Rec. Clause-clause subsumption calls : 118082
% 20.77/3.61 % Non-unit clause-clause subsumptions : 276
% 20.77/3.61 % Unit Clause-clause subsumption calls : 139182
% 20.77/3.61 % Rewrite failures with RHS unbound : 0
% 20.77/3.61 % BW rewrite match attempts : 30631
% 20.77/3.61 % BW rewrite match successes : 81
% 20.77/3.61 % Condensation attempts : 0
% 20.77/3.61 % Condensation successes : 0
% 20.77/3.61 % Termbank termtop insertions : 9402816
% 20.77/3.61 % Search garbage collected termcells : 67909
% 20.77/3.61
% 20.77/3.61 % -------------------------------------------------
% 20.77/3.61 % User time : 2.792 s
% 20.77/3.61 % System time : 0.144 s
% 20.77/3.61 % Total time : 2.936 s
% 20.77/3.61 % Maximum resident set size: 14756 pages
% 20.77/3.61
% 20.77/3.61 % -------------------------------------------------
% 20.77/3.61 % User time : 8.351 s
% 20.77/3.61 % System time : 0.385 s
% 20.77/3.61 % Total time : 8.736 s
% 20.77/3.61 % Maximum resident set size: 9728 pages
% 20.77/3.61 % E exiting
%------------------------------------------------------------------------------