%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU344+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:29:03 PM UTC 2026
% Result : Theorem 35.17s 5.10s
% Output : CNFRefutation 35.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 49 ( 18 unt; 0 def)
% Number of atoms : 164 ( 42 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 186 ( 71 ~; 70 |; 23 &)
% ( 5 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 3 con; 0-3 aty)
% Number of variables : 68 ( 4 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t2_lattice3,conjecture,
! [X1,X2] :
( element(X2,the_carrier(boole_lattice(X1)))
=> ! [X3] :
( element(X3,the_carrier(boole_lattice(X1)))
=> ( below(boole_lattice(X1),X2,X3)
<=> subset(X2,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_lattice3) ).
fof(d1_lattice3,axiom,
! [X1,X2] :
( ( latt_str(X2)
& strict_latt_str(X2) )
=> ( X2 = boole_lattice(X1)
<=> ( ! [X3] :
( element(X3,powerset(X1))
=> ! [X4] :
( element(X4,powerset(X1))
=> ( apply_binary(the_L_meet(X2),X3,X4) = subset_intersection2(X1,X3,X4)
& apply_binary(the_L_join(X2),X3,X4) = subset_union2(X1,X3,X4) ) ) )
& the_carrier(X2) = powerset(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_lattice3) ).
fof(dt_k1_lattice3,axiom,
! [X1] :
( latt_str(boole_lattice(X1))
& strict_latt_str(boole_lattice(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_lattice3) ).
fof(d3_lattices,axiom,
! [X1] :
( ( join_semilatt_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( below(X1,X2,X3)
<=> join(X1,X2,X3) = X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_lattices) ).
fof(fc1_lattice3,axiom,
! [X1] :
( strict_latt_str(boole_lattice(X1))
& ~ empty_carrier(boole_lattice(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_lattice3) ).
fof(t1_lattice3,lemma,
! [X1,X2] :
( element(X2,the_carrier(boole_lattice(X1)))
=> ! [X3] :
( element(X3,the_carrier(boole_lattice(X1)))
=> ( meet(boole_lattice(X1),X2,X3) = set_intersection2(X2,X3)
& join(boole_lattice(X1),X2,X3) = set_union2(X2,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_lattice3) ).
fof(dt_l3_lattices,axiom,
! [X1] :
( latt_str(X1)
=> ( join_semilatt_str(X1)
& meet_semilatt_str(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_l3_lattices) ).
fof(t12_xboole_1,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(t7_xboole_1,lemma,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] :
( element(X2,the_carrier(boole_lattice(X1)))
=> ! [X3] :
( element(X3,the_carrier(boole_lattice(X1)))
=> ( below(boole_lattice(X1),X2,X3)
<=> subset(X2,X3) ) ) ),
inference(assume_negation,[status(cth)],[t2_lattice3]) ).
fof(c_0_10,plain,
! [X346,X347,X348,X349] :
( ( ~ latt_str(X347)
| ~ strict_latt_str(X347)
| X347 = boole_lattice(X346)
| the_carrier(X347) != powerset(X346)
| apply_binary(the_L_meet(X347),esk61_2(X346,X347),esk62_2(X346,X347)) != subset_intersection2(X346,esk61_2(X346,X347),esk62_2(X346,X347))
| apply_binary(the_L_join(X347),esk61_2(X346,X347),esk62_2(X346,X347)) != subset_union2(X346,esk61_2(X346,X347),esk62_2(X346,X347)) )
& ( ~ latt_str(X347)
| ~ strict_latt_str(X347)
| X347 = boole_lattice(X346)
| the_carrier(X347) != powerset(X346)
| element(esk62_2(X346,X347),powerset(X346)) )
& ( ~ latt_str(X347)
| ~ strict_latt_str(X347)
| X347 = boole_lattice(X346)
| the_carrier(X347) != powerset(X346)
| element(esk61_2(X346,X347),powerset(X346)) )
& ( ~ latt_str(X347)
| ~ strict_latt_str(X347)
| X347 != boole_lattice(X346)
| ~ element(X348,powerset(X346))
| ~ element(X349,powerset(X346))
| apply_binary(the_L_meet(X347),X348,X349) = subset_intersection2(X346,X348,X349) )
& ( ~ latt_str(X347)
| ~ strict_latt_str(X347)
| X347 != boole_lattice(X346)
| ~ element(X348,powerset(X346))
| ~ element(X349,powerset(X346))
| apply_binary(the_L_join(X347),X348,X349) = subset_union2(X346,X348,X349) )
& ( ~ latt_str(X347)
| ~ strict_latt_str(X347)
| X347 != boole_lattice(X346)
| the_carrier(X347) = powerset(X346) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_lattice3])])])])])]) ).
fof(c_0_11,plain,
! [X63] :
( latt_str(boole_lattice(X63))
& strict_latt_str(boole_lattice(X63)) ),
inference(variable_rename,[status(thm)],[dt_k1_lattice3]) ).
fof(c_0_12,plain,
! [X1] :
( ( join_semilatt_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( below(X1,X2,X3)
<=> join(X1,X2,X3) = X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[d3_lattices]) ).
fof(c_0_13,negated_conjecture,
( ( subset(esk2_0,esk3_0)
| below(boole_lattice(esk1_0),esk2_0,esk3_0) )
& ( ~ subset(esk2_0,esk3_0)
| ~ below(boole_lattice(esk1_0),esk2_0,esk3_0) )
& element(esk3_0,the_carrier(boole_lattice(esk1_0)))
& element(esk2_0,the_carrier(boole_lattice(esk1_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_14,plain,
( ~ latt_str(X1)
| ~ strict_latt_str(X1)
| X1 != boole_lattice(X2)
| the_carrier(X1) = powerset(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
strict_latt_str(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
latt_str(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X1] :
( strict_latt_str(boole_lattice(X1))
& ~ empty_carrier(boole_lattice(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_lattice3]) ).
fof(c_0_18,lemma,
! [X65,X66,X67] :
( ( ~ element(X66,the_carrier(boole_lattice(X65)))
| ~ element(X67,the_carrier(boole_lattice(X65)))
| meet(boole_lattice(X65),X66,X67) = set_intersection2(X66,X67) )
& ( ~ element(X66,the_carrier(boole_lattice(X65)))
| ~ element(X67,the_carrier(boole_lattice(X65)))
| join(boole_lattice(X65),X66,X67) = set_union2(X66,X67) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_lattice3])])])])]) ).
fof(c_0_19,plain,
! [X51,X52,X53] :
( ( ~ join_semilatt_str(X51)
| empty_carrier(X51)
| ~ element(X52,the_carrier(X51))
| ~ element(X53,the_carrier(X51))
| below(X51,X52,X53)
| join(X51,X52,X53) != X53 )
& ( ~ join_semilatt_str(X51)
| empty_carrier(X51)
| ~ element(X52,the_carrier(X51))
| ~ element(X53,the_carrier(X51))
| join(X51,X52,X53) = X53
| ~ below(X51,X52,X53) ) ),
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_12])])])])]) ).
cnf(c_0_20,negated_conjecture,
element(esk3_0,the_carrier(boole_lattice(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
the_carrier(boole_lattice(X1)) = powerset(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_22,negated_conjecture,
element(esk2_0,the_carrier(boole_lattice(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_23,plain,
! [X64] :
( strict_latt_str(boole_lattice(X64))
& ~ empty_carrier(boole_lattice(X64)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_17])]) ).
cnf(c_0_24,lemma,
( ~ element(X2,the_carrier(boole_lattice(X1)))
| ~ element(X3,the_carrier(boole_lattice(X1)))
| join(boole_lattice(X1),X2,X3) = set_union2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( ~ join_semilatt_str(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| ~ below(X1,X2,X3)
| empty_carrier(X1)
| join(X1,X2,X3) = X3 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,negated_conjecture,
( subset(esk2_0,esk3_0)
| below(boole_lattice(esk1_0),esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_27,negated_conjecture,
element(esk3_0,powerset(esk1_0)),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,negated_conjecture,
element(esk2_0,powerset(esk1_0)),
inference(rw,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_29,plain,
~ empty_carrier(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_30,plain,
! [X184] :
( ( ~ latt_str(X184)
| join_semilatt_str(X184) )
& ( ~ latt_str(X184)
| meet_semilatt_str(X184) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l3_lattices])])])]) ).
cnf(c_0_31,lemma,
( ~ element(X2,powerset(X1))
| ~ element(X3,powerset(X1))
| join(boole_lattice(X1),X2,X3) = set_union2(X2,X3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_21]),c_0_21]) ).
cnf(c_0_32,negated_conjecture,
( ~ join_semilatt_str(boole_lattice(esk1_0))
| subset(esk2_0,esk3_0)
| join(boole_lattice(esk1_0),esk2_0,esk3_0) = esk3_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_21]),c_0_27]),c_0_21]),c_0_28])]),c_0_29]) ).
cnf(c_0_33,plain,
( ~ latt_str(X1)
| join_semilatt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( ~ element(X1,powerset(esk1_0))
| join(boole_lattice(esk1_0),X1,esk3_0) = set_union2(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_27]) ).
fof(c_0_35,lemma,
! [X277,X278] :
( set_union2(X277,X278) = X278
| ~ subset(X277,X278) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_xboole_1])])]) ).
fof(c_0_36,lemma,
! [X288,X289] : subset(X288,set_union2(X288,X289)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
cnf(c_0_37,negated_conjecture,
( subset(esk2_0,esk3_0)
| join(boole_lattice(esk1_0),esk2_0,esk3_0) = esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_16])]) ).
cnf(c_0_38,negated_conjecture,
join(boole_lattice(esk1_0),esk2_0,esk3_0) = set_union2(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_34,c_0_28]) ).
cnf(c_0_39,lemma,
( ~ subset(X1,X2)
| set_union2(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,lemma,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,negated_conjecture,
set_union2(esk2_0,esk3_0) = esk3_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_42,negated_conjecture,
( ~ subset(esk2_0,esk3_0)
| ~ below(boole_lattice(esk1_0),esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_43,lemma,
subset(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
( ~ join_semilatt_str(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| join(X1,X2,X3) != X3
| empty_carrier(X1)
| below(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_45,negated_conjecture,
join(boole_lattice(esk1_0),esk2_0,esk3_0) = esk3_0,
inference(rw,[status(thm)],[c_0_38,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
~ below(boole_lattice(esk1_0),esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_47,negated_conjecture,
~ join_semilatt_str(boole_lattice(esk1_0)),
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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_21]),c_0_27]),c_0_21]),c_0_28])]),c_0_29]),c_0_46]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_33]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU344+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n003.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 06:15:45 UTC 2026
% 0.20/0.45 % CPUTime :
% 0.20/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.27/0.51 Running first-order theorem proving
% 0.27/0.51 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
% 35.17/5.10 % Version: 3.5.1
% 35.17/5.10 % Preprocessing class: FSLMSMSSSSSNFFN.
% 35.17/5.10 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.17/5.10 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 35.17/5.10 % Starting new_bool_3 with 600s (2) cores
% 35.17/5.10 % Starting new_bool_1 with 600s (2) cores
% 35.17/5.10 % Starting sh5l with 300s (1) cores
% 35.17/5.10 % new_bool_3 with pid 3588920 completed with status 0
% 35.17/5.10 % Result found by new_bool_3
% 35.17/5.10 % Preprocessing class: FSLMSMSSSSSNFFN.
% 35.17/5.10 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.17/5.10 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 35.17/5.10 % Starting new_bool_3 with 600s (2) cores
% 35.17/5.10 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 35.17/5.10 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 35.17/5.10 % Search class: FGHSM-FSLM32-MFFFFFNN
% 35.17/5.10 % Scheduled 12 strats onto 2 cores with 600 seconds (600 total)
% 35.17/5.10 % Starting SubtermCWHack with 55s (1) cores
% 35.17/5.10 % Starting new_bool_3 with 61s (1) cores
% 35.17/5.10 % new_bool_3 with pid 3588924 completed with status 0
% 35.17/5.10 % Result found by new_bool_3
% 35.17/5.10 % Preprocessing class: FSLMSMSSSSSNFFN.
% 35.17/5.10 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.17/5.10 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 35.17/5.10 % Starting new_bool_3 with 600s (2) cores
% 35.17/5.10 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 35.17/5.10 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 35.17/5.10 % Search class: FGHSM-FSLM32-MFFFFFNN
% 35.17/5.10 % Scheduled 12 strats onto 2 cores with 600 seconds (600 total)
% 35.17/5.10 % Starting SubtermCWHack with 55s (1) cores
% 35.17/5.10 % Starting new_bool_3 with 61s (1) cores
% 35.17/5.10 % Preprocessing time : 0.015 s
% 35.17/5.10 % Presaturation interreduction done
% 35.17/5.10
% 35.17/5.10 % Proof found!
% 35.17/5.10 % SZS status Theorem
% 35.17/5.10 % SZS output start CNFRefutation
% See solution above
% 35.17/5.10 % Parsed axioms : 599
% 35.17/5.10 % Removed by relevancy pruning/SinE : 394
% 35.17/5.10 % Initial clauses : 884
% 35.17/5.10 % Removed in clause preprocessing : 2
% 35.17/5.10 % Initial clauses in saturation : 882
% 35.17/5.10 % Processed clauses : 27867
% 35.17/5.10 % ...of these trivial : 306
% 35.17/5.10 % ...subsumed : 21381
% 35.17/5.10 % ...remaining for further processing : 6180
% 35.17/5.10 % Other redundant clauses eliminated : 983
% 35.17/5.10 % Clauses deleted for lack of memory : 0
% 35.17/5.10 % Backward-subsumed : 153
% 35.17/5.10 % Backward-rewritten : 307
% 35.17/5.10 % Generated clauses : 158981
% 35.17/5.10 % ...of the previous two non-redundant : 145805
% 35.17/5.10 % ...aggressively subsumed : 0
% 35.17/5.10 % Contextual simplify-reflections : 67
% 35.17/5.10 % Paramodulations : 158061
% 35.17/5.10 % Factorizations : 19
% 35.17/5.10 % NegExts : 0
% 35.17/5.10 % Equation resolutions : 985
% 35.17/5.10 % Disequality decompositions : 0
% 35.17/5.10 % Total rewrite steps : 22193
% 35.17/5.10 % ...of those cached : 18893
% 35.17/5.10 % Propositional unsat checks : 1
% 35.17/5.10 % Propositional check models : 0
% 35.17/5.10 % Propositional check unsatisfiable : 0
% 35.17/5.10 % Propositional clauses : 0
% 35.17/5.10 % Propositional clauses after purity: 0
% 35.17/5.10 % Propositional unsat core size : 0
% 35.17/5.10 % Propositional preprocessing time : 0.000
% 35.17/5.10 % Propositional encoding time : 0.142
% 35.17/5.10 % Propositional solver time : 0.116
% 35.17/5.10 % Success case prop preproc time : 0.000
% 35.17/5.10 % Success case prop encoding time : 0.000
% 35.17/5.10 % Success case prop solver time : 0.000
% 35.17/5.10 % Current number of processed clauses : 4676
% 35.17/5.10 % Positive orientable unit clauses : 649
% 35.17/5.10 % Positive unorientable unit clauses: 2
% 35.17/5.10 % Negative unit clauses : 706
% 35.17/5.10 % Non-unit-clauses : 3319
% 35.17/5.10 % Current number of unprocessed clauses: 119333
% 35.17/5.10 % ...number of literals in the above : 416894
% 35.17/5.10 % Current number of archived formulas : 0
% 35.17/5.10 % Current number of archived clauses : 1266
% 35.17/5.10 % Clause-clause subsumption calls (NU) : 2319393
% 35.17/5.10 % Rec. Clause-clause subsumption calls : 1235326
% 35.17/5.10 % Non-unit clause-clause subsumptions : 10365
% 35.17/5.10 % Unit Clause-clause subsumption calls : 237287
% 35.17/5.10 % Rewrite failures with RHS unbound : 0
% 35.17/5.10 % BW rewrite match attempts : 478
% 35.17/5.10 % BW rewrite match successes : 93
% 35.17/5.10 % Condensation attempts : 0
% 35.17/5.10 % Condensation successes : 0
% 35.17/5.10 % Termbank termtop insertions : 2915023
% 35.17/5.10 % Search garbage collected termcells : 13928
% 35.17/5.10
% 35.17/5.10 % -------------------------------------------------
% 35.17/5.10 % User time : 4.335 s
% 35.17/5.10 % System time : 0.119 s
% 35.17/5.10 % Total time : 4.454 s
% 35.17/5.10 % Maximum resident set size: 6240 pages
% 35.17/5.10
% 35.17/5.10 % -------------------------------------------------
% 35.17/5.10 % User time : 8.418 s
% 35.17/5.10 % System time : 0.256 s
% 35.17/5.10 % Total time : 8.673 s
% 35.17/5.10 % Maximum resident set size: 5632 pages
% 35.17/5.10 % E exiting
%------------------------------------------------------------------------------