%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU156+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:28:18 PM UTC 2026
% Result : Theorem 0.17s 0.68s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 9
% Syntax : Number of formulae : 59 ( 25 unt; 0 def)
% Number of atoms : 139 ( 113 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 133 ( 53 ~; 57 |; 15 &)
% ( 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 : 120 ( 10 sgn 63 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t33_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X2 = X4
& X1 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.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/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(t69_enumset1,lemma,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
fof(t10_zfmisc_1,lemma,
! [X1,X2,X3,X4] :
~ ( X1 != X4
& X1 != X3
& unordered_pair(X1,X2) = unordered_pair(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_zfmisc_1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X2
| X4 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(t8_zfmisc_1,lemma,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(t9_zfmisc_1,lemma,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_zfmisc_1) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X2 = X4
& X1 = X3 ) ),
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,
( ( esk16_0 != esk18_0
| esk15_0 != esk17_0 )
& ordered_pair(esk15_0,esk16_0) = ordered_pair(esk17_0,esk18_0) ),
inference(fof_nnf,[status(thm)],[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]) ).
fof(c_0_15,lemma,
! [X1,X2,X3,X4] :
~ ( X1 != X4
& X1 != X3
& unordered_pair(X1,X2) = unordered_pair(X3,X4) ),
inference(fof_simplification,[status(thm)],[t10_zfmisc_1]) ).
cnf(c_0_16,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_17,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_18,plain,
! [X9,X10] : unordered_pair(X9,X10) = unordered_pair(X10,X9),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
fof(c_0_19,lemma,
! [X126,X127,X128,X129] :
( X126 = X129
| X126 = X128
| unordered_pair(X126,X127) != unordered_pair(X128,X129) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
cnf(c_0_20,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_16,c_0_17]),c_0_17]) ).
cnf(c_0_21,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_22,plain,
! [X17,X18,X19,X20,X21,X22] :
( ( X22 = singleton(X21)
| esk1_2(X21,X22) = X21
| in(esk1_2(X21,X22),X22) )
& ( X22 = singleton(X21)
| esk1_2(X21,X22) != X21
| ~ in(esk1_2(X21,X22),X22) )
& ( X18 != singleton(X17)
| in(X20,X18)
| X20 != X17 )
& ( X18 != singleton(X17)
| X19 = X17
| ~ in(X19,X18) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_23,plain,
! [X35,X36,X37,X38,X39,X40,X41,X42] :
( ( X42 = unordered_pair(X40,X41)
| esk4_3(X40,X41,X42) = X41
| esk4_3(X40,X41,X42) = X40
| in(esk4_3(X40,X41,X42),X42) )
& ( X42 = unordered_pair(X40,X41)
| ~ in(esk4_3(X40,X41,X42),X42)
| esk4_3(X40,X41,X42) != X41 )
& ( X42 = unordered_pair(X40,X41)
| ~ in(esk4_3(X40,X41,X42),X42)
| esk4_3(X40,X41,X42) != X40 )
& ( X37 != unordered_pair(X35,X36)
| in(X39,X37)
| X39 != X36 )
& ( X37 != unordered_pair(X35,X36)
| in(X39,X37)
| X39 != X35 )
& ( X37 != unordered_pair(X35,X36)
| X38 = X36
| X38 = X35
| ~ in(X38,X37) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_24,lemma,
( unordered_pair(X1,X2) != unordered_pair(X3,X4)
| X1 = X4
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,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_20,c_0_21]),c_0_21]) ).
fof(c_0_26,lemma,
! [X205,X206,X207] :
( X205 = X206
| singleton(X205) != unordered_pair(X206,X207) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_zfmisc_1])])]) ).
cnf(c_0_27,plain,
( X2 != singleton(X3)
| ~ in(X1,X2)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( X3 != unordered_pair(X2,X4)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,negated_conjecture,
( unordered_pair(X1,X2) != unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk18_0))
| X1 = unordered_pair(esk15_0,esk16_0)
| X1 = unordered_pair(esk15_0,esk15_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,lemma,
( singleton(X1) != unordered_pair(X2,X3)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
( X3 != unordered_pair(X4,X2)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
( ~ in(X1,X2)
| X2 != unordered_pair(X3,X3)
| X1 = X3 ),
inference(rw,[status(thm)],[c_0_27,c_0_14]) ).
cnf(c_0_33,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_28])]) ).
cnf(c_0_34,negated_conjecture,
( unordered_pair(esk15_0,esk15_0) = unordered_pair(esk17_0,esk17_0)
| unordered_pair(esk15_0,esk16_0) = unordered_pair(esk17_0,esk17_0) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_35,lemma,
( unordered_pair(X1,X1) != unordered_pair(X2,X3)
| X1 = X2 ),
inference(rw,[status(thm)],[c_0_30,c_0_14]) ).
cnf(c_0_36,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_31])]) ).
cnf(c_0_37,plain,
( ~ in(X1,unordered_pair(X2,X2))
| X1 = X2 ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( in(esk15_0,unordered_pair(esk17_0,esk17_0))
| unordered_pair(esk15_0,esk15_0) = unordered_pair(esk17_0,esk17_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,lemma,
( unordered_pair(X1,X1) != unordered_pair(X3,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_35,c_0_21]) ).
cnf(c_0_40,plain,
( X2 != unordered_pair(X3,X4)
| ~ in(X1,X2)
| X1 = X4
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_41,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_36,c_0_25]) ).
cnf(c_0_42,negated_conjecture,
esk15_0 = esk17_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_43,plain,
( ~ in(X1,unordered_pair(X3,X2))
| X1 = X3
| X1 = X2 ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_44,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_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
( unordered_pair(esk17_0,esk16_0) = unordered_pair(esk17_0,esk17_0)
| unordered_pair(esk17_0,esk16_0) = unordered_pair(esk17_0,esk18_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,negated_conjecture,
( esk16_0 != esk18_0
| esk15_0 != esk17_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_47,lemma,
! [X208,X209,X210] :
( X209 = X210
| singleton(X208) != unordered_pair(X209,X210) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t9_zfmisc_1])])]) ).
cnf(c_0_48,negated_conjecture,
( in(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_36,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
esk16_0 != esk18_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_42])]) ).
cnf(c_0_50,lemma,
( singleton(X1) != unordered_pair(X2,X3)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_51,negated_conjecture,
esk16_0 = esk17_0,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_48]),c_0_49]),c_0_39]) ).
cnf(c_0_52,lemma,
( unordered_pair(X1,X1) != unordered_pair(X2,X3)
| X2 = X3 ),
inference(rw,[status(thm)],[c_0_50,c_0_14]) ).
cnf(c_0_53,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_25,c_0_51]),c_0_42]),c_0_42]),c_0_42]) ).
cnf(c_0_54,lemma,
( unordered_pair(X1,X1) != unordered_pair(unordered_pair(esk17_0,esk17_0),unordered_pair(esk17_0,esk17_0))
| unordered_pair(esk17_0,esk18_0) = unordered_pair(esk17_0,esk17_0) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_55,lemma,
unordered_pair(esk17_0,esk18_0) = unordered_pair(esk17_0,esk17_0),
inference(er,[status(thm)],[c_0_54]) ).
cnf(c_0_56,negated_conjecture,
esk18_0 != esk17_0,
inference(rw,[status(thm)],[c_0_49,c_0_51]) ).
cnf(c_0_57,lemma,
unordered_pair(X1,X1) != unordered_pair(esk17_0,esk17_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_55]),c_0_56]) ).
cnf(c_0_58,lemma,
$false,
inference(er,[status(thm)],[c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU156+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.59 % Computer : n008.cluster.edu
% 0.13/0.59 % Model : x86_64 x86_64
% 0.13/0.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.59 % Memory : 8046.5625MB
% 0.13/0.59 % OS : Linux 6.8.0-71-generic
% 0.13/0.59 % CPULimit : 300
% 0.13/0.59 % WCLimit : 300
% 0.13/0.59 % DateTime : Mon Sep 21 05:54:24 UTC 2026
% 0.13/0.59 % CPUTime :
% 0.13/0.59 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.64 Running first-order theorem proving
% 0.17/0.64 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
% 0.17/0.68 % Version: 3.5.1
% 0.17/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.68 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.68 % Starting sh5l with 300s (1) cores
% 0.17/0.68 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 287896 completed with status 0
% 0.17/0.68 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.17/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.68 % No SInE strategy applied
% 0.17/0.68 % Search class: FGHSM-FFMS32-SFFFFFNN
% 0.17/0.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.68 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/0.68 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.68 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.17/0.68 % Starting new_bool_3 with 136s (1) cores
% 0.17/0.68 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with pid 287910 completed with status 0
% 0.17/0.68 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I
% 0.17/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.68 % No SInE strategy applied
% 0.17/0.68 % Search class: FGHSM-FFMS32-SFFFFFNN
% 0.17/0.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.68 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/0.68 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.68 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.17/0.68 % Preprocessing time : 0.002 s
% 0.17/0.68 % Presaturation interreduction done
% 0.17/0.68
% 0.17/0.68 % Proof found!
% 0.17/0.68 % SZS status Theorem
% 0.17/0.68 % SZS output start CNFRefutation
% See solution above
% 0.17/0.68 % Parsed axioms : 84
% 0.17/0.68 % Removed by relevancy pruning/SinE : 0
% 0.17/0.68 % Initial clauses : 134
% 0.17/0.68 % Removed in clause preprocessing : 12
% 0.17/0.68 % Initial clauses in saturation : 122
% 0.17/0.68 % Processed clauses : 522
% 0.17/0.68 % ...of these trivial : 11
% 0.17/0.68 % ...subsumed : 225
% 0.17/0.68 % ...remaining for further processing : 286
% 0.17/0.68 % Other redundant clauses eliminated : 35
% 0.17/0.68 % Clauses deleted for lack of memory : 0
% 0.17/0.68 % Backward-subsumed : 2
% 0.17/0.68 % Backward-rewritten : 31
% 0.17/0.68 % Generated clauses : 810
% 0.17/0.68 % ...of the previous two non-redundant : 666
% 0.17/0.68 % ...aggressively subsumed : 0
% 0.17/0.68 % Contextual simplify-reflections : 2
% 0.17/0.68 % Paramodulations : 770
% 0.17/0.68 % Factorizations : 1
% 0.17/0.68 % NegExts : 0
% 0.17/0.68 % Equation resolutions : 42
% 0.17/0.68 % Disequality decompositions : 0
% 0.17/0.68 % Total rewrite steps : 310
% 0.17/0.68 % ...of those cached : 240
% 0.17/0.68 % Propositional unsat checks : 0
% 0.17/0.68 % Propositional check models : 0
% 0.17/0.68 % Propositional check unsatisfiable : 0
% 0.17/0.68 % Propositional clauses : 0
% 0.17/0.68 % Propositional clauses after purity: 0
% 0.17/0.68 % Propositional unsat core size : 0
% 0.17/0.68 % Propositional preprocessing time : 0.000
% 0.17/0.68 % Propositional encoding time : 0.000
% 0.17/0.68 % Propositional solver time : 0.000
% 0.17/0.68 % Success case prop preproc time : 0.000
% 0.17/0.68 % Success case prop encoding time : 0.000
% 0.17/0.68 % Success case prop solver time : 0.000
% 0.17/0.68 % Current number of processed clauses : 118
% 0.17/0.68 % Positive orientable unit clauses : 28
% 0.17/0.68 % Positive unorientable unit clauses: 3
% 0.17/0.68 % Negative unit clauses : 22
% 0.17/0.68 % Non-unit-clauses : 65
% 0.17/0.68 % Current number of unprocessed clauses: 341
% 0.17/0.68 % ...number of literals in the above : 745
% 0.17/0.68 % Current number of archived formulas : 0
% 0.17/0.68 % Current number of archived clauses : 146
% 0.17/0.68 % Clause-clause subsumption calls (NU) : 1989
% 0.17/0.68 % Rec. Clause-clause subsumption calls : 1575
% 0.17/0.68 % Non-unit clause-clause subsumptions : 77
% 0.17/0.68 % Unit Clause-clause subsumption calls : 378
% 0.17/0.68 % Rewrite failures with RHS unbound : 0
% 0.17/0.68 % BW rewrite match attempts : 88
% 0.17/0.68 % BW rewrite match successes : 67
% 0.17/0.68 % Condensation attempts : 0
% 0.17/0.68 % Condensation successes : 0
% 0.17/0.68 % Termbank termtop insertions : 14494
% 0.17/0.68 % Search garbage collected termcells : 1908
% 0.17/0.68
% 0.17/0.68 % -------------------------------------------------
% 0.17/0.68 % User time : 0.020 s
% 0.17/0.68 % System time : 0.006 s
% 0.17/0.68 % Total time : 0.027 s
% 0.17/0.68 % Maximum resident set size: 3956 pages
% 0.17/0.68
% 0.17/0.68 % -------------------------------------------------
% 0.17/0.68 % User time : 0.080 s
% 0.17/0.68 % System time : 0.022 s
% 0.17/0.68 % Total time : 0.102 s
% 0.17/0.68 % Maximum resident set size: 4608 pages
% 0.17/0.68 % E exiting
%------------------------------------------------------------------------------