%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT327+2 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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 01:04:56 PM UTC 2026
% Result : Theorem 119.67s 20.24s
% Output : CNFRefutation 119.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 43 ( 14 unt; 0 def)
% Number of atoms : 232 ( 0 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 295 ( 106 ~; 104 |; 55 &)
% ( 2 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 51 ( 1 sgn 35 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(reflexivity_r3_lattices,axiom,
! [X1,X2,X3] :
( ( m1_subset_1(X3,u1_struct_0(X1))
& m1_subset_1(X2,u1_struct_0(X1))
& l3_lattices(X1)
& v9_lattices(X1)
& v8_lattices(X1)
& v6_lattices(X1)
& ~ v3_struct_0(X1) )
=> r3_lattices(X1,X2,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+205.ax',reflexivity_r3_lattices) ).
fof(t64_filter_2,conjecture,
! [X1] :
( ( l3_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,u1_struct_0(X1))
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ( r3_lattices(X1,X2,X3)
=> ( r2_hidden(X3,k22_filter_2(X1,X2,X3))
& r2_hidden(X2,k22_filter_2(X1,X2,X3)) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t64_filter_2) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : m1_subset_1(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+7.ax',existence_m1_subset_1) ).
fof(cc1_lattices,axiom,
! [X1] :
( l3_lattices(X1)
=> ( ( v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ( v9_lattices(X1)
& v8_lattices(X1)
& v7_lattices(X1)
& v6_lattices(X1)
& v5_lattices(X1)
& v4_lattices(X1)
& ~ v3_struct_0(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+205.ax',cc1_lattices) ).
fof(t63_filter_2,axiom,
! [X1] :
( ( l3_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,u1_struct_0(X1))
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ! [X4] :
( m1_subset_1(X4,u1_struct_0(X1))
=> ( r3_lattices(X1,X2,X3)
=> ( r2_hidden(X4,k22_filter_2(X1,X2,X3))
<=> ( r3_lattices(X1,X4,X3)
& r3_lattices(X1,X2,X4) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t63_filter_2) ).
fof(c_0_5,plain,
! [X1,X2,X3] :
( ( m1_subset_1(X3,u1_struct_0(X1))
& m1_subset_1(X2,u1_struct_0(X1))
& l3_lattices(X1)
& v9_lattices(X1)
& v8_lattices(X1)
& v6_lattices(X1)
& ~ v3_struct_0(X1) )
=> r3_lattices(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[reflexivity_r3_lattices]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ( l3_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,u1_struct_0(X1))
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ( r3_lattices(X1,X2,X3)
=> ( r2_hidden(X3,k22_filter_2(X1,X2,X3))
& r2_hidden(X2,k22_filter_2(X1,X2,X3)) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t64_filter_2]) ).
fof(c_0_7,plain,
! [X67,X68,X69] :
( r3_lattices(X67,X68,X68)
| ~ m1_subset_1(X69,u1_struct_0(X67))
| ~ m1_subset_1(X68,u1_struct_0(X67))
| ~ l3_lattices(X67)
| ~ v9_lattices(X67)
| ~ v8_lattices(X67)
| ~ v6_lattices(X67)
| v3_struct_0(X67) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X114] : m1_subset_1(esk7_1(X114),X114),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ( l3_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,u1_struct_0(X1))
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ( r3_lattices(X1,X2,X3)
=> ( r2_hidden(X3,k22_filter_2(X1,X2,X3))
& r2_hidden(X2,k22_filter_2(X1,X2,X3)) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ m1_subset_1(X3,u1_struct_0(X1))
| ~ m1_subset_1(X2,u1_struct_0(X1))
| ~ l3_lattices(X1)
| ~ v9_lattices(X1)
| ~ v8_lattices(X1)
| ~ v6_lattices(X1)
| r3_lattices(X1,X2,X2)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
m1_subset_1(esk7_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,negated_conjecture,
( ( ~ r2_hidden(esk3_0,k22_filter_2(esk1_0,esk2_0,esk3_0))
| ~ r2_hidden(esk2_0,k22_filter_2(esk1_0,esk2_0,esk3_0)) )
& r3_lattices(esk1_0,esk2_0,esk3_0)
& m1_subset_1(esk3_0,u1_struct_0(esk1_0))
& m1_subset_1(esk2_0,u1_struct_0(esk1_0))
& l3_lattices(esk1_0)
& v10_lattices(esk1_0)
& ~ v3_struct_0(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] :
( l3_lattices(X1)
=> ( ( v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ( v9_lattices(X1)
& v8_lattices(X1)
& v7_lattices(X1)
& v6_lattices(X1)
& v5_lattices(X1)
& v4_lattices(X1)
& ~ v3_struct_0(X1) ) ) ),
inference(fof_simplification,[status(thm)],[cc1_lattices]) ).
fof(c_0_14,plain,
! [X1] :
( ( l3_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,u1_struct_0(X1))
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ! [X4] :
( m1_subset_1(X4,u1_struct_0(X1))
=> ( r3_lattices(X1,X2,X3)
=> ( r2_hidden(X4,k22_filter_2(X1,X2,X3))
<=> ( r3_lattices(X1,X4,X3)
& r3_lattices(X1,X2,X4) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[t63_filter_2]) ).
cnf(c_0_15,plain,
( ~ m1_subset_1(X2,u1_struct_0(X1))
| ~ l3_lattices(X1)
| ~ v6_lattices(X1)
| ~ v8_lattices(X1)
| ~ v9_lattices(X1)
| v3_struct_0(X1)
| r3_lattices(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
m1_subset_1(esk2_0,u1_struct_0(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
l3_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_19,plain,
! [X236] :
( ( ~ l3_lattices(X236)
| ~ v10_lattices(X236)
| v3_struct_0(X236)
| v9_lattices(X236) )
& ( ~ l3_lattices(X236)
| ~ v10_lattices(X236)
| v3_struct_0(X236)
| v8_lattices(X236) )
& ( ~ l3_lattices(X236)
| ~ v10_lattices(X236)
| v3_struct_0(X236)
| v7_lattices(X236) )
& ( ~ l3_lattices(X236)
| ~ v10_lattices(X236)
| v3_struct_0(X236)
| v6_lattices(X236) )
& ( ~ l3_lattices(X236)
| ~ v10_lattices(X236)
| v3_struct_0(X236)
| v5_lattices(X236) )
& ( ~ l3_lattices(X236)
| ~ v10_lattices(X236)
| v3_struct_0(X236)
| v4_lattices(X236) )
& ( ~ l3_lattices(X236)
| ~ v10_lattices(X236)
| v3_struct_0(X236)
| ~ v3_struct_0(X236) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
cnf(c_0_20,negated_conjecture,
m1_subset_1(esk3_0,u1_struct_0(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_21,plain,
! [X63,X64,X65,X66] :
( ( ~ l3_lattices(X63)
| ~ v10_lattices(X63)
| v3_struct_0(X63)
| ~ m1_subset_1(X64,u1_struct_0(X63))
| ~ m1_subset_1(X65,u1_struct_0(X63))
| ~ m1_subset_1(X66,u1_struct_0(X63))
| ~ r3_lattices(X63,X64,X65)
| r2_hidden(X66,k22_filter_2(X63,X64,X65))
| ~ r3_lattices(X63,X66,X65)
| ~ r3_lattices(X63,X64,X66) )
& ( ~ l3_lattices(X63)
| ~ v10_lattices(X63)
| v3_struct_0(X63)
| ~ m1_subset_1(X64,u1_struct_0(X63))
| ~ m1_subset_1(X65,u1_struct_0(X63))
| ~ m1_subset_1(X66,u1_struct_0(X63))
| ~ r3_lattices(X63,X64,X65)
| ~ r2_hidden(X66,k22_filter_2(X63,X64,X65))
| r3_lattices(X63,X66,X65) )
& ( ~ l3_lattices(X63)
| ~ v10_lattices(X63)
| v3_struct_0(X63)
| ~ m1_subset_1(X64,u1_struct_0(X63))
| ~ m1_subset_1(X65,u1_struct_0(X63))
| ~ m1_subset_1(X66,u1_struct_0(X63))
| ~ r3_lattices(X63,X64,X65)
| ~ r2_hidden(X66,k22_filter_2(X63,X64,X65))
| r3_lattices(X63,X64,X66) ) ),
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_14])])])])]) ).
cnf(c_0_22,negated_conjecture,
( ~ v6_lattices(esk1_0)
| ~ v8_lattices(esk1_0)
| ~ v9_lattices(esk1_0)
| r3_lattices(esk1_0,esk2_0,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_23,plain,
( ~ l3_lattices(X1)
| ~ v10_lattices(X1)
| v3_struct_0(X1)
| v9_lattices(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
v10_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,negated_conjecture,
( ~ v6_lattices(esk1_0)
| ~ v8_lattices(esk1_0)
| ~ v9_lattices(esk1_0)
| r3_lattices(esk1_0,esk3_0,esk3_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_20]),c_0_17])]),c_0_18]) ).
cnf(c_0_26,plain,
( ~ l3_lattices(X1)
| ~ v10_lattices(X1)
| ~ m1_subset_1(X2,u1_struct_0(X1))
| ~ m1_subset_1(X4,u1_struct_0(X1))
| ~ m1_subset_1(X3,u1_struct_0(X1))
| ~ r3_lattices(X1,X2,X4)
| ~ r3_lattices(X1,X3,X4)
| ~ r3_lattices(X1,X2,X3)
| v3_struct_0(X1)
| r2_hidden(X3,k22_filter_2(X1,X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
r3_lattices(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_28,negated_conjecture,
( ~ v6_lattices(esk1_0)
| ~ v8_lattices(esk1_0)
| r3_lattices(esk1_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_22,c_0_23]),c_0_24]),c_0_17])]),c_0_18]) ).
cnf(c_0_29,plain,
( ~ l3_lattices(X1)
| ~ v10_lattices(X1)
| v3_struct_0(X1)
| v8_lattices(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,negated_conjecture,
( ~ v6_lattices(esk1_0)
| ~ v8_lattices(esk1_0)
| r3_lattices(esk1_0,esk3_0,esk3_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_24]),c_0_17])]),c_0_18]) ).
cnf(c_0_31,negated_conjecture,
( ~ m1_subset_1(X1,u1_struct_0(esk1_0))
| ~ r3_lattices(esk1_0,X1,esk2_0)
| ~ r3_lattices(esk1_0,X1,esk3_0)
| r2_hidden(esk2_0,k22_filter_2(esk1_0,X1,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_26,c_0_27]),c_0_24]),c_0_17]),c_0_20]),c_0_16])]),c_0_18]) ).
cnf(c_0_32,negated_conjecture,
( ~ v6_lattices(esk1_0)
| r3_lattices(esk1_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_28,c_0_29]),c_0_24]),c_0_17])]),c_0_18]) ).
cnf(c_0_33,plain,
( ~ l3_lattices(X1)
| ~ v10_lattices(X1)
| v3_struct_0(X1)
| v6_lattices(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_34,negated_conjecture,
( ~ v6_lattices(esk1_0)
| r3_lattices(esk1_0,esk3_0,esk3_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_29]),c_0_24]),c_0_17])]),c_0_18]) ).
cnf(c_0_35,negated_conjecture,
( ~ r3_lattices(esk1_0,esk2_0,esk2_0)
| r2_hidden(esk2_0,k22_filter_2(esk1_0,esk2_0,esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_27]),c_0_16])]) ).
cnf(c_0_36,negated_conjecture,
r3_lattices(esk1_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_32,c_0_33]),c_0_24]),c_0_17])]),c_0_18]) ).
cnf(c_0_37,negated_conjecture,
r3_lattices(esk1_0,esk3_0,esk3_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_33]),c_0_24]),c_0_17])]),c_0_18]) ).
cnf(c_0_38,negated_conjecture,
( ~ r2_hidden(esk3_0,k22_filter_2(esk1_0,esk2_0,esk3_0))
| ~ r2_hidden(esk2_0,k22_filter_2(esk1_0,esk2_0,esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_39,negated_conjecture,
r2_hidden(esk2_0,k22_filter_2(esk1_0,esk2_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_40,negated_conjecture,
( ~ m1_subset_1(X1,u1_struct_0(esk1_0))
| ~ r3_lattices(esk1_0,X1,esk3_0)
| r2_hidden(esk3_0,k22_filter_2(esk1_0,X1,esk3_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_26,c_0_37]),c_0_24]),c_0_17]),c_0_20])]),c_0_18]) ).
cnf(c_0_41,negated_conjecture,
~ r2_hidden(esk3_0,k22_filter_2(esk1_0,esk2_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_27]),c_0_16])]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT327+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.42 % Computer : n014.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.42 % CPULimit : 300
% 0.17/0.42 % WCLimit : 300
% 0.17/0.42 % DateTime : Sun Sep 20 23:38:19 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.50 Running first-order theorem proving
% 0.17/0.50 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
% 119.67/20.24 % Version: 3.5.1
% 119.67/20.24 % Preprocessing class: FMLMSMSLSSSNFFN.
% 119.67/20.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 119.67/20.24 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 119.67/20.24 % Starting new_bool_3 with 600s (2) cores
% 119.67/20.24 % Starting new_bool_1 with 600s (2) cores
% 119.67/20.24 % Starting sh5l with 300s (1) cores
% 119.67/20.24 % new_bool_1 with pid 2625472 completed with status 0
% 119.67/20.24 % Result found by new_bool_1
% 119.67/20.24 % Preprocessing class: FMLMSMSLSSSNFFN.
% 119.67/20.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 119.67/20.24 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 119.67/20.24 % Starting new_bool_3 with 600s (2) cores
% 119.67/20.24 % Starting new_bool_1 with 600s (2) cores
% 119.67/20.24 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 119.67/20.24 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 119.67/20.24 % Search class: FGHSM-FSLM31-MFFFFFNN
% 119.67/20.24 % Scheduled 8 strats onto 2 cores with 600 seconds (600 total)
% 119.67/20.24 % Starting SubtermCWHack with 55s (1) cores
% 119.67/20.24 % Starting new_bool_1 with 61s (1) cores
% 119.67/20.24 % new_bool_1 with pid 2625477 completed with status 0
% 119.67/20.24 % Result found by new_bool_1
% 119.67/20.24 % Preprocessing class: FMLMSMSLSSSNFFN.
% 119.67/20.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 119.67/20.24 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 119.67/20.24 % Starting new_bool_3 with 600s (2) cores
% 119.67/20.24 % Starting new_bool_1 with 600s (2) cores
% 119.67/20.24 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 119.67/20.24 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 119.67/20.24 % Search class: FGHSM-FSLM31-MFFFFFNN
% 119.67/20.24 % Scheduled 8 strats onto 2 cores with 600 seconds (600 total)
% 119.67/20.24 % Starting SubtermCWHack with 55s (1) cores
% 119.67/20.24 % Starting new_bool_1 with 61s (1) cores
% 119.67/20.24 % Preprocessing time : 0.019 s
% 119.67/20.24 % Presaturation interreduction done
% 119.67/20.24
% 119.67/20.24 % Proof found!
% 119.67/20.24 % SZS status Theorem
% 119.67/20.24 % SZS output start CNFRefutation
% See solution above
% 119.67/20.24 % Parsed axioms : 3000
% 119.67/20.24 % Removed by relevancy pruning/SinE : 2794
% 119.67/20.24 % Initial clauses : 502
% 119.67/20.24 % Removed in clause preprocessing : 16
% 119.67/20.24 % Initial clauses in saturation : 486
% 119.67/20.24 % Processed clauses : 32727
% 119.67/20.24 % ...of these trivial : 73
% 119.67/20.24 % ...subsumed : 23827
% 119.67/20.24 % ...remaining for further processing : 8827
% 119.67/20.24 % Other redundant clauses eliminated : 130
% 119.67/20.24 % Clauses deleted for lack of memory : 0
% 119.67/20.24 % Backward-subsumed : 629
% 119.67/20.24 % Backward-rewritten : 107
% 119.67/20.24 % Generated clauses : 390844
% 119.67/20.24 % ...of the previous two non-redundant : 383277
% 119.67/20.24 % ...aggressively subsumed : 0
% 119.67/20.24 % Contextual simplify-reflections : 319
% 119.67/20.24 % Paramodulations : 390698
% 119.67/20.24 % Factorizations : 6
% 119.67/20.24 % NegExts : 0
% 119.67/20.24 % Equation resolutions : 139
% 119.67/20.24 % Disequality decompositions : 0
% 119.67/20.24 % Total rewrite steps : 75322
% 119.67/20.24 % ...of those cached : 73455
% 119.67/20.24 % Propositional unsat checks : 1
% 119.67/20.24 % Propositional check models : 0
% 119.67/20.24 % Propositional check unsatisfiable : 0
% 119.67/20.24 % Propositional clauses : 0
% 119.67/20.24 % Propositional clauses after purity: 0
% 119.67/20.24 % Propositional unsat core size : 0
% 119.67/20.24 % Propositional preprocessing time : 0.000
% 119.67/20.24 % Propositional encoding time : 0.299
% 119.67/20.24 % Propositional solver time : 0.294
% 119.67/20.24 % Success case prop preproc time : 0.000
% 119.67/20.24 % Success case prop encoding time : 0.000
% 119.67/20.24 % Success case prop solver time : 0.000
% 119.67/20.24 % Current number of processed clauses : 7608
% 119.67/20.24 % Positive orientable unit clauses : 645
% 119.67/20.24 % Positive unorientable unit clauses: 2
% 119.67/20.24 % Negative unit clauses : 862
% 119.67/20.24 % Non-unit-clauses : 6099
% 119.67/20.24 % Current number of unprocessed clauses: 346926
% 119.67/20.24 % ...number of literals in the above : 1837128
% 119.67/20.24 % Current number of archived formulas : 0
% 119.67/20.24 % Current number of archived clauses : 1194
% 119.67/20.24 % Clause-clause subsumption calls (NU) : 4409623
% 119.67/20.24 % Rec. Clause-clause subsumption calls : 1927437
% 119.67/20.24 % Non-unit clause-clause subsumptions : 7432
% 119.67/20.24 % Unit Clause-clause subsumption calls : 201136
% 119.67/20.24 % Rewrite failures with RHS unbound : 0
% 119.67/20.24 % BW rewrite match attempts : 5583
% 119.67/20.24 % BW rewrite match successes : 40
% 119.67/20.24 % Condensation attempts : 0
% 119.67/20.24 % Condensation successes : 0
% 119.67/20.24 % Termbank termtop insertions : 8966360
% 119.67/20.24 % Search garbage collected termcells : 28578
% 119.67/20.24
% 119.67/20.24 % -------------------------------------------------
% 119.67/20.24 % User time : 18.707 s
% 119.67/20.24 % System time : 0.538 s
% 119.67/20.24 % Total time : 19.245 s
% 119.67/20.24 % Maximum resident set size: 9000 pages
% 119.67/20.24
% 119.67/20.24 % -------------------------------------------------
% 119.67/20.24 % User time : 34.981 s
% 119.67/20.24 % System time : 1.023 s
% 119.67/20.24 % Total time : 36.003 s
% 119.67/20.24 % Maximum resident set size: 8192 pages
% 119.67/20.24 % E exiting
%------------------------------------------------------------------------------