TSTP Solution File: SWV396+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV396+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.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 : Wed Jul 20 18:16:27 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 16
% Syntax : Number of formulae : 82 ( 21 unt; 0 def)
% Number of atoms : 213 ( 68 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 200 ( 69 ~; 88 |; 25 &)
% ( 6 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 10 ( 7 usr; 4 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-3 aty)
% Number of variables : 208 ( 36 sgn 127 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l32_co,conjecture,
! [X1] :
( ! [X2,X3,X4,X5] :
( ( pair_in_list(X1,X4,X5)
& strictly_less_than(X4,X5)
& ok(remove_cpq(triple(X2,X1,X3),X4)) )
=> pair_in_list(remove_slb(X1,X4),X4,X5) )
=> ! [X6,X7,X8,X9,X10,X11] :
( ( pair_in_list(insert_slb(X1,pair(X10,X11)),X8,X9)
& strictly_less_than(X8,X9)
& ok(remove_cpq(triple(X6,insert_slb(X1,pair(X10,X11)),X7),X8)) )
=> pair_in_list(remove_slb(insert_slb(X1,pair(X10,X11)),X8),X8,X9) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l32_co) ).
fof(ax45,axiom,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& strictly_less_than(X4,lookup_slb(X2,X4)) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax45) ).
fof(ax43,axiom,
! [X1,X2,X3,X4] :
( ~ contains_slb(X2,X4)
=> remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax43) ).
fof(ax40,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax40) ).
fof(ax21,axiom,
! [X1,X2,X3,X4] :
( contains_slb(insert_slb(X1,pair(X2,X4)),X3)
<=> ( contains_slb(X1,X3)
| X2 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax21) ).
fof(ax27,axiom,
! [X1,X2,X3,X4] :
( ( X2 != X3
& contains_slb(X1,X3) )
=> lookup_slb(insert_slb(X1,pair(X2,X4)),X3) = lookup_slb(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax27) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(ax41,axiom,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax41) ).
fof(ax44,axiom,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& less_than(lookup_slb(X2,X4),X4) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax44) ).
fof(ax24,axiom,
! [X1,X2,X3] : remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax24) ).
fof(ax23,axiom,
! [X1,X2,X3,X4,X5] :
( pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5)
<=> ( pair_in_list(X1,X3,X5)
| ( X2 = X3
& X4 = X5 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax23) ).
fof(ax26,axiom,
! [X1,X2,X3] : lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax26) ).
fof(ax25,axiom,
! [X1,X2,X3,X4] :
( ( X2 != X3
& contains_slb(X1,X3) )
=> remove_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(remove_slb(X1,X3),pair(X2,X4)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax25) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ! [X2,X3,X4,X5] :
( ( pair_in_list(X1,X4,X5)
& strictly_less_than(X4,X5)
& ok(remove_cpq(triple(X2,X1,X3),X4)) )
=> pair_in_list(remove_slb(X1,X4),X4,X5) )
=> ! [X6,X7,X8,X9,X10,X11] :
( ( pair_in_list(insert_slb(X1,pair(X10,X11)),X8,X9)
& strictly_less_than(X8,X9)
& ok(remove_cpq(triple(X6,insert_slb(X1,pair(X10,X11)),X7),X8)) )
=> pair_in_list(remove_slb(insert_slb(X1,pair(X10,X11)),X8),X8,X9) ) ),
inference(assume_negation,[status(cth)],[l32_co]) ).
fof(c_0_15,plain,
! [X5,X6,X7,X8] :
( ~ contains_slb(X6,X8)
| ~ strictly_less_than(X8,lookup_slb(X6,X8))
| remove_cpq(triple(X5,X6,X7),X8) = triple(remove_pqp(X5,X8),remove_slb(X6,X8),bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])]) ).
fof(c_0_16,negated_conjecture,
! [X13,X14,X15,X16] :
( ( ~ pair_in_list(esk1_0,X15,X16)
| ~ strictly_less_than(X15,X16)
| ~ ok(remove_cpq(triple(X13,esk1_0,X14),X15))
| pair_in_list(remove_slb(esk1_0,X15),X15,X16) )
& pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0,esk5_0)
& strictly_less_than(esk4_0,esk5_0)
& ok(remove_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk3_0),esk4_0))
& ~ pair_in_list(remove_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),esk4_0,esk5_0) ),
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_14])])])])])]) ).
fof(c_0_17,plain,
! [X5,X6,X7,X8] :
( contains_slb(X6,X8)
| remove_cpq(triple(X5,X6,X7),X8) = triple(X5,X6,bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax43])])]) ).
fof(c_0_18,plain,
! [X3,X4] : ~ ok(triple(X3,X4,bad)),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[ax40])]) ).
cnf(c_0_19,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)
| ~ strictly_less_than(X4,lookup_slb(X2,X4))
| ~ contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
ok(remove_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk3_0),esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad)
| contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
~ ok(triple(X1,X2,bad)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( remove_cpq(triple(X1,X2,X3),X4) = remove_cpq(triple(X1,X2,X5),X4)
| ~ contains_slb(X2,X4)
| ~ strictly_less_than(X4,lookup_slb(X2,X4)) ),
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
contains_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
fof(c_0_25,plain,
! [X5,X6,X7,X8,X5,X6,X7,X8] :
( ( ~ contains_slb(insert_slb(X5,pair(X6,X8)),X7)
| contains_slb(X5,X7)
| X6 = X7 )
& ( ~ contains_slb(X5,X7)
| contains_slb(insert_slb(X5,pair(X6,X8)),X7) )
& ( X6 != X7
| contains_slb(insert_slb(X5,pair(X6,X8)),X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])])])]) ).
cnf(c_0_26,negated_conjecture,
( remove_cpq(triple(X1,insert_slb(esk1_0,pair(esk6_0,esk7_0)),X2),esk4_0) = remove_cpq(triple(X1,insert_slb(esk1_0,pair(esk6_0,esk7_0)),X3),esk4_0)
| ~ strictly_less_than(esk4_0,lookup_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_27,plain,
! [X5,X6,X7,X8] :
( X6 = X7
| ~ contains_slb(X5,X7)
| lookup_slb(insert_slb(X5,pair(X6,X8)),X7) = lookup_slb(X5,X7) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
cnf(c_0_28,plain,
( X1 = X2
| contains_slb(X3,X2)
| ~ contains_slb(insert_slb(X3,pair(X1,X4)),X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( ok(remove_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),X1),esk4_0))
| ~ strictly_less_than(esk4_0,lookup_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0)) ),
inference(spm,[status(thm)],[c_0_20,c_0_26]) ).
cnf(c_0_30,plain,
( lookup_slb(insert_slb(X1,pair(X2,X3)),X4) = lookup_slb(X1,X4)
| X2 = X4
| ~ contains_slb(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( esk6_0 = esk4_0
| contains_slb(esk1_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_24]) ).
fof(c_0_32,plain,
! [X3,X4,X3,X4] :
( ( less_than(X3,X4)
| ~ strictly_less_than(X3,X4) )
& ( ~ less_than(X4,X3)
| ~ strictly_less_than(X3,X4) )
& ( ~ less_than(X3,X4)
| less_than(X4,X3)
| strictly_less_than(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[stricly_smaller_definition])])])])])]) ).
fof(c_0_33,plain,
! [X3,X4] :
( less_than(X3,X4)
| less_than(X4,X3) ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(c_0_34,plain,
( ~ epred1_0
<=> ! [X3] :
( X3 = bad
| esk6_0 = esk4_0 ) ),
introduced(definition) ).
fof(c_0_35,plain,
! [X4,X5,X6] :
( ok(triple(X4,X5,X6))
| X6 = bad ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax41])])]) ).
fof(c_0_36,plain,
! [X5,X6,X7,X8] :
( ~ contains_slb(X6,X8)
| ~ less_than(lookup_slb(X6,X8),X8)
| remove_cpq(triple(X5,X6,X7),X8) = triple(remove_pqp(X5,X8),remove_slb(X6,X8),X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax44])]) ).
cnf(c_0_37,negated_conjecture,
~ strictly_less_than(esk4_0,lookup_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_19]),c_0_24])]),c_0_22]) ).
cnf(c_0_38,negated_conjecture,
( lookup_slb(insert_slb(esk1_0,pair(X1,X2)),esk4_0) = lookup_slb(esk1_0,esk4_0)
| esk6_0 = esk4_0
| X1 = esk4_0 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,negated_conjecture,
( esk6_0 = esk4_0
| X1 = bad
| epred1_0 ),
inference(split_equiv,[status(thm)],[c_0_34]) ).
fof(c_0_42,plain,
! [X4,X5,X6] : remove_slb(insert_slb(X4,pair(X5,X6)),X5) = X4,
inference(variable_rename,[status(thm)],[ax24]) ).
fof(c_0_43,plain,
! [X6,X7,X8,X9,X10,X6,X7,X8,X9,X10] :
( ( X7 = X8
| pair_in_list(X6,X8,X10)
| ~ pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
& ( X9 = X10
| pair_in_list(X6,X8,X10)
| ~ pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
& ( ~ pair_in_list(X6,X8,X10)
| pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
& ( X7 != X8
| X9 != X10
| pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])])])]) ).
cnf(c_0_44,plain,
( X1 = bad
| ok(triple(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_45,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3)
| ~ less_than(lookup_slb(X2,X4),X4)
| ~ contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_46,negated_conjecture,
( esk6_0 = esk4_0
| ~ strictly_less_than(esk4_0,lookup_slb(esk1_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_47,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_39,c_0_40]) ).
fof(c_0_48,plain,
! [X4,X5,X6] : lookup_slb(insert_slb(X4,pair(X5,X6)),X5) = X6,
inference(variable_rename,[status(thm)],[ax26]) ).
cnf(c_0_49,negated_conjecture,
~ pair_in_list(remove_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_50,negated_conjecture,
( esk6_0 = esk4_0
| epred1_0 ),
inference(csr,[status(thm)],[inference(ef,[status(thm)],[c_0_41]),c_0_41]) ).
cnf(c_0_51,plain,
remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_52,plain,
( pair_in_list(X1,X4,X5)
| X3 = X5
| ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_53,negated_conjecture,
pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_54,plain,
! [X5,X6,X7,X8] :
( X6 = X7
| ~ contains_slb(X5,X7)
| remove_slb(insert_slb(X5,pair(X6,X8)),X7) = insert_slb(remove_slb(X5,X7),pair(X6,X8)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax25])])])]) ).
cnf(c_0_55,plain,
( X1 = bad
| ok(remove_cpq(triple(X2,X3,X1),X4))
| ~ contains_slb(X3,X4)
| ~ less_than(lookup_slb(X3,X4),X4) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_56,negated_conjecture,
( esk6_0 = esk4_0
| less_than(lookup_slb(esk1_0,esk4_0),esk4_0) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_57,plain,
lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_58,negated_conjecture,
( epred1_0
| ~ pair_in_list(esk1_0,esk4_0,esk5_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_59,negated_conjecture,
( esk7_0 = esk5_0
| pair_in_list(esk1_0,esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
( remove_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(remove_slb(X1,X4),pair(X2,X3))
| X2 = X4
| ~ contains_slb(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
fof(c_0_61,plain,
( ~ epred2_0
<=> ! [X1] :
( pair_in_list(remove_slb(esk1_0,esk4_0),esk4_0,X1)
| ~ strictly_less_than(esk4_0,X1)
| ~ pair_in_list(esk1_0,esk4_0,X1) ) ),
introduced(definition) ).
cnf(c_0_62,negated_conjecture,
( pair_in_list(remove_slb(esk1_0,X1),X1,X2)
| ~ ok(remove_cpq(triple(X3,esk1_0,X4),X1))
| ~ strictly_less_than(X1,X2)
| ~ pair_in_list(esk1_0,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_63,negated_conjecture,
( esk6_0 = esk4_0
| X1 = bad
| ok(remove_cpq(triple(X2,esk1_0,X1),esk4_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_31]),c_0_56]) ).
cnf(c_0_64,negated_conjecture,
( epred1_0
| ~ strictly_less_than(esk4_0,esk7_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_50]),c_0_57]) ).
cnf(c_0_65,negated_conjecture,
( esk7_0 = esk5_0
| epred1_0 ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_66,negated_conjecture,
strictly_less_than(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_67,negated_conjecture,
( remove_slb(insert_slb(esk1_0,pair(X1,X2)),esk4_0) = insert_slb(remove_slb(esk1_0,esk4_0),pair(X1,X2))
| esk6_0 = esk4_0
| X1 = esk4_0 ),
inference(spm,[status(thm)],[c_0_60,c_0_31]) ).
cnf(c_0_68,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_34]),c_0_61]) ).
cnf(c_0_69,negated_conjecture,
epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66])]) ).
cnf(c_0_70,negated_conjecture,
( esk6_0 = esk4_0
| ~ pair_in_list(insert_slb(remove_slb(esk1_0,esk4_0),pair(esk6_0,esk7_0)),esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_49,c_0_67]) ).
cnf(c_0_71,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| ~ pair_in_list(X1,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_72,negated_conjecture,
~ epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]) ).
cnf(c_0_73,plain,
( pair_in_list(X1,X4,X5)
| X2 = X4
| ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_74,negated_conjecture,
( esk6_0 = esk4_0
| ~ pair_in_list(remove_slb(esk1_0,esk4_0),esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_75,negated_conjecture,
( pair_in_list(remove_slb(esk1_0,esk4_0),esk4_0,X1)
| ~ pair_in_list(esk1_0,esk4_0,X1)
| ~ strictly_less_than(esk4_0,X1) ),
inference(sr,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_61]),c_0_72]) ).
cnf(c_0_76,negated_conjecture,
( esk6_0 = esk4_0
| pair_in_list(esk1_0,esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_73,c_0_53]) ).
cnf(c_0_77,negated_conjecture,
esk6_0 = esk4_0,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_66])]),c_0_76]) ).
cnf(c_0_78,negated_conjecture,
~ pair_in_list(esk1_0,esk4_0,esk5_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_77]),c_0_51]) ).
cnf(c_0_79,negated_conjecture,
~ strictly_less_than(esk4_0,esk7_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_77]),c_0_57]) ).
cnf(c_0_80,negated_conjecture,
esk7_0 = esk5_0,
inference(sr,[status(thm)],[c_0_59,c_0_78]) ).
cnf(c_0_81,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80]),c_0_66])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV396+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jun 15 15:39:54 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.25/1.43 # Preprocessing time : 0.017 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 82
% 0.25/1.43 # Proof object clause steps : 51
% 0.25/1.43 # Proof object formula steps : 31
% 0.25/1.43 # Proof object conjectures : 36
% 0.25/1.43 # Proof object clause conjectures : 33
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 21
% 0.25/1.43 # Proof object initial formulas used : 14
% 0.25/1.43 # Proof object generating inferences : 23
% 0.25/1.43 # Proof object simplifying inferences : 27
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 42
% 0.25/1.43 # Removed by relevancy pruning/SinE : 0
% 0.25/1.43 # Initial clauses : 55
% 0.25/1.43 # Removed in clause preprocessing : 2
% 0.25/1.43 # Initial clauses in saturation : 53
% 0.25/1.43 # Processed clauses : 1139
% 0.25/1.43 # ...of these trivial : 39
% 0.25/1.43 # ...subsumed : 606
% 0.25/1.43 # ...remaining for further processing : 494
% 0.25/1.43 # Other redundant clauses eliminated : 3
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 13
% 0.25/1.43 # Backward-rewritten : 45
% 0.25/1.43 # Generated clauses : 17130
% 0.25/1.43 # ...of the previous two non-trivial : 15084
% 0.25/1.43 # Contextual simplify-reflections : 47
% 0.25/1.43 # Paramodulations : 17099
% 0.25/1.43 # Factorizations : 21
% 0.25/1.43 # Equation resolutions : 7
% 0.25/1.43 # Current number of processed clauses : 432
% 0.25/1.43 # Positive orientable unit clauses : 124
% 0.25/1.43 # Positive unorientable unit clauses: 14
% 0.25/1.43 # Negative unit clauses : 53
% 0.25/1.43 # Non-unit-clauses : 241
% 0.25/1.43 # Current number of unprocessed clauses: 10032
% 0.25/1.43 # ...number of literals in the above : 41822
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 61
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 9341
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 4290
% 0.25/1.43 # Non-unit clause-clause subsumptions : 161
% 0.25/1.43 # Unit Clause-clause subsumption calls : 4324
% 0.25/1.43 # Rewrite failures with RHS unbound : 152
% 0.25/1.43 # BW rewrite match attempts : 1253
% 0.25/1.43 # BW rewrite match successes : 48
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 549955
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.295 s
% 0.25/1.43 # System time : 0.012 s
% 0.25/1.43 # Total time : 0.307 s
% 0.25/1.43 # Maximum resident set size: 17828 pages
% 0.25/23.41 eprover: CPU time limit exceeded, terminating
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.43 eprover: CPU time limit exceeded, terminating
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.50 eprover: No such file or directory
% 0.25/23.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.51 eprover: No such file or directory
%------------------------------------------------------------------------------