%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL674+1.005 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:16:05 PM UTC 2026
% Result : Theorem 0.14s 0.49s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 7 unt; 0 def)
% Number of atoms : 794 ( 0 equ)
% Maximal formula atoms : 250 ( 28 avg)
% Number of connectives : 1401 ( 635 ~; 488 |; 275 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 74 ( 10 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 16 ( 15 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 1 con; 0-1 aty)
% Number of variables : 138 ( 0 sgn 119 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X1] :
~ ( ~ ( p100(X1)
& ~ p101(X1)
& ! [X2] :
( ( ( ~ p101(X2)
| p100(X2) )
& ( ~ p102(X2)
| p101(X2) )
& ( ~ p103(X2)
| p102(X2) )
& ( ~ p104(X2)
| p103(X2) )
& ( ~ p105(X2)
| p104(X2) )
& ( ~ p106(X2)
| p105(X2) )
& ( ~ p100(X2)
| ( ( ~ p1(X2)
| ! [X1] :
( ~ p100(X1)
| p1(X1)
| ~ r1(X2,X1) ) )
& ( p1(X2)
| ! [X1] :
( ~ p100(X1)
| ~ p1(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p101(X2)
| ( ( ~ p2(X2)
| ! [X1] :
( ~ p101(X1)
| p2(X1)
| ~ r1(X2,X1) ) )
& ( p2(X2)
| ! [X1] :
( ~ p101(X1)
| ~ p2(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p102(X2)
| ( ( ~ p3(X2)
| ! [X1] :
( ~ p102(X1)
| p3(X1)
| ~ r1(X2,X1) ) )
& ( p3(X2)
| ! [X1] :
( ~ p102(X1)
| ~ p3(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p103(X2)
| ( ( ~ p4(X2)
| ! [X1] :
( ~ p103(X1)
| p4(X1)
| ~ r1(X2,X1) ) )
& ( p4(X2)
| ! [X1] :
( ~ p103(X1)
| ~ p4(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p104(X2)
| ( ( ~ p5(X2)
| ! [X1] :
( ~ p104(X1)
| p5(X1)
| ~ r1(X2,X1) ) )
& ( p5(X2)
| ! [X1] :
( ~ p104(X1)
| ~ p5(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p105(X2)
| ( ( ~ p6(X2)
| ! [X1] :
( ~ p105(X1)
| p6(X1)
| ~ r1(X2,X1) ) )
& ( p6(X2)
| ! [X1] :
( ~ p105(X1)
| ~ p6(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ ( p100(X2)
& ~ p101(X2) )
| ( ~ ! [X1] :
( ~ ( p101(X1)
& ~ p102(X1)
& p2(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p101(X1)
& ~ p102(X1)
& ~ p2(X1) )
| ~ r1(X2,X1) ) ) )
& ( ~ ( p101(X2)
& ~ p102(X2) )
| ( ~ ! [X1] :
( ~ ( p102(X1)
& ~ p103(X1)
& p3(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p102(X1)
& ~ p103(X1)
& ~ p3(X1) )
| ~ r1(X2,X1) ) ) )
& ( ~ ( p102(X2)
& ~ p103(X2) )
| ( ~ ! [X1] :
( ~ ( p103(X1)
& ~ p104(X1)
& p4(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p103(X1)
& ~ p104(X1)
& ~ p4(X1) )
| ~ r1(X2,X1) ) ) )
& ( ~ ( p103(X2)
& ~ p104(X2) )
| ( ~ ! [X1] :
( ~ ( p104(X1)
& ~ p105(X1)
& p5(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p104(X1)
& ~ p105(X1)
& ~ p5(X1) )
| ~ r1(X2,X1) ) ) )
& ( ~ ( p104(X2)
& ~ p105(X2) )
| ( ~ ! [X1] :
( ~ ( p105(X1)
& ~ p106(X1)
& p6(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p105(X1)
& ~ p106(X1)
& ~ p6(X1) )
| ~ r1(X2,X1) ) ) ) )
| ~ r1(X1,X2) ) )
| ~ ! [X2] :
( p3(X2)
| ~ r1(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
fof(transitivity,axiom,
! [X1,X2,X3] :
( ( r1(X2,X3)
& r1(X1,X2) )
=> r1(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity) ).
fof(reflexivity,axiom,
! [X1] : r1(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).
fof(c_0_3,plain,
! [X2] :
( epred1_1(X2)
<=> ( ( ~ p101(X2)
| p100(X2) )
& ( ~ p102(X2)
| p101(X2) )
& ( ~ p103(X2)
| p102(X2) )
& ( ~ p104(X2)
| p103(X2) )
& ( ~ p105(X2)
| p104(X2) )
& ( ~ p106(X2)
| p105(X2) )
& ( ~ p100(X2)
| ( ( ~ p1(X2)
| ! [X1] :
( ~ p100(X1)
| p1(X1)
| ~ r1(X2,X1) ) )
& ( p1(X2)
| ! [X1] :
( ~ p100(X1)
| ~ p1(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p101(X2)
| ( ( ~ p2(X2)
| ! [X1] :
( ~ p101(X1)
| p2(X1)
| ~ r1(X2,X1) ) )
& ( p2(X2)
| ! [X1] :
( ~ p101(X1)
| ~ p2(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p102(X2)
| ( ( ~ p3(X2)
| ! [X1] :
( ~ p102(X1)
| p3(X1)
| ~ r1(X2,X1) ) )
& ( p3(X2)
| ! [X1] :
( ~ p102(X1)
| ~ p3(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p103(X2)
| ( ( ~ p4(X2)
| ! [X1] :
( ~ p103(X1)
| p4(X1)
| ~ r1(X2,X1) ) )
& ( p4(X2)
| ! [X1] :
( ~ p103(X1)
| ~ p4(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p104(X2)
| ( ( ~ p5(X2)
| ! [X1] :
( ~ p104(X1)
| p5(X1)
| ~ r1(X2,X1) ) )
& ( p5(X2)
| ! [X1] :
( ~ p104(X1)
| ~ p5(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p105(X2)
| ( ( ~ p6(X2)
| ! [X1] :
( ~ p105(X1)
| p6(X1)
| ~ r1(X2,X1) ) )
& ( p6(X2)
| ! [X1] :
( ~ p105(X1)
| ~ p6(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ ( p100(X2)
& ~ p101(X2) )
| ( ~ ! [X1] :
( ~ ( p101(X1)
& ~ p102(X1)
& p2(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p101(X1)
& ~ p102(X1)
& ~ p2(X1) )
| ~ r1(X2,X1) ) ) )
& ( ~ ( p101(X2)
& ~ p102(X2) )
| ( ~ ! [X1] :
( ~ ( p102(X1)
& ~ p103(X1)
& p3(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p102(X1)
& ~ p103(X1)
& ~ p3(X1) )
| ~ r1(X2,X1) ) ) )
& ( ~ ( p102(X2)
& ~ p103(X2) )
| ( ~ ! [X1] :
( ~ ( p103(X1)
& ~ p104(X1)
& p4(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p103(X1)
& ~ p104(X1)
& ~ p4(X1) )
| ~ r1(X2,X1) ) ) )
& ( ~ ( p103(X2)
& ~ p104(X2) )
| ( ~ ! [X1] :
( ~ ( p104(X1)
& ~ p105(X1)
& p5(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p104(X1)
& ~ p105(X1)
& ~ p5(X1) )
| ~ r1(X2,X1) ) ) )
& ( ~ ( p104(X2)
& ~ p105(X2) )
| ( ~ ! [X1] :
( ~ ( p105(X1)
& ~ p106(X1)
& p6(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p105(X1)
& ~ p106(X1)
& ~ p6(X1) )
| ~ r1(X2,X1) ) ) ) ) ),
introduced(definition) ).
fof(c_0_4,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ( p100(X1)
& ~ p101(X1)
& ! [X2] :
( ( ( ~ p101(X2)
| p100(X2) )
& ( ~ p102(X2)
| p101(X2) )
& ( ~ p103(X2)
| p102(X2) )
& ( ~ p104(X2)
| p103(X2) )
& ( ~ p105(X2)
| p104(X2) )
& ( ~ p106(X2)
| p105(X2) )
& ( ~ p100(X2)
| ( ( ~ p1(X2)
| ! [X1] :
( ~ p100(X1)
| p1(X1)
| ~ r1(X2,X1) ) )
& ( p1(X2)
| ! [X1] :
( ~ p100(X1)
| ~ p1(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p101(X2)
| ( ( ~ p2(X2)
| ! [X1] :
( ~ p101(X1)
| p2(X1)
| ~ r1(X2,X1) ) )
& ( p2(X2)
| ! [X1] :
( ~ p101(X1)
| ~ p2(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p102(X2)
| ( ( ~ p3(X2)
| ! [X1] :
( ~ p102(X1)
| p3(X1)
| ~ r1(X2,X1) ) )
& ( p3(X2)
| ! [X1] :
( ~ p102(X1)
| ~ p3(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p103(X2)
| ( ( ~ p4(X2)
| ! [X1] :
( ~ p103(X1)
| p4(X1)
| ~ r1(X2,X1) ) )
& ( p4(X2)
| ! [X1] :
( ~ p103(X1)
| ~ p4(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p104(X2)
| ( ( ~ p5(X2)
| ! [X1] :
( ~ p104(X1)
| p5(X1)
| ~ r1(X2,X1) ) )
& ( p5(X2)
| ! [X1] :
( ~ p104(X1)
| ~ p5(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p105(X2)
| ( ( ~ p6(X2)
| ! [X1] :
( ~ p105(X1)
| p6(X1)
| ~ r1(X2,X1) ) )
& ( p6(X2)
| ! [X1] :
( ~ p105(X1)
| ~ p6(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ ( p100(X2)
& ~ p101(X2) )
| ( ~ ! [X1] :
( ~ ( p101(X1)
& ~ p102(X1)
& p2(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p101(X1)
& ~ p102(X1)
& ~ p2(X1) )
| ~ r1(X2,X1) ) ) )
& ( ~ ( p101(X2)
& ~ p102(X2) )
| ( ~ ! [X1] :
( ~ ( p102(X1)
& ~ p103(X1)
& p3(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p102(X1)
& ~ p103(X1)
& ~ p3(X1) )
| ~ r1(X2,X1) ) ) )
& ( ~ ( p102(X2)
& ~ p103(X2) )
| ( ~ ! [X1] :
( ~ ( p103(X1)
& ~ p104(X1)
& p4(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p103(X1)
& ~ p104(X1)
& ~ p4(X1) )
| ~ r1(X2,X1) ) ) )
& ( ~ ( p103(X2)
& ~ p104(X2) )
| ( ~ ! [X1] :
( ~ ( p104(X1)
& ~ p105(X1)
& p5(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p104(X1)
& ~ p105(X1)
& ~ p5(X1) )
| ~ r1(X2,X1) ) ) )
& ( ~ ( p104(X2)
& ~ p105(X2) )
| ( ~ ! [X1] :
( ~ ( p105(X1)
& ~ p106(X1)
& p6(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p105(X1)
& ~ p106(X1)
& ~ p6(X1) )
| ~ r1(X2,X1) ) ) ) )
| ~ r1(X1,X2) ) )
| ~ ! [X2] :
( p3(X2)
| ~ r1(X1,X2) ) ),
inference(assume_negation,[status(cth)],[main]) ).
fof(c_0_5,plain,
! [X2] :
( epred1_1(X2)
=> ( ( ~ p101(X2)
| p100(X2) )
& ( ~ p102(X2)
| p101(X2) )
& ( ~ p103(X2)
| p102(X2) )
& ( ~ p104(X2)
| p103(X2) )
& ( ~ p105(X2)
| p104(X2) )
& ( ~ p106(X2)
| p105(X2) )
& ( ~ p100(X2)
| ( ( ~ p1(X2)
| ! [X1] :
( ~ p100(X1)
| p1(X1)
| ~ r1(X2,X1) ) )
& ( p1(X2)
| ! [X1] :
( ~ p100(X1)
| ~ p1(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p101(X2)
| ( ( ~ p2(X2)
| ! [X1] :
( ~ p101(X1)
| p2(X1)
| ~ r1(X2,X1) ) )
& ( p2(X2)
| ! [X1] :
( ~ p101(X1)
| ~ p2(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p102(X2)
| ( ( ~ p3(X2)
| ! [X1] :
( ~ p102(X1)
| p3(X1)
| ~ r1(X2,X1) ) )
& ( p3(X2)
| ! [X1] :
( ~ p102(X1)
| ~ p3(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p103(X2)
| ( ( ~ p4(X2)
| ! [X1] :
( ~ p103(X1)
| p4(X1)
| ~ r1(X2,X1) ) )
& ( p4(X2)
| ! [X1] :
( ~ p103(X1)
| ~ p4(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p104(X2)
| ( ( ~ p5(X2)
| ! [X1] :
( ~ p104(X1)
| p5(X1)
| ~ r1(X2,X1) ) )
& ( p5(X2)
| ! [X1] :
( ~ p104(X1)
| ~ p5(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ p105(X2)
| ( ( ~ p6(X2)
| ! [X1] :
( ~ p105(X1)
| p6(X1)
| ~ r1(X2,X1) ) )
& ( p6(X2)
| ! [X1] :
( ~ p105(X1)
| ~ p6(X1)
| ~ r1(X2,X1) ) ) ) )
& ( ~ ( p100(X2)
& ~ p101(X2) )
| ( ~ ! [X1] :
( ~ ( p101(X1)
& ~ p102(X1)
& p2(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p101(X1)
& ~ p102(X1)
& ~ p2(X1) )
| ~ r1(X2,X1) ) ) )
& ( ~ ( p101(X2)
& ~ p102(X2) )
| ( ~ ! [X1] :
( ~ ( p102(X1)
& ~ p103(X1)
& p3(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p102(X1)
& ~ p103(X1)
& ~ p3(X1) )
| ~ r1(X2,X1) ) ) )
& ( ~ ( p102(X2)
& ~ p103(X2) )
| ( ~ ! [X1] :
( ~ ( p103(X1)
& ~ p104(X1)
& p4(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p103(X1)
& ~ p104(X1)
& ~ p4(X1) )
| ~ r1(X2,X1) ) ) )
& ( ~ ( p103(X2)
& ~ p104(X2) )
| ( ~ ! [X1] :
( ~ ( p104(X1)
& ~ p105(X1)
& p5(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p104(X1)
& ~ p105(X1)
& ~ p5(X1) )
| ~ r1(X2,X1) ) ) )
& ( ~ ( p104(X2)
& ~ p105(X2) )
| ( ~ ! [X1] :
( ~ ( p105(X1)
& ~ p106(X1)
& p6(X1) )
| ~ r1(X2,X1) )
& ~ ! [X1] :
( ~ ( p105(X1)
& ~ p106(X1)
& ~ p6(X1) )
| ~ r1(X2,X1) ) ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_3]) ).
fof(c_0_6,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ( p100(X1)
& ~ p101(X1)
& ! [X2] :
( epred1_1(X2)
| ~ r1(X1,X2) ) )
| ~ ! [X2] :
( p3(X2)
| ~ r1(X1,X2) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4]),c_0_3]) ).
fof(c_0_7,plain,
! [X11,X22,X23,X24,X25,X26,X27,X28,X29,X30,X31,X32,X33] :
( ( ~ epred1_1(X11)
| ~ p101(X11)
| p100(X11) )
& ( ~ epred1_1(X11)
| ~ p102(X11)
| p101(X11) )
& ( ~ epred1_1(X11)
| ~ p103(X11)
| p102(X11) )
& ( ~ epred1_1(X11)
| ~ p104(X11)
| p103(X11) )
& ( ~ epred1_1(X11)
| ~ p105(X11)
| p104(X11) )
& ( ~ epred1_1(X11)
| ~ p106(X11)
| p105(X11) )
& ( ~ epred1_1(X11)
| ~ p100(X11)
| ~ p1(X11)
| ~ p100(X33)
| p1(X33)
| ~ r1(X11,X33) )
& ( ~ epred1_1(X11)
| ~ p100(X11)
| p1(X11)
| ~ p100(X32)
| ~ p1(X32)
| ~ r1(X11,X32) )
& ( ~ epred1_1(X11)
| ~ p101(X11)
| ~ p2(X11)
| ~ p101(X31)
| p2(X31)
| ~ r1(X11,X31) )
& ( ~ epred1_1(X11)
| ~ p101(X11)
| p2(X11)
| ~ p101(X30)
| ~ p2(X30)
| ~ r1(X11,X30) )
& ( ~ epred1_1(X11)
| ~ p102(X11)
| ~ p3(X11)
| ~ p102(X29)
| p3(X29)
| ~ r1(X11,X29) )
& ( ~ epred1_1(X11)
| ~ p102(X11)
| p3(X11)
| ~ p102(X28)
| ~ p3(X28)
| ~ r1(X11,X28) )
& ( ~ epred1_1(X11)
| ~ p103(X11)
| ~ p4(X11)
| ~ p103(X27)
| p4(X27)
| ~ r1(X11,X27) )
& ( ~ epred1_1(X11)
| ~ p103(X11)
| p4(X11)
| ~ p103(X26)
| ~ p4(X26)
| ~ r1(X11,X26) )
& ( ~ epred1_1(X11)
| ~ p104(X11)
| ~ p5(X11)
| ~ p104(X25)
| p5(X25)
| ~ r1(X11,X25) )
& ( ~ epred1_1(X11)
| ~ p104(X11)
| p5(X11)
| ~ p104(X24)
| ~ p5(X24)
| ~ r1(X11,X24) )
& ( ~ epred1_1(X11)
| ~ p105(X11)
| ~ p6(X11)
| ~ p105(X23)
| p6(X23)
| ~ r1(X11,X23) )
& ( ~ epred1_1(X11)
| ~ p105(X11)
| p6(X11)
| ~ p105(X22)
| ~ p6(X22)
| ~ r1(X11,X22) )
& ( ~ epred1_1(X11)
| ~ p100(X11)
| p101(X11)
| p101(esk11_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p100(X11)
| p101(X11)
| ~ p102(esk11_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p100(X11)
| p101(X11)
| p2(esk11_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p100(X11)
| p101(X11)
| r1(X11,esk11_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p100(X11)
| p101(X11)
| p101(esk10_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p100(X11)
| p101(X11)
| ~ p102(esk10_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p100(X11)
| p101(X11)
| ~ p2(esk10_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p100(X11)
| p101(X11)
| r1(X11,esk10_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p101(X11)
| p102(X11)
| p102(esk9_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p101(X11)
| p102(X11)
| ~ p103(esk9_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p101(X11)
| p102(X11)
| p3(esk9_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p101(X11)
| p102(X11)
| r1(X11,esk9_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p101(X11)
| p102(X11)
| p102(esk8_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p101(X11)
| p102(X11)
| ~ p103(esk8_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p101(X11)
| p102(X11)
| ~ p3(esk8_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p101(X11)
| p102(X11)
| r1(X11,esk8_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p102(X11)
| p103(X11)
| p103(esk7_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p102(X11)
| p103(X11)
| ~ p104(esk7_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p102(X11)
| p103(X11)
| p4(esk7_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p102(X11)
| p103(X11)
| r1(X11,esk7_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p102(X11)
| p103(X11)
| p103(esk6_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p102(X11)
| p103(X11)
| ~ p104(esk6_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p102(X11)
| p103(X11)
| ~ p4(esk6_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p102(X11)
| p103(X11)
| r1(X11,esk6_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p103(X11)
| p104(X11)
| p104(esk5_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p103(X11)
| p104(X11)
| ~ p105(esk5_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p103(X11)
| p104(X11)
| p5(esk5_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p103(X11)
| p104(X11)
| r1(X11,esk5_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p103(X11)
| p104(X11)
| p104(esk4_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p103(X11)
| p104(X11)
| ~ p105(esk4_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p103(X11)
| p104(X11)
| ~ p5(esk4_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p103(X11)
| p104(X11)
| r1(X11,esk4_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p104(X11)
| p105(X11)
| p105(esk3_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p104(X11)
| p105(X11)
| ~ p106(esk3_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p104(X11)
| p105(X11)
| p6(esk3_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p104(X11)
| p105(X11)
| r1(X11,esk3_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p104(X11)
| p105(X11)
| p105(esk2_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p104(X11)
| p105(X11)
| ~ p106(esk2_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p104(X11)
| p105(X11)
| ~ p6(esk2_1(X11)) )
& ( ~ epred1_1(X11)
| ~ p104(X11)
| p105(X11)
| r1(X11,esk2_1(X11)) ) ),
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_5])])])])])]) ).
fof(c_0_8,negated_conjecture,
! [X5,X6] :
( p100(esk1_0)
& ~ p101(esk1_0)
& ( epred1_1(X6)
| ~ r1(esk1_0,X6) )
& ( p3(X5)
| ~ r1(esk1_0,X5) ) ),
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_6])])])])]) ).
fof(c_0_9,plain,
! [X8,X9,X10] :
( r1(X8,X10)
| ~ r1(X9,X10)
| ~ r1(X8,X9) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity])])]) ).
cnf(c_0_10,plain,
( ~ epred1_1(X1)
| ~ p101(X1)
| ~ p3(esk8_1(X1))
| p102(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( ~ r1(esk1_0,X1)
| p3(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( ~ r1(X2,X3)
| ~ r1(X1,X2)
| r1(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( ~ epred1_1(X1)
| ~ p101(X1)
| p102(X1)
| r1(X1,esk8_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
( ~ r1(esk1_0,esk8_1(X1))
| ~ p101(X1)
| ~ epred1_1(X1)
| p102(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( ~ r1(X2,X1)
| ~ p101(X1)
| ~ epred1_1(X1)
| r1(X2,esk8_1(X1))
| p102(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( ~ r1(esk1_0,X1)
| epred1_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_17,plain,
! [X7] : r1(X7,X7),
inference(variable_rename,[status(thm)],[reflexivity]) ).
cnf(c_0_18,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p101(X1)
| p102(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,plain,
( ~ epred1_1(X1)
| ~ p100(X1)
| p101(X1)
| p101(esk11_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,plain,
( ~ epred1_1(X1)
| ~ p100(X1)
| ~ p102(esk11_1(X1))
| p101(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( ~ r1(esk1_0,esk11_1(X1))
| ~ p100(X1)
| ~ epred1_1(X1)
| p101(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_23,plain,
( ~ epred1_1(X1)
| ~ p100(X1)
| p101(X1)
| r1(X1,esk11_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_24,negated_conjecture,
epred1_1(esk1_0),
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
p100(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,negated_conjecture,
~ p101(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,plain,
$false,
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_25])]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL674+1.005 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n019.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 00:53:34 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/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
% 0.14/0.49 % Version: 3.5.1
% 0.14/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.49 % Starting sh5l with 300s (1) cores
% 0.14/0.49 % new_bool_1 with pid 1342890 completed with status 0
% 0.14/0.49 % Result found by new_bool_1
% 0.14/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.49 % Search class: FGUNF-FFMF11-SFFFFFNN
% 0.14/0.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.49 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.49 % SubtermCWHack with pid 1342892 completed with status 0
% 0.14/0.49 % Result found by SubtermCWHack
% 0.14/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.49 % Search class: FGUNF-FFMF11-SFFFFFNN
% 0.14/0.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.49 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.49 % Preprocessing time : 0.001 s
% 0.14/0.49
% 0.14/0.49 % Proof found!
% 0.14/0.49 % SZS status Theorem
% 0.14/0.49 % SZS output start CNFRefutation
% See solution above
% 0.14/0.49 % Parsed axioms : 3
% 0.14/0.49 % Removed by relevancy pruning/SinE : 0
% 0.14/0.49 % Initial clauses : 64
% 0.14/0.49 % Removed in clause preprocessing : 0
% 0.14/0.49 % Initial clauses in saturation : 64
% 0.14/0.49 % Processed clauses : 111
% 0.14/0.49 % ...of these trivial : 0
% 0.14/0.49 % ...subsumed : 12
% 0.14/0.49 % ...remaining for further processing : 99
% 0.14/0.49 % Other redundant clauses eliminated : 0
% 0.14/0.49 % Clauses deleted for lack of memory : 0
% 0.14/0.49 % Backward-subsumed : 0
% 0.14/0.49 % Backward-rewritten : 0
% 0.14/0.49 % Generated clauses : 313
% 0.14/0.49 % ...of the previous two non-redundant : 278
% 0.14/0.49 % ...aggressively subsumed : 0
% 0.14/0.49 % Contextual simplify-reflections : 10
% 0.14/0.49 % Paramodulations : 313
% 0.14/0.49 % Factorizations : 0
% 0.14/0.49 % NegExts : 0
% 0.14/0.49 % Equation resolutions : 0
% 0.14/0.49 % Disequality decompositions : 0
% 0.14/0.49 % Total rewrite steps : 18
% 0.14/0.49 % ...of those cached : 16
% 0.14/0.49 % Propositional unsat checks : 0
% 0.14/0.49 % Propositional check models : 0
% 0.14/0.49 % Propositional check unsatisfiable : 0
% 0.14/0.49 % Propositional clauses : 0
% 0.14/0.49 % Propositional clauses after purity: 0
% 0.14/0.49 % Propositional unsat core size : 0
% 0.14/0.49 % Propositional preprocessing time : 0.000
% 0.14/0.49 % Propositional encoding time : 0.000
% 0.14/0.49 % Propositional solver time : 0.000
% 0.14/0.49 % Success case prop preproc time : 0.000
% 0.14/0.49 % Success case prop encoding time : 0.000
% 0.14/0.49 % Success case prop solver time : 0.000
% 0.14/0.49 % Current number of processed clauses : 99
% 0.14/0.49 % Positive orientable unit clauses : 5
% 0.14/0.49 % Positive unorientable unit clauses: 0
% 0.14/0.49 % Negative unit clauses : 4
% 0.14/0.49 % Non-unit-clauses : 90
% 0.14/0.49 % Current number of unprocessed clauses: 230
% 0.14/0.49 % ...number of literals in the above : 1818
% 0.14/0.49 % Current number of archived formulas : 0
% 0.14/0.49 % Current number of archived clauses : 0
% 0.14/0.49 % Clause-clause subsumption calls (NU) : 806
% 0.14/0.49 % Rec. Clause-clause subsumption calls : 165
% 0.14/0.49 % Non-unit clause-clause subsumptions : 13
% 0.14/0.49 % Unit Clause-clause subsumption calls : 66
% 0.14/0.49 % Rewrite failures with RHS unbound : 0
% 0.14/0.49 % BW rewrite match attempts : 0
% 0.14/0.49 % BW rewrite match successes : 0
% 0.14/0.49 % Condensation attempts : 0
% 0.14/0.49 % Condensation successes : 0
% 0.14/0.49 % Termbank termtop insertions : 10926
% 0.14/0.49 % Search garbage collected termcells : 900
% 0.14/0.49
% 0.14/0.49 % -------------------------------------------------
% 0.14/0.49 % User time : 0.015 s
% 0.14/0.49 % System time : 0.003 s
% 0.14/0.49 % Total time : 0.018 s
% 0.14/0.49 % Maximum resident set size: 3916 pages
% 0.14/0.49
% 0.14/0.49 % -------------------------------------------------
% 0.14/0.49 % User time : 0.018 s
% 0.14/0.49 % System time : 0.010 s
% 0.14/0.49 % Total time : 0.028 s
% 0.14/0.49 % Maximum resident set size: 4608 pages
% 0.14/0.49 % E exiting
%------------------------------------------------------------------------------