%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV388+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 : n005.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:04 PM UTC 2026
% Result : Theorem 0.28s 1.61s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_81)
% Comments :
%------------------------------------------------------------------------------
fof(l24_l34,lemma,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l24_l34) ).
fof(ax38,axiom,
! [X1,X2,X3,X4,X5] :
( strictly_less_than(X4,X5)
=> ( check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))
<=> ~ $true ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax38) ).
fof(ax47,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& ~ contains_slb(X2,findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax47) ).
fof(l24_co,conjecture,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ( ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3)))
| ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l24_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(ax41,axiom,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax41) ).
fof(ax35,axiom,
! [X1,X2] :
( succ_cpq(X1,X2)
=> succ_cpq(X1,removemin_cpq_eff(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax35) ).
fof(ax52,axiom,
! [X1] : removemin_cpq_eff(X1) = remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax52) ).
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(ax37,axiom,
! [X1,X2,X3,X4,X5] :
( less_than(X5,X4)
=> ( check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))
<=> check_cpq(triple(X1,X2,X3)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax37) ).
fof(ax49,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax49) ).
fof(ax48,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax48) ).
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/sandbox/benchmark/Axioms/SWV007+3.ax',ax44) ).
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/sandbox/benchmark/Axioms/SWV007+3.ax',ax45) ).
fof(ax42,axiom,
! [X1,X2,X3,X4] : insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax42) ).
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(ax39,axiom,
! [X1,X2,X3,X4] :
( contains_cpq(triple(X1,X2,X3),X4)
<=> contains_slb(X2,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax39) ).
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(ax46,axiom,
! [X1,X2] : findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax46) ).
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(ax51,axiom,
! [X1,X2,X3,X4] :
( X2 != create_slb
=> findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax51) ).
fof(ax36,axiom,
! [X1,X2] : check_cpq(triple(X1,create_slb,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax36) ).
fof(ax50,axiom,
! [X1,X2] : findmin_cpq_res(triple(X1,create_slb,X2)) = bottom,
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax50) ).
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(ax33,axiom,
! [X1,X2,X3] :
( succ_cpq(X1,X2)
=> succ_cpq(X1,remove_cpq(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax33) ).
fof(ax32,axiom,
! [X1,X2,X3] :
( succ_cpq(X1,X2)
=> succ_cpq(X1,insert_cpq(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax32) ).
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(ax34,axiom,
! [X1,X2] :
( succ_cpq(X1,X2)
=> succ_cpq(X1,findmin_cpq_eff(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax34) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(ax31,axiom,
! [X1] : succ_cpq(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax31) ).
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_42,lemma,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(fof_simplification,[status(thm)],[l24_l34]) ).
fof(i_0_43,plain,
! [X1,X2,X3,X4,X5] :
( strictly_less_than(X4,X5)
=> ~ check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3)) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
fof(i_0_44,plain,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& ~ contains_slb(X2,findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
inference(fof_simplification,[status(thm)],[ax47]) ).
fof(i_0_45,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ( ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3)))
| ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l24_co])]) ).
fof(i_0_46,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(i_0_47,plain,
! [X1,X2] : ~ ok(triple(X1,X2,bad)),
inference(fof_simplification,[status(thm)],[ax40]) ).
fof(i_0_48,plain,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
inference(fof_simplification,[status(thm)],[ax41]) ).
fof(i_0_49,plain,
! [X185,X186] :
( ~ succ_cpq(X185,X186)
| succ_cpq(X185,removemin_cpq_eff(X186)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax35])]) ).
fof(i_0_50,plain,
! [X240] : removemin_cpq_eff(X240) = remove_cpq(findmin_cpq_eff(X240),findmin_cpq_res(X240)),
inference(variable_rename,[status(thm)],[ax52]) ).
fof(i_0_51,plain,
! [X1,X2] : ~ pair_in_list(create_slb,X1,X2),
inference(fof_simplification,[status(thm)],[ax22]) ).
fof(i_0_52,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_53,plain,
! [X1] : ~ contains_slb(create_slb,X1),
inference(fof_simplification,[status(thm)],[ax20]) ).
fof(i_0_54,plain,
! [X189,X190,X191,X192,X193] :
( ( ~ check_cpq(triple(X189,insert_slb(X190,pair(X192,X193)),X191))
| check_cpq(triple(X189,X190,X191))
| ~ less_than(X193,X192) )
& ( ~ check_cpq(triple(X189,X190,X191))
| check_cpq(triple(X189,insert_slb(X190,pair(X192,X193)),X191))
| ~ less_than(X193,X192) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])]) ).
fof(i_0_55,lemma,
! [X242,X243,X244] :
( check_cpq(triple(X242,X243,X244))
| ~ check_cpq(findmin_cpq_eff(triple(X242,X243,X244))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_42])]) ).
fof(i_0_56,plain,
! [X194,X195,X196,X197,X198] :
( ~ strictly_less_than(X197,X198)
| ~ check_cpq(triple(X194,insert_slb(X195,pair(X197,X198)),X196)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_43])]) ).
fof(i_0_57,plain,
! [X232,X233,X234] :
( X233 = create_slb
| ~ contains_slb(X233,findmin_pqp_res(X232))
| ~ less_than(lookup_slb(X233,findmin_pqp_res(X232)),findmin_pqp_res(X232))
| findmin_cpq_eff(triple(X232,X233,X234)) = triple(X232,update_slb(X233,findmin_pqp_res(X232)),X234) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax49])])]) ).
fof(i_0_58,plain,
! [X229,X230,X231] :
( X230 = create_slb
| ~ contains_slb(X230,findmin_pqp_res(X229))
| ~ strictly_less_than(findmin_pqp_res(X229),lookup_slb(X230,findmin_pqp_res(X229)))
| findmin_cpq_eff(triple(X229,X230,X231)) = triple(X229,update_slb(X230,findmin_pqp_res(X229)),bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax48])])]) ).
fof(i_0_59,plain,
! [X216,X217,X218,X219] :
( ~ contains_slb(X217,X219)
| ~ less_than(lookup_slb(X217,X219),X219)
| remove_cpq(triple(X216,X217,X218),X219) = triple(remove_pqp(X216,X219),remove_slb(X217,X219),X218) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax44])]) ).
fof(i_0_60,plain,
! [X220,X221,X222,X223] :
( ~ contains_slb(X221,X223)
| ~ strictly_less_than(X223,lookup_slb(X221,X223))
| remove_cpq(triple(X220,X221,X222),X223) = triple(remove_pqp(X220,X223),remove_slb(X221,X223),bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])]) ).
fof(i_0_61,plain,
! [X208,X209,X210,X211] : insert_cpq(triple(X208,X209,X210),X211) = triple(insert_pqp(X208,X211),insert_slb(X209,pair(X211,bottom)),X210),
inference(variable_rename,[status(thm)],[ax42]) ).
fof(i_0_62,plain,
! [X148,X149,X150,X151,X152] :
( ( X149 = X150
| pair_in_list(X148,X150,X152)
| ~ pair_in_list(insert_slb(X148,pair(X149,X151)),X150,X152) )
& ( X151 = X152
| pair_in_list(X148,X150,X152)
| ~ pair_in_list(insert_slb(X148,pair(X149,X151)),X150,X152) )
& ( ~ pair_in_list(X148,X150,X152)
| pair_in_list(insert_slb(X148,pair(X149,X151)),X150,X152) )
& ( X149 != X150
| X151 != X152
| pair_in_list(insert_slb(X148,pair(X149,X151)),X150,X152) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])]) ).
fof(i_0_63,plain,
! [X226,X227,X228] :
( X227 = create_slb
| contains_slb(X227,findmin_pqp_res(X226))
| findmin_cpq_eff(triple(X226,X227,X228)) = triple(X226,update_slb(X227,findmin_pqp_res(X226)),bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[i_0_44])])]) ).
fof(i_0_64,negated_conjecture,
( ~ check_cpq(triple(esk1_0,esk2_0,esk3_0))
& check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))
& ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_45])])]) ).
fof(i_0_65,plain,
! [X199,X200,X201,X202] :
( ( ~ contains_cpq(triple(X199,X200,X201),X202)
| contains_slb(X200,X202) )
& ( ~ contains_slb(X200,X202)
| contains_cpq(triple(X199,X200,X201),X202) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax39])]) ).
fof(i_0_66,plain,
! [X212,X213,X214,X215] :
( contains_slb(X213,X215)
| remove_cpq(triple(X212,X213,X214),X215) = triple(X212,X213,bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_46])]) ).
fof(i_0_67,plain,
! [X156,X157,X158,X159] :
( X157 = X158
| ~ contains_slb(X156,X158)
| remove_slb(insert_slb(X156,pair(X157,X159)),X158) = insert_slb(remove_slb(X156,X158),pair(X157,X159)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax25])]) ).
fof(i_0_68,plain,
! [X168,X169,X170,X171] :
( ~ strictly_less_than(X171,X170)
| update_slb(insert_slb(X168,pair(X169,X171)),X170) = insert_slb(update_slb(X168,X170),pair(X169,X170)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax29])]) ).
fof(i_0_69,plain,
! [X172,X173,X174,X175] :
( ~ less_than(X174,X175)
| update_slb(insert_slb(X172,pair(X173,X175)),X174) = insert_slb(update_slb(X172,X174),pair(X173,X175)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax30])]) ).
fof(i_0_70,plain,
! [X203,X204] : ~ ok(triple(X203,X204,bad)),
inference(variable_rename,[status(thm)],[i_0_47]) ).
fof(i_0_71,plain,
! [X142,X143,X144,X145] :
( ( ~ contains_slb(insert_slb(X142,pair(X143,X145)),X144)
| contains_slb(X142,X144)
| X143 = X144 )
& ( ~ contains_slb(X142,X144)
| contains_slb(insert_slb(X142,pair(X143,X145)),X144) )
& ( X143 != X144
| contains_slb(insert_slb(X142,pair(X143,X145)),X144) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])]) ).
fof(i_0_72,plain,
! [X224,X225] : findmin_cpq_eff(triple(X224,create_slb,X225)) = triple(X224,create_slb,bad),
inference(variable_rename,[status(thm)],[ax46]) ).
fof(i_0_73,plain,
! [X163,X164,X165,X166] :
( X164 = X165
| ~ contains_slb(X163,X165)
| lookup_slb(insert_slb(X163,pair(X164,X166)),X165) = lookup_slb(X163,X165) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])]) ).
fof(i_0_74,plain,
! [X237,X238,X239] :
( X238 = create_slb
| findmin_cpq_res(triple(X237,X238,X239)) = findmin_pqp_res(X237) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax51])])]) ).
fof(i_0_75,plain,
! [X205,X206,X207] :
( ok(triple(X205,X206,X207))
| X207 = bad ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_48])]) ).
fof(i_0_76,plain,
! [X187,X188] : check_cpq(triple(X187,create_slb,X188)),
inference(variable_rename,[status(thm)],[ax36]) ).
fof(i_0_77,plain,
! [X235,X236] : findmin_cpq_res(triple(X235,create_slb,X236)) = bottom,
inference(variable_rename,[status(thm)],[ax50]) ).
fof(i_0_78,plain,
! [X160,X161,X162] : lookup_slb(insert_slb(X160,pair(X161,X162)),X161) = X162,
inference(variable_rename,[status(thm)],[ax26]) ).
fof(i_0_79,plain,
! [X153,X154,X155] : remove_slb(insert_slb(X153,pair(X154,X155)),X154) = X153,
inference(variable_rename,[status(thm)],[ax24]) ).
cnf(i_0_80,plain,
( succ_cpq(X1,removemin_cpq_eff(X2))
| ~ succ_cpq(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_49]) ).
cnf(i_0_81,plain,
removemin_cpq_eff(X1) = remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)),
inference(split_conjunct,[status(thm)],[i_0_50]) ).
fof(i_0_82,plain,
! [X146,X147] : ~ pair_in_list(create_slb,X146,X147),
inference(variable_rename,[status(thm)],[i_0_51]) ).
fof(i_0_83,plain,
! [X138,X139,X140] : isnonempty_slb(insert_slb(X138,pair(X139,X140))),
inference(variable_rename,[status(thm)],[ax19]) ).
fof(i_0_84,plain,
! [X180,X181,X182] :
( ~ succ_cpq(X180,X181)
| succ_cpq(X180,remove_cpq(X181,X182)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax33])]) ).
fof(i_0_85,plain,
! [X177,X178,X179] :
( ~ succ_cpq(X177,X178)
| succ_cpq(X177,insert_cpq(X178,X179)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax32])]) ).
fof(i_0_86,plain,
! [X129,X130,X131] :
( ~ less_than(X129,X130)
| ~ less_than(X130,X131)
| less_than(X129,X131) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity])]) ).
fof(i_0_87,plain,
! [X135,X136] :
( ( less_than(X135,X136)
| ~ strictly_less_than(X135,X136) )
& ( ~ less_than(X136,X135)
| ~ strictly_less_than(X135,X136) )
& ( ~ less_than(X135,X136)
| less_than(X136,X135)
| strictly_less_than(X135,X136) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_52])])]) ).
fof(i_0_88,plain,
! [X183,X184] :
( ~ succ_cpq(X183,X184)
| succ_cpq(X183,findmin_cpq_eff(X184)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax34])]) ).
fof(i_0_89,plain,
! [X132,X133] :
( less_than(X132,X133)
| less_than(X133,X132) ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(i_0_90,plain,
! [X141] : ~ contains_slb(create_slb,X141),
inference(variable_rename,[status(thm)],[i_0_53]) ).
fof(i_0_91,plain,
! [X176] : succ_cpq(X176,X176),
inference(variable_rename,[status(thm)],[ax31]) ).
fof(i_0_92,plain,
! [X134] : less_than(X134,X134),
inference(variable_rename,[status(thm)],[reflexivity]) ).
fof(i_0_93,plain,
! [X137] : less_than(bottom,X137),
inference(variable_rename,[status(thm)],[bottom_smallest]) ).
fof(i_0_94,plain,
! [X167] : update_slb(create_slb,X167) = create_slb,
inference(variable_rename,[status(thm)],[ax28]) ).
fof(i_0_95,plain,
~ isnonempty_slb(create_slb),
inference(fof_simplification,[status(thm)],[ax18]) ).
cnf(i_0_96,plain,
( check_cpq(triple(X1,X2,X5))
| ~ check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))
| ~ less_than(X4,X3) ),
inference(split_conjunct,[status(thm)],[i_0_54]),
[final] ).
cnf(i_0_97,plain,
( check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))
| ~ check_cpq(triple(X1,X2,X3))
| ~ less_than(X5,X4) ),
inference(split_conjunct,[status(thm)],[i_0_54]),
[final] ).
cnf(i_0_98,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[i_0_55]),
[final] ).
cnf(i_0_99,plain,
( ~ strictly_less_than(X1,X2)
| ~ check_cpq(triple(X3,insert_slb(X4,pair(X1,X2)),X5)) ),
inference(split_conjunct,[status(thm)],[i_0_56]),
[final] ).
cnf(i_0_100,plain,
( X1 = create_slb
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),X3)
| ~ contains_slb(X1,findmin_pqp_res(X2))
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X2)),findmin_pqp_res(X2)) ),
inference(split_conjunct,[status(thm)],[i_0_57]),
[final] ).
cnf(i_0_101,plain,
( X1 = create_slb
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad)
| ~ contains_slb(X1,findmin_pqp_res(X2))
| ~ strictly_less_than(findmin_pqp_res(X2),lookup_slb(X1,findmin_pqp_res(X2))) ),
inference(split_conjunct,[status(thm)],[i_0_58]),
[final] ).
cnf(i_0_102,plain,
( remove_cpq(triple(X3,X1,X4),X2) = triple(remove_pqp(X3,X2),remove_slb(X1,X2),X4)
| ~ contains_slb(X1,X2)
| ~ less_than(lookup_slb(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[i_0_59]),
[final] ).
cnf(i_0_103,plain,
( remove_cpq(triple(X3,X1,X4),X2) = triple(remove_pqp(X3,X2),remove_slb(X1,X2),bad)
| ~ contains_slb(X1,X2)
| ~ strictly_less_than(X2,lookup_slb(X1,X2)) ),
inference(split_conjunct,[status(thm)],[i_0_60]),
[final] ).
cnf(i_0_104,plain,
insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
inference(split_conjunct,[status(thm)],[i_0_61]),
[final] ).
cnf(i_0_105,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_62]),
[final] ).
cnf(i_0_106,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_62]),
[final] ).
cnf(i_0_107,plain,
( X1 = create_slb
| contains_slb(X1,findmin_pqp_res(X2))
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad) ),
inference(split_conjunct,[status(thm)],[i_0_63]),
[final] ).
cnf(i_0_108,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_62]),
[final] ).
cnf(i_0_109,negated_conjecture,
ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[i_0_64]),
[final] ).
cnf(i_0_110,negated_conjecture,
check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[i_0_64]),
[final] ).
cnf(i_0_111,plain,
( contains_slb(X2,X4)
| ~ contains_cpq(triple(X1,X2,X3),X4) ),
inference(split_conjunct,[status(thm)],[i_0_65]),
[final] ).
cnf(i_0_112,plain,
( contains_slb(X1,X2)
| remove_cpq(triple(X3,X1,X4),X2) = triple(X3,X1,bad) ),
inference(split_conjunct,[status(thm)],[i_0_66]),
[final] ).
cnf(i_0_113,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_67]),
[final] ).
cnf(i_0_114,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_68]),
[final] ).
cnf(i_0_115,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_69]),
[final] ).
cnf(i_0_116,plain,
~ ok(triple(X1,X2,bad)),
inference(split_conjunct,[status(thm)],[i_0_70]),
[final] ).
cnf(i_0_117,plain,
( contains_slb(X1,X4)
| X2 = X4
| ~ contains_slb(insert_slb(X1,pair(X2,X3)),X4) ),
inference(split_conjunct,[status(thm)],[i_0_71]),
[final] ).
cnf(i_0_118,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[i_0_64]),
[final] ).
cnf(i_0_119,plain,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
inference(split_conjunct,[status(thm)],[i_0_72]),
[final] ).
cnf(i_0_120,plain,
( contains_cpq(triple(X3,X1,X4),X2)
| ~ contains_slb(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_65]),
[final] ).
cnf(i_0_121,plain,
( pair_in_list(insert_slb(X5,pair(X1,X3)),X2,X4)
| X1 != X2
| X3 != X4 ),
inference(split_conjunct,[status(thm)],[i_0_62]),
[final] ).
cnf(i_0_122,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_73]),
[final] ).
cnf(i_0_123,plain,
( X1 = create_slb
| findmin_cpq_res(triple(X2,X1,X3)) = findmin_pqp_res(X2) ),
inference(split_conjunct,[status(thm)],[i_0_74]),
[final] ).
cnf(i_0_124,plain,
( contains_slb(insert_slb(X1,pair(X3,X4)),X2)
| ~ contains_slb(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_71]),
[final] ).
cnf(i_0_125,plain,
( ok(triple(X1,X2,X3))
| X3 = bad ),
inference(split_conjunct,[status(thm)],[i_0_75]),
[final] ).
cnf(i_0_126,plain,
check_cpq(triple(X1,create_slb,X2)),
inference(split_conjunct,[status(thm)],[i_0_76]),
[final] ).
cnf(i_0_127,plain,
findmin_cpq_res(triple(X1,create_slb,X2)) = bottom,
inference(split_conjunct,[status(thm)],[i_0_77]),
[final] ).
cnf(i_0_128,plain,
( contains_slb(insert_slb(X3,pair(X1,X4)),X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[i_0_71]),
[final] ).
cnf(i_0_129,plain,
lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
inference(split_conjunct,[status(thm)],[i_0_78]),
[final] ).
cnf(i_0_130,plain,
remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
inference(split_conjunct,[status(thm)],[i_0_79]),
[final] ).
cnf(i_0_131,plain,
( succ_cpq(X1,remove_cpq(findmin_cpq_eff(X2),findmin_cpq_res(X2)))
| ~ succ_cpq(X1,X2) ),
inference(rw,[status(thm)],[i_0_80,c_0_81]),
[final] ).
cnf(i_0_132,plain,
~ pair_in_list(create_slb,X1,X2),
inference(split_conjunct,[status(thm)],[i_0_82]),
[final] ).
cnf(i_0_133,plain,
isnonempty_slb(insert_slb(X1,pair(X2,X3))),
inference(split_conjunct,[status(thm)],[i_0_83]),
[final] ).
cnf(i_0_134,plain,
( succ_cpq(X1,remove_cpq(X2,X3))
| ~ succ_cpq(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_84]),
[final] ).
cnf(i_0_135,plain,
( succ_cpq(X1,insert_cpq(X2,X3))
| ~ succ_cpq(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_85]),
[final] ).
cnf(i_0_136,plain,
( less_than(X1,X3)
| ~ less_than(X1,X2)
| ~ less_than(X2,X3) ),
inference(split_conjunct,[status(thm)],[i_0_86]),
[final] ).
cnf(i_0_137,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_87]),
[final] ).
cnf(i_0_138,plain,
( ~ less_than(X1,X2)
| ~ strictly_less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[i_0_87]),
[final] ).
cnf(i_0_139,plain,
( succ_cpq(X1,findmin_cpq_eff(X2))
| ~ succ_cpq(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_88]),
[final] ).
cnf(i_0_140,plain,
( less_than(X1,X2)
| ~ strictly_less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_87]),
[final] ).
cnf(i_0_141,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[i_0_89]),
[final] ).
cnf(i_0_142,plain,
~ contains_slb(create_slb,X1),
inference(split_conjunct,[status(thm)],[i_0_90]),
[final] ).
cnf(i_0_143,plain,
succ_cpq(X1,X1),
inference(split_conjunct,[status(thm)],[i_0_91]),
[final] ).
cnf(i_0_144,plain,
less_than(X1,X1),
inference(split_conjunct,[status(thm)],[i_0_92]),
[final] ).
cnf(i_0_145,plain,
less_than(bottom,X1),
inference(split_conjunct,[status(thm)],[i_0_93]),
[final] ).
cnf(i_0_146,plain,
update_slb(create_slb,X1) = create_slb,
inference(split_conjunct,[status(thm)],[i_0_94]),
[final] ).
cnf(i_0_147,plain,
~ isnonempty_slb(create_slb),
inference(split_conjunct,[status(thm)],[i_0_95]),
[final] ).
cnf(i_0_148,axiom,
X1 = X1 ).
cnf(i_0_149,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_150,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_151,axiom,
( X1 != X2
| triple(X1,X3,X4) = triple(X2,X3,X4) ) ).
cnf(i_0_152,axiom,
( X1 != X2
| triple(X3,X1,X4) = triple(X3,X2,X4) ) ).
cnf(i_0_153,axiom,
( X1 != X2
| triple(X3,X4,X1) = triple(X3,X4,X2) ) ).
cnf(i_0_154,axiom,
( X1 != X2
| remove_slb(X1,X3) = remove_slb(X2,X3) ) ).
cnf(i_0_155,axiom,
( X1 != X2
| remove_slb(X3,X1) = remove_slb(X3,X2) ) ).
cnf(i_0_156,axiom,
( X1 != X2
| insert_cpq(X1,X3) = insert_cpq(X2,X3) ) ).
cnf(i_0_157,axiom,
( X1 != X2
| insert_cpq(X3,X1) = insert_cpq(X3,X2) ) ).
cnf(i_0_158,axiom,
( X1 != X2
| findmin_cpq_res(X1) = findmin_cpq_res(X2) ) ).
cnf(i_0_159,axiom,
( X1 != X2
| insert_slb(X1,X3) = insert_slb(X2,X3) ) ).
cnf(i_0_160,axiom,
( X1 != X2
| insert_slb(X3,X1) = insert_slb(X3,X2) ) ).
cnf(i_0_161,axiom,
( X1 != X2
| findmin_cpq_eff(X1) = findmin_cpq_eff(X2) ) ).
cnf(i_0_162,axiom,
( X1 != X2
| update_slb(X1,X3) = update_slb(X2,X3) ) ).
cnf(i_0_163,axiom,
( X1 != X2
| update_slb(X3,X1) = update_slb(X3,X2) ) ).
cnf(i_0_164,axiom,
( X1 != X2
| findmin_pqp_res(X1) = findmin_pqp_res(X2) ) ).
cnf(i_0_165,axiom,
( X1 != X2
| lookup_slb(X1,X3) = lookup_slb(X2,X3) ) ).
cnf(i_0_166,axiom,
( X1 != X2
| lookup_slb(X3,X1) = lookup_slb(X3,X2) ) ).
cnf(i_0_167,axiom,
( X1 != X2
| remove_cpq(X1,X3) = remove_cpq(X2,X3) ) ).
cnf(i_0_168,axiom,
( X1 != X2
| remove_cpq(X3,X1) = remove_cpq(X3,X2) ) ).
cnf(i_0_169,axiom,
( X1 != X2
| ~ check_cpq(X1)
| check_cpq(X2) ) ).
cnf(i_0_170,axiom,
( X1 != X2
| ~ less_than(X1,X3)
| less_than(X2,X3) ) ).
cnf(i_0_171,axiom,
( X1 != X2
| ~ less_than(X3,X1)
| less_than(X3,X2) ) ).
cnf(i_0_172,axiom,
( X1 != X2
| ~ strictly_less_than(X1,X3)
| strictly_less_than(X2,X3) ) ).
cnf(i_0_173,axiom,
( X1 != X2
| ~ strictly_less_than(X3,X1)
| strictly_less_than(X3,X2) ) ).
cnf(i_0_174,axiom,
( X1 != X2
| ~ contains_slb(X1,X3)
| contains_slb(X2,X3) ) ).
cnf(i_0_175,axiom,
( X1 != X2
| ~ contains_slb(X3,X1)
| contains_slb(X3,X2) ) ).
cnf(i_0_176,axiom,
( X1 != X2
| ~ pair_in_list(X1,X3,X4)
| pair_in_list(X2,X3,X4) ) ).
cnf(i_0_177,axiom,
( X1 != X2
| ~ pair_in_list(X3,X1,X4)
| pair_in_list(X3,X2,X4) ) ).
cnf(i_0_178,axiom,
( X1 != X2
| ~ pair_in_list(X3,X4,X1)
| pair_in_list(X3,X4,X2) ) ).
cnf(i_0_179,axiom,
( X1 != X2
| ~ ok(X1)
| ok(X2) ) ).
cnf(i_0_180,axiom,
( X1 != X2
| ~ contains_cpq(X1,X3)
| contains_cpq(X2,X3) ) ).
cnf(i_0_181,axiom,
( X1 != X2
| ~ contains_cpq(X3,X1)
| contains_cpq(X3,X2) ) ).
cnf(i_0_182,axiom,
( X1 != X2
| ~ succ_cpq(X1,X3)
| succ_cpq(X2,X3) ) ).
cnf(i_0_183,axiom,
( X1 != X2
| ~ succ_cpq(X3,X1)
| succ_cpq(X3,X2) ) ).
cnf(i_0_184,axiom,
( X1 != X2
| ~ isnonempty_slb(X1)
| isnonempty_slb(X2) ) ).
cnf(i_0_148_001,axiom,
X1 = X1 ).
cnf(i_0_149_002,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_150_003,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_151_004,axiom,
( X1 != X2
| triple(X1,X3,X4) = triple(X2,X3,X4) ) ).
cnf(i_0_152_005,axiom,
( X1 != X2
| triple(X3,X1,X4) = triple(X3,X2,X4) ) ).
cnf(i_0_153_006,axiom,
( X1 != X2
| triple(X3,X4,X1) = triple(X3,X4,X2) ) ).
cnf(i_0_154_007,axiom,
( X1 != X2
| remove_slb(X1,X3) = remove_slb(X2,X3) ) ).
cnf(i_0_155_008,axiom,
( X1 != X2
| remove_slb(X3,X1) = remove_slb(X3,X2) ) ).
cnf(i_0_156_009,axiom,
( X1 != X2
| insert_cpq(X1,X3) = insert_cpq(X2,X3) ) ).
cnf(i_0_157_010,axiom,
( X1 != X2
| insert_cpq(X3,X1) = insert_cpq(X3,X2) ) ).
cnf(i_0_158_011,axiom,
( X1 != X2
| findmin_cpq_res(X1) = findmin_cpq_res(X2) ) ).
cnf(i_0_159_012,axiom,
( X1 != X2
| insert_slb(X1,X3) = insert_slb(X2,X3) ) ).
cnf(i_0_160_013,axiom,
( X1 != X2
| insert_slb(X3,X1) = insert_slb(X3,X2) ) ).
cnf(i_0_161_014,axiom,
( X1 != X2
| findmin_cpq_eff(X1) = findmin_cpq_eff(X2) ) ).
cnf(i_0_162_015,axiom,
( X1 != X2
| update_slb(X1,X3) = update_slb(X2,X3) ) ).
cnf(i_0_163_016,axiom,
( X1 != X2
| update_slb(X3,X1) = update_slb(X3,X2) ) ).
cnf(i_0_164_017,axiom,
( X1 != X2
| findmin_pqp_res(X1) = findmin_pqp_res(X2) ) ).
cnf(i_0_165_018,axiom,
( X1 != X2
| lookup_slb(X1,X3) = lookup_slb(X2,X3) ) ).
cnf(i_0_166_019,axiom,
( X1 != X2
| lookup_slb(X3,X1) = lookup_slb(X3,X2) ) ).
cnf(i_0_167_020,axiom,
( X1 != X2
| remove_cpq(X1,X3) = remove_cpq(X2,X3) ) ).
cnf(i_0_168_021,axiom,
( X1 != X2
| remove_cpq(X3,X1) = remove_cpq(X3,X2) ) ).
cnf(i_0_169_022,axiom,
( X1 != X2
| ~ check_cpq(X1)
| check_cpq(X2) ) ).
cnf(i_0_170_023,axiom,
( X1 != X2
| ~ less_than(X1,X3)
| less_than(X2,X3) ) ).
cnf(i_0_171_024,axiom,
( X1 != X2
| ~ less_than(X3,X1)
| less_than(X3,X2) ) ).
cnf(i_0_172_025,axiom,
( X1 != X2
| ~ strictly_less_than(X1,X3)
| strictly_less_than(X2,X3) ) ).
cnf(i_0_173_026,axiom,
( X1 != X2
| ~ strictly_less_than(X3,X1)
| strictly_less_than(X3,X2) ) ).
cnf(i_0_174_027,axiom,
( X1 != X2
| ~ contains_slb(X1,X3)
| contains_slb(X2,X3) ) ).
cnf(i_0_175_028,axiom,
( X1 != X2
| ~ contains_slb(X3,X1)
| contains_slb(X3,X2) ) ).
cnf(i_0_176_029,axiom,
( X1 != X2
| ~ pair_in_list(X1,X3,X4)
| pair_in_list(X2,X3,X4) ) ).
cnf(i_0_177_030,axiom,
( X1 != X2
| ~ pair_in_list(X3,X1,X4)
| pair_in_list(X3,X2,X4) ) ).
cnf(i_0_178_031,axiom,
( X1 != X2
| ~ pair_in_list(X3,X4,X1)
| pair_in_list(X3,X4,X2) ) ).
cnf(i_0_179_032,axiom,
( X1 != X2
| ~ ok(X1)
| ok(X2) ) ).
cnf(i_0_180_033,axiom,
( X1 != X2
| ~ contains_cpq(X1,X3)
| contains_cpq(X2,X3) ) ).
cnf(i_0_181_034,axiom,
( X1 != X2
| ~ contains_cpq(X3,X1)
| contains_cpq(X3,X2) ) ).
cnf(i_0_182_035,axiom,
( X1 != X2
| ~ succ_cpq(X1,X3)
| succ_cpq(X2,X3) ) ).
cnf(i_0_183_036,axiom,
( X1 != X2
| ~ succ_cpq(X3,X1)
| succ_cpq(X3,X2) ) ).
cnf(i_0_184_037,axiom,
( X1 != X2
| ~ isnonempty_slb(X1)
| isnonempty_slb(X2) ) ).
cnf(i_0_185,plain,
contains_slb(insert_slb(X1,pair(X2,X3)),X2),
inference(equality_inference,[],[128]) ).
cnf(i_0_186,plain,
$false,
inference(scs_inference,[],[i_0_118,i_0_110,i_0_98]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV388+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.15/0.33 % Computer : n005.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 05:04:15 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 0.28/1.61 % Version : CSE_E---1.7
% 0.28/1.61 % Problem : theBenchmark.p
% 0.28/1.61 % SZS status Theorem for theBenchmark.p
% 0.28/1.61 % SZS output start CNFRefutation
% See solution above
% 0.28/1.64 % Total time : 1.271s
%------------------------------------------------------------------------------