%------------------------------------------------------------------------------
% 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/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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 4.09s 1.44s
% Output : CNFRefutation 4.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 117 ( 7 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 142 ( 58 ~; 58 |; 8 &)
% ( 3 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 77 ( 0 sgn 77 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
del: $tType ).
tff(decl_23,type,
bool: del ).
tff(decl_25,type,
arr: ( del * del ) > del ).
tff(decl_26,type,
mem: ( del * $i ) > $o ).
tff(decl_27,type,
ap: ( $i * $i ) > $i ).
tff(decl_30,type,
p: $i > $o ).
tff(decl_35,type,
c_2Epred__set_2ESUBSET: del > $i ).
tff(decl_40,type,
c_2Ebool_2EIN: del > $i ).
tff(decl_41,type,
c_2Epred__set_2ECHOICE: del > $i ).
tff(decl_42,type,
c_2Epred__set_2EDELETE: del > $i ).
tff(decl_43,type,
c_2Epred__set_2EREST: del > $i ).
tff(decl_46,type,
esk1_0: del ).
tff(decl_47,type,
esk2_0: $i ).
tff(decl_49,type,
esk4_3: ( $i * ( $i * del ) ) > $i ).
tff(ap_tp,axiom,
! [X1: del,X2: del,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) ).
tff(mem_c_2Epred__set_2EDELETE,axiom,
! [X13: del] : mem(c_2Epred__set_2EDELETE(X13),arr(arr(X13,bool),arr(X13,arr(X13,bool)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mem_c_2Epred__set_2EDELETE) ).
tff(conj_thm_2Epred__set_2EIN__DELETE,axiom,
! [X13: del,X14] :
( mem(X14,arr(X13,bool))
=> ! [X17] :
( mem(X17,X13)
=> ! [X18] :
( mem(X18,X13)
=> ( p(ap(ap(c_2Ebool_2EIN(X13),X17),ap(ap(c_2Epred__set_2EDELETE(X13),X14),X18)))
<=> ( ( X17 != X18 )
& p(ap(ap(c_2Ebool_2EIN(X13),X17),X14)) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Epred__set_2EIN__DELETE) ).
tff(ax_thm_2Epred__set_2ESUBSET__DEF,axiom,
! [X13: del,X14] :
( mem(X14,arr(X13,bool))
=> ! [X15] :
( mem(X15,arr(X13,bool))
=> ( p(ap(ap(c_2Epred__set_2ESUBSET(X13),X14),X15))
<=> ! [X16] :
( mem(X16,X13)
=> ( p(ap(ap(c_2Ebool_2EIN(X13),X16),X14))
=> p(ap(ap(c_2Ebool_2EIN(X13),X16),X15)) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_thm_2Epred__set_2ESUBSET__DEF) ).
tff(mem_c_2Epred__set_2ECHOICE,axiom,
! [X13: del] : mem(c_2Epred__set_2ECHOICE(X13),arr(arr(X13,bool),X13)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mem_c_2Epred__set_2ECHOICE) ).
tff(conj_thm_2Epred__set_2EREST__SUBSET,conjecture,
! [X13: del,X14] :
( mem(X14,arr(X13,bool))
=> p(ap(ap(c_2Epred__set_2ESUBSET(X13),ap(c_2Epred__set_2EREST(X13),X14)),X14)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Epred__set_2EREST__SUBSET) ).
tff(ax_thm_2Epred__set_2EREST__DEF,axiom,
! [X13: del,X14] :
( mem(X14,arr(X13,bool))
=> ( ap(c_2Epred__set_2EREST(X13),X14) = ap(ap(c_2Epred__set_2EDELETE(X13),X14),ap(c_2Epred__set_2ECHOICE(X13),X14)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_thm_2Epred__set_2EREST__DEF) ).
tff(c_0_7,plain,
! [X23: del,X24: del,X25,X26] :
( mem(ap(X25,X26),X24)
| ~ mem(X26,X23)
| ~ mem(X25,arr(X23,X24)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ap_tp])])])]) ).
tff(c_0_8,plain,
! [X42: del] : mem(c_2Epred__set_2EDELETE(X42),arr(arr(X42,bool),arr(X42,arr(X42,bool)))),
inference(variable_rename,[status(thm)],[mem_c_2Epred__set_2EDELETE]) ).
tff(c_0_9,plain,
! [X13: del,X14] :
( mem(X14,arr(X13,bool))
=> ! [X17] :
( mem(X17,X13)
=> ! [X18] :
( mem(X18,X13)
=> ( p(ap(ap(c_2Ebool_2EIN(X13),X17),ap(ap(c_2Epred__set_2EDELETE(X13),X14),X18)))
<=> ( ( X17 != X18 )
& p(ap(ap(c_2Ebool_2EIN(X13),X17),X14)) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[conj_thm_2Epred__set_2EIN__DELETE]) ).
tcf(c_0_10,plain,
! [X2: del,X4,X3,X1: del] :
( ~ mem(X4,X1)
| ~ mem(X3,arr(X1,X2))
| mem(ap(X3,X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_11,plain,
! [X1: del] : mem(c_2Epred__set_2EDELETE(X1),arr(arr(X1,bool),arr(X1,arr(X1,bool)))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tff(c_0_12,plain,
! [X43: del,X44,X45,X46] :
( ( ~ mem(X44,arr(X43,bool))
| ~ mem(X45,X43)
| ~ mem(X46,X43)
| p(ap(ap(c_2Ebool_2EIN(X43),X45),ap(ap(c_2Epred__set_2EDELETE(X43),X44),X46)))
| ( X45 = X46 )
| ~ p(ap(ap(c_2Ebool_2EIN(X43),X45),X44)) )
& ( ~ mem(X44,arr(X43,bool))
| ~ mem(X45,X43)
| ~ mem(X46,X43)
| ~ p(ap(ap(c_2Ebool_2EIN(X43),X45),ap(ap(c_2Epred__set_2EDELETE(X43),X44),X46)))
| ( X45 != X46 ) )
& ( ~ mem(X44,arr(X43,bool))
| ~ mem(X45,X43)
| ~ mem(X46,X43)
| ~ p(ap(ap(c_2Ebool_2EIN(X43),X45),ap(ap(c_2Epred__set_2EDELETE(X43),X44),X46)))
| p(ap(ap(c_2Ebool_2EIN(X43),X45),X44)) ) ),
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])])])])]) ).
tff(c_0_13,plain,
! [X36: del,X37,X38,X39] :
( ( ~ mem(X37,arr(X36,bool))
| ~ mem(X38,arr(X36,bool))
| p(ap(ap(c_2Epred__set_2ESUBSET(X36),X37),X38))
| ~ p(ap(ap(c_2Ebool_2EIN(X36),esk4_3(X36,X37,X38)),X38)) )
& ( ~ mem(X37,arr(X36,bool))
| ~ mem(X38,arr(X36,bool))
| p(ap(ap(c_2Epred__set_2ESUBSET(X36),X37),X38))
| p(ap(ap(c_2Ebool_2EIN(X36),esk4_3(X36,X37,X38)),X37)) )
& ( ~ mem(X37,arr(X36,bool))
| ~ mem(X38,arr(X36,bool))
| p(ap(ap(c_2Epred__set_2ESUBSET(X36),X37),X38))
| mem(esk4_3(X36,X37,X38),X36) )
& ( ~ mem(X37,arr(X36,bool))
| ~ mem(X38,arr(X36,bool))
| p(ap(ap(c_2Ebool_2EIN(X36),X39),X38))
| ~ p(ap(ap(c_2Ebool_2EIN(X36),X39),X37))
| ~ mem(X39,X36)
| ~ p(ap(ap(c_2Epred__set_2ESUBSET(X36),X37),X38)) ) ),
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])])])])])]) ).
tcf(c_0_14,plain,
! [X3,X1: del] :
( ~ mem(X3,arr(X1,bool))
| mem(ap(c_2Epred__set_2EDELETE(X1),X3),arr(X1,arr(X1,bool))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
tcf(c_0_15,plain,
! [X5,X4,X3,X1: del] :
( ~ mem(X4,arr(X1,bool))
| ~ mem(X3,X1)
| ~ mem(X5,X1)
| ~ p(ap(ap(c_2Ebool_2EIN(X1),X3),ap(ap(c_2Epred__set_2EDELETE(X1),X4),X5)))
| p(ap(ap(c_2Ebool_2EIN(X1),X3),X4)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_16,plain,
! [X4,X3,X1: del] :
( ~ mem(X3,arr(X1,bool))
| ~ mem(X4,arr(X1,bool))
| p(ap(ap(c_2Epred__set_2ESUBSET(X1),X3),X4))
| p(ap(ap(c_2Ebool_2EIN(X1),esk4_3(X1,X3,X4)),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_17,plain,
! [X4,X3,X1: del] :
( ~ mem(X4,X1)
| ~ mem(X3,arr(X1,bool))
| mem(ap(ap(c_2Epred__set_2EDELETE(X1),X3),X4),arr(X1,bool)) ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
tff(c_0_18,plain,
! [X41: del] : mem(c_2Epred__set_2ECHOICE(X41),arr(arr(X41,bool),X41)),
inference(variable_rename,[status(thm)],[mem_c_2Epred__set_2ECHOICE]) ).
tff(c_0_19,negated_conjecture,
~ ! [X13: del,X14] :
( mem(X14,arr(X13,bool))
=> p(ap(ap(c_2Epred__set_2ESUBSET(X13),ap(c_2Epred__set_2EREST(X13),X14)),X14)) ),
inference(assume_negation,[status(cth)],[conj_thm_2Epred__set_2EREST__SUBSET]) ).
tcf(c_0_20,plain,
! [X4,X3,X1: del] :
( ~ mem(X3,arr(X1,bool))
| ~ mem(X4,arr(X1,bool))
| ~ p(ap(ap(c_2Ebool_2EIN(X1),esk4_3(X1,X3,X4)),X4))
| p(ap(ap(c_2Epred__set_2ESUBSET(X1),X3),X4)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_21,plain,
! [X5,X4,X3,X1: del] :
( ~ mem(X4,X1)
| ~ mem(X5,arr(X1,bool))
| ~ mem(X3,arr(X1,bool))
| ~ mem(esk4_3(X1,ap(ap(c_2Epred__set_2EDELETE(X1),X3),X4),X5),X1)
| p(ap(ap(c_2Epred__set_2ESUBSET(X1),ap(ap(c_2Epred__set_2EDELETE(X1),X3),X4)),X5))
| p(ap(ap(c_2Ebool_2EIN(X1),esk4_3(X1,ap(ap(c_2Epred__set_2EDELETE(X1),X3),X4),X5)),X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
tcf(c_0_22,plain,
! [X4,X3,X1: del] :
( ~ mem(X3,arr(X1,bool))
| ~ mem(X4,arr(X1,bool))
| p(ap(ap(c_2Epred__set_2ESUBSET(X1),X3),X4))
| mem(esk4_3(X1,X3,X4),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tff(c_0_23,plain,
! [X33: del,X34] :
( ( ap(c_2Epred__set_2EREST(X33),X34) = ap(ap(c_2Epred__set_2EDELETE(X33),X34),ap(c_2Epred__set_2ECHOICE(X33),X34)) )
| ~ mem(X34,arr(X33,bool)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax_thm_2Epred__set_2EREST__DEF])])]) ).
tcf(c_0_24,plain,
! [X1: del] : mem(c_2Epred__set_2ECHOICE(X1),arr(arr(X1,bool),X1)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
tff(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)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
tcf(c_0_26,plain,
! [X4,X3,X1: del] :
( ~ mem(X4,X1)
| ~ mem(X3,arr(X1,bool))
| p(ap(ap(c_2Epred__set_2ESUBSET(X1),ap(ap(c_2Epred__set_2EDELETE(X1),X3),X4)),X3)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_17]) ).
tcf(c_0_27,plain,
! [X3,X1: del] :
( ~ mem(X3,arr(X1,bool))
| ( ap(c_2Epred__set_2EREST(X1),X3) = ap(ap(c_2Epred__set_2EDELETE(X1),X3),ap(c_2Epred__set_2ECHOICE(X1),X3)) ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
tcf(c_0_28,plain,
! [X3,X1: del] :
( ~ mem(X3,arr(X1,bool))
| mem(ap(c_2Epred__set_2ECHOICE(X1),X3),X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_24]) ).
tcf(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]) ).
tcf(c_0_30,plain,
! [X3,X1: del] :
( ~ mem(X3,arr(X1,bool))
| p(ap(ap(c_2Epred__set_2ESUBSET(X1),ap(c_2Epred__set_2EREST(X1),X3)),X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
tcf(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,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : ITP004_2 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.66 % Computer : n004.cluster.edu
% 0.20/0.66 % Model : x86_64 x86_64
% 0.20/0.66 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.66 % Memory : 8046.5625MB
% 0.20/0.66 % OS : Linux 6.8.0-71-generic
% 0.20/0.66 % CPULimit : 300
% 0.20/0.66 % WCLimit : 300
% 0.20/0.66 % DateTime : Sun Sep 20 21:40:20 UTC 2026
% 0.20/0.66 % CPUTime :
% 0.20/0.66 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.73 Running first-order theorem proving
% 0.24/0.73 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
% 4.09/1.44 % Version: 3.5.1
% 4.09/1.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.09/1.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.09/1.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.09/1.44 % Starting new_bool_3 with 300s (1) cores
% 4.09/1.44 % Starting new_bool_1 with 300s (1) cores
% 4.09/1.44 % Starting sh5l with 300s (1) cores
% 4.09/1.44 % new_bool_1 with pid 1513287 completed with status 0
% 4.09/1.44 % Result found by new_bool_1
% 4.09/1.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.09/1.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.09/1.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.09/1.44 % Starting new_bool_3 with 300s (1) cores
% 4.09/1.44 % Starting new_bool_1 with 300s (1) cores
% 4.09/1.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.09/1.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.09/1.44 % Search class: FGHSM-FFMF31-MFFFFFNN
% 4.09/1.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.09/1.44 % Starting SubtermCWHack with 31s (1) cores
% 4.09/1.44 % SubtermCWHack with pid 1513295 completed with status 0
% 4.09/1.44 % Result found by SubtermCWHack
% 4.09/1.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.09/1.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.09/1.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.09/1.44 % Starting new_bool_3 with 300s (1) cores
% 4.09/1.44 % Starting new_bool_1 with 300s (1) cores
% 4.09/1.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.09/1.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.09/1.44 % Search class: FGHSM-FFMF31-MFFFFFNN
% 4.09/1.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.09/1.44 % Starting SubtermCWHack with 31s (1) cores
% 4.09/1.44 % Preprocessing time : 0.002 s
% 4.09/1.44
% 4.09/1.44 % Proof found!
% 4.09/1.44 % SZS status Theorem
% 4.09/1.44 % SZS output start CNFRefutation
% See solution above
% 4.09/1.44 % Parsed axioms : 55
% 4.09/1.44 % Removed by relevancy pruning/SinE : 43
% 4.09/1.44 % Initial clauses : 20
% 4.09/1.44 % Removed in clause preprocessing : 0
% 4.09/1.44 % Initial clauses in saturation : 20
% 4.09/1.44 % Processed clauses : 1316
% 4.09/1.44 % ...of these trivial : 0
% 4.09/1.44 % ...subsumed : 618
% 4.09/1.44 % ...remaining for further processing : 698
% 4.09/1.44 % Other redundant clauses eliminated : 1
% 4.09/1.44 % Clauses deleted for lack of memory : 0
% 4.09/1.44 % Backward-subsumed : 15
% 4.09/1.44 % Backward-rewritten : 3
% 4.09/1.44 % Generated clauses : 10445
% 4.09/1.44 % ...of the previous two non-redundant : 10153
% 4.09/1.44 % ...aggressively subsumed : 0
% 4.09/1.44 % Contextual simplify-reflections : 24
% 4.09/1.44 % Paramodulations : 10443
% 4.09/1.44 % Factorizations : 0
% 4.09/1.44 % NegExts : 0
% 4.09/1.44 % Equation resolutions : 2
% 4.09/1.44 % Disequality decompositions : 0
% 4.09/1.44 % Total rewrite steps : 544
% 4.09/1.44 % ...of those cached : 540
% 4.09/1.44 % Propositional unsat checks : 0
% 4.09/1.44 % Propositional check models : 0
% 4.09/1.44 % Propositional check unsatisfiable : 0
% 4.09/1.44 % Propositional clauses : 0
% 4.09/1.44 % Propositional clauses after purity: 0
% 4.09/1.44 % Propositional unsat core size : 0
% 4.09/1.44 % Propositional preprocessing time : 0.000
% 4.09/1.44 % Propositional encoding time : 0.000
% 4.09/1.44 % Propositional solver time : 0.000
% 4.09/1.44 % Success case prop preproc time : 0.000
% 4.09/1.44 % Success case prop encoding time : 0.000
% 4.09/1.44 % Success case prop solver time : 0.000
% 4.09/1.44 % Current number of processed clauses : 679
% 4.09/1.44 % Positive orientable unit clauses : 8
% 4.09/1.44 % Positive unorientable unit clauses: 0
% 4.09/1.44 % Negative unit clauses : 1
% 4.09/1.44 % Non-unit-clauses : 670
% 4.09/1.44 % Current number of unprocessed clauses: 8797
% 4.09/1.44 % ...number of literals in the above : 56977
% 4.09/1.44 % Current number of archived formulas : 0
% 4.09/1.44 % Current number of archived clauses : 18
% 4.09/1.44 % Clause-clause subsumption calls (NU) : 27033
% 4.09/1.44 % Rec. Clause-clause subsumption calls : 4816
% 4.09/1.44 % Non-unit clause-clause subsumptions : 629
% 4.09/1.44 % Unit Clause-clause subsumption calls : 70
% 4.09/1.44 % Rewrite failures with RHS unbound : 0
% 4.09/1.44 % BW rewrite match attempts : 6
% 4.09/1.44 % BW rewrite match successes : 2
% 4.09/1.44 % Condensation attempts : 0
% 4.09/1.44 % Condensation successes : 0
% 4.09/1.44 % Termbank termtop insertions : 539275
% 4.09/1.44 % Search garbage collected termcells : 538
% 4.09/1.44
% 4.09/1.44 % -------------------------------------------------
% 4.09/1.44 % User time : 0.647 s
% 4.09/1.44 % System time : 0.016 s
% 4.09/1.44 % Total time : 0.663 s
% 4.09/1.44 % Maximum resident set size: 3692 pages
% 4.09/1.44
% 4.09/1.44 % -------------------------------------------------
% 4.09/1.44 % User time : 0.651 s
% 4.09/1.44 % System time : 0.022 s
% 4.09/1.44 % Total time : 0.673 s
% 4.09/1.44 % Maximum resident set size: 4864 pages
% 4.09/1.44 % E exiting
%------------------------------------------------------------------------------