TSTP Solution File: LCL656+1.005 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL656+1.005 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:17:32 EDT 2023
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of formulae : 34 ( 9 unt; 0 def)
% Number of atoms : 723 ( 0 equ)
% Maximal formula atoms : 250 ( 21 avg)
% Number of connectives : 1257 ( 568 ~; 467 |; 220 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 74 ( 9 avg)
% Maximal term depth : 3 ( 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 : 155 ( 0 sgn; 113 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) ) ) ) ) )
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ( ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p6(X1)
& ~ p106(X1)
& p105(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p6(X1)
& ~ p106(X1)
& p105(X1) ) ) )
| ~ ( ~ p105(X2)
& p104(X2) ) )
& ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p5(X1)
& ~ p105(X1)
& p104(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p5(X1)
& ~ p105(X1)
& p104(X1) ) ) )
| ~ ( ~ p104(X2)
& p103(X2) ) )
& ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p4(X1)
& ~ p104(X1)
& p103(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p4(X1)
& ~ p104(X1)
& p103(X1) ) ) )
| ~ ( ~ p103(X2)
& p102(X2) ) )
& ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p3(X1)
& ~ p103(X1)
& p102(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p3(X1)
& ~ p103(X1)
& p102(X1) ) ) )
| ~ ( ~ p102(X2)
& p101(X2) ) )
& ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p2(X1)
& ~ p102(X1)
& p101(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p2(X1)
& ~ p102(X1)
& p101(X1) ) ) )
| ~ ( ~ p101(X2)
& p100(X2) ) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p6(X1)
| ~ p105(X1) )
| p6(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p6(X1)
| ~ p105(X1) )
| ~ p6(X2) ) )
| ~ p105(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p5(X1)
| ~ p104(X1) )
| p5(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p5(X1)
| ~ p104(X1) )
| ~ p5(X2) ) )
| ~ p104(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p4(X1)
| ~ p103(X1) )
| p4(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p4(X1)
| ~ p103(X1) )
| ~ p4(X2) ) )
| ~ p103(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p3(X1)
| ~ p102(X1) )
| p3(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p3(X1)
| ~ p102(X1) )
| ~ p3(X2) ) )
| ~ p102(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p2(X1)
| ~ p101(X1) )
| p2(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p2(X1)
| ~ p101(X1) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1)
| ~ p100(X1) )
| p1(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1)
| ~ p100(X1) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p105(X2)
| ~ p106(X2) )
& ( p104(X2)
| ~ p105(X2) )
& ( p103(X2)
| ~ p104(X2) )
& ( p102(X2)
| ~ p103(X2) )
& ( p101(X2)
| ~ p102(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) ) ) ) ) )
& ~ p101(X1)
& p100(X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MKtGMWWR0U/E---3.1_18681.p',main) ).
fof(reflexivity,axiom,
! [X1] : r1(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.MKtGMWWR0U/E---3.1_18681.p',reflexivity) ).
fof(c_0_2,plain,
! [X2] :
( epred1_1(X2)
<=> ( ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p6(X1)
& ~ p106(X1)
& p105(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p6(X1)
& ~ p106(X1)
& p105(X1) ) ) )
| ~ ( ~ p105(X2)
& p104(X2) ) )
& ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p5(X1)
& ~ p105(X1)
& p104(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p5(X1)
& ~ p105(X1)
& p104(X1) ) ) )
| ~ ( ~ p104(X2)
& p103(X2) ) )
& ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p4(X1)
& ~ p104(X1)
& p103(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p4(X1)
& ~ p104(X1)
& p103(X1) ) ) )
| ~ ( ~ p103(X2)
& p102(X2) ) )
& ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p3(X1)
& ~ p103(X1)
& p102(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p3(X1)
& ~ p103(X1)
& p102(X1) ) ) )
| ~ ( ~ p102(X2)
& p101(X2) ) )
& ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p2(X1)
& ~ p102(X1)
& p101(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p2(X1)
& ~ p102(X1)
& p101(X1) ) ) )
| ~ ( ~ p101(X2)
& p100(X2) ) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p6(X1)
| ~ p105(X1) )
| p6(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p6(X1)
| ~ p105(X1) )
| ~ p6(X2) ) )
| ~ p105(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p5(X1)
| ~ p104(X1) )
| p5(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p5(X1)
| ~ p104(X1) )
| ~ p5(X2) ) )
| ~ p104(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p4(X1)
| ~ p103(X1) )
| p4(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p4(X1)
| ~ p103(X1) )
| ~ p4(X2) ) )
| ~ p103(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p3(X1)
| ~ p102(X1) )
| p3(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p3(X1)
| ~ p102(X1) )
| ~ p3(X2) ) )
| ~ p102(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p2(X1)
| ~ p101(X1) )
| p2(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p2(X1)
| ~ p101(X1) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1)
| ~ p100(X1) )
| p1(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1)
| ~ p100(X1) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p105(X2)
| ~ p106(X2) )
& ( p104(X2)
| ~ p105(X2) )
& ( p103(X2)
| ~ p104(X2) )
& ( p102(X2)
| ~ p103(X2) )
& ( p101(X2)
| ~ p102(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) ),
introduced(definition) ).
fof(c_0_3,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) ) ) ) ) )
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| epred1_1(X2) ) ) ) ) )
& ~ p101(X1)
& p100(X1) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[main])]),c_0_2]) ).
fof(c_0_4,negated_conjecture,
! [X5,X6,X7,X8,X9,X10,X11,X12,X13,X14] :
( ( ~ r1(esk1_0,X5)
| ~ r1(X5,X6)
| ~ r1(X6,X7)
| ~ r1(X7,X8)
| ~ r1(X8,X9)
| p3(X9) )
& ( ~ r1(esk1_0,X10)
| ~ r1(X10,X11)
| ~ r1(X11,X12)
| ~ r1(X12,X13)
| ~ r1(X13,X14)
| epred1_1(X14) )
& ~ p101(esk1_0)
& p100(esk1_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
fof(c_0_5,plain,
! [X3] : r1(X3,X3),
inference(variable_rename,[status(thm)],[reflexivity]) ).
cnf(c_0_6,negated_conjecture,
( epred1_1(X5)
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ r1(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( epred1_1(X1)
| ~ r1(esk1_0,X2)
| ~ r1(X3,X1)
| ~ r1(X4,X3)
| ~ r1(X2,X4) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
fof(c_0_9,plain,
! [X2] :
( epred1_1(X2)
=> ( ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p6(X1)
& ~ p106(X1)
& p105(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p6(X1)
& ~ p106(X1)
& p105(X1) ) ) )
| ~ ( ~ p105(X2)
& p104(X2) ) )
& ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p5(X1)
& ~ p105(X1)
& p104(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p5(X1)
& ~ p105(X1)
& p104(X1) ) ) )
| ~ ( ~ p104(X2)
& p103(X2) ) )
& ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p4(X1)
& ~ p104(X1)
& p103(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p4(X1)
& ~ p104(X1)
& p103(X1) ) ) )
| ~ ( ~ p103(X2)
& p102(X2) ) )
& ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p3(X1)
& ~ p103(X1)
& p102(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p3(X1)
& ~ p103(X1)
& p102(X1) ) ) )
| ~ ( ~ p102(X2)
& p101(X2) ) )
& ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p2(X1)
& ~ p102(X1)
& p101(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p2(X1)
& ~ p102(X1)
& p101(X1) ) ) )
| ~ ( ~ p101(X2)
& p100(X2) ) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p6(X1)
| ~ p105(X1) )
| p6(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p6(X1)
| ~ p105(X1) )
| ~ p6(X2) ) )
| ~ p105(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p5(X1)
| ~ p104(X1) )
| p5(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p5(X1)
| ~ p104(X1) )
| ~ p5(X2) ) )
| ~ p104(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p4(X1)
| ~ p103(X1) )
| p4(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p4(X1)
| ~ p103(X1) )
| ~ p4(X2) ) )
| ~ p103(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p3(X1)
| ~ p102(X1) )
| p3(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p3(X1)
| ~ p102(X1) )
| ~ p3(X2) ) )
| ~ p102(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p2(X1)
| ~ p101(X1) )
| p2(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p2(X1)
| ~ p101(X1) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1)
| ~ p100(X1) )
| p1(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1)
| ~ p100(X1) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p105(X2)
| ~ p106(X2) )
& ( p104(X2)
| ~ p105(X2) )
& ( p103(X2)
| ~ p104(X2) )
& ( p102(X2)
| ~ p103(X2) )
& ( p101(X2)
| ~ p102(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) ),
inference(split_equiv,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( epred1_1(X1)
| ~ r1(esk1_0,X2)
| ~ r1(X3,X1)
| ~ r1(X2,X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
fof(c_0_11,plain,
! [X15,X26,X27,X28,X29,X30,X31,X32,X33,X34,X35,X36,X37] :
( ( r1(X15,esk2_1(X15))
| p105(X15)
| ~ p104(X15)
| ~ epred1_1(X15) )
& ( ~ p6(esk2_1(X15))
| p105(X15)
| ~ p104(X15)
| ~ epred1_1(X15) )
& ( ~ p106(esk2_1(X15))
| p105(X15)
| ~ p104(X15)
| ~ epred1_1(X15) )
& ( p105(esk2_1(X15))
| p105(X15)
| ~ p104(X15)
| ~ epred1_1(X15) )
& ( r1(X15,esk3_1(X15))
| p105(X15)
| ~ p104(X15)
| ~ epred1_1(X15) )
& ( p6(esk3_1(X15))
| p105(X15)
| ~ p104(X15)
| ~ epred1_1(X15) )
& ( ~ p106(esk3_1(X15))
| p105(X15)
| ~ p104(X15)
| ~ epred1_1(X15) )
& ( p105(esk3_1(X15))
| p105(X15)
| ~ p104(X15)
| ~ epred1_1(X15) )
& ( r1(X15,esk4_1(X15))
| p104(X15)
| ~ p103(X15)
| ~ epred1_1(X15) )
& ( ~ p5(esk4_1(X15))
| p104(X15)
| ~ p103(X15)
| ~ epred1_1(X15) )
& ( ~ p105(esk4_1(X15))
| p104(X15)
| ~ p103(X15)
| ~ epred1_1(X15) )
& ( p104(esk4_1(X15))
| p104(X15)
| ~ p103(X15)
| ~ epred1_1(X15) )
& ( r1(X15,esk5_1(X15))
| p104(X15)
| ~ p103(X15)
| ~ epred1_1(X15) )
& ( p5(esk5_1(X15))
| p104(X15)
| ~ p103(X15)
| ~ epred1_1(X15) )
& ( ~ p105(esk5_1(X15))
| p104(X15)
| ~ p103(X15)
| ~ epred1_1(X15) )
& ( p104(esk5_1(X15))
| p104(X15)
| ~ p103(X15)
| ~ epred1_1(X15) )
& ( r1(X15,esk6_1(X15))
| p103(X15)
| ~ p102(X15)
| ~ epred1_1(X15) )
& ( ~ p4(esk6_1(X15))
| p103(X15)
| ~ p102(X15)
| ~ epred1_1(X15) )
& ( ~ p104(esk6_1(X15))
| p103(X15)
| ~ p102(X15)
| ~ epred1_1(X15) )
& ( p103(esk6_1(X15))
| p103(X15)
| ~ p102(X15)
| ~ epred1_1(X15) )
& ( r1(X15,esk7_1(X15))
| p103(X15)
| ~ p102(X15)
| ~ epred1_1(X15) )
& ( p4(esk7_1(X15))
| p103(X15)
| ~ p102(X15)
| ~ epred1_1(X15) )
& ( ~ p104(esk7_1(X15))
| p103(X15)
| ~ p102(X15)
| ~ epred1_1(X15) )
& ( p103(esk7_1(X15))
| p103(X15)
| ~ p102(X15)
| ~ epred1_1(X15) )
& ( r1(X15,esk8_1(X15))
| p102(X15)
| ~ p101(X15)
| ~ epred1_1(X15) )
& ( ~ p3(esk8_1(X15))
| p102(X15)
| ~ p101(X15)
| ~ epred1_1(X15) )
& ( ~ p103(esk8_1(X15))
| p102(X15)
| ~ p101(X15)
| ~ epred1_1(X15) )
& ( p102(esk8_1(X15))
| p102(X15)
| ~ p101(X15)
| ~ epred1_1(X15) )
& ( r1(X15,esk9_1(X15))
| p102(X15)
| ~ p101(X15)
| ~ epred1_1(X15) )
& ( p3(esk9_1(X15))
| p102(X15)
| ~ p101(X15)
| ~ epred1_1(X15) )
& ( ~ p103(esk9_1(X15))
| p102(X15)
| ~ p101(X15)
| ~ epred1_1(X15) )
& ( p102(esk9_1(X15))
| p102(X15)
| ~ p101(X15)
| ~ epred1_1(X15) )
& ( r1(X15,esk10_1(X15))
| p101(X15)
| ~ p100(X15)
| ~ epred1_1(X15) )
& ( ~ p2(esk10_1(X15))
| p101(X15)
| ~ p100(X15)
| ~ epred1_1(X15) )
& ( ~ p102(esk10_1(X15))
| p101(X15)
| ~ p100(X15)
| ~ epred1_1(X15) )
& ( p101(esk10_1(X15))
| p101(X15)
| ~ p100(X15)
| ~ epred1_1(X15) )
& ( r1(X15,esk11_1(X15))
| p101(X15)
| ~ p100(X15)
| ~ epred1_1(X15) )
& ( p2(esk11_1(X15))
| p101(X15)
| ~ p100(X15)
| ~ epred1_1(X15) )
& ( ~ p102(esk11_1(X15))
| p101(X15)
| ~ p100(X15)
| ~ epred1_1(X15) )
& ( p101(esk11_1(X15))
| p101(X15)
| ~ p100(X15)
| ~ epred1_1(X15) )
& ( ~ r1(X15,X26)
| ~ p6(X26)
| ~ p105(X26)
| p6(X15)
| ~ p105(X15)
| ~ epred1_1(X15) )
& ( ~ r1(X15,X27)
| p6(X27)
| ~ p105(X27)
| ~ p6(X15)
| ~ p105(X15)
| ~ epred1_1(X15) )
& ( ~ r1(X15,X28)
| ~ p5(X28)
| ~ p104(X28)
| p5(X15)
| ~ p104(X15)
| ~ epred1_1(X15) )
& ( ~ r1(X15,X29)
| p5(X29)
| ~ p104(X29)
| ~ p5(X15)
| ~ p104(X15)
| ~ epred1_1(X15) )
& ( ~ r1(X15,X30)
| ~ p4(X30)
| ~ p103(X30)
| p4(X15)
| ~ p103(X15)
| ~ epred1_1(X15) )
& ( ~ r1(X15,X31)
| p4(X31)
| ~ p103(X31)
| ~ p4(X15)
| ~ p103(X15)
| ~ epred1_1(X15) )
& ( ~ r1(X15,X32)
| ~ p3(X32)
| ~ p102(X32)
| p3(X15)
| ~ p102(X15)
| ~ epred1_1(X15) )
& ( ~ r1(X15,X33)
| p3(X33)
| ~ p102(X33)
| ~ p3(X15)
| ~ p102(X15)
| ~ epred1_1(X15) )
& ( ~ r1(X15,X34)
| ~ p2(X34)
| ~ p101(X34)
| p2(X15)
| ~ p101(X15)
| ~ epred1_1(X15) )
& ( ~ r1(X15,X35)
| p2(X35)
| ~ p101(X35)
| ~ p2(X15)
| ~ p101(X15)
| ~ epred1_1(X15) )
& ( ~ r1(X15,X36)
| ~ p1(X36)
| ~ p100(X36)
| p1(X15)
| ~ p100(X15)
| ~ epred1_1(X15) )
& ( ~ r1(X15,X37)
| p1(X37)
| ~ p100(X37)
| ~ p1(X15)
| ~ p100(X15)
| ~ epred1_1(X15) )
& ( p105(X15)
| ~ p106(X15)
| ~ epred1_1(X15) )
& ( p104(X15)
| ~ p105(X15)
| ~ epred1_1(X15) )
& ( p103(X15)
| ~ p104(X15)
| ~ epred1_1(X15) )
& ( p102(X15)
| ~ p103(X15)
| ~ epred1_1(X15) )
& ( p101(X15)
| ~ p102(X15)
| ~ epred1_1(X15) )
& ( p100(X15)
| ~ p101(X15)
| ~ epred1_1(X15) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
cnf(c_0_12,negated_conjecture,
( epred1_1(X1)
| ~ r1(esk1_0,X2)
| ~ r1(X2,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( p3(X5)
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ r1(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,plain,
( r1(X1,esk10_1(X1))
| p101(X1)
| ~ p100(X1)
| ~ epred1_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
p100(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,negated_conjecture,
~ p101(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,negated_conjecture,
( epred1_1(X1)
| ~ r1(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_18,plain,
( p3(X1)
| ~ epred1_1(esk1_0)
| ~ r1(esk10_1(esk1_0),X2)
| ~ r1(X3,X1)
| ~ r1(X4,X3)
| ~ r1(X2,X4) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),c_0_16]) ).
cnf(c_0_19,negated_conjecture,
epred1_1(esk1_0),
inference(spm,[status(thm)],[c_0_17,c_0_7]) ).
cnf(c_0_20,plain,
( p3(X1)
| ~ r1(esk10_1(esk1_0),X2)
| ~ r1(X3,X1)
| ~ r1(X4,X3)
| ~ r1(X2,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_21,plain,
( p3(X1)
| ~ r1(esk10_1(esk1_0),X2)
| ~ r1(X3,X1)
| ~ r1(X2,X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_7]) ).
cnf(c_0_22,plain,
( p3(X1)
| ~ r1(esk10_1(esk1_0),X2)
| ~ r1(X2,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_7]) ).
cnf(c_0_23,plain,
( p3(X1)
| ~ r1(esk10_1(esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_7]) ).
cnf(c_0_24,plain,
( r1(X1,esk8_1(X1))
| p102(X1)
| ~ p101(X1)
| ~ epred1_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,plain,
epred1_1(esk10_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_14]),c_0_15])]),c_0_16]),c_0_19])]) ).
cnf(c_0_26,plain,
( p102(esk10_1(esk1_0))
| p3(esk8_1(esk10_1(esk1_0)))
| ~ p101(esk10_1(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_27,plain,
( p101(esk10_1(X1))
| p101(X1)
| ~ p100(X1)
| ~ epred1_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_28,plain,
( p102(X1)
| ~ p3(esk8_1(X1))
| ~ p101(X1)
| ~ epred1_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_29,plain,
( p102(esk10_1(esk1_0))
| p3(esk8_1(esk10_1(esk1_0))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_19]),c_0_15])]),c_0_16]) ).
cnf(c_0_30,plain,
( p102(esk10_1(esk1_0))
| ~ p101(esk10_1(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_25])]) ).
cnf(c_0_31,plain,
( p101(X1)
| ~ p102(esk10_1(X1))
| ~ p100(X1)
| ~ epred1_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_32,plain,
p102(esk10_1(esk1_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_27]),c_0_19]),c_0_15])]),c_0_16]) ).
cnf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_19]),c_0_15])]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : LCL656+1.005 : TPTP v8.1.2. Released v4.0.0.
% 0.04/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n031.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 13:34:28 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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/tmp/tmp.MKtGMWWR0U/E---3.1_18681.p
% 0.15/0.43 # Version: 3.1pre001
% 0.15/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 18759 completed with status 0
% 0.15/0.43 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: FGUNF-FFMF11-SFFFFFNN
% 0.15/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 811s (1) cores
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.43 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.43 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.43 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 18765 completed with status 0
% 0.15/0.43 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: FGUNF-FFMF11-SFFFFFNN
% 0.15/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 811s (1) cores
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.43 # Preprocessing time : 0.001 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Theorem
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 2
% 0.15/0.43 # Removed by relevancy pruning/SinE : 0
% 0.15/0.43 # Initial clauses : 63
% 0.15/0.43 # Removed in clause preprocessing : 0
% 0.15/0.43 # Initial clauses in saturation : 63
% 0.15/0.43 # Processed clauses : 247
% 0.15/0.43 # ...of these trivial : 0
% 0.15/0.43 # ...subsumed : 44
% 0.15/0.44 # ...remaining for further processing : 203
% 0.15/0.44 # Other redundant clauses eliminated : 0
% 0.15/0.44 # Clauses deleted for lack of memory : 0
% 0.15/0.44 # Backward-subsumed : 10
% 0.15/0.44 # Backward-rewritten : 20
% 0.15/0.44 # Generated clauses : 378
% 0.15/0.44 # ...of the previous two non-redundant : 339
% 0.15/0.44 # ...aggressively subsumed : 0
% 0.15/0.44 # Contextual simplify-reflections : 0
% 0.15/0.44 # Paramodulations : 378
% 0.15/0.44 # Factorizations : 0
% 0.15/0.44 # NegExts : 0
% 0.15/0.44 # Equation resolutions : 0
% 0.15/0.44 # Total rewrite steps : 232
% 0.15/0.44 # Propositional unsat checks : 0
% 0.15/0.44 # Propositional check models : 0
% 0.15/0.44 # Propositional check unsatisfiable : 0
% 0.15/0.44 # Propositional clauses : 0
% 0.15/0.44 # Propositional clauses after purity: 0
% 0.15/0.44 # Propositional unsat core size : 0
% 0.15/0.44 # Propositional preprocessing time : 0.000
% 0.15/0.44 # Propositional encoding time : 0.000
% 0.15/0.44 # Propositional solver time : 0.000
% 0.15/0.44 # Success case prop preproc time : 0.000
% 0.15/0.44 # Success case prop encoding time : 0.000
% 0.15/0.44 # Success case prop solver time : 0.000
% 0.15/0.44 # Current number of processed clauses : 110
% 0.15/0.44 # Positive orientable unit clauses : 7
% 0.15/0.44 # Positive unorientable unit clauses: 0
% 0.15/0.44 # Negative unit clauses : 8
% 0.15/0.44 # Non-unit-clauses : 95
% 0.15/0.44 # Current number of unprocessed clauses: 210
% 0.15/0.44 # ...number of literals in the above : 1285
% 0.15/0.44 # Current number of archived formulas : 0
% 0.15/0.44 # Current number of archived clauses : 93
% 0.15/0.44 # Clause-clause subsumption calls (NU) : 1094
% 0.15/0.44 # Rec. Clause-clause subsumption calls : 575
% 0.15/0.44 # Non-unit clause-clause subsumptions : 14
% 0.15/0.44 # Unit Clause-clause subsumption calls : 249
% 0.15/0.44 # Rewrite failures with RHS unbound : 0
% 0.15/0.44 # BW rewrite match attempts : 2
% 0.15/0.44 # BW rewrite match successes : 2
% 0.15/0.44 # Condensation attempts : 0
% 0.15/0.44 # Condensation successes : 0
% 0.15/0.44 # Termbank termtop insertions : 11383
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.019 s
% 0.15/0.44 # System time : 0.002 s
% 0.15/0.44 # Total time : 0.021 s
% 0.15/0.44 # Maximum resident set size: 1956 pages
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.086 s
% 0.15/0.44 # System time : 0.010 s
% 0.15/0.44 # Total time : 0.096 s
% 0.15/0.44 # Maximum resident set size: 1704 pages
% 0.15/0.44 % E---3.1 exiting
% 0.15/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------