TSTP Solution File: SEU391+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU391+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:26:17 EDT 2023
% Result : Theorem 0.54s 1.04s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 48 ( 14 unt; 0 def)
% Number of atoms : 188 ( 19 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 218 ( 78 ~; 86 |; 36 &)
% ( 4 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 67 ( 0 sgn; 38 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(dt_k2_yellow19,axiom,
! [X1,X2] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1)
& ~ empty_carrier(X2)
& net_str(X2,X1) )
=> element(filter_of_net_str(X1,X2),powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) ),
file('/export/starexec/sandbox2/tmp/tmp.yQUQq5Re1r/E---3.1_19809.p',dt_k2_yellow19) ).
fof(t4_waybel_7,lemma,
! [X1] : the_carrier(boole_POSet(X1)) = powerset(X1),
file('/export/starexec/sandbox2/tmp/tmp.yQUQq5Re1r/E---3.1_19809.p',t4_waybel_7) ).
fof(t11_yellow19,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3] :
( in(X3,filter_of_net_str(X1,X2))
<=> ( is_eventually_in(X1,X2,X3)
& element(X3,powerset(the_carrier(X1))) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yQUQq5Re1r/E---3.1_19809.p',t11_yellow19) ).
fof(d3_yellow19,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> filter_of_net_str(X1,X2) = a_2_1_yellow19(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yQUQq5Re1r/E---3.1_19809.p',d3_yellow19) ).
fof(fraenkel_a_2_1_yellow19,axiom,
! [X1,X2,X3] :
( ( ~ empty_carrier(X2)
& one_sorted_str(X2)
& ~ empty_carrier(X3)
& net_str(X3,X2) )
=> ( in(X1,a_2_1_yellow19(X2,X3))
<=> ? [X4] :
( element(X4,powerset(the_carrier(X2)))
& X1 = X4
& is_eventually_in(X2,X3,X4) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yQUQq5Re1r/E---3.1_19809.p',fraenkel_a_2_1_yellow19) ).
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( in(X1,X2)
& element(X2,powerset(X3)) )
=> element(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.yQUQq5Re1r/E---3.1_19809.p',t4_subset) ).
fof(d3_pre_topc,axiom,
! [X1] :
( one_sorted_str(X1)
=> cast_as_carrier_subset(X1) = the_carrier(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.yQUQq5Re1r/E---3.1_19809.p',d3_pre_topc) ).
fof(c_0_7,plain,
! [X1,X2] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1)
& ~ empty_carrier(X2)
& net_str(X2,X1) )
=> element(filter_of_net_str(X1,X2),powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) ),
inference(fof_simplification,[status(thm)],[dt_k2_yellow19]) ).
fof(c_0_8,plain,
! [X62,X63] :
( empty_carrier(X62)
| ~ one_sorted_str(X62)
| empty_carrier(X63)
| ~ net_str(X63,X62)
| element(filter_of_net_str(X62,X63),powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X62))))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
fof(c_0_9,lemma,
! [X142] : the_carrier(boole_POSet(X142)) = powerset(X142),
inference(variable_rename,[status(thm)],[t4_waybel_7]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3] :
( in(X3,filter_of_net_str(X1,X2))
<=> ( is_eventually_in(X1,X2,X3)
& element(X3,powerset(the_carrier(X1))) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t11_yellow19])]) ).
fof(c_0_11,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> filter_of_net_str(X1,X2) = a_2_1_yellow19(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[d3_yellow19]) ).
cnf(c_0_12,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| element(filter_of_net_str(X1,X2),powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,lemma,
the_carrier(boole_POSet(X1)) = powerset(X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,negated_conjecture,
( ~ empty_carrier(esk1_0)
& one_sorted_str(esk1_0)
& ~ empty_carrier(esk2_0)
& net_str(esk2_0,esk1_0)
& ( ~ in(esk3_0,filter_of_net_str(esk1_0,esk2_0))
| ~ is_eventually_in(esk1_0,esk2_0,esk3_0)
| ~ element(esk3_0,powerset(the_carrier(esk1_0))) )
& ( is_eventually_in(esk1_0,esk2_0,esk3_0)
| in(esk3_0,filter_of_net_str(esk1_0,esk2_0)) )
& ( element(esk3_0,powerset(the_carrier(esk1_0)))
| in(esk3_0,filter_of_net_str(esk1_0,esk2_0)) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_15,plain,
! [X1,X2,X3] :
( ( ~ empty_carrier(X2)
& one_sorted_str(X2)
& ~ empty_carrier(X3)
& net_str(X3,X2) )
=> ( in(X1,a_2_1_yellow19(X2,X3))
<=> ? [X4] :
( element(X4,powerset(the_carrier(X2)))
& X1 = X4
& is_eventually_in(X2,X3,X4) ) ) ),
inference(fof_simplification,[status(thm)],[fraenkel_a_2_1_yellow19]) ).
fof(c_0_16,plain,
! [X60,X61] :
( empty_carrier(X60)
| ~ one_sorted_str(X60)
| empty_carrier(X61)
| ~ net_str(X61,X60)
| filter_of_net_str(X60,X61) = a_2_1_yellow19(X60,X61) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_17,plain,
! [X34,X35,X36] :
( ~ in(X34,X35)
| ~ element(X35,powerset(X36))
| element(X34,X36) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])]) ).
cnf(c_0_18,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| element(filter_of_net_str(X1,X2),powerset(powerset(cast_as_carrier_subset(X1))))
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
net_str(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
~ empty_carrier(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_23,plain,
! [X143] :
( ~ one_sorted_str(X143)
| cast_as_carrier_subset(X143) = the_carrier(X143) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_pre_topc])]) ).
fof(c_0_24,plain,
! [X134,X135,X136,X138] :
( ( element(esk22_3(X134,X135,X136),powerset(the_carrier(X135)))
| ~ in(X134,a_2_1_yellow19(X135,X136))
| empty_carrier(X135)
| ~ one_sorted_str(X135)
| empty_carrier(X136)
| ~ net_str(X136,X135) )
& ( X134 = esk22_3(X134,X135,X136)
| ~ in(X134,a_2_1_yellow19(X135,X136))
| empty_carrier(X135)
| ~ one_sorted_str(X135)
| empty_carrier(X136)
| ~ net_str(X136,X135) )
& ( is_eventually_in(X135,X136,esk22_3(X134,X135,X136))
| ~ in(X134,a_2_1_yellow19(X135,X136))
| empty_carrier(X135)
| ~ one_sorted_str(X135)
| empty_carrier(X136)
| ~ net_str(X136,X135) )
& ( ~ element(X138,powerset(the_carrier(X135)))
| X134 != X138
| ~ is_eventually_in(X135,X136,X138)
| in(X134,a_2_1_yellow19(X135,X136))
| empty_carrier(X135)
| ~ one_sorted_str(X135)
| empty_carrier(X136)
| ~ net_str(X136,X135) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])]) ).
cnf(c_0_25,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| filter_of_net_str(X1,X2) = a_2_1_yellow19(X1,X2)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
( element(X1,X3)
| ~ in(X1,X2)
| ~ element(X2,powerset(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,negated_conjecture,
( element(esk3_0,powerset(the_carrier(esk1_0)))
| in(esk3_0,filter_of_net_str(esk1_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_28,negated_conjecture,
element(filter_of_net_str(esk1_0,esk2_0),powerset(powerset(cast_as_carrier_subset(esk1_0)))),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_21]),c_0_22]) ).
cnf(c_0_29,plain,
( cast_as_carrier_subset(X1) = the_carrier(X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
( is_eventually_in(X1,X2,esk22_3(X3,X1,X2))
| empty_carrier(X1)
| empty_carrier(X2)
| ~ in(X3,a_2_1_yellow19(X1,X2))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,negated_conjecture,
a_2_1_yellow19(esk1_0,esk2_0) = filter_of_net_str(esk1_0,esk2_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_19]),c_0_20])]),c_0_21]),c_0_22]) ).
cnf(c_0_32,plain,
( X1 = esk22_3(X1,X2,X3)
| empty_carrier(X2)
| empty_carrier(X3)
| ~ in(X1,a_2_1_yellow19(X2,X3))
| ~ one_sorted_str(X2)
| ~ net_str(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,negated_conjecture,
( element(esk3_0,powerset(the_carrier(esk1_0)))
| element(esk3_0,X1)
| ~ element(filter_of_net_str(esk1_0,esk2_0),powerset(X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
element(filter_of_net_str(esk1_0,esk2_0),powerset(powerset(the_carrier(esk1_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_20])]) ).
cnf(c_0_35,negated_conjecture,
( is_eventually_in(esk1_0,esk2_0,esk22_3(X1,esk1_0,esk2_0))
| ~ in(X1,filter_of_net_str(esk1_0,esk2_0)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_19]),c_0_31]),c_0_20])]),c_0_21]),c_0_22]) ).
cnf(c_0_36,negated_conjecture,
( is_eventually_in(esk1_0,esk2_0,esk3_0)
| in(esk3_0,filter_of_net_str(esk1_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_37,negated_conjecture,
( esk22_3(X1,esk1_0,esk2_0) = X1
| ~ in(X1,filter_of_net_str(esk1_0,esk2_0)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_19]),c_0_31]),c_0_20])]),c_0_21]),c_0_22]) ).
cnf(c_0_38,negated_conjecture,
( ~ in(esk3_0,filter_of_net_str(esk1_0,esk2_0))
| ~ is_eventually_in(esk1_0,esk2_0,esk3_0)
| ~ element(esk3_0,powerset(the_carrier(esk1_0))) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_39,negated_conjecture,
element(esk3_0,powerset(the_carrier(esk1_0))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
( is_eventually_in(esk1_0,esk2_0,esk22_3(esk3_0,esk1_0,esk2_0))
| is_eventually_in(esk1_0,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( esk22_3(esk3_0,esk1_0,esk2_0) = esk3_0
| is_eventually_in(esk1_0,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_37,c_0_36]) ).
cnf(c_0_42,plain,
( in(X3,a_2_1_yellow19(X2,X4))
| empty_carrier(X2)
| empty_carrier(X4)
| ~ element(X1,powerset(the_carrier(X2)))
| X3 != X1
| ~ is_eventually_in(X2,X4,X1)
| ~ one_sorted_str(X2)
| ~ net_str(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_43,negated_conjecture,
( ~ is_eventually_in(esk1_0,esk2_0,esk3_0)
| ~ in(esk3_0,filter_of_net_str(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
cnf(c_0_44,negated_conjecture,
is_eventually_in(esk1_0,esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(X3,a_2_1_yellow19(X2,X1))
| ~ is_eventually_in(X2,X1,X3)
| ~ element(X3,powerset(the_carrier(X2)))
| ~ net_str(X1,X2)
| ~ one_sorted_str(X2) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_46,negated_conjecture,
~ in(esk3_0,filter_of_net_str(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_44]),c_0_31]),c_0_39]),c_0_19]),c_0_20])]),c_0_22]),c_0_21]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.23 % Problem : SEU391+2 : TPTP v8.1.2. Released v3.3.0.
% 0.23/0.24 % Command : run_E %s %d THM
% 0.24/0.46 % Computer : n022.cluster.edu
% 0.24/0.46 % Model : x86_64 x86_64
% 0.24/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.24/0.46 % Memory : 8042.1875MB
% 0.24/0.46 % OS : Linux 3.10.0-693.el7.x86_64
% 0.24/0.46 % CPULimit : 2400
% 0.24/0.46 % WCLimit : 300
% 0.24/0.46 % DateTime : Mon Oct 2 09:11:10 EDT 2023
% 0.24/0.46 % CPUTime :
% 0.44/0.70 Running first-order theorem proving
% 0.44/0.70 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/tmp/tmp.yQUQq5Re1r/E---3.1_19809.p
% 0.54/1.04 # Version: 3.1pre001
% 0.54/1.04 # Preprocessing class: FSLMSMSSSSSNFFN.
% 0.54/1.04 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/1.04 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.54/1.04 # Starting new_bool_3 with 600s (2) cores
% 0.54/1.04 # Starting new_bool_1 with 600s (2) cores
% 0.54/1.04 # Starting sh5l with 300s (1) cores
% 0.54/1.04 # new_bool_1 with pid 19889 completed with status 0
% 0.54/1.04 # Result found by new_bool_1
% 0.54/1.04 # Preprocessing class: FSLMSMSSSSSNFFN.
% 0.54/1.04 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/1.04 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.54/1.04 # Starting new_bool_3 with 600s (2) cores
% 0.54/1.04 # Starting new_bool_1 with 600s (2) cores
% 0.54/1.04 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.54/1.04 # Search class: FGHSM-FSLM31-MFFFFFNN
% 0.54/1.04 # Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.54/1.04 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 270s (1) cores
% 0.54/1.04 # Starting new_bool_1 with 61s (1) cores
% 0.54/1.04 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 19893 completed with status 0
% 0.54/1.04 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.54/1.04 # Preprocessing class: FSLMSMSSSSSNFFN.
% 0.54/1.04 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/1.04 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.54/1.04 # Starting new_bool_3 with 600s (2) cores
% 0.54/1.04 # Starting new_bool_1 with 600s (2) cores
% 0.54/1.04 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.54/1.04 # Search class: FGHSM-FSLM31-MFFFFFNN
% 0.54/1.04 # Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.54/1.04 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 270s (1) cores
% 0.54/1.04 # Preprocessing time : 0.007 s
% 0.54/1.04 # Presaturation interreduction done
% 0.54/1.04
% 0.54/1.04 # Proof found!
% 0.54/1.04 # SZS status Theorem
% 0.54/1.04 # SZS output start CNFRefutation
% See solution above
% 0.54/1.04 # Parsed axioms : 901
% 0.54/1.04 # Removed by relevancy pruning/SinE : 765
% 0.54/1.04 # Initial clauses : 433
% 0.54/1.04 # Removed in clause preprocessing : 17
% 0.54/1.04 # Initial clauses in saturation : 416
% 0.54/1.04 # Processed clauses : 3877
% 0.54/1.04 # ...of these trivial : 53
% 0.54/1.04 # ...subsumed : 2194
% 0.54/1.04 # ...remaining for further processing : 1629
% 0.54/1.04 # Other redundant clauses eliminated : 90
% 0.54/1.04 # Clauses deleted for lack of memory : 0
% 0.54/1.04 # Backward-subsumed : 26
% 0.54/1.04 # Backward-rewritten : 103
% 0.54/1.04 # Generated clauses : 9654
% 0.54/1.04 # ...of the previous two non-redundant : 8721
% 0.54/1.04 # ...aggressively subsumed : 0
% 0.54/1.04 # Contextual simplify-reflections : 25
% 0.54/1.04 # Paramodulations : 9573
% 0.54/1.04 # Factorizations : 4
% 0.54/1.04 # NegExts : 0
% 0.54/1.04 # Equation resolutions : 90
% 0.54/1.04 # Total rewrite steps : 2121
% 0.54/1.04 # Propositional unsat checks : 0
% 0.54/1.04 # Propositional check models : 0
% 0.54/1.04 # Propositional check unsatisfiable : 0
% 0.54/1.04 # Propositional clauses : 0
% 0.54/1.04 # Propositional clauses after purity: 0
% 0.54/1.04 # Propositional unsat core size : 0
% 0.54/1.04 # Propositional preprocessing time : 0.000
% 0.54/1.04 # Propositional encoding time : 0.000
% 0.54/1.04 # Propositional solver time : 0.000
% 0.54/1.04 # Success case prop preproc time : 0.000
% 0.54/1.04 # Success case prop encoding time : 0.000
% 0.54/1.04 # Success case prop solver time : 0.000
% 0.54/1.04 # Current number of processed clauses : 1073
% 0.54/1.04 # Positive orientable unit clauses : 249
% 0.54/1.04 # Positive unorientable unit clauses: 1
% 0.54/1.04 # Negative unit clauses : 183
% 0.54/1.04 # Non-unit-clauses : 640
% 0.54/1.04 # Current number of unprocessed clauses: 5611
% 0.54/1.04 # ...number of literals in the above : 21629
% 0.54/1.04 # Current number of archived formulas : 0
% 0.54/1.04 # Current number of archived clauses : 526
% 0.54/1.04 # Clause-clause subsumption calls (NU) : 150090
% 0.54/1.04 # Rec. Clause-clause subsumption calls : 24857
% 0.54/1.04 # Non-unit clause-clause subsumptions : 853
% 0.54/1.04 # Unit Clause-clause subsumption calls : 9042
% 0.54/1.04 # Rewrite failures with RHS unbound : 0
% 0.54/1.04 # BW rewrite match attempts : 40
% 0.54/1.04 # BW rewrite match successes : 9
% 0.54/1.04 # Condensation attempts : 0
% 0.54/1.04 # Condensation successes : 0
% 0.54/1.04 # Termbank termtop insertions : 170194
% 0.54/1.04
% 0.54/1.04 # -------------------------------------------------
% 0.54/1.04 # User time : 0.279 s
% 0.54/1.04 # System time : 0.023 s
% 0.54/1.04 # Total time : 0.302 s
% 0.54/1.04 # Maximum resident set size: 4008 pages
% 0.54/1.04
% 0.54/1.04 # -------------------------------------------------
% 0.54/1.04 # User time : 0.575 s
% 0.54/1.04 # System time : 0.028 s
% 0.54/1.04 # Total time : 0.603 s
% 0.54/1.04 # Maximum resident set size: 2964 pages
% 0.54/1.04 % E---3.1 exiting
% 0.54/1.04 % E---3.1 exiting
%------------------------------------------------------------------------------