%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU304+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 : 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:24:38 PM UTC 2026
% Result : Theorem 205.10s 30.33s
% Output : CNFRefutation 205.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 50 ( 14 unt; 0 def)
% Number of atoms : 210 ( 27 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 242 ( 82 ~; 79 |; 49 &)
% ( 4 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 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 : 80 ( 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(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(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(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(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(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(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,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_9,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_10,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_11,plain,
! [X33,X34,X35] :
( meet_commut(X33,X34,X35) = meet(X33,X34,X35)
| ~ element(X35,the_carrier(X33))
| ~ element(X34,the_carrier(X33))
| ~ meet_semilatt_str(X33)
| ~ meet_commutative(X33)
| empty_carrier(X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_12,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_9])])])]) ).
fof(c_0_13,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]) ).
fof(c_0_14,plain,
! [X64,X65,X66] :
( ( ~ latt_str(X64)
| empty_carrier(X64)
| meet_absorbing(X64)
| join(X64,meet(X64,esk9_1(X64),esk10_1(X64)),esk10_1(X64)) != esk10_1(X64) )
& ( ~ latt_str(X64)
| empty_carrier(X64)
| meet_absorbing(X64)
| element(esk10_1(X64),the_carrier(X64)) )
& ( ~ latt_str(X64)
| empty_carrier(X64)
| meet_absorbing(X64)
| element(esk9_1(X64),the_carrier(X64)) )
& ( ~ latt_str(X64)
| empty_carrier(X64)
| join(X64,meet(X64,X65,X66),X66) = X66
| ~ element(X66,the_carrier(X64))
| ~ element(X65,the_carrier(X64))
| ~ meet_absorbing(X64) ) ),
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_10])])])])])]) ).
cnf(c_0_15,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_11]) ).
cnf(c_0_16,negated_conjecture,
element(esk2_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
meet_commutative(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_19,plain,
! [X62] :
( ( ~ latt_str(X62)
| join_semilatt_str(X62) )
& ( ~ latt_str(X62)
| meet_semilatt_str(X62) ) ),
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_20,plain,
! [X30,X31,X32] :
( element(meet_commut(X30,X31,X32),the_carrier(X30))
| ~ element(X32,the_carrier(X30))
| ~ element(X31,the_carrier(X30))
| ~ meet_semilatt_str(X30)
| ~ meet_commutative(X30)
| empty_carrier(X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
cnf(c_0_21,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_14]) ).
cnf(c_0_22,negated_conjecture,
meet_absorbing(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,negated_conjecture,
latt_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_24,negated_conjecture,
( ~ element(X1,the_carrier(esk1_0))
| ~ meet_semilatt_str(esk1_0)
| meet(esk1_0,X1,esk2_0) = meet_commut(esk1_0,X1,esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),c_0_18]) ).
cnf(c_0_25,plain,
( ~ latt_str(X1)
| meet_semilatt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,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_20]) ).
fof(c_0_27,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_28,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]) ).
cnf(c_0_29,negated_conjecture,
( ~ element(X1,the_carrier(esk1_0))
| join(esk1_0,meet(esk1_0,X1,esk2_0),esk2_0) = esk2_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_16]),c_0_22]),c_0_23])]),c_0_18]) ).
cnf(c_0_30,negated_conjecture,
element(esk3_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_31,negated_conjecture,
( ~ element(X1,the_carrier(esk1_0))
| meet(esk1_0,X1,esk2_0) = meet_commut(esk1_0,X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_23])]) ).
cnf(c_0_32,negated_conjecture,
( ~ element(X1,the_carrier(esk1_0))
| ~ meet_semilatt_str(esk1_0)
| element(meet_commut(esk1_0,X1,esk2_0),the_carrier(esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_16]),c_0_17])]),c_0_18]) ).
fof(c_0_33,plain,
! [X27,X28,X29] :
( meet_commut(X27,X28,X29) = meet_commut(X27,X29,X28)
| ~ element(X29,the_carrier(X27))
| ~ element(X28,the_carrier(X27))
| ~ meet_semilatt_str(X27)
| ~ meet_commutative(X27)
| empty_carrier(X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])]) ).
fof(c_0_34,plain,
! [X24,X25,X26] :
( ( ~ join_semilatt_str(X24)
| empty_carrier(X24)
| ~ element(X25,the_carrier(X24))
| ~ element(X26,the_carrier(X24))
| below(X24,X25,X26)
| join(X24,X25,X26) != X26 )
& ( ~ join_semilatt_str(X24)
| empty_carrier(X24)
| ~ element(X25,the_carrier(X24))
| ~ element(X26,the_carrier(X24))
| join(X24,X25,X26) = X26
| ~ below(X24,X25,X26) ) ),
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_28])])])])]) ).
cnf(c_0_35,negated_conjecture,
join(esk1_0,meet(esk1_0,esk3_0,esk2_0),esk2_0) = esk2_0,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
meet(esk1_0,esk3_0,esk2_0) = meet_commut(esk1_0,esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_37,negated_conjecture,
( ~ element(X1,the_carrier(esk1_0))
| element(meet_commut(esk1_0,X1,esk2_0),the_carrier(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_25]),c_0_23])]) ).
cnf(c_0_38,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_33]) ).
cnf(c_0_39,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_34]) ).
cnf(c_0_40,negated_conjecture,
join(esk1_0,meet_commut(esk1_0,esk3_0,esk2_0),esk2_0) = esk2_0,
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
element(meet_commut(esk1_0,esk3_0,esk2_0),the_carrier(esk1_0)),
inference(spm,[status(thm)],[c_0_37,c_0_30]) ).
cnf(c_0_42,negated_conjecture,
( ~ element(X1,the_carrier(esk1_0))
| ~ meet_semilatt_str(esk1_0)
| meet_commut(esk1_0,X1,esk3_0) = meet_commut(esk1_0,esk3_0,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_30]),c_0_17])]),c_0_18]) ).
cnf(c_0_43,negated_conjecture,
( ~ join_semilatt_str(esk1_0)
| below(esk1_0,meet_commut(esk1_0,esk3_0,esk2_0),esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_16]),c_0_41])]),c_0_18]) ).
cnf(c_0_44,plain,
( ~ latt_str(X1)
| join_semilatt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_45,negated_conjecture,
( ~ element(X1,the_carrier(esk1_0))
| meet_commut(esk1_0,X1,esk3_0) = meet_commut(esk1_0,esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_25]),c_0_23])]) ).
cnf(c_0_46,negated_conjecture,
below(esk1_0,meet_commut(esk1_0,esk3_0,esk2_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_23])]) ).
cnf(c_0_47,negated_conjecture,
meet_commut(esk1_0,esk3_0,esk2_0) = meet_commut(esk1_0,esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_45,c_0_16]) ).
cnf(c_0_48,negated_conjecture,
~ below(esk1_0,meet_commut(esk1_0,esk2_0,esk3_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU304+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n008.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 06:10:40 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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
% 205.10/30.33 % Version: 3.5.1
% 205.10/30.33 % Preprocessing class: FSLSSMSSSSSNFFN.
% 205.10/30.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 205.10/30.33 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 205.10/30.33 % Starting new_bool_3 with 300s (1) cores
% 205.10/30.33 % Starting new_bool_1 with 300s (1) cores
% 205.10/30.33 % Starting sh5l with 300s (1) cores
% 205.10/30.33 % new_bool_1 with pid 311359 completed with status 0
% 205.10/30.33 % Result found by new_bool_1
% 205.10/30.33 % Preprocessing class: FSLSSMSSSSSNFFN.
% 205.10/30.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 205.10/30.33 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 205.10/30.33 % Starting new_bool_3 with 300s (1) cores
% 205.10/30.33 % Starting new_bool_1 with 300s (1) cores
% 205.10/30.33 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 205.10/30.33 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 205.10/30.33 % Search class: FGHSM-FSLM31-MFFFFFNN
% 205.10/30.33 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 205.10/30.33 % Starting SubtermCWHack with 28s (1) cores
% 205.10/30.33 % SubtermCWHack with pid 311362 completed with status 8
% 205.10/30.33 % Starting new_bool_1 with 31s (1) cores
% 205.10/30.33 % new_bool_1 with pid 311862 completed with status 0
% 205.10/30.33 % Result found by new_bool_1
% 205.10/30.33 % Preprocessing class: FSLSSMSSSSSNFFN.
% 205.10/30.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 205.10/30.33 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 205.10/30.33 % Starting new_bool_3 with 300s (1) cores
% 205.10/30.33 % Starting new_bool_1 with 300s (1) cores
% 205.10/30.33 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 205.10/30.33 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 205.10/30.33 % Search class: FGHSM-FSLM31-MFFFFFNN
% 205.10/30.33 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 205.10/30.33 % Starting SubtermCWHack with 28s (1) cores
% 205.10/30.33 % SubtermCWHack with pid 311362 completed with status 8
% 205.10/30.33 % Starting new_bool_1 with 31s (1) cores
% 205.10/30.33 % Preprocessing time : 0.006 s
% 205.10/30.33 % Presaturation interreduction done
% 205.10/30.33
% 205.10/30.33 % Proof found!
% 205.10/30.33 % SZS status Theorem
% 205.10/30.33 % SZS output start CNFRefutation
% See solution above
% 205.10/30.33 % Parsed axioms : 450
% 205.10/30.33 % Removed by relevancy pruning/SinE : 377
% 205.10/30.33 % Initial clauses : 256
% 205.10/30.33 % Removed in clause preprocessing : 2
% 205.10/30.33 % Initial clauses in saturation : 254
% 205.10/30.33 % Processed clauses : 4347
% 205.10/30.33 % ...of these trivial : 7
% 205.10/30.33 % ...subsumed : 2080
% 205.10/30.33 % ...remaining for further processing : 2260
% 205.10/30.33 % Other redundant clauses eliminated : 105
% 205.10/30.33 % Clauses deleted for lack of memory : 0
% 205.10/30.33 % Backward-subsumed : 25
% 205.10/30.33 % Backward-rewritten : 56
% 205.10/30.33 % Generated clauses : 55971
% 205.10/30.33 % ...of the previous two non-redundant : 55142
% 205.10/30.33 % ...aggressively subsumed : 0
% 205.10/30.33 % Contextual simplify-reflections : 40
% 205.10/30.33 % Paramodulations : 55860
% 205.10/30.33 % Factorizations : 4
% 205.10/30.33 % NegExts : 0
% 205.10/30.33 % Equation resolutions : 107
% 205.10/30.33 % Disequality decompositions : 0
% 205.10/30.33 % Total rewrite steps : 4972
% 205.10/30.33 % ...of those cached : 4738
% 205.10/30.33 % Propositional unsat checks : 0
% 205.10/30.33 % Propositional check models : 0
% 205.10/30.33 % Propositional check unsatisfiable : 0
% 205.10/30.33 % Propositional clauses : 0
% 205.10/30.33 % Propositional clauses after purity: 0
% 205.10/30.33 % Propositional unsat core size : 0
% 205.10/30.33 % Propositional preprocessing time : 0.000
% 205.10/30.33 % Propositional encoding time : 0.000
% 205.10/30.33 % Propositional solver time : 0.000
% 205.10/30.33 % Success case prop preproc time : 0.000
% 205.10/30.33 % Success case prop encoding time : 0.000
% 205.10/30.33 % Success case prop solver time : 0.000
% 205.10/30.33 % Current number of processed clauses : 1902
% 205.10/30.33 % Positive orientable unit clauses : 989
% 205.10/30.33 % Positive unorientable unit clauses: 0
% 205.10/30.33 % Negative unit clauses : 372
% 205.10/30.33 % Non-unit-clauses : 541
% 205.10/30.33 % Current number of unprocessed clauses: 51235
% 205.10/30.33 % ...number of literals in the above : 155458
% 205.10/30.33 % Current number of archived formulas : 0
% 205.10/30.33 % Current number of archived clauses : 313
% 205.10/30.33 % Clause-clause subsumption calls (NU) : 90239
% 205.10/30.33 % Rec. Clause-clause subsumption calls : 20400
% 205.10/30.33 % Non-unit clause-clause subsumptions : 750
% 205.10/30.33 % Unit Clause-clause subsumption calls : 32346
% 205.10/30.33 % Rewrite failures with RHS unbound : 0
% 205.10/30.33 % BW rewrite match attempts : 195501
% 205.10/30.33 % BW rewrite match successes : 35
% 205.10/30.33 % Condensation attempts : 0
% 205.10/30.33 % Condensation successes : 0
% 205.10/30.33 % Termbank termtop insertions : 1267813
% 205.10/30.33 % Search garbage collected termcells : 6488
% 205.10/30.33
% 205.10/30.33 % -------------------------------------------------
% 205.10/30.33 % User time : 28.332 s
% 205.10/30.33 % System time : 0.975 s
% 205.10/30.33 % Total time : 29.307 s
% 205.10/30.33 % Maximum resident set size: 4744 pages
% 205.10/30.33
% 205.10/30.33 % -------------------------------------------------
% 205.10/30.33 % User time : 28.346 s
% 205.10/30.33 % System time : 0.981 s
% 205.10/30.33 % Total time : 29.327 s
% 205.10/30.33 % Maximum resident set size: 5376 pages
% 205.10/30.33 % E exiting
%------------------------------------------------------------------------------