%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV412+1 : TPTP v9.2.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n015.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 : 300s
% DateTime : Tue May 5 05:22:07 PM UTC 2026
% Result : Theorem 0.28s 1.62s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 56)
% Comments :
%------------------------------------------------------------------------------
fof(l48_co,conjecture,
! [X1,X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& strictly_less_than(X2,X4)
& strictly_less_than(X3,X4) )
=> pair_in_list(update_slb(X1,X4),X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l48_co) ).
fof(ax22,axiom,
! [X1,X2] : ~ pair_in_list(create_slb,X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax22) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(ax20,axiom,
! [X1] : ~ contains_slb(create_slb,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax20) ).
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/sandbox/benchmark/Axioms/SWV007+2.ax',ax23) ).
fof(l48_li3839,lemma,
! [X1,X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& strictly_less_than(X3,X4) )
=> pair_in_list(update_slb(X1,X4),X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l48_li3839) ).
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/sandbox/benchmark/Axioms/SWV007+2.ax',ax25) ).
fof(ax29,axiom,
! [X1,X2,X3,X4] :
( strictly_less_than(X4,X3)
=> update_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(update_slb(X1,X3),pair(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax29) ).
fof(ax30,axiom,
! [X1,X2,X3,X4] :
( less_than(X3,X4)
=> update_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(update_slb(X1,X3),pair(X2,X4)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax30) ).
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/sandbox/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/sandbox/benchmark/Axioms/SWV007+2.ax',ax27) ).
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(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(ax19,axiom,
! [X1,X2,X3] : isnonempty_slb(insert_slb(X1,pair(X2,X3))),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax19) ).
fof(transitivity,axiom,
! [X1,X2,X3] :
( ( less_than(X1,X2)
& less_than(X2,X3) )
=> less_than(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',transitivity) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(reflexivity,axiom,
! [X1] : less_than(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',reflexivity) ).
fof(bottom_smallest,axiom,
! [X1] : less_than(bottom,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',bottom_smallest) ).
fof(ax28,axiom,
! [X1] : update_slb(create_slb,X1) = create_slb,
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax28) ).
fof(ax18,axiom,
~ isnonempty_slb(create_slb),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax18) ).
fof(i_0_20,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& strictly_less_than(X2,X4)
& strictly_less_than(X3,X4) )
=> pair_in_list(update_slb(X1,X4),X2,X4) ),
inference(assume_negation,[status(cth)],[l48_co]) ).
fof(i_0_21,plain,
! [X1,X2] : ~ pair_in_list(create_slb,X1,X2),
inference(fof_simplification,[status(thm)],[ax22]) ).
fof(i_0_22,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[stricly_smaller_definition]) ).
fof(i_0_23,plain,
! [X1] : ~ contains_slb(create_slb,X1),
inference(fof_simplification,[status(thm)],[ax20]) ).
fof(i_0_24,plain,
! [X80,X81,X82,X83,X84] :
( ( X81 = X82
| pair_in_list(X80,X82,X84)
| ~ pair_in_list(insert_slb(X80,pair(X81,X83)),X82,X84) )
& ( X83 = X84
| pair_in_list(X80,X82,X84)
| ~ pair_in_list(insert_slb(X80,pair(X81,X83)),X82,X84) )
& ( ~ pair_in_list(X80,X82,X84)
| pair_in_list(insert_slb(X80,pair(X81,X83)),X82,X84) )
& ( X81 != X82
| X83 != X84
| pair_in_list(insert_slb(X80,pair(X81,X83)),X82,X84) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])]) ).
fof(i_0_25,lemma,
! [X108,X109,X110,X111] :
( ~ pair_in_list(X108,X109,X110)
| ~ strictly_less_than(X110,X111)
| pair_in_list(update_slb(X108,X111),X109,X111) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l48_li3839])]) ).
fof(i_0_26,plain,
! [X88,X89,X90,X91] :
( X89 = X90
| ~ contains_slb(X88,X90)
| remove_slb(insert_slb(X88,pair(X89,X91)),X90) = insert_slb(remove_slb(X88,X90),pair(X89,X91)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax25])]) ).
fof(i_0_27,plain,
! [X100,X101,X102,X103] :
( ~ strictly_less_than(X103,X102)
| update_slb(insert_slb(X100,pair(X101,X103)),X102) = insert_slb(update_slb(X100,X102),pair(X101,X102)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax29])]) ).
fof(i_0_28,plain,
! [X104,X105,X106,X107] :
( ~ less_than(X106,X107)
| update_slb(insert_slb(X104,pair(X105,X107)),X106) = insert_slb(update_slb(X104,X106),pair(X105,X107)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax30])]) ).
fof(i_0_29,plain,
! [X74,X75,X76,X77] :
( ( ~ contains_slb(insert_slb(X74,pair(X75,X77)),X76)
| contains_slb(X74,X76)
| X75 = X76 )
& ( ~ contains_slb(X74,X76)
| contains_slb(insert_slb(X74,pair(X75,X77)),X76) )
& ( X75 != X76
| contains_slb(insert_slb(X74,pair(X75,X77)),X76) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])]) ).
fof(i_0_30,plain,
! [X95,X96,X97,X98] :
( X96 = X97
| ~ contains_slb(X95,X97)
| lookup_slb(insert_slb(X95,pair(X96,X98)),X97) = lookup_slb(X95,X97) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])]) ).
fof(i_0_31,negated_conjecture,
( pair_in_list(esk1_0,esk2_0,esk3_0)
& strictly_less_than(esk2_0,esk4_0)
& strictly_less_than(esk3_0,esk4_0)
& ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_20])])]) ).
fof(i_0_32,plain,
! [X92,X93,X94] : lookup_slb(insert_slb(X92,pair(X93,X94)),X93) = X94,
inference(variable_rename,[status(thm)],[ax26]) ).
fof(i_0_33,plain,
! [X85,X86,X87] : remove_slb(insert_slb(X85,pair(X86,X87)),X86) = X85,
inference(variable_rename,[status(thm)],[ax24]) ).
fof(i_0_34,plain,
! [X78,X79] : ~ pair_in_list(create_slb,X78,X79),
inference(variable_rename,[status(thm)],[i_0_21]) ).
fof(i_0_35,plain,
! [X70,X71,X72] : isnonempty_slb(insert_slb(X70,pair(X71,X72))),
inference(variable_rename,[status(thm)],[ax19]) ).
fof(i_0_36,plain,
! [X61,X62,X63] :
( ~ less_than(X61,X62)
| ~ less_than(X62,X63)
| less_than(X61,X63) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity])]) ).
fof(i_0_37,plain,
! [X67,X68] :
( ( less_than(X67,X68)
| ~ strictly_less_than(X67,X68) )
& ( ~ less_than(X68,X67)
| ~ strictly_less_than(X67,X68) )
& ( ~ less_than(X67,X68)
| less_than(X68,X67)
| strictly_less_than(X67,X68) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_22])])]) ).
fof(i_0_38,plain,
! [X64,X65] :
( less_than(X64,X65)
| less_than(X65,X64) ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(i_0_39,plain,
! [X73] : ~ contains_slb(create_slb,X73),
inference(variable_rename,[status(thm)],[i_0_23]) ).
fof(i_0_40,plain,
! [X66] : less_than(X66,X66),
inference(variable_rename,[status(thm)],[reflexivity]) ).
fof(i_0_41,plain,
! [X69] : less_than(bottom,X69),
inference(variable_rename,[status(thm)],[bottom_smallest]) ).
fof(i_0_42,plain,
! [X99] : update_slb(create_slb,X99) = create_slb,
inference(variable_rename,[status(thm)],[ax28]) ).
fof(i_0_43,plain,
~ isnonempty_slb(create_slb),
inference(fof_simplification,[status(thm)],[ax18]) ).
cnf(i_0_44,plain,
( X1 = X2
| pair_in_list(X3,X2,X4)
| ~ pair_in_list(insert_slb(X3,pair(X1,X5)),X2,X4) ),
inference(split_conjunct,[status(thm)],[i_0_24]),
[final] ).
cnf(i_0_45,plain,
( X1 = X2
| pair_in_list(X3,X4,X2)
| ~ pair_in_list(insert_slb(X3,pair(X5,X1)),X4,X2) ),
inference(split_conjunct,[status(thm)],[i_0_24]),
[final] ).
cnf(i_0_46,plain,
( pair_in_list(insert_slb(X1,pair(X4,X5)),X2,X3)
| ~ pair_in_list(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[i_0_24]),
[final] ).
cnf(i_0_47,lemma,
( pair_in_list(update_slb(X1,X4),X2,X4)
| ~ pair_in_list(X1,X2,X3)
| ~ strictly_less_than(X3,X4) ),
inference(split_conjunct,[status(thm)],[i_0_25]),
[final] ).
cnf(i_0_48,plain,
( X1 = X2
| remove_slb(insert_slb(X3,pair(X1,X4)),X2) = insert_slb(remove_slb(X3,X2),pair(X1,X4))
| ~ contains_slb(X3,X2) ),
inference(split_conjunct,[status(thm)],[i_0_26]),
[final] ).
cnf(i_0_49,plain,
( update_slb(insert_slb(X3,pair(X4,X1)),X2) = insert_slb(update_slb(X3,X2),pair(X4,X2))
| ~ strictly_less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_27]),
[final] ).
cnf(i_0_50,plain,
( update_slb(insert_slb(X3,pair(X4,X2)),X1) = insert_slb(update_slb(X3,X1),pair(X4,X2))
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_28]),
[final] ).
cnf(i_0_51,plain,
( contains_slb(X1,X4)
| X2 = X4
| ~ contains_slb(insert_slb(X1,pair(X2,X3)),X4) ),
inference(split_conjunct,[status(thm)],[i_0_29]),
[final] ).
cnf(i_0_52,plain,
( pair_in_list(insert_slb(X5,pair(X1,X3)),X2,X4)
| X1 != X2
| X3 != X4 ),
inference(split_conjunct,[status(thm)],[i_0_24]),
[final] ).
cnf(i_0_53,plain,
( X1 = X2
| lookup_slb(insert_slb(X3,pair(X1,X4)),X2) = lookup_slb(X3,X2)
| ~ contains_slb(X3,X2) ),
inference(split_conjunct,[status(thm)],[i_0_30]),
[final] ).
cnf(i_0_54,plain,
( contains_slb(insert_slb(X1,pair(X3,X4)),X2)
| ~ contains_slb(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_29]),
[final] ).
cnf(i_0_55,negated_conjecture,
~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[i_0_31]),
[final] ).
cnf(i_0_56,plain,
( contains_slb(insert_slb(X3,pair(X1,X4)),X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[i_0_29]),
[final] ).
cnf(i_0_57,plain,
lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
inference(split_conjunct,[status(thm)],[i_0_32]),
[final] ).
cnf(i_0_58,plain,
remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
inference(split_conjunct,[status(thm)],[i_0_33]),
[final] ).
cnf(i_0_59,plain,
~ pair_in_list(create_slb,X1,X2),
inference(split_conjunct,[status(thm)],[i_0_34]),
[final] ).
cnf(i_0_60,plain,
isnonempty_slb(insert_slb(X1,pair(X2,X3))),
inference(split_conjunct,[status(thm)],[i_0_35]),
[final] ).
cnf(i_0_61,plain,
( less_than(X1,X3)
| ~ less_than(X1,X2)
| ~ less_than(X2,X3) ),
inference(split_conjunct,[status(thm)],[i_0_36]),
[final] ).
cnf(i_0_62,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_37]),
[final] ).
cnf(i_0_63,negated_conjecture,
pair_in_list(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[i_0_31]),
[final] ).
cnf(i_0_64,plain,
( ~ less_than(X1,X2)
| ~ strictly_less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[i_0_37]),
[final] ).
cnf(i_0_65,plain,
( less_than(X1,X2)
| ~ strictly_less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_37]),
[final] ).
cnf(i_0_66,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[i_0_38]),
[final] ).
cnf(i_0_67,plain,
~ contains_slb(create_slb,X1),
inference(split_conjunct,[status(thm)],[i_0_39]),
[final] ).
cnf(i_0_68,plain,
less_than(X1,X1),
inference(split_conjunct,[status(thm)],[i_0_40]),
[final] ).
cnf(i_0_69,plain,
less_than(bottom,X1),
inference(split_conjunct,[status(thm)],[i_0_41]),
[final] ).
cnf(i_0_70,plain,
update_slb(create_slb,X1) = create_slb,
inference(split_conjunct,[status(thm)],[i_0_42]),
[final] ).
cnf(i_0_71,negated_conjecture,
strictly_less_than(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[i_0_31]),
[final] ).
cnf(i_0_72,negated_conjecture,
strictly_less_than(esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[i_0_31]),
[final] ).
cnf(i_0_73,plain,
~ isnonempty_slb(create_slb),
inference(split_conjunct,[status(thm)],[i_0_43]),
[final] ).
cnf(i_0_74,axiom,
X1 = X1 ).
cnf(i_0_75,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_76,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_77,axiom,
( X1 != X2
| insert_slb(X1,X3) = insert_slb(X2,X3) ) ).
cnf(i_0_78,axiom,
( X1 != X2
| insert_slb(X3,X1) = insert_slb(X3,X2) ) ).
cnf(i_0_79,axiom,
( X1 != X2
| update_slb(X1,X3) = update_slb(X2,X3) ) ).
cnf(i_0_80,axiom,
( X1 != X2
| update_slb(X3,X1) = update_slb(X3,X2) ) ).
cnf(i_0_81,axiom,
( X1 != X2
| remove_slb(X1,X3) = remove_slb(X2,X3) ) ).
cnf(i_0_82,axiom,
( X1 != X2
| remove_slb(X3,X1) = remove_slb(X3,X2) ) ).
cnf(i_0_83,axiom,
( X1 != X2
| lookup_slb(X1,X3) = lookup_slb(X2,X3) ) ).
cnf(i_0_84,axiom,
( X1 != X2
| lookup_slb(X3,X1) = lookup_slb(X3,X2) ) ).
cnf(i_0_85,axiom,
( X1 != X2
| ~ pair_in_list(X1,X3,X4)
| pair_in_list(X2,X3,X4) ) ).
cnf(i_0_86,axiom,
( X1 != X2
| ~ pair_in_list(X3,X1,X4)
| pair_in_list(X3,X2,X4) ) ).
cnf(i_0_87,axiom,
( X1 != X2
| ~ pair_in_list(X3,X4,X1)
| pair_in_list(X3,X4,X2) ) ).
cnf(i_0_88,axiom,
( X1 != X2
| ~ strictly_less_than(X1,X3)
| strictly_less_than(X2,X3) ) ).
cnf(i_0_89,axiom,
( X1 != X2
| ~ strictly_less_than(X3,X1)
| strictly_less_than(X3,X2) ) ).
cnf(i_0_90,axiom,
( X1 != X2
| ~ contains_slb(X1,X3)
| contains_slb(X2,X3) ) ).
cnf(i_0_91,axiom,
( X1 != X2
| ~ contains_slb(X3,X1)
| contains_slb(X3,X2) ) ).
cnf(i_0_92,axiom,
( X1 != X2
| ~ less_than(X1,X3)
| less_than(X2,X3) ) ).
cnf(i_0_93,axiom,
( X1 != X2
| ~ less_than(X3,X1)
| less_than(X3,X2) ) ).
cnf(i_0_94,axiom,
( X1 != X2
| ~ isnonempty_slb(X1)
| isnonempty_slb(X2) ) ).
cnf(i_0_74_001,axiom,
X1 = X1 ).
cnf(i_0_75_002,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_76_003,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_77_004,axiom,
( X1 != X2
| insert_slb(X1,X3) = insert_slb(X2,X3) ) ).
cnf(i_0_78_005,axiom,
( X1 != X2
| insert_slb(X3,X1) = insert_slb(X3,X2) ) ).
cnf(i_0_79_006,axiom,
( X1 != X2
| update_slb(X1,X3) = update_slb(X2,X3) ) ).
cnf(i_0_80_007,axiom,
( X1 != X2
| update_slb(X3,X1) = update_slb(X3,X2) ) ).
cnf(i_0_81_008,axiom,
( X1 != X2
| remove_slb(X1,X3) = remove_slb(X2,X3) ) ).
cnf(i_0_82_009,axiom,
( X1 != X2
| remove_slb(X3,X1) = remove_slb(X3,X2) ) ).
cnf(i_0_83_010,axiom,
( X1 != X2
| lookup_slb(X1,X3) = lookup_slb(X2,X3) ) ).
cnf(i_0_84_011,axiom,
( X1 != X2
| lookup_slb(X3,X1) = lookup_slb(X3,X2) ) ).
cnf(i_0_85_012,axiom,
( X1 != X2
| ~ pair_in_list(X1,X3,X4)
| pair_in_list(X2,X3,X4) ) ).
cnf(i_0_86_013,axiom,
( X1 != X2
| ~ pair_in_list(X3,X1,X4)
| pair_in_list(X3,X2,X4) ) ).
cnf(i_0_87_014,axiom,
( X1 != X2
| ~ pair_in_list(X3,X4,X1)
| pair_in_list(X3,X4,X2) ) ).
cnf(i_0_88_015,axiom,
( X1 != X2
| ~ strictly_less_than(X1,X3)
| strictly_less_than(X2,X3) ) ).
cnf(i_0_89_016,axiom,
( X1 != X2
| ~ strictly_less_than(X3,X1)
| strictly_less_than(X3,X2) ) ).
cnf(i_0_90_017,axiom,
( X1 != X2
| ~ contains_slb(X1,X3)
| contains_slb(X2,X3) ) ).
cnf(i_0_91_018,axiom,
( X1 != X2
| ~ contains_slb(X3,X1)
| contains_slb(X3,X2) ) ).
cnf(i_0_92_019,axiom,
( X1 != X2
| ~ less_than(X1,X3)
| less_than(X2,X3) ) ).
cnf(i_0_93_020,axiom,
( X1 != X2
| ~ less_than(X3,X1)
| less_than(X3,X2) ) ).
cnf(i_0_94_021,axiom,
( X1 != X2
| ~ isnonempty_slb(X1)
| isnonempty_slb(X2) ) ).
cnf(i_0_95,plain,
contains_slb(insert_slb(X1,pair(X2,X3)),X2),
inference(equality_inference,[],[56]) ).
cnf(i_0_96,plain,
$false,
inference(scs_inference,[],[i_0_55,i_0_63,i_0_71,i_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV412+1 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n015.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 05:06:32 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 0.28/1.62 % Version : CSE_E---1.7
% 0.28/1.62 % Problem : theBenchmark.p
% 0.28/1.62 % SZS status Theorem for theBenchmark.p
% 0.28/1.62 % SZS output start CNFRefutation
% See solution above
% 0.28/1.64 % Total time : 1.270s
%------------------------------------------------------------------------------