TSTP Solution File: SEU394+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU394+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : Sat May 4 09:26:30 EDT 2024
% Result : Theorem 0.23s 0.61s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 12 unt; 0 def)
% Number of atoms : 142 ( 17 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 172 ( 69 ~; 46 |; 41 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 48 ( 1 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t2_yellow19,axiom,
! [X1] :
( ~ empty(X1)
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(X1))
& upper_relstr_subset(X2,boole_POSet(X1))
& proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
& element(X2,powerset(the_carrier(boole_POSet(X1)))) )
=> ! [X3] :
~ ( in(X3,X2)
& empty(X3) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.naIHaCcKm5/E---3.1_25678.p',t2_yellow19) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox/tmp/tmp.naIHaCcKm5/E---3.1_25678.p',t7_boole) ).
fof(t15_yellow19,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) )
=> X2 = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.naIHaCcKm5/E---3.1_25678.p',t15_yellow19) ).
fof(t65_zfmisc_1,axiom,
! [X1,X2] :
( set_difference(X1,singleton(X2)) = X1
<=> ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.naIHaCcKm5/E---3.1_25678.p',t65_zfmisc_1) ).
fof(t14_yellow19,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) )
=> set_difference(X2,singleton(empty_set)) = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.naIHaCcKm5/E---3.1_25678.p',t14_yellow19) ).
fof(fc2_pre_topc,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ~ empty(cast_as_carrier_subset(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.naIHaCcKm5/E---3.1_25678.p',fc2_pre_topc) ).
fof(fc12_relat_1,axiom,
( empty(empty_set)
& relation(empty_set)
& relation_empty_yielding(empty_set) ),
file('/export/starexec/sandbox/tmp/tmp.naIHaCcKm5/E---3.1_25678.p',fc12_relat_1) ).
fof(c_0_7,plain,
! [X1] :
( ~ empty(X1)
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(X1))
& upper_relstr_subset(X2,boole_POSet(X1))
& proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
& element(X2,powerset(the_carrier(boole_POSet(X1)))) )
=> ! [X3] :
~ ( in(X3,X2)
& empty(X3) ) ) ),
inference(fof_simplification,[status(thm)],[t2_yellow19]) ).
fof(c_0_8,plain,
! [X192,X193,X194] :
( empty(X192)
| empty(X193)
| ~ filtered_subset(X193,boole_POSet(X192))
| ~ upper_relstr_subset(X193,boole_POSet(X192))
| ~ proper_element(X193,powerset(the_carrier(boole_POSet(X192))))
| ~ element(X193,powerset(the_carrier(boole_POSet(X192))))
| ~ in(X194,X193)
| ~ empty(X194) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_9,plain,
! [X208,X209] :
( ~ in(X208,X209)
| ~ empty(X209) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) )
=> X2 = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t15_yellow19])]) ).
cnf(c_0_11,plain,
( empty(X1)
| empty(X2)
| ~ filtered_subset(X2,boole_POSet(X1))
| ~ upper_relstr_subset(X2,boole_POSet(X1))
| ~ proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
| ~ element(X2,powerset(the_carrier(boole_POSet(X1))))
| ~ in(X3,X2)
| ~ empty(X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( ~ in(X1,X2)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
( ~ empty_carrier(esk38_0)
& one_sorted_str(esk38_0)
& ~ empty(esk39_0)
& filtered_subset(esk39_0,boole_POSet(cast_as_carrier_subset(esk38_0)))
& upper_relstr_subset(esk39_0,boole_POSet(cast_as_carrier_subset(esk38_0)))
& proper_element(esk39_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk38_0)))))
& element(esk39_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk38_0)))))
& esk39_0 != filter_of_net_str(esk38_0,net_of_bool_filter(esk38_0,cast_as_carrier_subset(esk38_0),esk39_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_14,plain,
! [X1,X2] :
( set_difference(X1,singleton(X2)) = X1
<=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[t65_zfmisc_1]) ).
fof(c_0_15,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) )
=> set_difference(X2,singleton(empty_set)) = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
inference(fof_simplification,[status(thm)],[t14_yellow19]) ).
fof(c_0_16,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ~ empty(cast_as_carrier_subset(X1)) ),
inference(fof_simplification,[status(thm)],[fc2_pre_topc]) ).
cnf(c_0_17,plain,
( empty(X1)
| ~ proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
| ~ upper_relstr_subset(X2,boole_POSet(X1))
| ~ filtered_subset(X2,boole_POSet(X1))
| ~ element(X2,powerset(the_carrier(boole_POSet(X1))))
| ~ empty(X3)
| ~ in(X3,X2) ),
inference(csr,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
upper_relstr_subset(esk39_0,boole_POSet(cast_as_carrier_subset(esk38_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
proper_element(esk39_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk38_0))))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
filtered_subset(esk39_0,boole_POSet(cast_as_carrier_subset(esk38_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
element(esk39_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk38_0))))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_22,plain,
! [X205,X206] :
( ( set_difference(X205,singleton(X206)) != X205
| ~ in(X206,X205) )
& ( in(X206,X205)
| set_difference(X205,singleton(X206)) = X205 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
fof(c_0_23,plain,
! [X181,X182] :
( empty_carrier(X181)
| ~ one_sorted_str(X181)
| empty(X182)
| ~ filtered_subset(X182,boole_POSet(cast_as_carrier_subset(X181)))
| ~ upper_relstr_subset(X182,boole_POSet(cast_as_carrier_subset(X181)))
| ~ element(X182,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X181)))))
| set_difference(X182,singleton(empty_set)) = filter_of_net_str(X181,net_of_bool_filter(X181,cast_as_carrier_subset(X181),X182)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
fof(c_0_24,plain,
! [X84] :
( empty_carrier(X84)
| ~ one_sorted_str(X84)
| ~ empty(cast_as_carrier_subset(X84)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
cnf(c_0_25,negated_conjecture,
( empty(cast_as_carrier_subset(esk38_0))
| ~ empty(X1)
| ~ in(X1,esk39_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_26,plain,
( in(X1,X2)
| set_difference(X2,singleton(X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
( empty_carrier(X1)
| empty(X2)
| set_difference(X2,singleton(empty_set)) = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2))
| ~ one_sorted_str(X1)
| ~ filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
| ~ upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
| ~ element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
one_sorted_str(esk38_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_29,negated_conjecture,
~ empty(esk39_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_30,negated_conjecture,
~ empty_carrier(esk38_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_31,plain,
( empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ empty(cast_as_carrier_subset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,negated_conjecture,
( set_difference(esk39_0,singleton(X1)) = esk39_0
| empty(cast_as_carrier_subset(esk38_0))
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,negated_conjecture,
esk39_0 != filter_of_net_str(esk38_0,net_of_bool_filter(esk38_0,cast_as_carrier_subset(esk38_0),esk39_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_34,negated_conjecture,
filter_of_net_str(esk38_0,net_of_bool_filter(esk38_0,cast_as_carrier_subset(esk38_0),esk39_0)) = set_difference(esk39_0,singleton(empty_set)),
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(spm,[status(thm)],[c_0_27,c_0_18]),c_0_20]),c_0_21]),c_0_28])]),c_0_29]),c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( set_difference(esk39_0,singleton(X1)) = esk39_0
| ~ empty(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_28])]),c_0_30]) ).
cnf(c_0_36,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc12_relat_1]) ).
cnf(c_0_37,negated_conjecture,
set_difference(esk39_0,singleton(empty_set)) != esk39_0,
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SEU394+1 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.16 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n008.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Fri May 3 07:55:27 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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/tmp/tmp.naIHaCcKm5/E---3.1_25678.p
% 0.23/0.61 # Version: 3.1.0
% 0.23/0.61 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.61 # Starting sh5l with 300s (1) cores
% 0.23/0.61 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 25800 completed with status 0
% 0.23/0.61 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.23/0.61 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.61 # No SInE strategy applied
% 0.23/0.61 # Search class: FGHSM-FSLM31-MFFFFFNN
% 0.23/0.61 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.61 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 0.23/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.23/0.61 # Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.23/0.61 # Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.23/0.61 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 136s (1) cores
% 0.23/0.61 # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 25821 completed with status 0
% 0.23/0.61 # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 0.23/0.61 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.61 # No SInE strategy applied
% 0.23/0.61 # Search class: FGHSM-FSLM31-MFFFFFNN
% 0.23/0.61 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.61 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 0.23/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.23/0.61 # Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.23/0.61 # Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.23/0.61 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 136s (1) cores
% 0.23/0.61 # Preprocessing time : 0.005 s
% 0.23/0.61
% 0.23/0.61 # Proof found!
% 0.23/0.61 # SZS status Theorem
% 0.23/0.61 # SZS output start CNFRefutation
% See solution above
% 0.23/0.61 # Parsed axioms : 127
% 0.23/0.61 # Removed by relevancy pruning/SinE : 0
% 0.23/0.61 # Initial clauses : 396
% 0.23/0.61 # Removed in clause preprocessing : 34
% 0.23/0.61 # Initial clauses in saturation : 362
% 0.23/0.61 # Processed clauses : 559
% 0.23/0.61 # ...of these trivial : 52
% 0.23/0.61 # ...subsumed : 40
% 0.23/0.61 # ...remaining for further processing : 467
% 0.23/0.61 # Other redundant clauses eliminated : 1
% 0.23/0.61 # Clauses deleted for lack of memory : 0
% 0.23/0.61 # Backward-subsumed : 3
% 0.23/0.61 # Backward-rewritten : 6
% 0.23/0.61 # Generated clauses : 888
% 0.23/0.61 # ...of the previous two non-redundant : 757
% 0.23/0.61 # ...aggressively subsumed : 0
% 0.23/0.61 # Contextual simplify-reflections : 4
% 0.23/0.61 # Paramodulations : 883
% 0.23/0.61 # Factorizations : 2
% 0.23/0.61 # NegExts : 0
% 0.23/0.61 # Equation resolutions : 3
% 0.23/0.61 # Disequality decompositions : 0
% 0.23/0.61 # Total rewrite steps : 887
% 0.23/0.61 # ...of those cached : 756
% 0.23/0.61 # Propositional unsat checks : 0
% 0.23/0.61 # Propositional check models : 0
% 0.23/0.61 # Propositional check unsatisfiable : 0
% 0.23/0.61 # Propositional clauses : 0
% 0.23/0.61 # Propositional clauses after purity: 0
% 0.23/0.61 # Propositional unsat core size : 0
% 0.23/0.61 # Propositional preprocessing time : 0.000
% 0.23/0.61 # Propositional encoding time : 0.000
% 0.23/0.61 # Propositional solver time : 0.000
% 0.23/0.61 # Success case prop preproc time : 0.000
% 0.23/0.61 # Success case prop encoding time : 0.000
% 0.23/0.61 # Success case prop solver time : 0.000
% 0.23/0.61 # Current number of processed clauses : 457
% 0.23/0.61 # Positive orientable unit clauses : 202
% 0.23/0.61 # Positive unorientable unit clauses: 0
% 0.23/0.61 # Negative unit clauses : 26
% 0.23/0.61 # Non-unit-clauses : 229
% 0.23/0.61 # Current number of unprocessed clauses: 551
% 0.23/0.61 # ...number of literals in the above : 2051
% 0.23/0.61 # Current number of archived formulas : 0
% 0.23/0.61 # Current number of archived clauses : 9
% 0.23/0.61 # Clause-clause subsumption calls (NU) : 15624
% 0.23/0.61 # Rec. Clause-clause subsumption calls : 3240
% 0.23/0.61 # Non-unit clause-clause subsumptions : 26
% 0.23/0.61 # Unit Clause-clause subsumption calls : 8772
% 0.23/0.61 # Rewrite failures with RHS unbound : 0
% 0.23/0.61 # BW rewrite match attempts : 37
% 0.23/0.61 # BW rewrite match successes : 5
% 0.23/0.61 # Condensation attempts : 0
% 0.23/0.61 # Condensation successes : 0
% 0.23/0.61 # Termbank termtop insertions : 33042
% 0.23/0.61 # Search garbage collected termcells : 3276
% 0.23/0.61
% 0.23/0.61 # -------------------------------------------------
% 0.23/0.61 # User time : 0.057 s
% 0.23/0.61 # System time : 0.007 s
% 0.23/0.61 # Total time : 0.064 s
% 0.23/0.61 # Maximum resident set size: 2744 pages
% 0.23/0.61
% 0.23/0.61 # -------------------------------------------------
% 0.23/0.61 # User time : 0.229 s
% 0.23/0.61 # System time : 0.029 s
% 0.23/0.61 # Total time : 0.257 s
% 0.23/0.61 # Maximum resident set size: 1848 pages
% 0.23/0.61 % E---3.1 exiting
% 0.23/0.61 % E exiting
%------------------------------------------------------------------------------