TSTP Solution File: SET791+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET791+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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 : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 00:54:23 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 6 unt; 0 def)
% Number of atoms : 379 ( 20 equ)
% Maximal formula atoms : 256 ( 13 avg)
% Number of connectives : 461 ( 111 ~; 240 |; 91 &)
% ( 5 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 77 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 90 ( 11 sgn 60 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thIV3,conjecture,
! [X1,X2,X6] :
( ( order(X1,X2)
& greatest(X6,X1,X2) )
=> max(X6,X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thIV3) ).
fof(max,axiom,
! [X1,X2,X6] :
( max(X6,X1,X2)
<=> ( member(X6,X2)
& ! [X3] :
( ( member(X3,X2)
& apply(X1,X6,X3) )
=> X6 = X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+3.ax',max) ).
fof(greatest,axiom,
! [X1,X2,X6] :
( greatest(X6,X1,X2)
<=> ( member(X6,X2)
& ! [X3] :
( member(X3,X2)
=> apply(X1,X3,X6) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+3.ax',greatest) ).
fof(order,axiom,
! [X1,X2] :
( order(X1,X2)
<=> ( ! [X3] :
( member(X3,X2)
=> apply(X1,X3,X3) )
& ! [X3,X4] :
( ( member(X3,X2)
& member(X4,X2) )
=> ( ( apply(X1,X3,X4)
& apply(X1,X4,X3) )
=> X3 = X4 ) )
& ! [X3,X4,X5] :
( ( member(X3,X2)
& member(X4,X2)
& member(X5,X2) )
=> ( ( apply(X1,X3,X4)
& apply(X1,X4,X5) )
=> apply(X1,X3,X5) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+3.ax',order) ).
fof(c_0_4,plain,
! [X2,X1] :
( epred1_2(X1,X2)
<=> ( ! [X3] :
( member(X3,X2)
=> apply(X1,X3,X3) )
& ! [X3,X4] :
( ( member(X3,X2)
& member(X4,X2) )
=> ( ( apply(X1,X3,X4)
& apply(X1,X4,X3) )
=> X3 = X4 ) )
& ! [X3,X4,X5] :
( ( member(X3,X2)
& member(X4,X2)
& member(X5,X2) )
=> ( ( apply(X1,X3,X4)
& apply(X1,X4,X5) )
=> apply(X1,X3,X5) ) ) ) ),
introduced(definition) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X6] :
( ( order(X1,X2)
& greatest(X6,X1,X2) )
=> max(X6,X1,X2) ),
inference(assume_negation,[status(cth)],[thIV3]) ).
fof(c_0_6,plain,
! [X6,X7,X8,X9,X10,X11,X12,X13,X6,X7] :
( ( ~ member(X8,X6)
| apply(X7,X8,X8)
| ~ epred1_2(X7,X6) )
& ( ~ member(X9,X6)
| ~ member(X10,X6)
| ~ apply(X7,X9,X10)
| ~ apply(X7,X10,X9)
| X9 = X10
| ~ epred1_2(X7,X6) )
& ( ~ member(X11,X6)
| ~ member(X12,X6)
| ~ member(X13,X6)
| ~ apply(X7,X11,X12)
| ~ apply(X7,X12,X13)
| apply(X7,X11,X13)
| ~ epred1_2(X7,X6) )
& ( member(esk9_2(X6,X7),X6)
| member(esk7_2(X6,X7),X6)
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( member(esk10_2(X6,X7),X6)
| member(esk7_2(X6,X7),X6)
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( member(esk11_2(X6,X7),X6)
| member(esk7_2(X6,X7),X6)
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( apply(X7,esk9_2(X6,X7),esk10_2(X6,X7))
| member(esk7_2(X6,X7),X6)
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( apply(X7,esk10_2(X6,X7),esk11_2(X6,X7))
| member(esk7_2(X6,X7),X6)
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( ~ apply(X7,esk9_2(X6,X7),esk11_2(X6,X7))
| member(esk7_2(X6,X7),X6)
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( member(esk9_2(X6,X7),X6)
| member(esk8_2(X6,X7),X6)
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( member(esk10_2(X6,X7),X6)
| member(esk8_2(X6,X7),X6)
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( member(esk11_2(X6,X7),X6)
| member(esk8_2(X6,X7),X6)
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( apply(X7,esk9_2(X6,X7),esk10_2(X6,X7))
| member(esk8_2(X6,X7),X6)
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( apply(X7,esk10_2(X6,X7),esk11_2(X6,X7))
| member(esk8_2(X6,X7),X6)
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( ~ apply(X7,esk9_2(X6,X7),esk11_2(X6,X7))
| member(esk8_2(X6,X7),X6)
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( member(esk9_2(X6,X7),X6)
| apply(X7,esk7_2(X6,X7),esk8_2(X6,X7))
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( member(esk10_2(X6,X7),X6)
| apply(X7,esk7_2(X6,X7),esk8_2(X6,X7))
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( member(esk11_2(X6,X7),X6)
| apply(X7,esk7_2(X6,X7),esk8_2(X6,X7))
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( apply(X7,esk9_2(X6,X7),esk10_2(X6,X7))
| apply(X7,esk7_2(X6,X7),esk8_2(X6,X7))
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( apply(X7,esk10_2(X6,X7),esk11_2(X6,X7))
| apply(X7,esk7_2(X6,X7),esk8_2(X6,X7))
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( ~ apply(X7,esk9_2(X6,X7),esk11_2(X6,X7))
| apply(X7,esk7_2(X6,X7),esk8_2(X6,X7))
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( member(esk9_2(X6,X7),X6)
| apply(X7,esk8_2(X6,X7),esk7_2(X6,X7))
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( member(esk10_2(X6,X7),X6)
| apply(X7,esk8_2(X6,X7),esk7_2(X6,X7))
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( member(esk11_2(X6,X7),X6)
| apply(X7,esk8_2(X6,X7),esk7_2(X6,X7))
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( apply(X7,esk9_2(X6,X7),esk10_2(X6,X7))
| apply(X7,esk8_2(X6,X7),esk7_2(X6,X7))
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( apply(X7,esk10_2(X6,X7),esk11_2(X6,X7))
| apply(X7,esk8_2(X6,X7),esk7_2(X6,X7))
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( ~ apply(X7,esk9_2(X6,X7),esk11_2(X6,X7))
| apply(X7,esk8_2(X6,X7),esk7_2(X6,X7))
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( member(esk9_2(X6,X7),X6)
| esk7_2(X6,X7) != esk8_2(X6,X7)
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( member(esk10_2(X6,X7),X6)
| esk7_2(X6,X7) != esk8_2(X6,X7)
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( member(esk11_2(X6,X7),X6)
| esk7_2(X6,X7) != esk8_2(X6,X7)
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( apply(X7,esk9_2(X6,X7),esk10_2(X6,X7))
| esk7_2(X6,X7) != esk8_2(X6,X7)
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( apply(X7,esk10_2(X6,X7),esk11_2(X6,X7))
| esk7_2(X6,X7) != esk8_2(X6,X7)
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( ~ apply(X7,esk9_2(X6,X7),esk11_2(X6,X7))
| esk7_2(X6,X7) != esk8_2(X6,X7)
| member(esk6_2(X6,X7),X6)
| epred1_2(X7,X6) )
& ( member(esk9_2(X6,X7),X6)
| member(esk7_2(X6,X7),X6)
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( member(esk10_2(X6,X7),X6)
| member(esk7_2(X6,X7),X6)
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( member(esk11_2(X6,X7),X6)
| member(esk7_2(X6,X7),X6)
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( apply(X7,esk9_2(X6,X7),esk10_2(X6,X7))
| member(esk7_2(X6,X7),X6)
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( apply(X7,esk10_2(X6,X7),esk11_2(X6,X7))
| member(esk7_2(X6,X7),X6)
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( ~ apply(X7,esk9_2(X6,X7),esk11_2(X6,X7))
| member(esk7_2(X6,X7),X6)
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( member(esk9_2(X6,X7),X6)
| member(esk8_2(X6,X7),X6)
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( member(esk10_2(X6,X7),X6)
| member(esk8_2(X6,X7),X6)
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( member(esk11_2(X6,X7),X6)
| member(esk8_2(X6,X7),X6)
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( apply(X7,esk9_2(X6,X7),esk10_2(X6,X7))
| member(esk8_2(X6,X7),X6)
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( apply(X7,esk10_2(X6,X7),esk11_2(X6,X7))
| member(esk8_2(X6,X7),X6)
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( ~ apply(X7,esk9_2(X6,X7),esk11_2(X6,X7))
| member(esk8_2(X6,X7),X6)
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( member(esk9_2(X6,X7),X6)
| apply(X7,esk7_2(X6,X7),esk8_2(X6,X7))
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( member(esk10_2(X6,X7),X6)
| apply(X7,esk7_2(X6,X7),esk8_2(X6,X7))
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( member(esk11_2(X6,X7),X6)
| apply(X7,esk7_2(X6,X7),esk8_2(X6,X7))
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( apply(X7,esk9_2(X6,X7),esk10_2(X6,X7))
| apply(X7,esk7_2(X6,X7),esk8_2(X6,X7))
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( apply(X7,esk10_2(X6,X7),esk11_2(X6,X7))
| apply(X7,esk7_2(X6,X7),esk8_2(X6,X7))
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( ~ apply(X7,esk9_2(X6,X7),esk11_2(X6,X7))
| apply(X7,esk7_2(X6,X7),esk8_2(X6,X7))
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( member(esk9_2(X6,X7),X6)
| apply(X7,esk8_2(X6,X7),esk7_2(X6,X7))
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( member(esk10_2(X6,X7),X6)
| apply(X7,esk8_2(X6,X7),esk7_2(X6,X7))
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( member(esk11_2(X6,X7),X6)
| apply(X7,esk8_2(X6,X7),esk7_2(X6,X7))
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( apply(X7,esk9_2(X6,X7),esk10_2(X6,X7))
| apply(X7,esk8_2(X6,X7),esk7_2(X6,X7))
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( apply(X7,esk10_2(X6,X7),esk11_2(X6,X7))
| apply(X7,esk8_2(X6,X7),esk7_2(X6,X7))
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( ~ apply(X7,esk9_2(X6,X7),esk11_2(X6,X7))
| apply(X7,esk8_2(X6,X7),esk7_2(X6,X7))
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( member(esk9_2(X6,X7),X6)
| esk7_2(X6,X7) != esk8_2(X6,X7)
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( member(esk10_2(X6,X7),X6)
| esk7_2(X6,X7) != esk8_2(X6,X7)
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( member(esk11_2(X6,X7),X6)
| esk7_2(X6,X7) != esk8_2(X6,X7)
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( apply(X7,esk9_2(X6,X7),esk10_2(X6,X7))
| esk7_2(X6,X7) != esk8_2(X6,X7)
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( apply(X7,esk10_2(X6,X7),esk11_2(X6,X7))
| esk7_2(X6,X7) != esk8_2(X6,X7)
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) )
& ( ~ apply(X7,esk9_2(X6,X7),esk11_2(X6,X7))
| esk7_2(X6,X7) != esk8_2(X6,X7)
| ~ apply(X7,esk6_2(X6,X7),esk6_2(X6,X7))
| epred1_2(X7,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])])]) ).
fof(c_0_7,plain,
! [X7,X8,X9,X10,X7,X8,X9] :
( ( member(X9,X8)
| ~ max(X9,X7,X8) )
& ( ~ member(X10,X8)
| ~ apply(X7,X9,X10)
| X9 = X10
| ~ max(X9,X7,X8) )
& ( member(esk4_3(X7,X8,X9),X8)
| ~ member(X9,X8)
| max(X9,X7,X8) )
& ( apply(X7,X9,esk4_3(X7,X8,X9))
| ~ member(X9,X8)
| max(X9,X7,X8) )
& ( X9 != esk4_3(X7,X8,X9)
| ~ member(X9,X8)
| max(X9,X7,X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[max])])])])])])]) ).
fof(c_0_8,plain,
! [X7,X8,X9,X10,X7,X8,X9] :
( ( member(X9,X8)
| ~ greatest(X9,X7,X8) )
& ( ~ member(X10,X8)
| apply(X7,X10,X9)
| ~ greatest(X9,X7,X8) )
& ( member(esk5_3(X7,X8,X9),X8)
| ~ member(X9,X8)
| greatest(X9,X7,X8) )
& ( ~ apply(X7,esk5_3(X7,X8,X9),X9)
| ~ member(X9,X8)
| greatest(X9,X7,X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[greatest])])])])])])]) ).
fof(c_0_9,negated_conjecture,
( order(esk1_0,esk2_0)
& greatest(esk3_0,esk1_0,esk2_0)
& ~ max(esk3_0,esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_10,plain,
( X3 = X4
| ~ epred1_2(X1,X2)
| ~ apply(X1,X4,X3)
| ~ apply(X1,X3,X4)
| ~ member(X4,X2)
| ~ member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( max(X1,X2,X3)
| apply(X2,X1,esk4_3(X2,X3,X1))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( max(X1,X2,X3)
| ~ member(X1,X3)
| X1 != esk4_3(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( apply(X2,X4,X1)
| ~ greatest(X1,X2,X3)
| ~ member(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
greatest(esk3_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,axiom,
! [X1,X2] :
( order(X1,X2)
<=> epred1_2(X1,X2) ),
inference(apply_def,[status(thm)],[order,c_0_4]) ).
cnf(c_0_16,plain,
( max(X1,X2,X3)
| ~ epred1_2(X2,X4)
| ~ apply(X2,esk4_3(X2,X3,X1),X1)
| ~ member(esk4_3(X2,X3,X1),X4)
| ~ member(X1,X4)
| ~ member(X1,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( apply(esk1_0,X1,esk3_0)
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( member(X1,X3)
| ~ greatest(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_19,plain,
! [X3,X4,X3,X4] :
( ( ~ order(X3,X4)
| epred1_2(X3,X4) )
& ( ~ epred1_2(X3,X4)
| order(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
cnf(c_0_20,negated_conjecture,
( max(esk3_0,esk1_0,X1)
| ~ epred1_2(esk1_0,X2)
| ~ member(esk4_3(esk1_0,X1,esk3_0),esk2_0)
| ~ member(esk4_3(esk1_0,X1,esk3_0),X2)
| ~ member(esk3_0,X2)
| ~ member(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( max(X1,X2,X3)
| member(esk4_3(X2,X3,X1),X3)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
member(esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_23,negated_conjecture,
~ max(esk3_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,plain,
( epred1_2(X1,X2)
| ~ order(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
order(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,negated_conjecture,
( ~ epred1_2(esk1_0,X1)
| ~ member(esk4_3(esk1_0,esk2_0,esk3_0),X1)
| ~ member(esk3_0,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_27,negated_conjecture,
epred1_2(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
$false,
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_21]),c_0_27]),c_0_22])]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET791+4 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 12:03:16 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.010 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 29
% 0.22/1.41 # Proof object clause steps : 17
% 0.22/1.41 # Proof object formula steps : 12
% 0.22/1.41 # Proof object conjectures : 12
% 0.22/1.41 # Proof object clause conjectures : 9
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 10
% 0.22/1.41 # Proof object initial formulas used : 4
% 0.22/1.41 # Proof object generating inferences : 7
% 0.22/1.41 # Proof object simplifying inferences : 8
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 11
% 0.22/1.41 # Removed by relevancy pruning/SinE : 7
% 0.22/1.41 # Initial clauses : 77
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 77
% 0.22/1.41 # Processed clauses : 91
% 0.22/1.41 # ...of these trivial : 0
% 0.22/1.41 # ...subsumed : 3
% 0.22/1.41 # ...remaining for further processing : 88
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 0
% 0.22/1.41 # Backward-rewritten : 0
% 0.22/1.41 # Generated clauses : 80
% 0.22/1.41 # ...of the previous two non-trivial : 76
% 0.22/1.41 # Contextual simplify-reflections : 8
% 0.22/1.41 # Paramodulations : 80
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 88
% 0.22/1.41 # Positive orientable unit clauses : 4
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 1
% 0.22/1.41 # Non-unit-clauses : 83
% 0.22/1.41 # Current number of unprocessed clauses: 62
% 0.22/1.41 # ...number of literals in the above : 534
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 0
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 968
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 334
% 0.22/1.41 # Non-unit clause-clause subsumptions : 11
% 0.22/1.41 # Unit Clause-clause subsumption calls : 125
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 0
% 0.22/1.41 # BW rewrite match successes : 0
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 6950
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.012 s
% 0.22/1.41 # System time : 0.003 s
% 0.22/1.41 # Total time : 0.015 s
% 0.22/1.41 # Maximum resident set size: 3112 pages
%------------------------------------------------------------------------------