%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU131+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 : n003.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:11 PM UTC 2026
% Result : Theorem 1.46s 0.79s
% Output : CNFRefutation 1.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 61 ( 17 unt; 0 def)
% Number of atoms : 162 ( 39 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 165 ( 64 ~; 62 |; 25 &)
% ( 10 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 143 ( 15 sgn 72 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( ~ in(X4,X2)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(l32_xboole_1,conjecture,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_xboole_1) ).
fof(t3_xboole_0,lemma,
! [X1,X2] :
( ~ ( disjoint(X1,X2)
& ? [X3] :
( in(X3,X2)
& in(X3,X1) ) )
& ~ ( ! [X3] :
~ ( in(X3,X2)
& in(X3,X1) )
& ~ disjoint(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_xboole_0) ).
fof(t1_xboole_1,lemma,
! [X1,X2,X3] :
( ( subset(X2,X3)
& subset(X1,X2) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(t7_xboole_1,lemma,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(t12_xboole_1,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(d7_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(t28_xboole_1,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(c_0_11,plain,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( ~ in(X4,X2)
& in(X4,X1) ) ) ),
inference(fof_simplification,[status(thm)],[d4_xboole_0]) ).
fof(c_0_12,plain,
! [X41,X42,X43,X44,X45,X46,X47,X48] :
( ( X48 = set_difference(X46,X47)
| in(esk5_3(X46,X47,X48),X48)
| ~ in(esk5_3(X46,X47,X48),X47) )
& ( X48 = set_difference(X46,X47)
| in(esk5_3(X46,X47,X48),X48)
| in(esk5_3(X46,X47,X48),X46) )
& ( X48 = set_difference(X46,X47)
| in(esk5_3(X46,X47,X48),X47)
| ~ in(esk5_3(X46,X47,X48),X46)
| ~ in(esk5_3(X46,X47,X48),X48) )
& ( X43 != set_difference(X41,X42)
| in(X45,X43)
| in(X45,X42)
| ~ in(X45,X41) )
& ( X43 != set_difference(X41,X42)
| ~ in(X44,X43)
| ~ in(X44,X42) )
& ( X43 != set_difference(X41,X42)
| ~ in(X44,X43)
| in(X44,X41) ) ),
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)],[c_0_11])])])])])])]) ).
fof(c_0_13,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
cnf(c_0_14,plain,
( X4 != set_difference(X2,X3)
| ~ in(X1,X2)
| in(X1,X4)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X26,X27,X28,X29,X30] :
( ( subset(X29,X30)
| ~ in(esk3_2(X29,X30),X30) )
& ( subset(X29,X30)
| in(esk3_2(X29,X30),X29) )
& ( in(X28,X27)
| ~ in(X28,X26)
| ~ subset(X26,X27) ) ),
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)],[d3_tarski])])])])])])]) ).
fof(c_0_16,negated_conjecture,
~ ! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
inference(assume_negation,[status(cth)],[l32_xboole_1]) ).
fof(c_0_17,plain,
! [X13,X14,X15] :
( ( X15 = empty_set
| in(esk1_1(X15),X15) )
& ( ~ in(X14,X13)
| X13 != empty_set ) ),
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)],[c_0_13])])])])])]) ).
cnf(c_0_18,plain,
( X3 != set_difference(X2,X4)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( ~ in(X1,X2)
| in(X1,X3)
| in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,negated_conjecture,
( ( subset(esk6_0,esk7_0)
| set_difference(esk6_0,esk7_0) = empty_set )
& ( ~ subset(esk6_0,esk7_0)
| set_difference(esk6_0,esk7_0) != empty_set ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
cnf(c_0_22,plain,
( ~ in(X2,X1)
| X1 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_23,lemma,
! [X1,X2] :
( ~ ( disjoint(X1,X2)
& ? [X3] :
( in(X3,X2)
& in(X3,X1) ) )
& ~ ( ! [X3] :
~ ( in(X3,X2)
& in(X3,X1) )
& ~ disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[t3_xboole_0]) ).
fof(c_0_24,lemma,
! [X73,X74,X75] :
( subset(X73,X75)
| ~ subset(X74,X75)
| ~ subset(X73,X74) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])])]) ).
fof(c_0_25,lemma,
! [X104,X105] : subset(X104,set_union2(X104,X105)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
cnf(c_0_26,plain,
( ~ in(X1,set_difference(X2,X3))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( in(esk3_2(X1,X2),X3)
| in(esk3_2(X1,X2),set_difference(X1,X3))
| subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,negated_conjecture,
( subset(esk6_0,esk7_0)
| set_difference(esk6_0,esk7_0) = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
( X3 != set_difference(X4,X2)
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_31,lemma,
! [X87,X88,X90,X91,X92] :
( ( ~ disjoint(X90,X91)
| ~ in(X92,X91)
| ~ in(X92,X90) )
& ( disjoint(X87,X88)
| in(esk11_2(X87,X88),X88) )
& ( disjoint(X87,X88)
| in(esk11_2(X87,X88),X87) ) ),
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)],[c_0_23])])])])])])]) ).
cnf(c_0_32,lemma,
( ~ subset(X2,X3)
| ~ subset(X1,X2)
| subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,lemma,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
( ~ in(esk3_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_35,plain,
( in(esk3_2(set_difference(X1,X2),X3),X1)
| subset(set_difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
fof(c_0_36,lemma,
! [X65,X66] :
( set_union2(X65,X66) = X66
| ~ subset(X65,X66) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_xboole_1])])]) ).
cnf(c_0_37,negated_conjecture,
( in(esk3_2(esk6_0,X1),esk7_0)
| subset(esk6_0,X1)
| subset(esk6_0,esk7_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_38,plain,
( ~ in(X1,X3)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_39,lemma,
( disjoint(X1,X2)
| in(esk11_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_40,lemma,
( ~ subset(X1,X2)
| subset(X1,set_union2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_41,plain,
subset(set_difference(X1,X2),X1),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,lemma,
( ~ subset(X1,X2)
| set_union2(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,negated_conjecture,
subset(esk6_0,esk7_0),
inference(spm,[status(thm)],[c_0_34,c_0_37]) ).
fof(c_0_44,plain,
! [X50,X51] :
( ( disjoint(X50,X51)
| set_intersection2(X50,X51) != empty_set )
& ( set_intersection2(X50,X51) = empty_set
| ~ disjoint(X50,X51) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d7_xboole_0])])]) ).
cnf(c_0_45,lemma,
( ~ in(esk11_2(X1,X2),set_difference(X3,X2))
| disjoint(X1,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,lemma,
( disjoint(X1,X2)
| in(esk11_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_47,plain,
! [X9,X10] : set_intersection2(X9,X10) = set_intersection2(X10,X9),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_48,lemma,
! [X79,X80] :
( set_intersection2(X79,X80) = X79
| ~ subset(X79,X80) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t28_xboole_1])])]) ).
cnf(c_0_49,lemma,
subset(set_difference(X1,X2),set_union2(X1,X3)),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_50,lemma,
set_union2(esk6_0,esk7_0) = esk7_0,
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_51,plain,
( ~ disjoint(X1,X2)
| set_intersection2(X1,X2) = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_52,lemma,
disjoint(set_difference(X1,X2),X2),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_53,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_54,lemma,
( ~ subset(X1,X2)
| set_intersection2(X1,X2) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_55,lemma,
subset(set_difference(esk6_0,X1),esk7_0),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,negated_conjecture,
( ~ subset(esk6_0,esk7_0)
| set_difference(esk6_0,esk7_0) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_57,lemma,
set_intersection2(X1,set_difference(X2,X1)) = empty_set,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_58,lemma,
set_intersection2(esk7_0,set_difference(esk6_0,X1)) = set_difference(esk6_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_53]) ).
cnf(c_0_59,negated_conjecture,
set_difference(esk6_0,esk7_0) != empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_43])]) ).
cnf(c_0_60,lemma,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU131+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n003.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Mon Sep 21 05:53:31 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.52 Running first-order theorem proving
% 0.27/0.52 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
% 1.46/0.79 % Version: 3.5.1
% 1.46/0.79 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.46/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.46/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.46/0.79 % Starting new_bool_3 with 300s (1) cores
% 1.46/0.79 % Starting new_bool_1 with 300s (1) cores
% 1.46/0.79 % Starting sh5l with 300s (1) cores
% 1.46/0.79 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3547745 completed with status 0
% 1.46/0.79 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.46/0.79 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.46/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.46/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.46/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.46/0.79 % No SInE strategy applied
% 1.46/0.79 % Search class: FGHSM-FFMS32-SFFFFFNN
% 1.46/0.79 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.46/0.79 % Starting SubtermCWHack with 136s (1) cores
% 1.46/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.46/0.79 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 1.46/0.79 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 1.46/0.79 % Starting new_bool_3 with 136s (1) cores
% 1.46/0.79 % new_bool_3 with pid 3547753 completed with status 0
% 1.46/0.79 % Result found by new_bool_3
% 1.46/0.79 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.46/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.46/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.46/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.46/0.79 % No SInE strategy applied
% 1.46/0.79 % Search class: FGHSM-FFMS32-SFFFFFNN
% 1.46/0.79 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.46/0.79 % Starting SubtermCWHack with 136s (1) cores
% 1.46/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.46/0.79 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 1.46/0.79 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 1.46/0.79 % Starting new_bool_3 with 136s (1) cores
% 1.46/0.79 % Preprocessing time : 0.003 s
% 1.46/0.79 % Presaturation interreduction done
% 1.46/0.79
% 1.46/0.79 % Proof found!
% 1.46/0.79 % SZS status Theorem
% 1.46/0.79 % SZS output start CNFRefutation
% See solution above
% 1.46/0.80 % Parsed axioms : 44
% 1.46/0.80 % Removed by relevancy pruning/SinE : 0
% 1.46/0.80 % Initial clauses : 70
% 1.46/0.80 % Removed in clause preprocessing : 4
% 1.46/0.80 % Initial clauses in saturation : 66
% 1.46/0.80 % Processed clauses : 2284
% 1.46/0.80 % ...of these trivial : 75
% 1.46/0.80 % ...subsumed : 1755
% 1.46/0.80 % ...remaining for further processing : 454
% 1.46/0.80 % Other redundant clauses eliminated : 40
% 1.46/0.80 % Clauses deleted for lack of memory : 0
% 1.46/0.80 % Backward-subsumed : 3
% 1.46/0.80 % Backward-rewritten : 6
% 1.46/0.80 % Generated clauses : 8868
% 1.46/0.80 % ...of the previous two non-redundant : 7236
% 1.46/0.80 % ...aggressively subsumed : 0
% 1.46/0.80 % Contextual simplify-reflections : 1
% 1.46/0.80 % Paramodulations : 8790
% 1.46/0.80 % Factorizations : 38
% 1.46/0.80 % NegExts : 0
% 1.46/0.80 % Equation resolutions : 40
% 1.46/0.80 % Disequality decompositions : 0
% 1.46/0.80 % Total rewrite steps : 2230
% 1.46/0.80 % ...of those cached : 1874
% 1.46/0.80 % Propositional unsat checks : 0
% 1.46/0.80 % Propositional check models : 0
% 1.46/0.80 % Propositional check unsatisfiable : 0
% 1.46/0.80 % Propositional clauses : 0
% 1.46/0.80 % Propositional clauses after purity: 0
% 1.46/0.80 % Propositional unsat core size : 0
% 1.46/0.80 % Propositional preprocessing time : 0.000
% 1.46/0.80 % Propositional encoding time : 0.000
% 1.46/0.80 % Propositional solver time : 0.000
% 1.46/0.80 % Success case prop preproc time : 0.000
% 1.46/0.80 % Success case prop encoding time : 0.000
% 1.46/0.80 % Success case prop solver time : 0.000
% 1.46/0.80 % Current number of processed clauses : 369
% 1.46/0.80 % Positive orientable unit clauses : 75
% 1.46/0.80 % Positive unorientable unit clauses: 2
% 1.46/0.80 % Negative unit clauses : 8
% 1.46/0.80 % Non-unit-clauses : 284
% 1.46/0.80 % Current number of unprocessed clauses: 5017
% 1.46/0.80 % ...number of literals in the above : 13383
% 1.46/0.80 % Current number of archived formulas : 0
% 1.46/0.80 % Current number of archived clauses : 73
% 1.46/0.80 % Clause-clause subsumption calls (NU) : 25025
% 1.46/0.80 % Rec. Clause-clause subsumption calls : 17317
% 1.46/0.80 % Non-unit clause-clause subsumptions : 1260
% 1.46/0.80 % Unit Clause-clause subsumption calls : 1569
% 1.46/0.80 % Rewrite failures with RHS unbound : 0
% 1.46/0.80 % BW rewrite match attempts : 81
% 1.46/0.80 % BW rewrite match successes : 33
% 1.46/0.80 % Condensation attempts : 0
% 1.46/0.80 % Condensation successes : 0
% 1.46/0.80 % Termbank termtop insertions : 73738
% 1.46/0.80 % Search garbage collected termcells : 1027
% 1.46/0.80
% 1.46/0.80 % -------------------------------------------------
% 1.46/0.80 % User time : 0.220 s
% 1.46/0.80 % System time : 0.013 s
% 1.46/0.80 % Total time : 0.233 s
% 1.46/0.80 % Maximum resident set size: 3408 pages
% 1.46/0.80
% 1.46/0.80 % -------------------------------------------------
% 1.46/0.80 % User time : 0.851 s
% 1.46/0.80 % System time : 0.057 s
% 1.46/0.80 % Total time : 0.907 s
% 1.46/0.80 % Maximum resident set size: 4608 pages
% 1.46/0.80 % E exiting
%------------------------------------------------------------------------------