TSTP Solution File: SEU341+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU341+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 : Tue May 21 03:26:42 EDT 2024
% Result : Theorem 0.15s 0.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 61 ( 26 unt; 0 def)
% Number of atoms : 184 ( 8 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 207 ( 84 ~; 67 |; 29 &)
% ( 3 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 93 ( 7 sgn 58 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(t5_connsp_2,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( ( open_subset(X2,X1)
& in(X3,X2) )
=> point_neighbourhood(X2,X1,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_connsp_2) ).
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( in(X1,X2)
& element(X2,powerset(X3))
& empty(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_subset) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
fof(rc1_subset_1,axiom,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_subset_1) ).
fof(fc1_subset_1,axiom,
! [X1] : ~ empty(powerset(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_subset_1) ).
fof(d1_connsp_2,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,powerset(the_carrier(X1)))
=> ( point_neighbourhood(X3,X1,X2)
<=> in(X2,interior(X1,X3)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_connsp_2) ).
fof(t55_tops_1,axiom,
! [X1] :
( ( topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( top_str(X2)
=> ! [X3] :
( element(X3,powerset(the_carrier(X1)))
=> ! [X4] :
( element(X4,powerset(the_carrier(X2)))
=> ( ( open_subset(X4,X2)
=> interior(X2,X4) = X4 )
& ( interior(X1,X3) = X3
=> open_subset(X3,X1) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t55_tops_1) ).
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( in(X1,X2)
& element(X2,powerset(X3)) )
=> element(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_subset) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(c_0_12,plain,
! [X57,X58] :
( ~ element(X57,X58)
| empty(X58)
| in(X57,X58) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
fof(c_0_13,plain,
! [X46] : element(esk4_1(X46),X46),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( ( open_subset(X2,X1)
& in(X3,X2) )
=> point_neighbourhood(X2,X1,X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t5_connsp_2])]) ).
fof(c_0_15,plain,
! [X71,X72,X73] :
( ~ in(X71,X72)
| ~ element(X72,powerset(X73))
| ~ empty(X73) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])])]) ).
cnf(c_0_16,plain,
( empty(X2)
| in(X1,X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
element(esk4_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X75,X76] :
( ~ in(X75,X76)
| ~ empty(X76) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])]) ).
fof(c_0_19,negated_conjecture,
( ~ empty_carrier(esk8_0)
& topological_space(esk8_0)
& top_str(esk8_0)
& element(esk9_0,powerset(the_carrier(esk8_0)))
& element(esk10_0,the_carrier(esk8_0))
& open_subset(esk9_0,esk8_0)
& in(esk10_0,esk9_0)
& ~ point_neighbourhood(esk9_0,esk8_0,esk10_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
cnf(c_0_20,plain,
( ~ in(X1,X2)
| ~ element(X2,powerset(X3))
| ~ empty(X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( empty(X1)
| in(esk4_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( ~ in(X1,X2)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
in(esk10_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_24,plain,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2) ) ),
inference(fof_simplification,[status(thm)],[rc1_subset_1]) ).
cnf(c_0_25,plain,
( empty(X1)
| ~ empty(X2)
| ~ element(X1,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
element(esk9_0,powerset(the_carrier(esk8_0))),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,negated_conjecture,
~ empty(esk9_0),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_28,plain,
! [X50] :
( ( element(esk6_1(X50),powerset(X50))
| empty(X50) )
& ( ~ empty(esk6_1(X50))
| empty(X50) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])])]) ).
fof(c_0_29,plain,
! [X1] : ~ empty(powerset(X1)),
inference(fof_simplification,[status(thm)],[fc1_subset_1]) ).
fof(c_0_30,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,powerset(the_carrier(X1)))
=> ( point_neighbourhood(X3,X1,X2)
<=> in(X2,interior(X1,X3)) ) ) ) ),
inference(fof_simplification,[status(thm)],[d1_connsp_2]) ).
fof(c_0_31,plain,
! [X64,X65,X66,X67] :
( ( ~ open_subset(X67,X65)
| interior(X65,X67) = X67
| ~ element(X67,powerset(the_carrier(X65)))
| ~ element(X66,powerset(the_carrier(X64)))
| ~ top_str(X65)
| ~ topological_space(X64)
| ~ top_str(X64) )
& ( interior(X64,X66) != X66
| open_subset(X66,X64)
| ~ element(X67,powerset(the_carrier(X65)))
| ~ element(X66,powerset(the_carrier(X64)))
| ~ top_str(X65)
| ~ topological_space(X64)
| ~ top_str(X64) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t55_tops_1])])])])]) ).
cnf(c_0_32,negated_conjecture,
~ empty(the_carrier(esk8_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_33,plain,
( element(esk6_1(X1),powerset(X1))
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_34,plain,
! [X48] : ~ empty(powerset(X48)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_29])]) ).
fof(c_0_35,plain,
! [X32,X33,X34] :
( ( ~ point_neighbourhood(X34,X32,X33)
| in(X33,interior(X32,X34))
| ~ element(X34,powerset(the_carrier(X32)))
| ~ element(X33,the_carrier(X32))
| empty_carrier(X32)
| ~ topological_space(X32)
| ~ top_str(X32) )
& ( ~ in(X33,interior(X32,X34))
| point_neighbourhood(X34,X32,X33)
| ~ element(X34,powerset(the_carrier(X32)))
| ~ element(X33,the_carrier(X32))
| empty_carrier(X32)
| ~ topological_space(X32)
| ~ top_str(X32) ) ),
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_30])])])])]) ).
cnf(c_0_36,plain,
( interior(X2,X1) = X1
| ~ open_subset(X1,X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ element(X3,powerset(the_carrier(X4)))
| ~ top_str(X2)
| ~ topological_space(X4)
| ~ top_str(X4) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,negated_conjecture,
open_subset(esk9_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_38,negated_conjecture,
top_str(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_39,plain,
! [X61,X62,X63] :
( ~ in(X61,X62)
| ~ element(X62,powerset(X63))
| element(X61,X63) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])]) ).
cnf(c_0_40,negated_conjecture,
element(esk6_1(the_carrier(esk8_0)),powerset(the_carrier(esk8_0))),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_41,plain,
~ empty(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_42,plain,
! [X59,X60] :
( ( ~ element(X59,powerset(X60))
| subset(X59,X60) )
& ( ~ subset(X59,X60)
| element(X59,powerset(X60)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
fof(c_0_43,plain,
! [X54] : subset(X54,X54),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_44,plain,
( point_neighbourhood(X3,X2,X1)
| empty_carrier(X2)
| ~ in(X1,interior(X2,X3))
| ~ element(X3,powerset(the_carrier(X2)))
| ~ element(X1,the_carrier(X2))
| ~ topological_space(X2)
| ~ top_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_45,negated_conjecture,
topological_space(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_46,negated_conjecture,
~ empty_carrier(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_47,negated_conjecture,
( interior(esk8_0,esk9_0) = esk9_0
| ~ top_str(X1)
| ~ topological_space(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_26])]) ).
cnf(c_0_48,plain,
( element(X1,X3)
| ~ in(X1,X2)
| ~ element(X2,powerset(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_49,negated_conjecture,
in(esk6_1(the_carrier(esk8_0)),powerset(the_carrier(esk8_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_40]),c_0_41]) ).
cnf(c_0_50,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_51,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_52,negated_conjecture,
~ point_neighbourhood(esk9_0,esk8_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_53,negated_conjecture,
( point_neighbourhood(esk9_0,esk8_0,X1)
| ~ element(X1,the_carrier(esk8_0))
| ~ in(X1,interior(esk8_0,esk9_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_26]),c_0_38]),c_0_45])]),c_0_46]) ).
cnf(c_0_54,negated_conjecture,
element(esk10_0,the_carrier(esk8_0)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_55,negated_conjecture,
( interior(esk8_0,esk9_0) = esk9_0
| ~ element(X1,powerset(the_carrier(esk8_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_45]),c_0_38])]) ).
cnf(c_0_56,negated_conjecture,
( element(esk6_1(the_carrier(esk8_0)),X1)
| ~ element(powerset(the_carrier(esk8_0)),powerset(X1)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_57,plain,
element(X1,powerset(X1)),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,negated_conjecture,
~ in(esk10_0,interior(esk8_0,esk9_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
cnf(c_0_59,negated_conjecture,
interior(esk8_0,esk9_0) = esk9_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SEU341+1 : TPTP v8.2.0. Released v3.3.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n014.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Sun May 19 16:24:52 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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
% 0.15/0.46 # Version: 3.1.0
% 0.15/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 # Starting sh5l with 300s (1) cores
% 0.15/0.46 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 32751 completed with status 0
% 0.15/0.46 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.46 # No SInE strategy applied
% 0.15/0.46 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.15/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.15/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.46 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.15/0.46 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.15/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.15/0.46 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 32761 completed with status 0
% 0.15/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.15/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.46 # No SInE strategy applied
% 0.15/0.46 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.15/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.15/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.46 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.15/0.46 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.15/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.15/0.46 # Preprocessing time : 0.001 s
% 0.15/0.46 # Presaturation interreduction done
% 0.15/0.46
% 0.15/0.46 # Proof found!
% 0.15/0.46 # SZS status Theorem
% 0.15/0.46 # SZS output start CNFRefutation
% See solution above
% 0.15/0.46 # Parsed axioms : 45
% 0.15/0.46 # Removed by relevancy pruning/SinE : 0
% 0.15/0.46 # Initial clauses : 91
% 0.15/0.46 # Removed in clause preprocessing : 5
% 0.15/0.46 # Initial clauses in saturation : 86
% 0.15/0.46 # Processed clauses : 404
% 0.15/0.46 # ...of these trivial : 0
% 0.15/0.46 # ...subsumed : 56
% 0.15/0.46 # ...remaining for further processing : 348
% 0.15/0.46 # Other redundant clauses eliminated : 0
% 0.15/0.46 # Clauses deleted for lack of memory : 0
% 0.15/0.46 # Backward-subsumed : 14
% 0.15/0.46 # Backward-rewritten : 5
% 0.15/0.46 # Generated clauses : 463
% 0.15/0.46 # ...of the previous two non-redundant : 409
% 0.15/0.46 # ...aggressively subsumed : 0
% 0.15/0.46 # Contextual simplify-reflections : 1
% 0.15/0.46 # Paramodulations : 462
% 0.15/0.46 # Factorizations : 0
% 0.15/0.46 # NegExts : 0
% 0.15/0.46 # Equation resolutions : 0
% 0.15/0.46 # Disequality decompositions : 0
% 0.15/0.46 # Total rewrite steps : 91
% 0.15/0.46 # ...of those cached : 54
% 0.15/0.46 # Propositional unsat checks : 0
% 0.15/0.46 # Propositional check models : 0
% 0.15/0.46 # Propositional check unsatisfiable : 0
% 0.15/0.46 # Propositional clauses : 0
% 0.15/0.46 # Propositional clauses after purity: 0
% 0.15/0.46 # Propositional unsat core size : 0
% 0.15/0.46 # Propositional preprocessing time : 0.000
% 0.15/0.46 # Propositional encoding time : 0.000
% 0.15/0.46 # Propositional solver time : 0.000
% 0.15/0.46 # Success case prop preproc time : 0.000
% 0.15/0.46 # Success case prop encoding time : 0.000
% 0.15/0.46 # Success case prop solver time : 0.000
% 0.15/0.46 # Current number of processed clauses : 242
% 0.15/0.46 # Positive orientable unit clauses : 51
% 0.15/0.46 # Positive unorientable unit clauses: 0
% 0.15/0.46 # Negative unit clauses : 25
% 0.15/0.46 # Non-unit-clauses : 166
% 0.15/0.46 # Current number of unprocessed clauses: 176
% 0.15/0.46 # ...number of literals in the above : 532
% 0.15/0.46 # Current number of archived formulas : 0
% 0.15/0.46 # Current number of archived clauses : 106
% 0.15/0.46 # Clause-clause subsumption calls (NU) : 3729
% 0.15/0.46 # Rec. Clause-clause subsumption calls : 2604
% 0.15/0.46 # Non-unit clause-clause subsumptions : 23
% 0.15/0.46 # Unit Clause-clause subsumption calls : 185
% 0.15/0.46 # Rewrite failures with RHS unbound : 0
% 0.15/0.46 # BW rewrite match attempts : 12
% 0.15/0.46 # BW rewrite match successes : 2
% 0.15/0.46 # Condensation attempts : 0
% 0.15/0.46 # Condensation successes : 0
% 0.15/0.46 # Termbank termtop insertions : 11245
% 0.15/0.46 # Search garbage collected termcells : 920
% 0.15/0.46
% 0.15/0.46 # -------------------------------------------------
% 0.15/0.46 # User time : 0.017 s
% 0.15/0.46 # System time : 0.003 s
% 0.15/0.46 # Total time : 0.020 s
% 0.15/0.46 # Maximum resident set size: 1916 pages
% 0.15/0.46
% 0.15/0.46 # -------------------------------------------------
% 0.15/0.46 # User time : 0.065 s
% 0.15/0.46 # System time : 0.011 s
% 0.15/0.46 # Total time : 0.076 s
% 0.15/0.46 # Maximum resident set size: 1736 pages
% 0.15/0.46 % E---3.1 exiting
% 0.15/0.46 % E exiting
%------------------------------------------------------------------------------