%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU407+4 : 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 02:25:00 PM UTC 2026
% Result : Theorem 0.15s 17.91s
% Output : CNFRefutation 0.15s
% 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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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,
! [X66,X67] :
( ( ~ v1_xboole_0(X66)
| m1_subset_1(X67,X66)
| ~ v1_xboole_0(X67) )
& ( ~ v1_xboole_0(X66)
| v1_xboole_0(X67)
| ~ m1_subset_1(X67,X66) )
& ( v1_xboole_0(X66)
| m1_subset_1(X67,X66)
| ~ r2_hidden(X67,X66) )
& ( v1_xboole_0(X66)
| r2_hidden(X67,X66)
| ~ m1_subset_1(X67,X66) ) ),
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,
! [X5518] :
( ~ v1_xboole_0(u1_struct_0(X5518))
| ~ l1_struct_0(X5518)
| v3_struct_0(X5518) ),
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,
! [X5534] :
( l1_struct_0(X5534)
| ~ l1_orders_2(X5534) ),
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,
! [X370,X371] :
( ( ~ l1_orders_2(X371)
| ~ l1_orders_2(X370)
| l1_orders_2(k1_latsum_1(X370,X371)) )
& ( ~ l1_orders_2(X371)
| ~ l1_orders_2(X370)
| v1_orders_2(k1_latsum_1(X370,X371)) ) ),
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,
! [X375,X376] :
( ( ~ l1_orders_2(X376)
| v3_struct_0(X376)
| ~ l1_orders_2(X375)
| v1_orders_2(k1_latsum_1(X375,X376)) )
& ( ~ l1_orders_2(X376)
| v3_struct_0(X376)
| ~ l1_orders_2(X375)
| ~ v3_struct_0(k1_latsum_1(X375,X376)) ) ),
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,
! [X372,X373,X374] :
( ( ~ l1_orders_2(X372)
| ~ l1_orders_2(X373)
| ~ l1_orders_2(X374)
| ~ v1_orders_2(X374)
| X374 = k1_latsum_1(X372,X373)
| u1_orders_2(X374) != k2_xboole_0(k2_xboole_0(u1_orders_2(X372),u1_orders_2(X373)),k7_relset_1(u1_struct_0(X372),u1_struct_0(X372),u1_struct_0(X373),u1_struct_0(X373),u1_orders_2(X372),u1_orders_2(X373)))
| u1_struct_0(X374) != k2_xboole_0(u1_struct_0(X372),u1_struct_0(X373)) )
& ( ~ l1_orders_2(X372)
| ~ l1_orders_2(X373)
| ~ l1_orders_2(X374)
| ~ v1_orders_2(X374)
| X374 != k1_latsum_1(X372,X373)
| u1_orders_2(X374) = k2_xboole_0(k2_xboole_0(u1_orders_2(X372),u1_orders_2(X373)),k7_relset_1(u1_struct_0(X372),u1_struct_0(X372),u1_struct_0(X373),u1_struct_0(X373),u1_orders_2(X372),u1_orders_2(X373))) )
& ( ~ l1_orders_2(X372)
| ~ l1_orders_2(X373)
| ~ l1_orders_2(X374)
| ~ v1_orders_2(X374)
| X374 != k1_latsum_1(X372,X373)
| u1_struct_0(X374) = k2_xboole_0(u1_struct_0(X372),u1_struct_0(X373)) ) ),
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,
! [X613,X614,X615,X616,X617,X618,X619,X620] :
( ( X620 = k2_xboole_0(X618,X619)
| r2_hidden(esk45_3(X618,X619,X620),X619)
| r2_hidden(esk45_3(X618,X619,X620),X618)
| r2_hidden(esk45_3(X618,X619,X620),X620) )
& ( X620 = k2_xboole_0(X618,X619)
| ~ r2_hidden(esk45_3(X618,X619,X620),X620)
| ~ r2_hidden(esk45_3(X618,X619,X620),X619) )
& ( X620 = k2_xboole_0(X618,X619)
| ~ r2_hidden(esk45_3(X618,X619,X620),X620)
| ~ r2_hidden(esk45_3(X618,X619,X620),X618) )
& ( X615 != k2_xboole_0(X613,X614)
| r2_hidden(X617,X615)
| ~ r2_hidden(X617,X614) )
& ( X615 != k2_xboole_0(X613,X614)
| r2_hidden(X617,X615)
| ~ r2_hidden(X617,X613) )
& ( X615 != k2_xboole_0(X613,X614)
| r2_hidden(X616,X614)
| r2_hidden(X616,X613)
| ~ r2_hidden(X616,X615) ) ),
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,
! [X110,X111,X112,X113,X114,X115,X116,X117] :
( ( X117 = k4_xboole_0(X115,X116)
| r2_hidden(esk10_3(X115,X116,X117),X117)
| ~ r2_hidden(esk10_3(X115,X116,X117),X116) )
& ( X117 = k4_xboole_0(X115,X116)
| r2_hidden(esk10_3(X115,X116,X117),X117)
| r2_hidden(esk10_3(X115,X116,X117),X115) )
& ( X117 = k4_xboole_0(X115,X116)
| r2_hidden(esk10_3(X115,X116,X117),X116)
| ~ r2_hidden(esk10_3(X115,X116,X117),X115)
| ~ r2_hidden(esk10_3(X115,X116,X117),X117) )
& ( X112 != k4_xboole_0(X110,X111)
| r2_hidden(X114,X112)
| r2_hidden(X114,X111)
| ~ r2_hidden(X114,X110) )
& ( X112 != k4_xboole_0(X110,X111)
| ~ r2_hidden(X113,X112)
| ~ r2_hidden(X113,X111) )
& ( X112 != k4_xboole_0(X110,X111)
| ~ r2_hidden(X113,X112)
| r2_hidden(X113,X110) ) ),
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+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n014.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 06:21:17 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.15/17.91 % Version: 3.5.1
% 0.15/17.91 % Preprocessing class: FMLLMLLLSSSNFFN.
% 0.15/17.91 % Scheduled 4 strats onto 8 cores with 296 seconds (2368 total)
% 0.15/17.91 % Starting new_bool_3 with 888s (3) cores
% 0.15/17.91 % Starting new_bool_1 with 888s (3) cores
% 0.15/17.91 % Starting sh5l with 296s (1) cores
% 0.15/17.91 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 296s (1) cores
% 0.15/17.91 % new_bool_3 with pid 3329374 completed with status 0
% 0.15/17.91 % Result found by new_bool_3
% 0.15/17.91 % Preprocessing class: FMLLMLLLSSSNFFN.
% 0.15/17.91 % Scheduled 4 strats onto 8 cores with 296 seconds (2368 total)
% 0.15/17.91 % Starting new_bool_3 with 888s (3) cores
% 0.15/17.91 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/17.91 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/17.91 % Search class: FGHSM-SMLM32-DFFFFFNN
% 0.15/17.91 % Scheduled 13 strats onto 3 cores with 887 seconds (887 total)
% 0.15/17.91 % Starting SubtermCWHack with 80s (1) cores
% 0.15/17.91 % Starting new_bool_3 with 89s (1) cores
% 0.15/17.91 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 67s (1) cores
% 0.15/17.91 % new_bool_3 with pid 3329389 completed with status 0
% 0.15/17.91 % Result found by new_bool_3
% 0.15/17.91 % Preprocessing class: FMLLMLLLSSSNFFN.
% 0.15/17.91 % Scheduled 4 strats onto 8 cores with 296 seconds (2368 total)
% 0.15/17.91 % Starting new_bool_3 with 888s (3) cores
% 0.15/17.91 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/17.91 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/17.91 % Search class: FGHSM-SMLM32-DFFFFFNN
% 0.15/17.91 % Scheduled 13 strats onto 3 cores with 887 seconds (887 total)
% 0.15/17.91 % Starting SubtermCWHack with 80s (1) cores
% 0.15/17.91 % Starting new_bool_3 with 89s (1) cores
% 0.15/17.91 % Preprocessing time : 0.287 s
% 0.15/17.91 % Presaturation interreduction done
% 0.15/17.91
% 0.15/17.91 % Proof found!
% 0.15/17.91 % SZS status Theorem
% 0.15/17.91 % SZS output start CNFRefutation
% See solution above
% 0.15/17.91 % Parsed axioms : 66043
% 0.15/17.91 % Removed by relevancy pruning/SinE : 63687
% 0.15/17.91 % Initial clauses : 4818
% 0.15/17.91 % Removed in clause preprocessing : 88
% 0.15/17.91 % Initial clauses in saturation : 4730
% 0.15/17.91 % Processed clauses : 25995
% 0.15/17.91 % ...of these trivial : 392
% 0.15/17.91 % ...subsumed : 12341
% 0.15/17.91 % ...remaining for further processing : 13262
% 0.15/17.91 % Other redundant clauses eliminated : 1427
% 0.15/17.91 % Clauses deleted for lack of memory : 0
% 0.15/17.91 % Backward-subsumed : 67
% 0.15/17.91 % Backward-rewritten : 233
% 0.15/17.91 % Generated clauses : 122097
% 0.15/17.91 % ...of the previous two non-redundant : 109950
% 0.15/17.91 % ...aggressively subsumed : 0
% 0.15/17.91 % Contextual simplify-reflections : 334
% 0.15/17.91 % Paramodulations : 120655
% 0.15/17.91 % Factorizations : 11
% 0.15/17.91 % NegExts : 0
% 0.15/17.91 % Equation resolutions : 1455
% 0.15/17.91 % Disequality decompositions : 0
% 0.15/17.91 % Total rewrite steps : 27261
% 0.15/17.91 % ...of those cached : 23329
% 0.15/17.91 % Propositional unsat checks : 2
% 0.15/17.91 % Propositional check models : 1
% 0.15/17.91 % Propositional check unsatisfiable : 0
% 0.15/17.92 % Propositional clauses : 0
% 0.15/17.92 % Propositional clauses after purity: 0
% 0.15/17.92 % Propositional unsat core size : 0
% 0.15/17.92 % Propositional preprocessing time : 0.000
% 0.15/17.92 % Propositional encoding time : 0.156
% 0.15/17.92 % Propositional solver time : 0.120
% 0.15/17.92 % Success case prop preproc time : 0.000
% 0.15/17.92 % Success case prop encoding time : 0.000
% 0.15/17.92 % Success case prop solver time : 0.000
% 0.15/17.92 % Current number of processed clauses : 8454
% 0.15/17.92 % Positive orientable unit clauses : 2244
% 0.15/17.92 % Positive unorientable unit clauses: 7
% 0.15/17.92 % Negative unit clauses : 2835
% 0.15/17.92 % Non-unit-clauses : 3368
% 0.15/17.92 % Current number of unprocessed clauses: 92372
% 0.15/17.92 % ...number of literals in the above : 264513
% 0.15/17.92 % Current number of archived formulas : 0
% 0.15/17.92 % Current number of archived clauses : 4528
% 0.15/17.92 % Clause-clause subsumption calls (NU) : 9775708
% 0.15/17.92 % Rec. Clause-clause subsumption calls : 1591337
% 0.15/17.92 % Non-unit clause-clause subsumptions : 1142
% 0.15/17.92 % Unit Clause-clause subsumption calls : 858159
% 0.15/17.92 % Rewrite failures with RHS unbound : 0
% 0.15/17.92 % BW rewrite match attempts : 546
% 0.15/17.92 % BW rewrite match successes : 373
% 0.15/17.92 % Condensation attempts : 0
% 0.15/17.92 % Condensation successes : 0
% 0.15/17.92 % Termbank termtop insertions : 4309565
% 0.15/17.92 % Search garbage collected termcells : 786366
% 0.15/17.92
% 0.15/17.92 % -------------------------------------------------
% 0.15/17.92 % User time : 12.151 s
% 0.15/17.92 % System time : 0.567 s
% 0.15/17.92 % Total time : 12.718 s
% 0.15/17.92 % Maximum resident set size: 139164 pages
% 0.15/17.92
% 0.15/17.92 % -------------------------------------------------
% 0.15/17.92 % User time : 38.208 s
% 0.15/17.92 % System time : 1.524 s
% 0.15/17.92 % Total time : 39.732 s
% 0.15/17.92 % Maximum resident set size: 112640 pages
% 0.15/17.92 % E exiting
%------------------------------------------------------------------------------