%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV396+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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 02:54:38 PM UTC 2026
% Result : Theorem 0.12s 0.48s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 14
% Syntax : Number of formulae : 79 ( 18 unt; 0 def)
% Number of atoms : 213 ( 72 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 202 ( 68 ~; 84 |; 29 &)
% ( 5 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 5 usr; 2 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-3 aty)
% Number of variables : 211 ( 26 sgn 131 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l32_co,conjecture,
! [X1] :
( ! [X2,X3,X4,X5] :
( ( ok(remove_cpq(triple(X2,X1,X3),X4))
& strictly_less_than(X4,X5)
& pair_in_list(X1,X4,X5) )
=> pair_in_list(remove_slb(X1,X4),X4,X5) )
=> ! [X6,X7,X8,X9,X10,X11] :
( ( ok(remove_cpq(triple(X6,insert_slb(X1,pair(X10,X11)),X7),X8))
& strictly_less_than(X8,X9)
& pair_in_list(insert_slb(X1,pair(X10,X11)),X8,X9) )
=> pair_in_list(remove_slb(insert_slb(X1,pair(X10,X11)),X8),X8,X9) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l32_co) ).
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/sandbox/benchmark/Axioms/SWV007+3.ax',ax43) ).
fof(ax40,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax40) ).
fof(ax45,axiom,
! [X1,X2,X3,X4] :
( ( strictly_less_than(X4,lookup_slb(X2,X4))
& contains_slb(X2,X4) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax45) ).
fof(ax27,axiom,
! [X1,X2,X3,X4] :
( ( contains_slb(X1,X3)
& X2 != X3 )
=> lookup_slb(insert_slb(X1,pair(X2,X4)),X3) = lookup_slb(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax27) ).
fof(ax21,axiom,
! [X1,X2,X3,X4] :
( contains_slb(insert_slb(X1,pair(X2,X4)),X3)
<=> ( X2 = X3
| contains_slb(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax21) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( ~ less_than(X2,X1)
& less_than(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(ax41,axiom,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax41) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X2,X1)
| less_than(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(ax25,axiom,
! [X1,X2,X3,X4] :
( ( contains_slb(X1,X3)
& X2 != X3 )
=> remove_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(remove_slb(X1,X3),pair(X2,X4)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax25) ).
fof(ax44,axiom,
! [X1,X2,X3,X4] :
( ( less_than(lookup_slb(X2,X4),X4)
& contains_slb(X2,X4) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax44) ).
fof(ax23,axiom,
! [X1,X2,X3,X4,X5] :
( pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5)
<=> ( ( X4 = X5
& X2 = X3 )
| pair_in_list(X1,X3,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax23) ).
fof(ax24,axiom,
! [X1,X2,X3] : remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax24) ).
fof(ax26,axiom,
! [X1,X2,X3] : lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax26) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ! [X2,X3,X4,X5] :
( ( ok(remove_cpq(triple(X2,X1,X3),X4))
& strictly_less_than(X4,X5)
& pair_in_list(X1,X4,X5) )
=> pair_in_list(remove_slb(X1,X4),X4,X5) )
=> ! [X6,X7,X8,X9,X10,X11] :
( ( ok(remove_cpq(triple(X6,insert_slb(X1,pair(X10,X11)),X7),X8))
& strictly_less_than(X8,X9)
& pair_in_list(insert_slb(X1,pair(X10,X11)),X8,X9) )
=> 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,
! [X1,X2,X3,X4] :
( ~ contains_slb(X2,X4)
=> remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
inference(fof_simplification,[status(thm)],[ax43]) ).
fof(c_0_16,plain,
! [X86,X87] :
( ( ok(triple(X86,X87,bad))
| $true )
& ( ~ $true
| ~ ok(triple(X86,X87,bad)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax40])])]) ).
fof(c_0_17,negated_conjecture,
! [X126,X127,X128,X129] :
( ~ pair_in_list(remove_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),esk4_0,esk5_0)
& ok(remove_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk3_0),esk4_0))
& strictly_less_than(esk4_0,esk5_0)
& pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0,esk5_0)
& ( pair_in_list(remove_slb(esk1_0,X128),X128,X129)
| ~ ok(remove_cpq(triple(X126,esk1_0,X127),X128))
| ~ strictly_less_than(X128,X129)
| ~ pair_in_list(esk1_0,X128,X129) ) ),
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_14])])])])]) ).
fof(c_0_18,plain,
! [X95,X96,X97,X98] :
( remove_cpq(triple(X95,X96,X97),X98) = triple(X95,X96,bad)
| contains_slb(X96,X98) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])]) ).
cnf(c_0_19,plain,
( $false
| ~ ok(triple(X1,X2,bad)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X103,X104,X105,X106] :
( remove_cpq(triple(X103,X104,X105),X106) = triple(remove_pqp(X103,X106),remove_slb(X104,X106),bad)
| ~ strictly_less_than(X106,lookup_slb(X104,X106))
| ~ contains_slb(X104,X106) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])])]) ).
fof(c_0_21,plain,
! [X1,X2,X3,X4] :
( ( contains_slb(X1,X3)
& X2 != X3 )
=> lookup_slb(insert_slb(X1,pair(X2,X4)),X3) = lookup_slb(X1,X3) ),
inference(fof_simplification,[status(thm)],[ax27]) ).
fof(c_0_22,plain,
! [X25,X26,X27,X28] :
( ( contains_slb(insert_slb(X25,pair(X26,X28)),X27)
| X26 != X27 )
& ( contains_slb(insert_slb(X25,pair(X26,X28)),X27)
| ~ contains_slb(X25,X27) )
& ( X26 = X27
| contains_slb(X25,X27)
| ~ contains_slb(insert_slb(X25,pair(X26,X28)),X27) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])])]) ).
cnf(c_0_23,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_17]) ).
cnf(c_0_24,plain,
( remove_cpq(triple(X3,X1,X4),X2) = triple(X3,X1,bad)
| contains_slb(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
~ ok(triple(X1,X2,bad)),
inference(cn,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( ~ strictly_less_than(X2,lookup_slb(X1,X2))
| ~ contains_slb(X1,X2)
| remove_cpq(triple(X3,X1,X4),X2) = triple(remove_pqp(X3,X2),remove_slb(X1,X2),bad) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_27,plain,
! [X46,X47,X48,X49] :
( lookup_slb(insert_slb(X46,pair(X47,X49)),X48) = lookup_slb(X46,X48)
| ~ contains_slb(X46,X48)
| X47 = X48 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
cnf(c_0_28,plain,
( ~ contains_slb(insert_slb(X1,pair(X2,X3)),X4)
| X2 = X4
| contains_slb(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,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_23,c_0_24]),c_0_25]) ).
fof(c_0_30,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( ~ less_than(X2,X1)
& less_than(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[stricly_smaller_definition]) ).
fof(c_0_31,plain,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
inference(fof_simplification,[status(thm)],[ax41]) ).
cnf(c_0_32,plain,
( ~ strictly_less_than(X4,lookup_slb(X2,X4))
| ~ contains_slb(X2,X4)
| ~ ok(remove_cpq(triple(X1,X2,X3),X4)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
( ~ contains_slb(X3,X2)
| lookup_slb(insert_slb(X3,pair(X1,X4)),X2) = lookup_slb(X3,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( contains_slb(esk1_0,esk4_0)
| esk6_0 = esk4_0 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_35,plain,
! [X18,X19] :
( ( strictly_less_than(X18,X19)
| less_than(X19,X18)
| ~ less_than(X18,X19) )
& ( ~ strictly_less_than(X18,X19)
| ~ less_than(X19,X18) )
& ( ~ strictly_less_than(X18,X19)
| less_than(X18,X19) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])]) ).
fof(c_0_36,plain,
! [X15,X16] :
( less_than(X16,X15)
| less_than(X15,X16) ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(c_0_37,plain,
! [X1,X2,X3,X4] :
( ( contains_slb(X1,X3)
& X2 != X3 )
=> remove_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(remove_slb(X1,X3),pair(X2,X4)) ),
inference(fof_simplification,[status(thm)],[ax25]) ).
fof(c_0_38,plain,
! [X88,X89,X90] :
( X90 = bad
| ok(triple(X88,X89,X90)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])]) ).
fof(c_0_39,plain,
! [X99,X100,X101,X102] :
( remove_cpq(triple(X99,X100,X101),X102) = triple(remove_pqp(X99,X102),remove_slb(X100,X102),X101)
| ~ less_than(lookup_slb(X100,X102),X102)
| ~ contains_slb(X100,X102) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax44])])]) ).
cnf(c_0_40,negated_conjecture,
~ strictly_less_than(esk4_0,lookup_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_23]),c_0_29])]) ).
cnf(c_0_41,negated_conjecture,
( X1 = esk4_0
| esk6_0 = esk4_0
| lookup_slb(insert_slb(esk1_0,pair(X1,X2)),esk4_0) = lookup_slb(esk1_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_42,plain,
( ~ less_than(X1,X2)
| strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_43,plain,
( less_than(X2,X1)
| less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
fof(c_0_44,plain,
! [X39,X40,X41,X42] :
( remove_slb(insert_slb(X39,pair(X40,X42)),X41) = insert_slb(remove_slb(X39,X41),pair(X40,X42))
| ~ contains_slb(X39,X41)
| X40 = X41 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])]) ).
cnf(c_0_45,plain,
( X3 = bad
| ok(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_46,plain,
( ~ less_than(lookup_slb(X1,X2),X2)
| ~ contains_slb(X1,X2)
| remove_cpq(triple(X3,X1,X4),X2) = triple(remove_pqp(X3,X2),remove_slb(X1,X2),X4) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_47,negated_conjecture,
( ~ strictly_less_than(esk4_0,lookup_slb(esk1_0,esk4_0))
| esk6_0 = esk4_0 ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2) ),
inference(csr,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,plain,
( ~ contains_slb(X3,X2)
| remove_slb(insert_slb(X3,pair(X1,X4)),X2) = insert_slb(remove_slb(X3,X2),pair(X1,X4))
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,plain,
( ~ less_than(lookup_slb(X3,X4),X4)
| ~ contains_slb(X3,X4)
| ok(remove_cpq(triple(X2,X3,X1),X4))
| X1 = bad ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
( less_than(lookup_slb(esk1_0,esk4_0),esk4_0)
| esk6_0 = esk4_0 ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
fof(c_0_52,plain,
! [X31,X32,X33,X34,X35] :
( ( pair_in_list(insert_slb(X31,pair(X32,X34)),X33,X35)
| X34 != X35
| X32 != X33 )
& ( pair_in_list(insert_slb(X31,pair(X32,X34)),X33,X35)
| ~ pair_in_list(X31,X33,X35) )
& ( ~ pair_in_list(insert_slb(X31,pair(X32,X34)),X33,X35)
| pair_in_list(X31,X33,X35)
| X34 = X35 )
& ( ~ pair_in_list(insert_slb(X31,pair(X32,X34)),X33,X35)
| pair_in_list(X31,X33,X35)
| X32 = X33 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])])]) ).
cnf(c_0_53,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_17]) ).
cnf(c_0_54,negated_conjecture,
( X1 = esk4_0
| esk6_0 = esk4_0
| remove_slb(insert_slb(esk1_0,pair(X1,X2)),esk4_0) = insert_slb(remove_slb(esk1_0,esk4_0),pair(X1,X2)) ),
inference(spm,[status(thm)],[c_0_49,c_0_34]) ).
cnf(c_0_55,negated_conjecture,
( ~ ok(remove_cpq(triple(X3,esk1_0,X4),X1))
| ~ strictly_less_than(X1,X2)
| ~ pair_in_list(esk1_0,X1,X2)
| pair_in_list(remove_slb(esk1_0,X1),X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_56,negated_conjecture,
( ok(remove_cpq(triple(X2,esk1_0,X1),esk4_0))
| X1 = bad
| esk6_0 = esk4_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_34]) ).
cnf(c_0_57,plain,
( ~ pair_in_list(insert_slb(X3,pair(X1,X5)),X2,X4)
| pair_in_list(X3,X2,X4)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_58,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_17]) ).
cnf(c_0_59,negated_conjecture,
( ~ pair_in_list(insert_slb(remove_slb(esk1_0,esk4_0),pair(esk6_0,esk7_0)),esk4_0,esk5_0)
| esk6_0 = esk4_0 ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,plain,
( ~ pair_in_list(X1,X2,X3)
| pair_in_list(insert_slb(X1,pair(X4,X5)),X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_61,negated_conjecture,
( ~ strictly_less_than(esk4_0,X2)
| ~ pair_in_list(esk1_0,esk4_0,X2)
| pair_in_list(remove_slb(esk1_0,esk4_0),esk4_0,X2)
| X1 = bad
| esk6_0 = esk4_0 ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,negated_conjecture,
( pair_in_list(esk1_0,esk4_0,esk5_0)
| esk6_0 = esk4_0 ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_63,negated_conjecture,
strictly_less_than(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_64,negated_conjecture,
( ~ pair_in_list(remove_slb(esk1_0,esk4_0),esk4_0,esk5_0)
| esk6_0 = esk4_0 ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,negated_conjecture,
( X1 = bad
| esk6_0 = esk4_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63])]),c_0_64]) ).
cnf(c_0_66,negated_conjecture,
( ~ ok(bad)
| esk6_0 = esk4_0 ),
inference(spm,[status(thm)],[c_0_25,c_0_65]) ).
cnf(c_0_67,negated_conjecture,
( ~ ok(X1)
| esk6_0 = esk4_0 ),
inference(spm,[status(thm)],[c_0_66,c_0_65]) ).
fof(c_0_68,plain,
! [X36,X37,X38] : remove_slb(insert_slb(X36,pair(X37,X38)),X37) = X36,
inference(variable_rename,[status(thm)],[ax24]) ).
fof(c_0_69,plain,
! [X43,X44,X45] : lookup_slb(insert_slb(X43,pair(X44,X45)),X44) = X45,
inference(variable_rename,[status(thm)],[ax26]) ).
cnf(c_0_70,plain,
( ~ pair_in_list(insert_slb(X3,pair(X5,X1)),X4,X2)
| pair_in_list(X3,X4,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_71,negated_conjecture,
esk6_0 = esk4_0,
inference(spm,[status(thm)],[c_0_67,c_0_23]) ).
cnf(c_0_72,plain,
remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_73,plain,
lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_74,negated_conjecture,
( pair_in_list(esk1_0,esk4_0,esk5_0)
| esk7_0 = esk5_0 ),
inference(spm,[status(thm)],[c_0_70,c_0_58]) ).
cnf(c_0_75,negated_conjecture,
~ pair_in_list(esk1_0,esk4_0,esk5_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_71]),c_0_72]) ).
cnf(c_0_76,negated_conjecture,
~ strictly_less_than(esk4_0,esk7_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_71]),c_0_73]) ).
cnf(c_0_77,negated_conjecture,
esk7_0 = esk5_0,
inference(sr,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_78,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77]),c_0_63])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV396+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n008.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 08:45:08 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.12/0.48 % Version: 3.5.1
% 0.12/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.48 % Starting sh5l with 300s (1) cores
% 0.12/0.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 621271 completed with status 0
% 0.12/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.48 % No SInE strategy applied
% 0.12/0.48 % Search class: FGHSM-FFMS31-MFFFFFNN
% 0.12/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.48 % Starting G-E--_107_C37_SOS_F1_PI_AE_Q4_CS_SP_PS_S0Y with 380s (1) cores
% 0.12/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.12/0.48 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 136s (1) cores
% 0.12/0.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 621277 completed with status 0
% 0.12/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.48 % No SInE strategy applied
% 0.12/0.48 % Search class: FGHSM-FFMS31-MFFFFFNN
% 0.12/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.48 % Preprocessing time : 0.002 s
% 0.12/0.48 % Presaturation interreduction done
% 0.12/0.48
% 0.12/0.48 % Proof found!
% 0.12/0.48 % SZS status Theorem
% 0.12/0.48 % SZS output start CNFRefutation
% See solution above
% 0.12/0.48 % Parsed axioms : 42
% 0.12/0.48 % Removed by relevancy pruning/SinE : 0
% 0.12/0.48 % Initial clauses : 57
% 0.12/0.48 % Removed in clause preprocessing : 4
% 0.12/0.48 % Initial clauses in saturation : 53
% 0.12/0.48 % Processed clauses : 321
% 0.12/0.48 % ...of these trivial : 5
% 0.12/0.48 % ...subsumed : 102
% 0.12/0.48 % ...remaining for further processing : 214
% 0.12/0.48 % Other redundant clauses eliminated : 3
% 0.12/0.48 % Clauses deleted for lack of memory : 0
% 0.12/0.48 % Backward-subsumed : 8
% 0.12/0.48 % Backward-rewritten : 18
% 0.12/0.48 % Generated clauses : 1095
% 0.12/0.48 % ...of the previous two non-redundant : 927
% 0.12/0.48 % ...aggressively subsumed : 0
% 0.12/0.48 % Contextual simplify-reflections : 4
% 0.12/0.48 % Paramodulations : 1077
% 0.12/0.48 % Factorizations : 15
% 0.12/0.48 % NegExts : 0
% 0.12/0.48 % Equation resolutions : 3
% 0.12/0.48 % Disequality decompositions : 0
% 0.12/0.48 % Total rewrite steps : 211
% 0.12/0.48 % ...of those cached : 160
% 0.12/0.48 % Propositional unsat checks : 0
% 0.12/0.48 % Propositional check models : 0
% 0.12/0.48 % Propositional check unsatisfiable : 0
% 0.12/0.48 % Propositional clauses : 0
% 0.12/0.48 % Propositional clauses after purity: 0
% 0.12/0.48 % Propositional unsat core size : 0
% 0.12/0.48 % Propositional preprocessing time : 0.000
% 0.12/0.48 % Propositional encoding time : 0.000
% 0.12/0.48 % Propositional solver time : 0.000
% 0.12/0.48 % Success case prop preproc time : 0.000
% 0.12/0.48 % Success case prop encoding time : 0.000
% 0.12/0.48 % Success case prop solver time : 0.000
% 0.12/0.48 % Current number of processed clauses : 132
% 0.12/0.48 % Positive orientable unit clauses : 25
% 0.12/0.48 % Positive unorientable unit clauses: 0
% 0.12/0.48 % Negative unit clauses : 15
% 0.12/0.48 % Non-unit-clauses : 92
% 0.12/0.48 % Current number of unprocessed clauses: 703
% 0.12/0.48 % ...number of literals in the above : 2498
% 0.12/0.48 % Current number of archived formulas : 0
% 0.12/0.48 % Current number of archived clauses : 82
% 0.12/0.48 % Clause-clause subsumption calls (NU) : 2272
% 0.12/0.48 % Rec. Clause-clause subsumption calls : 1528
% 0.12/0.48 % Non-unit clause-clause subsumptions : 102
% 0.12/0.48 % Unit Clause-clause subsumption calls : 218
% 0.12/0.48 % Rewrite failures with RHS unbound : 0
% 0.12/0.48 % BW rewrite match attempts : 14
% 0.12/0.48 % BW rewrite match successes : 2
% 0.12/0.48 % Condensation attempts : 0
% 0.12/0.48 % Condensation successes : 0
% 0.12/0.48 % Termbank termtop insertions : 18014
% 0.12/0.48 % Search garbage collected termcells : 716
% 0.12/0.48
% 0.12/0.48 % -------------------------------------------------
% 0.12/0.48 % User time : 0.034 s
% 0.12/0.48 % System time : 0.007 s
% 0.12/0.48 % Total time : 0.041 s
% 0.12/0.48 % Maximum resident set size: 3692 pages
% 0.12/0.48
% 0.12/0.48 % -------------------------------------------------
% 0.12/0.48 % User time : 0.159 s
% 0.12/0.48 % System time : 0.025 s
% 0.12/0.48 % Total time : 0.184 s
% 0.12/0.48 % Maximum resident set size: 4608 pages
% 0.12/0.48 % E exiting
%------------------------------------------------------------------------------