TSTP Solution File: SEU156+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU156+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:24:59 EDT 2023
% Result : Theorem 0.16s 0.50s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 9
% Syntax : Number of formulae : 58 ( 25 unt; 0 def)
% Number of atoms : 136 ( 110 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 128 ( 50 ~; 57 |; 13 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 116 ( 10 sgn; 59 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t33_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X1 = X3
& X2 = X4 ) ),
file('/export/starexec/sandbox/tmp/tmp.N73CaCobYp/E---3.1_23895.p',t33_zfmisc_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox/tmp/tmp.N73CaCobYp/E---3.1_23895.p',d5_tarski) ).
fof(t69_enumset1,lemma,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/tmp/tmp.N73CaCobYp/E---3.1_23895.p',t69_enumset1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.N73CaCobYp/E---3.1_23895.p',commutativity_k2_tarski) ).
fof(t10_zfmisc_1,lemma,
! [X1,X2,X3,X4] :
~ ( unordered_pair(X1,X2) = unordered_pair(X3,X4)
& X1 != X3
& X1 != X4 ),
file('/export/starexec/sandbox/tmp/tmp.N73CaCobYp/E---3.1_23895.p',t10_zfmisc_1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.N73CaCobYp/E---3.1_23895.p',d1_tarski) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.N73CaCobYp/E---3.1_23895.p',d2_tarski) ).
fof(t8_zfmisc_1,lemma,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
file('/export/starexec/sandbox/tmp/tmp.N73CaCobYp/E---3.1_23895.p',t8_zfmisc_1) ).
fof(t9_zfmisc_1,lemma,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
file('/export/starexec/sandbox/tmp/tmp.N73CaCobYp/E---3.1_23895.p',t9_zfmisc_1) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X1 = X3
& X2 = X4 ) ),
inference(assume_negation,[status(cth)],[t33_zfmisc_1]) ).
fof(c_0_10,plain,
! [X88,X89] : ordered_pair(X88,X89) = unordered_pair(unordered_pair(X88,X89),singleton(X88)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_11,lemma,
! [X190] : unordered_pair(X190,X190) = singleton(X190),
inference(variable_rename,[status(thm)],[t69_enumset1]) ).
fof(c_0_12,negated_conjecture,
( ordered_pair(esk15_0,esk16_0) = ordered_pair(esk17_0,esk18_0)
& ( esk15_0 != esk17_0
| esk16_0 != esk18_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_13,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,lemma,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
ordered_pair(esk15_0,esk16_0) = ordered_pair(esk17_0,esk18_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_17,plain,
! [X9,X10] : unordered_pair(X9,X10) = unordered_pair(X10,X9),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
fof(c_0_18,lemma,
! [X126,X127,X128,X129] :
( unordered_pair(X126,X127) != unordered_pair(X128,X129)
| X126 = X128
| X126 = X129 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t10_zfmisc_1])]) ).
cnf(c_0_19,negated_conjecture,
unordered_pair(unordered_pair(esk17_0,esk18_0),unordered_pair(esk17_0,esk17_0)) = unordered_pair(unordered_pair(esk15_0,esk16_0),unordered_pair(esk15_0,esk15_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_20,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_21,plain,
! [X17,X18,X19,X20,X21,X22] :
( ( ~ in(X19,X18)
| X19 = X17
| X18 != singleton(X17) )
& ( X20 != X17
| in(X20,X18)
| X18 != singleton(X17) )
& ( ~ in(esk1_2(X21,X22),X22)
| esk1_2(X21,X22) != X21
| X22 = singleton(X21) )
& ( in(esk1_2(X21,X22),X22)
| esk1_2(X21,X22) = X21
| X22 = singleton(X21) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_tarski])])])])])]) ).
fof(c_0_22,plain,
! [X35,X36,X37,X38,X39,X40,X41,X42] :
( ( ~ in(X38,X37)
| X38 = X35
| X38 = X36
| X37 != unordered_pair(X35,X36) )
& ( X39 != X35
| in(X39,X37)
| X37 != unordered_pair(X35,X36) )
& ( X39 != X36
| in(X39,X37)
| X37 != unordered_pair(X35,X36) )
& ( esk4_3(X40,X41,X42) != X40
| ~ in(esk4_3(X40,X41,X42),X42)
| X42 = unordered_pair(X40,X41) )
& ( esk4_3(X40,X41,X42) != X41
| ~ in(esk4_3(X40,X41,X42),X42)
| X42 = unordered_pair(X40,X41) )
& ( in(esk4_3(X40,X41,X42),X42)
| esk4_3(X40,X41,X42) = X40
| esk4_3(X40,X41,X42) = X41
| X42 = unordered_pair(X40,X41) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_tarski])])])])])]) ).
cnf(c_0_23,lemma,
( X1 = X3
| X1 = X4
| unordered_pair(X1,X2) != unordered_pair(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
unordered_pair(unordered_pair(esk15_0,esk15_0),unordered_pair(esk15_0,esk16_0)) = unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk18_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20]) ).
fof(c_0_25,lemma,
! [X205,X206,X207] :
( singleton(X205) != unordered_pair(X206,X207)
| X205 = X206 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_zfmisc_1])]) ).
cnf(c_0_26,plain,
( X1 = X3
| ~ in(X1,X2)
| X2 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_pair(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
( X1 = unordered_pair(esk15_0,esk15_0)
| X1 = unordered_pair(esk15_0,esk16_0)
| unordered_pair(X1,X2) != unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk18_0)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,lemma,
( X1 = X2
| singleton(X1) != unordered_pair(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_pair(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
( X1 = X3
| X2 != unordered_pair(X3,X3)
| ~ in(X1,X2) ),
inference(rw,[status(thm)],[c_0_26,c_0_14]) ).
cnf(c_0_32,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_27])]) ).
cnf(c_0_33,negated_conjecture,
( unordered_pair(esk15_0,esk16_0) = unordered_pair(esk17_0,esk17_0)
| unordered_pair(esk15_0,esk15_0) = unordered_pair(esk17_0,esk17_0) ),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_34,lemma,
( X1 = X2
| unordered_pair(X1,X1) != unordered_pair(X2,X3) ),
inference(rw,[status(thm)],[c_0_29,c_0_14]) ).
cnf(c_0_35,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_30])]) ).
cnf(c_0_36,plain,
( X1 = X2
| ~ in(X1,unordered_pair(X2,X2)) ),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_37,negated_conjecture,
( unordered_pair(esk15_0,esk15_0) = unordered_pair(esk17_0,esk17_0)
| in(esk15_0,unordered_pair(esk17_0,esk17_0)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,lemma,
( X1 = X2
| unordered_pair(X1,X1) != unordered_pair(X3,X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_20]) ).
cnf(c_0_39,plain,
( X1 = X3
| X1 = X4
| ~ in(X1,X2)
| X2 != unordered_pair(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_40,negated_conjecture,
in(unordered_pair(esk15_0,esk16_0),unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk18_0))),
inference(spm,[status(thm)],[c_0_35,c_0_24]) ).
cnf(c_0_41,negated_conjecture,
esk15_0 = esk17_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_42,plain,
( X1 = X2
| X1 = X3
| ~ in(X1,unordered_pair(X3,X2)) ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_43,negated_conjecture,
in(unordered_pair(esk17_0,esk16_0),unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk18_0))),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
( unordered_pair(esk17_0,esk16_0) = unordered_pair(esk17_0,esk18_0)
| unordered_pair(esk17_0,esk16_0) = unordered_pair(esk17_0,esk17_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,negated_conjecture,
( esk15_0 != esk17_0
| esk16_0 != esk18_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_46,lemma,
! [X208,X209,X210] :
( singleton(X208) != unordered_pair(X209,X210)
| X209 = X210 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t9_zfmisc_1])]) ).
cnf(c_0_47,negated_conjecture,
( unordered_pair(esk17_0,esk16_0) = unordered_pair(esk17_0,esk17_0)
| in(esk16_0,unordered_pair(esk17_0,esk18_0)) ),
inference(spm,[status(thm)],[c_0_35,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
esk16_0 != esk18_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_41])]) ).
cnf(c_0_49,lemma,
( X2 = X3
| singleton(X1) != unordered_pair(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_50,negated_conjecture,
esk16_0 = esk17_0,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_47]),c_0_48]),c_0_38]) ).
cnf(c_0_51,lemma,
( X2 = X3
| unordered_pair(X1,X1) != unordered_pair(X2,X3) ),
inference(rw,[status(thm)],[c_0_49,c_0_14]) ).
cnf(c_0_52,negated_conjecture,
unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk18_0)) = unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk17_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_50]),c_0_41]),c_0_41]),c_0_41]) ).
cnf(c_0_53,lemma,
( unordered_pair(esk17_0,esk18_0) = unordered_pair(esk17_0,esk17_0)
| unordered_pair(X1,X1) != unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk17_0)) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,lemma,
unordered_pair(esk17_0,esk18_0) = unordered_pair(esk17_0,esk17_0),
inference(er,[status(thm)],[c_0_53]) ).
cnf(c_0_55,negated_conjecture,
esk18_0 != esk17_0,
inference(rw,[status(thm)],[c_0_48,c_0_50]) ).
cnf(c_0_56,lemma,
unordered_pair(X1,X1) != unordered_pair(esk17_0,esk17_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_54]),c_0_55]) ).
cnf(c_0_57,lemma,
$false,
inference(er,[status(thm)],[c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU156+2 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n028.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 08:51:21 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.16/0.45 Running first-order theorem proving
% 0.16/0.45 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.N73CaCobYp/E---3.1_23895.p
% 0.16/0.50 # Version: 3.1pre001
% 0.16/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.50 # Starting sh5l with 300s (1) cores
% 0.16/0.50 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 23974 completed with status 0
% 0.16/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.16/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.50 # No SInE strategy applied
% 0.16/0.50 # Search class: FGHSM-FFMS32-SFFFFFNN
% 0.16/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.16/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.16/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.50 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with pid 23983 completed with status 0
% 0.16/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I
% 0.16/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.50 # No SInE strategy applied
% 0.16/0.50 # Search class: FGHSM-FFMS32-SFFFFFNN
% 0.16/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.16/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.16/0.50 # Preprocessing time : 0.002 s
% 0.16/0.50 # Presaturation interreduction done
% 0.16/0.50
% 0.16/0.50 # Proof found!
% 0.16/0.50 # SZS status Theorem
% 0.16/0.50 # SZS output start CNFRefutation
% See solution above
% 0.16/0.50 # Parsed axioms : 84
% 0.16/0.50 # Removed by relevancy pruning/SinE : 0
% 0.16/0.50 # Initial clauses : 134
% 0.16/0.50 # Removed in clause preprocessing : 12
% 0.16/0.50 # Initial clauses in saturation : 122
% 0.16/0.50 # Processed clauses : 522
% 0.16/0.50 # ...of these trivial : 11
% 0.16/0.50 # ...subsumed : 225
% 0.16/0.50 # ...remaining for further processing : 286
% 0.16/0.50 # Other redundant clauses eliminated : 35
% 0.16/0.50 # Clauses deleted for lack of memory : 0
% 0.16/0.50 # Backward-subsumed : 2
% 0.16/0.50 # Backward-rewritten : 31
% 0.16/0.50 # Generated clauses : 810
% 0.16/0.50 # ...of the previous two non-redundant : 666
% 0.16/0.50 # ...aggressively subsumed : 0
% 0.16/0.50 # Contextual simplify-reflections : 2
% 0.16/0.50 # Paramodulations : 770
% 0.16/0.50 # Factorizations : 1
% 0.16/0.50 # NegExts : 0
% 0.16/0.50 # Equation resolutions : 42
% 0.16/0.50 # Total rewrite steps : 310
% 0.16/0.50 # Propositional unsat checks : 0
% 0.16/0.50 # Propositional check models : 0
% 0.16/0.50 # Propositional check unsatisfiable : 0
% 0.16/0.50 # Propositional clauses : 0
% 0.16/0.50 # Propositional clauses after purity: 0
% 0.16/0.50 # Propositional unsat core size : 0
% 0.16/0.50 # Propositional preprocessing time : 0.000
% 0.16/0.50 # Propositional encoding time : 0.000
% 0.16/0.50 # Propositional solver time : 0.000
% 0.16/0.50 # Success case prop preproc time : 0.000
% 0.16/0.50 # Success case prop encoding time : 0.000
% 0.16/0.50 # Success case prop solver time : 0.000
% 0.16/0.50 # Current number of processed clauses : 118
% 0.16/0.50 # Positive orientable unit clauses : 28
% 0.16/0.50 # Positive unorientable unit clauses: 3
% 0.16/0.50 # Negative unit clauses : 22
% 0.16/0.50 # Non-unit-clauses : 65
% 0.16/0.50 # Current number of unprocessed clauses: 341
% 0.16/0.50 # ...number of literals in the above : 745
% 0.16/0.50 # Current number of archived formulas : 0
% 0.16/0.50 # Current number of archived clauses : 146
% 0.16/0.50 # Clause-clause subsumption calls (NU) : 1838
% 0.16/0.50 # Rec. Clause-clause subsumption calls : 1492
% 0.16/0.50 # Non-unit clause-clause subsumptions : 77
% 0.16/0.50 # Unit Clause-clause subsumption calls : 280
% 0.16/0.50 # Rewrite failures with RHS unbound : 0
% 0.16/0.50 # BW rewrite match attempts : 88
% 0.16/0.50 # BW rewrite match successes : 67
% 0.16/0.50 # Condensation attempts : 0
% 0.16/0.50 # Condensation successes : 0
% 0.16/0.50 # Termbank termtop insertions : 13030
% 0.16/0.50
% 0.16/0.50 # -------------------------------------------------
% 0.16/0.50 # User time : 0.026 s
% 0.16/0.50 # System time : 0.003 s
% 0.16/0.50 # Total time : 0.029 s
% 0.16/0.50 # Maximum resident set size: 2104 pages
% 0.16/0.50
% 0.16/0.50 # -------------------------------------------------
% 0.16/0.50 # User time : 0.112 s
% 0.16/0.50 # System time : 0.008 s
% 0.16/0.50 # Total time : 0.120 s
% 0.16/0.50 # Maximum resident set size: 1748 pages
% 0.16/0.50 % E---3.1 exiting
% 0.16/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------