%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU304+1 : 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 : n012.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:24:38 PM UTC 2026
% Result : Theorem 0.04s 10.58s
% Output : CNFRefutation 0.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 42 ( 9 unt; 0 def)
% Number of atoms : 207 ( 21 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 254 ( 89 ~; 84 |; 49 &)
% ( 4 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 79 ( 0 sgn 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t23_lattices,conjecture,
! [X1] :
( ( latt_str(X1)
& meet_absorbing(X1)
& meet_commutative(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> below(X1,meet_commut(X1,X2,X3),X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_lattices) ).
fof(d8_lattices,axiom,
! [X1] :
( ( latt_str(X1)
& ~ empty_carrier(X1) )
=> ( meet_absorbing(X1)
<=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> join(X1,meet(X1,X2,X3),X3) = X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_lattices) ).
fof(redefinition_k4_lattices,axiom,
! [X1,X2,X3] :
( ( element(X3,the_carrier(X1))
& element(X2,the_carrier(X1))
& meet_semilatt_str(X1)
& meet_commutative(X1)
& ~ empty_carrier(X1) )
=> meet_commut(X1,X2,X3) = meet(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k4_lattices) ).
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(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(commutativity_k4_lattices,axiom,
! [X1,X2,X3] :
( ( element(X3,the_carrier(X1))
& element(X2,the_carrier(X1))
& meet_semilatt_str(X1)
& meet_commutative(X1)
& ~ empty_carrier(X1) )
=> meet_commut(X1,X2,X3) = meet_commut(X1,X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k4_lattices) ).
fof(dt_k4_lattices,axiom,
! [X1,X2,X3] :
( ( element(X3,the_carrier(X1))
& element(X2,the_carrier(X1))
& meet_semilatt_str(X1)
& meet_commutative(X1)
& ~ empty_carrier(X1) )
=> element(meet_commut(X1,X2,X3),the_carrier(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k4_lattices) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( latt_str(X1)
& meet_absorbing(X1)
& meet_commutative(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> below(X1,meet_commut(X1,X2,X3),X2) ) ) ),
inference(assume_negation,[status(cth)],[t23_lattices]) ).
fof(c_0_8,plain,
! [X1] :
( ( latt_str(X1)
& ~ empty_carrier(X1) )
=> ( meet_absorbing(X1)
<=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> join(X1,meet(X1,X2,X3),X3) = X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[d8_lattices]) ).
fof(c_0_9,plain,
! [X1,X2,X3] :
( ( element(X3,the_carrier(X1))
& element(X2,the_carrier(X1))
& meet_semilatt_str(X1)
& meet_commutative(X1)
& ~ empty_carrier(X1) )
=> meet_commut(X1,X2,X3) = meet(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[redefinition_k4_lattices]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ( latt_str(X1)
& meet_absorbing(X1)
& meet_commutative(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> below(X1,meet_commut(X1,X2,X3),X2) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_11,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_12,plain,
! [X26,X27,X28] :
( ( ~ latt_str(X26)
| empty_carrier(X26)
| meet_absorbing(X26)
| join(X26,meet(X26,esk6_1(X26),esk7_1(X26)),esk7_1(X26)) != esk7_1(X26) )
& ( ~ latt_str(X26)
| empty_carrier(X26)
| meet_absorbing(X26)
| element(esk7_1(X26),the_carrier(X26)) )
& ( ~ latt_str(X26)
| empty_carrier(X26)
| meet_absorbing(X26)
| element(esk6_1(X26),the_carrier(X26)) )
& ( ~ latt_str(X26)
| empty_carrier(X26)
| join(X26,meet(X26,X27,X28),X28) = X28
| ~ element(X28,the_carrier(X26))
| ~ element(X27,the_carrier(X26))
| ~ meet_absorbing(X26) ) ),
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)],[c_0_8])])])])])]) ).
fof(c_0_13,plain,
! [X19,X20,X21] :
( meet_commut(X19,X20,X21) = meet(X19,X20,X21)
| ~ element(X21,the_carrier(X19))
| ~ element(X20,the_carrier(X19))
| ~ meet_semilatt_str(X19)
| ~ meet_commutative(X19)
| empty_carrier(X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_14,plain,
! [X24] :
( ( ~ latt_str(X24)
| join_semilatt_str(X24) )
& ( ~ latt_str(X24)
| meet_semilatt_str(X24) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l3_lattices])])])]) ).
fof(c_0_15,plain,
! [X1,X2,X3] :
( ( element(X3,the_carrier(X1))
& element(X2,the_carrier(X1))
& meet_semilatt_str(X1)
& meet_commutative(X1)
& ~ empty_carrier(X1) )
=> meet_commut(X1,X2,X3) = meet_commut(X1,X3,X2) ),
inference(fof_simplification,[status(thm)],[commutativity_k4_lattices]) ).
fof(c_0_16,negated_conjecture,
( ~ below(esk1_0,meet_commut(esk1_0,esk2_0,esk3_0),esk2_0)
& element(esk3_0,the_carrier(esk1_0))
& element(esk2_0,the_carrier(esk1_0))
& latt_str(esk1_0)
& meet_absorbing(esk1_0)
& meet_commutative(esk1_0)
& ~ empty_carrier(esk1_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_17,plain,
! [X10,X11,X12] :
( ( ~ join_semilatt_str(X10)
| empty_carrier(X10)
| ~ element(X11,the_carrier(X10))
| ~ element(X12,the_carrier(X10))
| below(X10,X11,X12)
| join(X10,X11,X12) != X12 )
& ( ~ join_semilatt_str(X10)
| empty_carrier(X10)
| ~ element(X11,the_carrier(X10))
| ~ element(X12,the_carrier(X10))
| join(X10,X11,X12) = X12
| ~ below(X10,X11,X12) ) ),
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_11])])])])]) ).
cnf(c_0_18,plain,
( ~ latt_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ meet_absorbing(X1)
| empty_carrier(X1)
| join(X1,meet(X1,X2,X3),X3) = X3 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ meet_semilatt_str(X1)
| ~ meet_commutative(X1)
| meet_commut(X1,X2,X3) = meet(X1,X2,X3)
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( ~ latt_str(X1)
| meet_semilatt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_21,plain,
! [X13,X14,X15] :
( meet_commut(X13,X14,X15) = meet_commut(X13,X15,X14)
| ~ element(X15,the_carrier(X13))
| ~ element(X14,the_carrier(X13))
| ~ meet_semilatt_str(X13)
| ~ meet_commutative(X13)
| empty_carrier(X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
cnf(c_0_22,negated_conjecture,
~ below(esk1_0,meet_commut(esk1_0,esk2_0,esk3_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,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_17]) ).
cnf(c_0_24,negated_conjecture,
element(esk2_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
( ~ meet_commutative(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| ~ latt_str(X1)
| ~ meet_absorbing(X1)
| empty_carrier(X1)
| join(X1,meet_commut(X1,X2,X3),X3) = X3 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_27,plain,
( ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ meet_semilatt_str(X1)
| ~ meet_commutative(X1)
| meet_commut(X1,X2,X3) = meet_commut(X1,X3,X2)
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_28,plain,
! [X1,X2,X3] :
( ( element(X3,the_carrier(X1))
& element(X2,the_carrier(X1))
& meet_semilatt_str(X1)
& meet_commutative(X1)
& ~ empty_carrier(X1) )
=> element(meet_commut(X1,X2,X3),the_carrier(X1)) ),
inference(fof_simplification,[status(thm)],[dt_k4_lattices]) ).
cnf(c_0_29,negated_conjecture,
( ~ element(meet_commut(esk1_0,esk2_0,esk3_0),the_carrier(esk1_0))
| ~ join_semilatt_str(esk1_0)
| join(esk1_0,meet_commut(esk1_0,esk2_0,esk3_0),esk2_0) != esk2_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),c_0_25]) ).
cnf(c_0_30,plain,
( ~ meet_commutative(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ latt_str(X1)
| ~ meet_absorbing(X1)
| empty_carrier(X1)
| join(X1,meet_commut(X1,X2,X3),X2) = X2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_20]) ).
cnf(c_0_31,negated_conjecture,
meet_absorbing(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_32,negated_conjecture,
latt_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_33,negated_conjecture,
element(esk3_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_34,negated_conjecture,
meet_commutative(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_35,plain,
! [X16,X17,X18] :
( element(meet_commut(X16,X17,X18),the_carrier(X16))
| ~ element(X18,the_carrier(X16))
| ~ element(X17,the_carrier(X16))
| ~ meet_semilatt_str(X16)
| ~ meet_commutative(X16)
| empty_carrier(X16) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])]) ).
cnf(c_0_36,negated_conjecture,
( ~ element(meet_commut(esk1_0,esk2_0,esk3_0),the_carrier(esk1_0))
| ~ join_semilatt_str(esk1_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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]),c_0_24]),c_0_33]),c_0_34])]),c_0_25]) ).
cnf(c_0_37,plain,
( ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ meet_semilatt_str(X1)
| ~ meet_commutative(X1)
| element(meet_commut(X1,X2,X3),the_carrier(X1))
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_38,negated_conjecture,
( ~ meet_semilatt_str(esk1_0)
| ~ join_semilatt_str(esk1_0) ),
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_36,c_0_37]),c_0_33]),c_0_24]),c_0_34])]),c_0_25]) ).
cnf(c_0_39,plain,
( ~ latt_str(X1)
| join_semilatt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_40,negated_conjecture,
~ meet_semilatt_str(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_32])]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_20]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU304+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/10.54 % Computer : n012.cluster.edu
% 0.04/10.54 % Model : x86_64 x86_64
% 0.04/10.54 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/10.54 % Memory : 8046.5625MB
% 0.04/10.54 % OS : Linux 6.8.0-71-generic
% 0.04/10.54 % CPULimit : 300
% 0.04/10.54 % WCLimit : 300
% 0.04/10.54 % DateTime : Mon Sep 21 06:09:58 UTC 2026
% 0.04/10.54 % CPUTime :
% 0.04/10.54 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/10.57 Running first-order theorem proving
% 0.04/10.57 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
% 0.04/10.58 % Version: 3.5.1
% 0.04/10.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.04/10.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/10.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.04/10.58 % Starting new_bool_3 with 300s (1) cores
% 0.04/10.58 % Starting new_bool_1 with 300s (1) cores
% 0.04/10.58 % Starting sh5l with 300s (1) cores
% 0.04/10.58 % new_bool_3 with pid 1715039 completed with status 0
% 0.04/10.58 % Result found by new_bool_3
% 0.04/10.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.04/10.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/10.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.04/10.58 % Starting new_bool_3 with 300s (1) cores
% 0.04/10.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.04/10.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.04/10.58 % Search class: FGUSF-FFMM31-MFFFFFNN
% 0.04/10.58 % partial match(1): FGUSF-FFMM21-MFFFFFNN
% 0.04/10.58 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.04/10.58 % Starting SubtermCWHack with 28s (1) cores
% 0.04/10.58 % SubtermCWHack with pid 1715042 completed with status 0
% 0.04/10.58 % Result found by SubtermCWHack
% 0.04/10.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.04/10.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/10.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.04/10.58 % Starting new_bool_3 with 300s (1) cores
% 0.04/10.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.04/10.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.04/10.58 % Search class: FGUSF-FFMM31-MFFFFFNN
% 0.04/10.58 % partial match(1): FGUSF-FFMM21-MFFFFFNN
% 0.04/10.58 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.04/10.58 % Starting SubtermCWHack with 28s (1) cores
% 0.04/10.58 % Preprocessing time : 0.001 s
% 0.04/10.58
% 0.04/10.58 % Proof found!
% 0.04/10.58 % SZS status Theorem
% 0.04/10.58 % SZS output start CNFRefutation
% See solution above
% 0.04/10.58 % Parsed axioms : 50
% 0.04/10.58 % Removed by relevancy pruning/SinE : 31
% 0.04/10.58 % Initial clauses : 32
% 0.04/10.58 % Removed in clause preprocessing : 0
% 0.04/10.58 % Initial clauses in saturation : 32
% 0.04/10.58 % Processed clauses : 43
% 0.04/10.58 % ...of these trivial : 0
% 0.04/10.58 % ...subsumed : 3
% 0.04/10.58 % ...remaining for further processing : 40
% 0.04/10.58 % Other redundant clauses eliminated : 0
% 0.04/10.58 % Clauses deleted for lack of memory : 0
% 0.04/10.58 % Backward-subsumed : 2
% 0.04/10.58 % Backward-rewritten : 0
% 0.04/10.58 % Generated clauses : 21
% 0.04/10.58 % ...of the previous two non-redundant : 15
% 0.04/10.58 % ...aggressively subsumed : 0
% 0.04/10.58 % Contextual simplify-reflections : 2
% 0.04/10.58 % Paramodulations : 21
% 0.04/10.58 % Factorizations : 0
% 0.04/10.58 % NegExts : 0
% 0.04/10.58 % Equation resolutions : 0
% 0.04/10.58 % Disequality decompositions : 0
% 0.04/10.58 % Total rewrite steps : 11
% 0.04/10.58 % ...of those cached : 6
% 0.04/10.58 % Propositional unsat checks : 0
% 0.04/10.58 % Propositional check models : 0
% 0.04/10.58 % Propositional check unsatisfiable : 0
% 0.04/10.58 % Propositional clauses : 0
% 0.04/10.58 % Propositional clauses after purity: 0
% 0.04/10.58 % Propositional unsat core size : 0
% 0.04/10.58 % Propositional preprocessing time : 0.000
% 0.04/10.58 % Propositional encoding time : 0.000
% 0.04/10.58 % Propositional solver time : 0.000
% 0.04/10.58 % Success case prop preproc time : 0.000
% 0.04/10.58 % Success case prop encoding time : 0.000
% 0.04/10.58 % Success case prop solver time : 0.000
% 0.04/10.58 % Current number of processed clauses : 38
% 0.04/10.58 % Positive orientable unit clauses : 12
% 0.04/10.58 % Positive unorientable unit clauses: 0
% 0.04/10.58 % Negative unit clauses : 4
% 0.04/10.58 % Non-unit-clauses : 22
% 0.04/10.58 % Current number of unprocessed clauses: 4
% 0.04/10.58 % ...number of literals in the above : 32
% 0.04/10.58 % Current number of archived formulas : 0
% 0.04/10.58 % Current number of archived clauses : 2
% 0.04/10.58 % Clause-clause subsumption calls (NU) : 209
% 0.04/10.58 % Rec. Clause-clause subsumption calls : 44
% 0.04/10.58 % Non-unit clause-clause subsumptions : 6
% 0.04/10.58 % Unit Clause-clause subsumption calls : 3
% 0.04/10.58 % Rewrite failures with RHS unbound : 0
% 0.04/10.58 % BW rewrite match attempts : 0
% 0.04/10.58 % BW rewrite match successes : 0
% 0.04/10.58 % Condensation attempts : 0
% 0.04/10.58 % Condensation successes : 0
% 0.04/10.58 % Termbank termtop insertions : 3583
% 0.04/10.58 % Search garbage collected termcells : 691
% 0.04/10.58
% 0.04/10.58 % -------------------------------------------------
% 0.04/10.58 % User time : 0.003 s
% 0.04/10.58 % System time : 0.003 s
% 0.04/10.58 % Total time : 0.006 s
% 0.04/10.58 % Maximum resident set size: 3632 pages
% 0.04/10.58
% 0.04/10.58 % -------------------------------------------------
% 0.04/10.58 % User time : 0.003 s
% 0.04/10.58 % System time : 0.007 s
% 0.04/10.58 % Total time : 0.010 s
% 0.04/10.58 % Maximum resident set size: 4864 pages
% 0.04/10.58 % E exiting
%------------------------------------------------------------------------------