TSTP Solution File: SET795+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET795+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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:25 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 9 unt; 0 def)
% Number of atoms : 404 ( 27 equ)
% Maximal formula atoms : 256 ( 10 avg)
% Number of connectives : 478 ( 112 ~; 247 |; 99 &)
% ( 6 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 77 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-4 aty)
% Number of variables : 127 ( 17 sgn 74 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(upper_bound,axiom,
! [X6,X4,X8] :
( upper_bound(X8,X6,X4)
<=> ! [X3] :
( member(X3,X4)
=> apply(X6,X3,X8) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',upper_bound) ).
fof(least_upper_bound,axiom,
! [X1,X3,X6,X4] :
( least_upper_bound(X1,X3,X6,X4)
<=> ( member(X1,X3)
& upper_bound(X1,X6,X3)
& ! [X8] :
( ( member(X8,X4)
& upper_bound(X8,X6,X3) )
=> apply(X6,X1,X8) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',least_upper_bound) ).
fof(unordered_pair,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( X3 = X1
| X3 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',unordered_pair) ).
fof(thIV7,conjecture,
! [X6,X4,X1,X2] :
( ( order(X6,X4)
& member(X1,X4)
& member(X2,X4)
& apply(X6,X1,X2) )
=> least_upper_bound(X2,unordered_pair(X1,X2),X6,X4) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thIV7) ).
fof(order,axiom,
! [X6,X4] :
( order(X6,X4)
<=> ( ! [X3] :
( member(X3,X4)
=> apply(X6,X3,X3) )
& ! [X3,X5] :
( ( member(X3,X4)
& member(X5,X4) )
=> ( ( apply(X6,X3,X5)
& apply(X6,X5,X3) )
=> X3 = X5 ) )
& ! [X3,X5,X7] :
( ( member(X3,X4)
& member(X5,X4)
& member(X7,X4) )
=> ( ( apply(X6,X3,X5)
& apply(X6,X5,X7) )
=> apply(X6,X3,X7) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',order) ).
fof(c_0_5,plain,
! [X9,X10,X11,X12,X9,X10,X11] :
( ( ~ upper_bound(X11,X9,X10)
| ~ member(X12,X10)
| apply(X9,X12,X11) )
& ( member(esk6_3(X9,X10,X11),X10)
| upper_bound(X11,X9,X10) )
& ( ~ apply(X9,esk6_3(X9,X10,X11),X11)
| upper_bound(X11,X9,X10) ) ),
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)],[upper_bound])])])])])])]) ).
fof(c_0_6,plain,
! [X9,X10,X11,X12,X13,X9,X10,X11,X12] :
( ( member(X9,X10)
| ~ least_upper_bound(X9,X10,X11,X12) )
& ( upper_bound(X9,X11,X10)
| ~ least_upper_bound(X9,X10,X11,X12) )
& ( ~ member(X13,X12)
| ~ upper_bound(X13,X11,X10)
| apply(X11,X9,X13)
| ~ least_upper_bound(X9,X10,X11,X12) )
& ( member(esk5_4(X9,X10,X11,X12),X12)
| ~ member(X9,X10)
| ~ upper_bound(X9,X11,X10)
| least_upper_bound(X9,X10,X11,X12) )
& ( upper_bound(esk5_4(X9,X10,X11,X12),X11,X10)
| ~ member(X9,X10)
| ~ upper_bound(X9,X11,X10)
| least_upper_bound(X9,X10,X11,X12) )
& ( ~ apply(X11,X9,esk5_4(X9,X10,X11,X12))
| ~ member(X9,X10)
| ~ upper_bound(X9,X11,X10)
| least_upper_bound(X9,X10,X11,X12) ) ),
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)],[least_upper_bound])])])])])])]) ).
fof(c_0_7,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( ~ member(X4,unordered_pair(X5,X6))
| X4 = X5
| X4 = X6 )
& ( X4 != X5
| member(X4,unordered_pair(X5,X6)) )
& ( X4 != X6
| member(X4,unordered_pair(X5,X6)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair])])])])]) ).
fof(c_0_8,plain,
! [X4,X6] :
( epred1_2(X6,X4)
<=> ( ! [X3] :
( member(X3,X4)
=> apply(X6,X3,X3) )
& ! [X3,X5] :
( ( member(X3,X4)
& member(X5,X4) )
=> ( ( apply(X6,X3,X5)
& apply(X6,X5,X3) )
=> X3 = X5 ) )
& ! [X3,X5,X7] :
( ( member(X3,X4)
& member(X5,X4)
& member(X7,X4) )
=> ( ( apply(X6,X3,X5)
& apply(X6,X5,X7) )
=> apply(X6,X3,X7) ) ) ) ),
introduced(definition) ).
fof(c_0_9,negated_conjecture,
~ ! [X6,X4,X1,X2] :
( ( order(X6,X4)
& member(X1,X4)
& member(X2,X4)
& apply(X6,X1,X2) )
=> least_upper_bound(X2,unordered_pair(X1,X2),X6,X4) ),
inference(assume_negation,[status(cth)],[thIV7]) ).
cnf(c_0_10,plain,
( apply(X1,X2,X3)
| ~ member(X2,X4)
| ~ upper_bound(X3,X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( least_upper_bound(X1,X2,X3,X4)
| upper_bound(esk5_4(X1,X2,X3,X4),X3,X2)
| ~ upper_bound(X1,X3,X2)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( upper_bound(X1,X2,X3)
| member(esk6_3(X2,X3,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_14,axiom,
! [X6,X4] :
( order(X6,X4)
<=> epred1_2(X6,X4) ),
inference(apply_def,[status(thm)],[order,c_0_8]) ).
fof(c_0_15,negated_conjecture,
( order(esk1_0,esk2_0)
& member(esk3_0,esk2_0)
& member(esk4_0,esk2_0)
& apply(esk1_0,esk3_0,esk4_0)
& ~ least_upper_bound(esk4_0,unordered_pair(esk3_0,esk4_0),esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_16,plain,
( least_upper_bound(X1,X2,X3,X4)
| ~ upper_bound(X1,X3,X2)
| ~ member(X1,X2)
| ~ apply(X3,X1,esk5_4(X1,X2,X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,plain,
( least_upper_bound(X1,X2,X3,X4)
| apply(X3,X5,esk5_4(X1,X2,X3,X4))
| ~ upper_bound(X1,X3,X2)
| ~ member(X5,X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,plain,
( upper_bound(X1,X2,X3)
| ~ apply(X2,esk6_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,plain,
( esk6_3(X1,unordered_pair(X2,X3),X4) = X2
| esk6_3(X1,unordered_pair(X2,X3),X4) = X3
| upper_bound(X4,X1,unordered_pair(X2,X3)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_21,plain,
! [X7,X8,X7,X8] :
( ( ~ order(X7,X8)
| epred1_2(X7,X8) )
& ( ~ epred1_2(X7,X8)
| order(X7,X8) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
cnf(c_0_22,negated_conjecture,
~ least_upper_bound(esk4_0,unordered_pair(esk3_0,esk4_0),esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( least_upper_bound(X1,X2,X3,X4)
| ~ upper_bound(X1,X3,X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
member(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( esk6_3(X1,unordered_pair(X2,X3),X4) = X2
| upper_bound(X4,X1,unordered_pair(X2,X3))
| ~ apply(X1,X3,X4) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_26,plain,
! [X8,X9,X10,X11,X12,X13,X14,X15,X8,X9] :
( ( ~ member(X10,X8)
| apply(X9,X10,X10)
| ~ epred1_2(X9,X8) )
& ( ~ member(X11,X8)
| ~ member(X12,X8)
| ~ apply(X9,X11,X12)
| ~ apply(X9,X12,X11)
| X11 = X12
| ~ epred1_2(X9,X8) )
& ( ~ member(X13,X8)
| ~ member(X14,X8)
| ~ member(X15,X8)
| ~ apply(X9,X13,X14)
| ~ apply(X9,X14,X15)
| apply(X9,X13,X15)
| ~ epred1_2(X9,X8) )
& ( member(esk10_2(X8,X9),X8)
| member(esk8_2(X8,X9),X8)
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( member(esk11_2(X8,X9),X8)
| member(esk8_2(X8,X9),X8)
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( member(esk12_2(X8,X9),X8)
| member(esk8_2(X8,X9),X8)
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( apply(X9,esk10_2(X8,X9),esk11_2(X8,X9))
| member(esk8_2(X8,X9),X8)
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))
| member(esk8_2(X8,X9),X8)
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( ~ apply(X9,esk10_2(X8,X9),esk12_2(X8,X9))
| member(esk8_2(X8,X9),X8)
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( member(esk10_2(X8,X9),X8)
| member(esk9_2(X8,X9),X8)
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( member(esk11_2(X8,X9),X8)
| member(esk9_2(X8,X9),X8)
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( member(esk12_2(X8,X9),X8)
| member(esk9_2(X8,X9),X8)
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( apply(X9,esk10_2(X8,X9),esk11_2(X8,X9))
| member(esk9_2(X8,X9),X8)
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))
| member(esk9_2(X8,X9),X8)
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( ~ apply(X9,esk10_2(X8,X9),esk12_2(X8,X9))
| member(esk9_2(X8,X9),X8)
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( member(esk10_2(X8,X9),X8)
| apply(X9,esk8_2(X8,X9),esk9_2(X8,X9))
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( member(esk11_2(X8,X9),X8)
| apply(X9,esk8_2(X8,X9),esk9_2(X8,X9))
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( member(esk12_2(X8,X9),X8)
| apply(X9,esk8_2(X8,X9),esk9_2(X8,X9))
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( apply(X9,esk10_2(X8,X9),esk11_2(X8,X9))
| apply(X9,esk8_2(X8,X9),esk9_2(X8,X9))
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))
| apply(X9,esk8_2(X8,X9),esk9_2(X8,X9))
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( ~ apply(X9,esk10_2(X8,X9),esk12_2(X8,X9))
| apply(X9,esk8_2(X8,X9),esk9_2(X8,X9))
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( member(esk10_2(X8,X9),X8)
| apply(X9,esk9_2(X8,X9),esk8_2(X8,X9))
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( member(esk11_2(X8,X9),X8)
| apply(X9,esk9_2(X8,X9),esk8_2(X8,X9))
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( member(esk12_2(X8,X9),X8)
| apply(X9,esk9_2(X8,X9),esk8_2(X8,X9))
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( apply(X9,esk10_2(X8,X9),esk11_2(X8,X9))
| apply(X9,esk9_2(X8,X9),esk8_2(X8,X9))
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))
| apply(X9,esk9_2(X8,X9),esk8_2(X8,X9))
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( ~ apply(X9,esk10_2(X8,X9),esk12_2(X8,X9))
| apply(X9,esk9_2(X8,X9),esk8_2(X8,X9))
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( member(esk10_2(X8,X9),X8)
| esk8_2(X8,X9) != esk9_2(X8,X9)
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( member(esk11_2(X8,X9),X8)
| esk8_2(X8,X9) != esk9_2(X8,X9)
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( member(esk12_2(X8,X9),X8)
| esk8_2(X8,X9) != esk9_2(X8,X9)
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( apply(X9,esk10_2(X8,X9),esk11_2(X8,X9))
| esk8_2(X8,X9) != esk9_2(X8,X9)
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))
| esk8_2(X8,X9) != esk9_2(X8,X9)
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( ~ apply(X9,esk10_2(X8,X9),esk12_2(X8,X9))
| esk8_2(X8,X9) != esk9_2(X8,X9)
| member(esk7_2(X8,X9),X8)
| epred1_2(X9,X8) )
& ( member(esk10_2(X8,X9),X8)
| member(esk8_2(X8,X9),X8)
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( member(esk11_2(X8,X9),X8)
| member(esk8_2(X8,X9),X8)
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( member(esk12_2(X8,X9),X8)
| member(esk8_2(X8,X9),X8)
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( apply(X9,esk10_2(X8,X9),esk11_2(X8,X9))
| member(esk8_2(X8,X9),X8)
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))
| member(esk8_2(X8,X9),X8)
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( ~ apply(X9,esk10_2(X8,X9),esk12_2(X8,X9))
| member(esk8_2(X8,X9),X8)
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( member(esk10_2(X8,X9),X8)
| member(esk9_2(X8,X9),X8)
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( member(esk11_2(X8,X9),X8)
| member(esk9_2(X8,X9),X8)
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( member(esk12_2(X8,X9),X8)
| member(esk9_2(X8,X9),X8)
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( apply(X9,esk10_2(X8,X9),esk11_2(X8,X9))
| member(esk9_2(X8,X9),X8)
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))
| member(esk9_2(X8,X9),X8)
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( ~ apply(X9,esk10_2(X8,X9),esk12_2(X8,X9))
| member(esk9_2(X8,X9),X8)
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( member(esk10_2(X8,X9),X8)
| apply(X9,esk8_2(X8,X9),esk9_2(X8,X9))
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( member(esk11_2(X8,X9),X8)
| apply(X9,esk8_2(X8,X9),esk9_2(X8,X9))
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( member(esk12_2(X8,X9),X8)
| apply(X9,esk8_2(X8,X9),esk9_2(X8,X9))
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( apply(X9,esk10_2(X8,X9),esk11_2(X8,X9))
| apply(X9,esk8_2(X8,X9),esk9_2(X8,X9))
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))
| apply(X9,esk8_2(X8,X9),esk9_2(X8,X9))
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( ~ apply(X9,esk10_2(X8,X9),esk12_2(X8,X9))
| apply(X9,esk8_2(X8,X9),esk9_2(X8,X9))
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( member(esk10_2(X8,X9),X8)
| apply(X9,esk9_2(X8,X9),esk8_2(X8,X9))
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( member(esk11_2(X8,X9),X8)
| apply(X9,esk9_2(X8,X9),esk8_2(X8,X9))
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( member(esk12_2(X8,X9),X8)
| apply(X9,esk9_2(X8,X9),esk8_2(X8,X9))
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( apply(X9,esk10_2(X8,X9),esk11_2(X8,X9))
| apply(X9,esk9_2(X8,X9),esk8_2(X8,X9))
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))
| apply(X9,esk9_2(X8,X9),esk8_2(X8,X9))
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( ~ apply(X9,esk10_2(X8,X9),esk12_2(X8,X9))
| apply(X9,esk9_2(X8,X9),esk8_2(X8,X9))
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( member(esk10_2(X8,X9),X8)
| esk8_2(X8,X9) != esk9_2(X8,X9)
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( member(esk11_2(X8,X9),X8)
| esk8_2(X8,X9) != esk9_2(X8,X9)
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( member(esk12_2(X8,X9),X8)
| esk8_2(X8,X9) != esk9_2(X8,X9)
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( apply(X9,esk10_2(X8,X9),esk11_2(X8,X9))
| esk8_2(X8,X9) != esk9_2(X8,X9)
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))
| esk8_2(X8,X9) != esk9_2(X8,X9)
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,X8) )
& ( ~ apply(X9,esk10_2(X8,X9),esk12_2(X8,X9))
| esk8_2(X8,X9) != esk9_2(X8,X9)
| ~ apply(X9,esk7_2(X8,X9),esk7_2(X8,X9))
| epred1_2(X9,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)],[c_0_8])])])])])])]) ).
cnf(c_0_27,plain,
( epred1_2(X1,X2)
| ~ order(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,negated_conjecture,
order(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_29,negated_conjecture,
~ upper_bound(esk4_0,esk1_0,unordered_pair(esk3_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_30,plain,
( upper_bound(X1,X2,unordered_pair(X3,X4))
| ~ apply(X2,X3,X1)
| ~ apply(X2,X4,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
apply(esk1_0,esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_32,plain,
( apply(X1,X3,X3)
| ~ epred1_2(X1,X2)
| ~ member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,negated_conjecture,
epred1_2(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
~ apply(esk1_0,esk4_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_35,plain,
( apply(esk1_0,X1,X1)
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
member(esk4_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_37,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET795+4 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.11/0.33 % Computer : n007.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sun Jul 10 05:24:16 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.018 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 38
% 0.22/1.40 # Proof object clause steps : 24
% 0.22/1.40 # Proof object formula steps : 14
% 0.22/1.40 # Proof object conjectures : 10
% 0.22/1.40 # Proof object clause conjectures : 7
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 13
% 0.22/1.40 # Proof object initial formulas used : 5
% 0.22/1.40 # Proof object generating inferences : 10
% 0.22/1.40 # Proof object simplifying inferences : 7
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 22
% 0.22/1.40 # Removed by relevancy pruning/SinE : 17
% 0.22/1.40 # Initial clauses : 82
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 82
% 0.22/1.40 # Processed clauses : 153
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 24
% 0.22/1.40 # ...remaining for further processing : 129
% 0.22/1.40 # Other redundant clauses eliminated : 16
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 6
% 0.22/1.40 # Backward-rewritten : 0
% 0.22/1.40 # Generated clauses : 761
% 0.22/1.40 # ...of the previous two non-trivial : 600
% 0.22/1.40 # Contextual simplify-reflections : 21
% 0.22/1.40 # Paramodulations : 731
% 0.22/1.40 # Factorizations : 14
% 0.22/1.40 # Equation resolutions : 16
% 0.22/1.40 # Current number of processed clauses : 121
% 0.22/1.40 # Positive orientable unit clauses : 7
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 3
% 0.22/1.40 # Non-unit-clauses : 111
% 0.22/1.40 # Current number of unprocessed clauses: 512
% 0.22/1.40 # ...number of literals in the above : 3278
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 6
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 2863
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 1071
% 0.22/1.40 # Non-unit clause-clause subsumptions : 51
% 0.22/1.40 # Unit Clause-clause subsumption calls : 64
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 3
% 0.22/1.40 # BW rewrite match successes : 0
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 25580
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.042 s
% 0.22/1.40 # System time : 0.005 s
% 0.22/1.40 # Total time : 0.047 s
% 0.22/1.40 # Maximum resident set size: 3692 pages
% 0.22/23.40 eprover: CPU time limit exceeded, terminating
% 0.22/23.40 eprover: CPU time limit exceeded, terminating
% 0.22/23.41 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.41 eprover: No such file or directory
% 0.22/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.42 eprover: No such file or directory
% 0.22/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.42 eprover: No such file or directory
% 0.22/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.42 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------