TSTP Solution File: ITP004_2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP004_2 : TPTP v8.2.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 22:15:11 EDT 2024
% Result : Theorem 1.18s 0.65s
% Output : CNFRefutation 1.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 21
% Syntax : Number of formulae : 52 ( 13 unt; 14 typ; 0 def)
% Number of atoms : 123 ( 7 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 142 ( 57 ~; 59 |; 8 &)
% ( 3 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 15 ( 10 >; 5 *; 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 : 72 ( 0 sgn 72 !; 0 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
del: $tType ).
tff(decl_22,type,
bool: del ).
tff(decl_24,type,
arr: ( del * del ) > del ).
tff(decl_25,type,
mem: ( $i * del ) > $o ).
tff(decl_26,type,
ap: ( $i * $i ) > $i ).
tff(decl_29,type,
p: $i > $o ).
tff(decl_34,type,
c_2Epred__set_2ESUBSET: del > $i ).
tff(decl_39,type,
c_2Ebool_2EIN: del > $i ).
tff(decl_40,type,
c_2Epred__set_2ECHOICE: del > $i ).
tff(decl_41,type,
c_2Epred__set_2EDELETE: del > $i ).
tff(decl_42,type,
c_2Epred__set_2EREST: del > $i ).
tff(decl_45,type,
esk1_0: del ).
tff(decl_46,type,
esk2_0: $i ).
tff(decl_48,type,
esk4_3: ( del * $i * $i ) > $i ).
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/sandbox2/benchmark/theBenchmark.p',conj_thm_2Epred__set_2EREST__SUBSET) ).
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/sandbox2/benchmark/theBenchmark.p',ax_thm_2Epred__set_2ESUBSET__DEF) ).
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/sandbox2/benchmark/Axioms/ITP001/ITP001_2.ax',ap_tp) ).
tff(mem_c_2Epred__set_2EREST,axiom,
! [X13: del] : mem(c_2Epred__set_2EREST(X13),arr(arr(X13,bool),arr(X13,bool))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mem_c_2Epred__set_2EREST) ).
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)))
<=> ( p(ap(ap(c_2Ebool_2EIN(X13),X17),X14))
& ( X17 != X18 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_thm_2Epred__set_2EIN__DELETE) ).
tff(mem_c_2Epred__set_2ECHOICE,axiom,
! [X13: del] : mem(c_2Epred__set_2ECHOICE(X13),arr(arr(X13,bool),X13)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mem_c_2Epred__set_2ECHOICE) ).
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/sandbox2/benchmark/theBenchmark.p',ax_thm_2Epred__set_2EREST__DEF) ).
tff(c_0_7,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]) ).
tff(c_0_8,plain,
! [X36: del,X37,X38,X39] :
( ( ~ p(ap(ap(c_2Epred__set_2ESUBSET(X36),X37),X38))
| ~ mem(X39,X36)
| ~ p(ap(ap(c_2Ebool_2EIN(X36),X39),X37))
| p(ap(ap(c_2Ebool_2EIN(X36),X39),X38))
| ~ mem(X38,arr(X36,bool))
| ~ mem(X37,arr(X36,bool)) )
& ( mem(esk4_3(X36,X37,X38),X36)
| p(ap(ap(c_2Epred__set_2ESUBSET(X36),X37),X38))
| ~ mem(X38,arr(X36,bool))
| ~ mem(X37,arr(X36,bool)) )
& ( p(ap(ap(c_2Ebool_2EIN(X36),esk4_3(X36,X37,X38)),X37))
| p(ap(ap(c_2Epred__set_2ESUBSET(X36),X37),X38))
| ~ mem(X38,arr(X36,bool))
| ~ mem(X37,arr(X36,bool)) )
& ( ~ p(ap(ap(c_2Ebool_2EIN(X36),esk4_3(X36,X37,X38)),X38))
| p(ap(ap(c_2Epred__set_2ESUBSET(X36),X37),X38))
| ~ mem(X38,arr(X36,bool))
| ~ mem(X37,arr(X36,bool)) ) ),
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])])])])])]) ).
tff(c_0_9,negated_conjecture,
( mem(esk2_0,arr(esk1_0,bool))
& ~ p(ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),esk2_0)),esk2_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
tff(c_0_10,plain,
! [X23: del,X24: del,X25,X26] :
( ~ mem(X25,arr(X23,X24))
| ~ mem(X26,X23)
| mem(ap(X25,X26),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_11,plain,
! [X32: del] : mem(c_2Epred__set_2EREST(X32),arr(arr(X32,bool),arr(X32,bool))),
inference(variable_rename,[status(thm)],[mem_c_2Epred__set_2EREST]) ).
tff(c_0_12,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)))
<=> ( p(ap(ap(c_2Ebool_2EIN(X13),X17),X14))
& ( X17 != X18 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[conj_thm_2Epred__set_2EIN__DELETE]) ).
tff(c_0_13,plain,
! [X41: del] : mem(c_2Epred__set_2ECHOICE(X41),arr(arr(X41,bool),X41)),
inference(variable_rename,[status(thm)],[mem_c_2Epred__set_2ECHOICE]) ).
tcf(c_0_14,plain,
! [X4,X3,X1: del] :
( p(ap(ap(c_2Ebool_2EIN(X1),esk4_3(X1,X3,X4)),X3))
| p(ap(ap(c_2Epred__set_2ESUBSET(X1),X3),X4))
| ~ mem(X4,arr(X1,bool))
| ~ mem(X3,arr(X1,bool)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_15,negated_conjecture,
mem(esk2_0,arr(esk1_0,bool)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_16,plain,
! [X2: del,X4,X3,X1: del] :
( mem(ap(X3,X4),X2)
| ~ mem(X3,arr(X1,X2))
| ~ mem(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_17,plain,
! [X1: del] : mem(c_2Epred__set_2EREST(X1),arr(arr(X1,bool),arr(X1,bool))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_18,plain,
! [X4,X3,X1: del] :
( mem(esk4_3(X1,X3,X4),X1)
| p(ap(ap(c_2Epred__set_2ESUBSET(X1),X3),X4))
| ~ mem(X4,arr(X1,bool))
| ~ mem(X3,arr(X1,bool)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tff(c_0_19,plain,
! [X43: del,X44,X45,X46] :
( ( p(ap(ap(c_2Ebool_2EIN(X43),X45),X44))
| ~ p(ap(ap(c_2Ebool_2EIN(X43),X45),ap(ap(c_2Epred__set_2EDELETE(X43),X44),X46)))
| ~ mem(X46,X43)
| ~ mem(X45,X43)
| ~ mem(X44,arr(X43,bool)) )
& ( ( X45 != X46 )
| ~ p(ap(ap(c_2Ebool_2EIN(X43),X45),ap(ap(c_2Epred__set_2EDELETE(X43),X44),X46)))
| ~ mem(X46,X43)
| ~ mem(X45,X43)
| ~ mem(X44,arr(X43,bool)) )
& ( ~ p(ap(ap(c_2Ebool_2EIN(X43),X45),X44))
| ( X45 = X46 )
| p(ap(ap(c_2Ebool_2EIN(X43),X45),ap(ap(c_2Epred__set_2EDELETE(X43),X44),X46)))
| ~ mem(X46,X43)
| ~ mem(X45,X43)
| ~ mem(X44,arr(X43,bool)) ) ),
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_12])])])])]) ).
tff(c_0_20,plain,
! [X33: del,X34] :
( ~ mem(X34,arr(X33,bool))
| ( ap(c_2Epred__set_2EREST(X33),X34) = ap(ap(c_2Epred__set_2EDELETE(X33),X34),ap(c_2Epred__set_2ECHOICE(X33),X34)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax_thm_2Epred__set_2EREST__DEF])])]) ).
tcf(c_0_21,plain,
! [X1: del] : mem(c_2Epred__set_2ECHOICE(X1),arr(arr(X1,bool),X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_22,negated_conjecture,
! [X3] :
( p(ap(ap(c_2Ebool_2EIN(esk1_0),esk4_3(esk1_0,X3,esk2_0)),X3))
| p(ap(ap(c_2Epred__set_2ESUBSET(esk1_0),X3),esk2_0))
| ~ mem(X3,arr(esk1_0,bool)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
tcf(c_0_23,plain,
! [X3,X1: del] :
( mem(ap(c_2Epred__set_2EREST(X1),X3),arr(X1,bool))
| ~ mem(X3,arr(X1,bool)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
tcf(c_0_24,negated_conjecture,
! [X3] :
( p(ap(ap(c_2Epred__set_2ESUBSET(esk1_0),X3),esk2_0))
| mem(esk4_3(esk1_0,X3,esk2_0),esk1_0)
| ~ mem(X3,arr(esk1_0,bool)) ),
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
tcf(c_0_25,plain,
! [X5,X4,X3,X1: del] :
( p(ap(ap(c_2Ebool_2EIN(X1),X3),X4))
| ~ p(ap(ap(c_2Ebool_2EIN(X1),X3),ap(ap(c_2Epred__set_2EDELETE(X1),X4),X5)))
| ~ mem(X5,X1)
| ~ mem(X3,X1)
| ~ mem(X4,arr(X1,bool)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
tcf(c_0_26,plain,
! [X3,X1: del] :
( ( ap(c_2Epred__set_2EREST(X1),X3) = ap(ap(c_2Epred__set_2EDELETE(X1),X3),ap(c_2Epred__set_2ECHOICE(X1),X3)) )
| ~ mem(X3,arr(X1,bool)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
tcf(c_0_27,plain,
! [X3,X1: del] :
( mem(ap(c_2Epred__set_2ECHOICE(X1),X3),X1)
| ~ mem(X3,arr(X1,bool)) ),
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
tcf(c_0_28,negated_conjecture,
! [X3] :
( p(ap(ap(c_2Ebool_2EIN(esk1_0),esk4_3(esk1_0,ap(c_2Epred__set_2EREST(esk1_0),X3),esk2_0)),ap(c_2Epred__set_2EREST(esk1_0),X3)))
| p(ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),X3)),esk2_0))
| ~ mem(X3,arr(esk1_0,bool)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
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_9]) ).
tcf(c_0_30,negated_conjecture,
! [X3] :
( p(ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),X3)),esk2_0))
| mem(esk4_3(esk1_0,ap(c_2Epred__set_2EREST(esk1_0),X3),esk2_0),esk1_0)
| ~ mem(X3,arr(esk1_0,bool)) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
tcf(c_0_31,plain,
! [X4,X3,X1: del] :
( p(ap(ap(c_2Ebool_2EIN(X1),X3),X4))
| ~ p(ap(ap(c_2Ebool_2EIN(X1),X3),ap(c_2Epred__set_2EREST(X1),X4)))
| ~ mem(X4,arr(X1,bool))
| ~ mem(X3,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
tcf(c_0_32,negated_conjecture,
p(ap(ap(c_2Ebool_2EIN(esk1_0),esk4_3(esk1_0,ap(c_2Epred__set_2EREST(esk1_0),esk2_0),esk2_0)),ap(c_2Epred__set_2EREST(esk1_0),esk2_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_15]),c_0_29]) ).
tcf(c_0_33,negated_conjecture,
mem(esk4_3(esk1_0,ap(c_2Epred__set_2EREST(esk1_0),esk2_0),esk2_0),esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_15]),c_0_29]) ).
tcf(c_0_34,plain,
! [X4,X3,X1: del] :
( p(ap(ap(c_2Epred__set_2ESUBSET(X1),X3),X4))
| ~ p(ap(ap(c_2Ebool_2EIN(X1),esk4_3(X1,X3,X4)),X4))
| ~ mem(X4,arr(X1,bool))
| ~ mem(X3,arr(X1,bool)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_35,negated_conjecture,
p(ap(ap(c_2Ebool_2EIN(esk1_0),esk4_3(esk1_0,ap(c_2Epred__set_2EREST(esk1_0),esk2_0),esk2_0)),esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_15]),c_0_33])]) ).
tcf(c_0_36,negated_conjecture,
~ mem(ap(c_2Epred__set_2EREST(esk1_0),esk2_0),arr(esk1_0,bool)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_15])]),c_0_29]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_23]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : ITP004_2 : TPTP v8.2.0. Bugfixed v7.5.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n011.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sat May 18 16:29:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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
% 1.18/0.65 # Version: 3.1.0
% 1.18/0.65 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.18/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.18/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.18/0.65 # Starting new_bool_3 with 300s (1) cores
% 1.18/0.65 # Starting new_bool_1 with 300s (1) cores
% 1.18/0.65 # Starting sh5l with 300s (1) cores
% 1.18/0.65 # new_bool_3 with pid 25230 completed with status 0
% 1.18/0.65 # Result found by new_bool_3
% 1.18/0.65 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.18/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.18/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.18/0.65 # Starting new_bool_3 with 300s (1) cores
% 1.18/0.65 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.18/0.65 # Search class: FGHSM-FFMF31-MFFFFFNN
% 1.18/0.65 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.18/0.65 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 1.18/0.65 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 25234 completed with status 0
% 1.18/0.65 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 1.18/0.65 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.18/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.18/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.18/0.65 # Starting new_bool_3 with 300s (1) cores
% 1.18/0.65 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.18/0.65 # Search class: FGHSM-FFMF31-MFFFFFNN
% 1.18/0.65 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.18/0.65 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 1.18/0.65 # Preprocessing time : 0.001 s
% 1.18/0.65 # Presaturation interreduction done
% 1.18/0.65
% 1.18/0.65 # Proof found!
% 1.18/0.65 # SZS status Theorem
% 1.18/0.65 # SZS output start CNFRefutation
% See solution above
% 1.18/0.65 # Parsed axioms : 55
% 1.18/0.65 # Removed by relevancy pruning/SinE : 43
% 1.18/0.65 # Initial clauses : 20
% 1.18/0.65 # Removed in clause preprocessing : 0
% 1.18/0.65 # Initial clauses in saturation : 20
% 1.18/0.65 # Processed clauses : 603
% 1.18/0.65 # ...of these trivial : 14
% 1.18/0.65 # ...subsumed : 156
% 1.18/0.65 # ...remaining for further processing : 433
% 1.18/0.65 # Other redundant clauses eliminated : 8
% 1.18/0.65 # Clauses deleted for lack of memory : 0
% 1.18/0.65 # Backward-subsumed : 92
% 1.18/0.65 # Backward-rewritten : 8
% 1.18/0.65 # Generated clauses : 2201
% 1.18/0.65 # ...of the previous two non-redundant : 2018
% 1.18/0.65 # ...aggressively subsumed : 0
% 1.18/0.65 # Contextual simplify-reflections : 13
% 1.18/0.65 # Paramodulations : 2138
% 1.18/0.65 # Factorizations : 54
% 1.18/0.65 # NegExts : 0
% 1.18/0.65 # Equation resolutions : 9
% 1.18/0.65 # Disequality decompositions : 0
% 1.18/0.65 # Total rewrite steps : 568
% 1.18/0.65 # ...of those cached : 560
% 1.18/0.65 # Propositional unsat checks : 0
% 1.18/0.65 # Propositional check models : 0
% 1.18/0.65 # Propositional check unsatisfiable : 0
% 1.18/0.65 # Propositional clauses : 0
% 1.18/0.65 # Propositional clauses after purity: 0
% 1.18/0.65 # Propositional unsat core size : 0
% 1.18/0.65 # Propositional preprocessing time : 0.000
% 1.18/0.65 # Propositional encoding time : 0.000
% 1.18/0.65 # Propositional solver time : 0.000
% 1.18/0.65 # Success case prop preproc time : 0.000
% 1.18/0.65 # Success case prop encoding time : 0.000
% 1.18/0.65 # Success case prop solver time : 0.000
% 1.18/0.65 # Current number of processed clauses : 312
% 1.18/0.65 # Positive orientable unit clauses : 12
% 1.18/0.65 # Positive unorientable unit clauses: 0
% 1.18/0.65 # Negative unit clauses : 2
% 1.18/0.65 # Non-unit-clauses : 298
% 1.18/0.65 # Current number of unprocessed clauses: 1439
% 1.18/0.65 # ...number of literals in the above : 7136
% 1.18/0.65 # Current number of archived formulas : 0
% 1.18/0.65 # Current number of archived clauses : 120
% 1.18/0.65 # Clause-clause subsumption calls (NU) : 11925
% 1.18/0.65 # Rec. Clause-clause subsumption calls : 2052
% 1.18/0.65 # Non-unit clause-clause subsumptions : 248
% 1.18/0.65 # Unit Clause-clause subsumption calls : 268
% 1.18/0.65 # Rewrite failures with RHS unbound : 0
% 1.18/0.65 # BW rewrite match attempts : 67
% 1.18/0.65 # BW rewrite match successes : 4
% 1.18/0.65 # Condensation attempts : 0
% 1.18/0.65 # Condensation successes : 0
% 1.18/0.65 # Termbank termtop insertions : 110153
% 1.18/0.65 # Search garbage collected termcells : 538
% 1.18/0.65
% 1.18/0.65 # -------------------------------------------------
% 1.18/0.65 # User time : 0.130 s
% 1.18/0.65 # System time : 0.002 s
% 1.18/0.65 # Total time : 0.132 s
% 1.18/0.65 # Maximum resident set size: 1828 pages
% 1.18/0.65
% 1.18/0.65 # -------------------------------------------------
% 1.18/0.65 # User time : 0.131 s
% 1.18/0.65 # System time : 0.005 s
% 1.18/0.65 # Total time : 0.136 s
% 1.18/0.65 # Maximum resident set size: 1768 pages
% 1.18/0.65 % E---3.1 exiting
% 1.18/0.65 % E exiting
%------------------------------------------------------------------------------