%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU407+3 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:25:00 PM UTC 2026
% Result : Theorem 17.66s 3.98s
% Output : CNFRefutation 17.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 51 ( 10 unt; 0 def)
% Number of atoms : 234 ( 30 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 290 ( 107 ~; 105 |; 45 &)
% ( 11 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-6 aty)
% Number of variables : 94 ( 0 sgn 64 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t7_latsum_1,conjecture,
! [X1] :
( ( l1_orders_2(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( l1_orders_2(X2)
& ~ v3_struct_0(X2) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2)))
=> ( r2_hidden(X3,k4_xboole_0(u1_struct_0(X2),u1_struct_0(X1)))
| r2_hidden(X3,u1_struct_0(X1)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_latsum_1) ).
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> v1_xboole_0(X2) ) )
& ( ~ v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> r2_hidden(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+7.ax',d2_subset_1) ).
fof(fc1_struct_0,axiom,
! [X1] :
( ( l1_struct_0(X1)
& ~ v3_struct_0(X1) )
=> ~ v1_xboole_0(u1_struct_0(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+200.ax',fc1_struct_0) ).
fof(dt_l1_orders_2,axiom,
! [X1] :
( l1_orders_2(X1)
=> l1_struct_0(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+218.ax',dt_l1_orders_2) ).
fof(fc1_latsum_1,axiom,
! [X1,X2] :
( ( l1_orders_2(X2)
& ~ v3_struct_0(X2)
& l1_orders_2(X1) )
=> ( v1_orders_2(k1_latsum_1(X1,X2))
& ~ v3_struct_0(k1_latsum_1(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_latsum_1) ).
fof(dt_k1_latsum_1,axiom,
! [X1,X2] :
( ( l1_orders_2(X2)
& l1_orders_2(X1) )
=> ( l1_orders_2(k1_latsum_1(X1,X2))
& v1_orders_2(k1_latsum_1(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k1_latsum_1) ).
fof(d2_latsum_1,axiom,
! [X1] :
( l1_orders_2(X1)
=> ! [X2] :
( l1_orders_2(X2)
=> ! [X3] :
( ( l1_orders_2(X3)
& v1_orders_2(X3) )
=> ( X3 = k1_latsum_1(X1,X2)
<=> ( u1_orders_2(X3) = k2_xboole_0(k2_xboole_0(u1_orders_2(X1),u1_orders_2(X2)),k7_relset_1(u1_struct_0(X1),u1_struct_0(X1),u1_struct_0(X2),u1_struct_0(X2),u1_orders_2(X1),u1_orders_2(X2)))
& u1_struct_0(X3) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2)) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_latsum_1) ).
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = k4_xboole_0(X1,X2)
<=> ! [X4] :
( r2_hidden(X4,X3)
<=> ( ~ r2_hidden(X4,X2)
& r2_hidden(X4,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+2.ax',d4_xboole_0) ).
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = k2_xboole_0(X1,X2)
<=> ! [X4] :
( r2_hidden(X4,X3)
<=> ( r2_hidden(X4,X2)
| r2_hidden(X4,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+2.ax',d2_xboole_0) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ( l1_orders_2(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( l1_orders_2(X2)
& ~ v3_struct_0(X2) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2)))
=> ( r2_hidden(X3,k4_xboole_0(u1_struct_0(X2),u1_struct_0(X1)))
| r2_hidden(X3,u1_struct_0(X1)) ) ) ) ),
inference(assume_negation,[status(cth)],[t7_latsum_1]) ).
fof(c_0_10,plain,
! [X1,X2] :
( ( v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> v1_xboole_0(X2) ) )
& ( ~ v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> r2_hidden(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[d2_subset_1]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ( l1_orders_2(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( l1_orders_2(X2)
& ~ v3_struct_0(X2) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2)))
=> ( r2_hidden(X3,k4_xboole_0(u1_struct_0(X2),u1_struct_0(X1)))
| r2_hidden(X3,u1_struct_0(X1)) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X1] :
( ( l1_struct_0(X1)
& ~ v3_struct_0(X1) )
=> ~ v1_xboole_0(u1_struct_0(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_struct_0]) ).
fof(c_0_13,plain,
! [X29,X30] :
( ( ~ v1_xboole_0(X29)
| m1_subset_1(X30,X29)
| ~ v1_xboole_0(X30) )
& ( ~ v1_xboole_0(X29)
| v1_xboole_0(X30)
| ~ m1_subset_1(X30,X29) )
& ( v1_xboole_0(X29)
| m1_subset_1(X30,X29)
| ~ r2_hidden(X30,X29) )
& ( v1_xboole_0(X29)
| r2_hidden(X30,X29)
| ~ m1_subset_1(X30,X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_14,negated_conjecture,
( ~ r2_hidden(esk3_0,k4_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0)))
& ~ r2_hidden(esk3_0,u1_struct_0(esk1_0))
& m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
& l1_orders_2(esk2_0)
& ~ v3_struct_0(esk2_0)
& l1_orders_2(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_11])])])]) ).
fof(c_0_15,plain,
! [X2451] :
( ~ v1_xboole_0(u1_struct_0(X2451))
| ~ l1_struct_0(X2451)
| v3_struct_0(X2451) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
cnf(c_0_16,plain,
( ~ m1_subset_1(X1,X2)
| v1_xboole_0(X2)
| r2_hidden(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( ~ v1_xboole_0(u1_struct_0(X1))
| ~ l1_struct_0(X1)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( r2_hidden(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
| v1_xboole_0(u1_struct_0(k1_latsum_1(esk1_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_20,plain,
! [X2461] :
( l1_struct_0(X2461)
| ~ l1_orders_2(X2461) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_orders_2])])]) ).
fof(c_0_21,plain,
! [X1,X2] :
( ( l1_orders_2(X2)
& ~ v3_struct_0(X2)
& l1_orders_2(X1) )
=> ( v1_orders_2(k1_latsum_1(X1,X2))
& ~ v3_struct_0(k1_latsum_1(X1,X2)) ) ),
inference(fof_simplification,[status(thm)],[fc1_latsum_1]) ).
cnf(c_0_22,negated_conjecture,
( ~ l1_struct_0(k1_latsum_1(esk1_0,esk2_0))
| r2_hidden(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
| v3_struct_0(k1_latsum_1(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( ~ l1_orders_2(X1)
| l1_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_24,plain,
! [X263,X264] :
( ( ~ l1_orders_2(X264)
| ~ l1_orders_2(X263)
| l1_orders_2(k1_latsum_1(X263,X264)) )
& ( ~ l1_orders_2(X264)
| ~ l1_orders_2(X263)
| v1_orders_2(k1_latsum_1(X263,X264)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_latsum_1])])])]) ).
fof(c_0_25,plain,
! [X268,X269] :
( ( ~ l1_orders_2(X269)
| v3_struct_0(X269)
| ~ l1_orders_2(X268)
| v1_orders_2(k1_latsum_1(X268,X269)) )
& ( ~ l1_orders_2(X269)
| v3_struct_0(X269)
| ~ l1_orders_2(X268)
| ~ v3_struct_0(k1_latsum_1(X268,X269)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])]) ).
cnf(c_0_26,negated_conjecture,
( ~ l1_orders_2(k1_latsum_1(esk1_0,esk2_0))
| r2_hidden(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
| v3_struct_0(k1_latsum_1(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( ~ l1_orders_2(X2)
| ~ l1_orders_2(X1)
| l1_orders_2(k1_latsum_1(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
l1_orders_2(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_29,negated_conjecture,
l1_orders_2(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_30,plain,
! [X265,X266,X267] :
( ( ~ l1_orders_2(X265)
| ~ l1_orders_2(X266)
| ~ l1_orders_2(X267)
| ~ v1_orders_2(X267)
| X267 = k1_latsum_1(X265,X266)
| u1_orders_2(X267) != k2_xboole_0(k2_xboole_0(u1_orders_2(X265),u1_orders_2(X266)),k7_relset_1(u1_struct_0(X265),u1_struct_0(X265),u1_struct_0(X266),u1_struct_0(X266),u1_orders_2(X265),u1_orders_2(X266)))
| u1_struct_0(X267) != k2_xboole_0(u1_struct_0(X265),u1_struct_0(X266)) )
& ( ~ l1_orders_2(X265)
| ~ l1_orders_2(X266)
| ~ l1_orders_2(X267)
| ~ v1_orders_2(X267)
| X267 != k1_latsum_1(X265,X266)
| u1_orders_2(X267) = k2_xboole_0(k2_xboole_0(u1_orders_2(X265),u1_orders_2(X266)),k7_relset_1(u1_struct_0(X265),u1_struct_0(X265),u1_struct_0(X266),u1_struct_0(X266),u1_orders_2(X265),u1_orders_2(X266))) )
& ( ~ l1_orders_2(X265)
| ~ l1_orders_2(X266)
| ~ l1_orders_2(X267)
| ~ v1_orders_2(X267)
| X267 != k1_latsum_1(X265,X266)
| u1_struct_0(X267) = k2_xboole_0(u1_struct_0(X265),u1_struct_0(X266)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_latsum_1])])])])]) ).
fof(c_0_31,plain,
! [X1,X2,X3] :
( X3 = k4_xboole_0(X1,X2)
<=> ! [X4] :
( r2_hidden(X4,X3)
<=> ( ~ r2_hidden(X4,X2)
& r2_hidden(X4,X1) ) ) ),
inference(fof_simplification,[status(thm)],[d4_xboole_0]) ).
fof(c_0_32,plain,
! [X430,X431,X432,X433,X434,X435,X436,X437] :
( ( X437 = k2_xboole_0(X435,X436)
| r2_hidden(esk27_3(X435,X436,X437),X436)
| r2_hidden(esk27_3(X435,X436,X437),X435)
| r2_hidden(esk27_3(X435,X436,X437),X437) )
& ( X437 = k2_xboole_0(X435,X436)
| ~ r2_hidden(esk27_3(X435,X436,X437),X437)
| ~ r2_hidden(esk27_3(X435,X436,X437),X436) )
& ( X437 = k2_xboole_0(X435,X436)
| ~ r2_hidden(esk27_3(X435,X436,X437),X437)
| ~ r2_hidden(esk27_3(X435,X436,X437),X435) )
& ( X432 != k2_xboole_0(X430,X431)
| r2_hidden(X434,X432)
| ~ r2_hidden(X434,X431) )
& ( X432 != k2_xboole_0(X430,X431)
| r2_hidden(X434,X432)
| ~ r2_hidden(X434,X430) )
& ( X432 != k2_xboole_0(X430,X431)
| r2_hidden(X433,X431)
| r2_hidden(X433,X430)
| ~ r2_hidden(X433,X432) ) ),
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)],[d2_xboole_0])])])])])])]) ).
cnf(c_0_33,plain,
( ~ l1_orders_2(X2)
| ~ l1_orders_2(X1)
| ~ v3_struct_0(k1_latsum_1(X1,X2))
| v3_struct_0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,negated_conjecture,
( r2_hidden(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
| v3_struct_0(k1_latsum_1(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_35,negated_conjecture,
~ v3_struct_0(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_36,plain,
( ~ l1_orders_2(X2)
| ~ l1_orders_2(X3)
| ~ l1_orders_2(X1)
| ~ v1_orders_2(X1)
| X1 != k1_latsum_1(X2,X3)
| u1_struct_0(X1) = k2_xboole_0(u1_struct_0(X2),u1_struct_0(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,plain,
( ~ l1_orders_2(X2)
| ~ l1_orders_2(X1)
| v1_orders_2(k1_latsum_1(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_38,plain,
! [X70,X71,X72,X73,X74,X75,X76,X77] :
( ( X77 = k4_xboole_0(X75,X76)
| r2_hidden(esk9_3(X75,X76,X77),X77)
| ~ r2_hidden(esk9_3(X75,X76,X77),X76) )
& ( X77 = k4_xboole_0(X75,X76)
| r2_hidden(esk9_3(X75,X76,X77),X77)
| r2_hidden(esk9_3(X75,X76,X77),X75) )
& ( X77 = k4_xboole_0(X75,X76)
| r2_hidden(esk9_3(X75,X76,X77),X76)
| ~ r2_hidden(esk9_3(X75,X76,X77),X75)
| ~ r2_hidden(esk9_3(X75,X76,X77),X77) )
& ( X72 != k4_xboole_0(X70,X71)
| r2_hidden(X74,X72)
| r2_hidden(X74,X71)
| ~ r2_hidden(X74,X70) )
& ( X72 != k4_xboole_0(X70,X71)
| ~ r2_hidden(X73,X72)
| ~ r2_hidden(X73,X71) )
& ( X72 != k4_xboole_0(X70,X71)
| ~ r2_hidden(X73,X72)
| r2_hidden(X73,X70) ) ),
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_31])])])])])])]) ).
cnf(c_0_39,plain,
( X2 != k2_xboole_0(X3,X4)
| ~ r2_hidden(X1,X2)
| r2_hidden(X1,X4)
| r2_hidden(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,negated_conjecture,
r2_hidden(esk3_0,u1_struct_0(k1_latsum_1(esk1_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_33,c_0_34]),c_0_28]),c_0_29])]),c_0_35]) ).
cnf(c_0_41,plain,
( ~ l1_orders_2(X1)
| ~ l1_orders_2(X2)
| u1_struct_0(k1_latsum_1(X1,X2)) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_36]),c_0_27]),c_0_37]) ).
cnf(c_0_42,plain,
( X4 != k4_xboole_0(X2,X3)
| ~ r2_hidden(X1,X2)
| r2_hidden(X1,X4)
| r2_hidden(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_43,plain,
( ~ r2_hidden(X1,k2_xboole_0(X3,X2))
| r2_hidden(X1,X3)
| r2_hidden(X1,X2) ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_44,negated_conjecture,
r2_hidden(esk3_0,k2_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_28]),c_0_29])]) ).
cnf(c_0_45,negated_conjecture,
~ r2_hidden(esk3_0,u1_struct_0(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_46,plain,
( ~ r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| r2_hidden(X1,k4_xboole_0(X2,X3)) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_47,negated_conjecture,
r2_hidden(esk3_0,u1_struct_0(esk2_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_48,negated_conjecture,
~ r2_hidden(esk3_0,k4_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_49,negated_conjecture,
( r2_hidden(esk3_0,X1)
| r2_hidden(esk3_0,k4_xboole_0(u1_struct_0(esk2_0),X1)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU407+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n026.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 06:24:09 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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
% 17.66/3.98 % Version: 3.5.1
% 17.66/3.98 % Preprocessing class: FMLLMMLLSSSNFFN.
% 17.66/3.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.66/3.98 % Starting new_bool_3 with 900s (3) cores
% 17.66/3.98 % Starting new_bool_1 with 900s (3) cores
% 17.66/3.98 % Starting sh5l with 300s (1) cores
% 17.66/3.98 % Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 17.66/3.98 % new_bool_3 with pid 1556834 completed with status 0
% 17.66/3.98 % Result found by new_bool_3
% 17.66/3.98 % Preprocessing class: FMLLMMLLSSSNFFN.
% 17.66/3.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.66/3.98 % Starting new_bool_3 with 900s (3) cores
% 17.66/3.98 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 17.66/3.98 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 17.66/3.98 % Search class: FGHSM-SMLM32-MFFFFFNN
% 17.66/3.98 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 17.66/3.98 % Starting SubtermCWHack with 82s (1) cores
% 17.66/3.98 % Starting new_bool_3 with 91s (1) cores
% 17.66/3.98 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 17.66/3.98 % new_bool_3 with pid 1556996 completed with status 0
% 17.66/3.98 % Result found by new_bool_3
% 17.66/3.98 % Preprocessing class: FMLLMMLLSSSNFFN.
% 17.66/3.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.66/3.98 % Starting new_bool_3 with 900s (3) cores
% 17.66/3.98 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 17.66/3.98 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 17.66/3.98 % Search class: FGHSM-SMLM32-MFFFFFNN
% 17.66/3.98 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 17.66/3.98 % Starting SubtermCWHack with 82s (1) cores
% 17.66/3.98 % Starting new_bool_3 with 91s (1) cores
% 17.66/3.98 % Preprocessing time : 0.064 s
% 17.66/3.98 % Presaturation interreduction done
% 17.66/3.98
% 17.66/3.98 % Proof found!
% 17.66/3.98 % SZS status Theorem
% 17.66/3.98 % SZS output start CNFRefutation
% See solution above
% 17.66/3.98 % Parsed axioms : 19033
% 17.66/3.98 % Removed by relevancy pruning/SinE : 18095
% 17.66/3.98 % Initial clauses : 1915
% 17.66/3.98 % Removed in clause preprocessing : 48
% 17.66/3.98 % Initial clauses in saturation : 1867
% 17.66/3.98 % Processed clauses : 12510
% 17.66/3.98 % ...of these trivial : 205
% 17.66/3.98 % ...subsumed : 7497
% 17.66/3.98 % ...remaining for further processing : 4808
% 17.66/3.98 % Other redundant clauses eliminated : 706
% 17.66/3.98 % Clauses deleted for lack of memory : 0
% 17.66/3.98 % Backward-subsumed : 51
% 17.66/3.98 % Backward-rewritten : 63
% 17.66/3.98 % Generated clauses : 52455
% 17.66/3.98 % ...of the previous two non-redundant : 46906
% 17.66/3.98 % ...aggressively subsumed : 0
% 17.66/3.98 % Contextual simplify-reflections : 123
% 17.66/3.98 % Paramodulations : 51736
% 17.66/3.98 % Factorizations : 7
% 17.66/3.98 % NegExts : 0
% 17.66/3.98 % Equation resolutions : 722
% 17.66/3.98 % Disequality decompositions : 0
% 17.66/3.98 % Total rewrite steps : 12327
% 17.66/3.98 % ...of those cached : 9831
% 17.66/3.98 % Propositional unsat checks : 0
% 17.66/3.98 % Propositional check models : 0
% 17.66/3.98 % Propositional check unsatisfiable : 0
% 17.66/3.98 % Propositional clauses : 0
% 17.66/3.98 % Propositional clauses after purity: 0
% 17.66/3.98 % Propositional unsat core size : 0
% 17.66/3.98 % Propositional preprocessing time : 0.000
% 17.66/3.98 % Propositional encoding time : 0.000
% 17.66/3.98 % Propositional solver time : 0.000
% 17.66/3.98 % Success case prop preproc time : 0.000
% 17.66/3.98 % Success case prop encoding time : 0.000
% 17.66/3.98 % Success case prop solver time : 0.000
% 17.66/3.98 % Current number of processed clauses : 2853
% 17.66/3.98 % Positive orientable unit clauses : 589
% 17.66/3.98 % Positive unorientable unit clauses: 3
% 17.66/3.98 % Negative unit clauses : 655
% 17.66/3.98 % Non-unit-clauses : 1606
% 17.66/3.98 % Current number of unprocessed clauses: 37756
% 17.66/3.98 % ...number of literals in the above : 120795
% 17.66/3.98 % Current number of archived formulas : 0
% 17.66/3.98 % Current number of archived clauses : 1798
% 17.66/3.98 % Clause-clause subsumption calls (NU) : 1956464
% 17.66/3.98 % Rec. Clause-clause subsumption calls : 507901
% 17.66/3.98 % Non-unit clause-clause subsumptions : 1275
% 17.66/3.98 % Unit Clause-clause subsumption calls : 145453
% 17.66/3.98 % Rewrite failures with RHS unbound : 0
% 17.66/3.98 % BW rewrite match attempts : 371
% 17.66/3.98 % BW rewrite match successes : 249
% 17.66/3.98 % Condensation attempts : 0
% 17.66/3.98 % Condensation successes : 0
% 17.66/3.98 % Termbank termtop insertions : 1271249
% 17.66/3.98 % Search garbage collected termcells : 207844
% 17.66/3.98
% 17.66/3.98 % -------------------------------------------------
% 17.66/3.98 % User time : 2.379 s
% 17.66/3.98 % System time : 0.143 s
% 17.66/3.98 % Total time : 2.522 s
% 17.66/3.98 % Maximum resident set size: 40988 pages
% 17.66/3.98
% 17.66/3.98 % -------------------------------------------------
% 17.66/3.98 % User time : 7.574 s
% 17.66/3.98 % System time : 0.380 s
% 17.66/3.98 % Total time : 7.954 s
% 17.66/3.98 % Maximum resident set size: 32768 pages
% 17.66/3.98 % E exiting
%------------------------------------------------------------------------------