%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC160+1 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n025.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:18:31 PM UTC 2026
% Result : Theorem 1.50s 1.79s
% Output : CNFRefutation 1.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 54 ( 22 unt; 0 def)
% Number of atoms : 253 ( 51 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 300 ( 101 ~; 106 |; 45 &)
% ( 1 <=>; 47 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 12 con; 0-2 aty)
% Number of variables : 98 ( 0 sgn 66 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ strictorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& lt(X8,X6) ) ) ) ) ) )
| ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssItem(X11)
=> ! [X12] :
( ssList(X12)
=> ! [X13] :
( ssList(X13)
=> ! [X14] :
( ssList(X14)
=> ( app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14) != X1
| ~ leq(X11,X10)
| ( ! [X15] :
( ssItem(X15)
=> ( ~ memberP(X13,X15)
| ( leq(X10,X15)
& leq(X15,X11) ) ) )
& leq(X10,X11) ) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax33,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax33) ).
fof(ax92,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( leq(X1,X2)
=> ( X1 = X2
| lt(X1,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax92) ).
fof(ax12,axiom,
! [X1] :
( ssList(X1)
=> ( strictorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> lt(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax12) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ strictorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& lt(X8,X6) ) ) ) ) ) )
| ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssItem(X11)
=> ! [X12] :
( ssList(X12)
=> ! [X13] :
( ssList(X13)
=> ! [X14] :
( ssList(X14)
=> ( app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14) != X1
| ~ leq(X11,X10)
| ( ! [X15] :
( ssItem(X15)
=> ( ~ memberP(X13,X15)
| ( leq(X10,X15)
& leq(X15,X11) ) ) )
& leq(X10,X11) ) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_10,negated_conjecture,
! [X483,X484,X485,X486] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ssList(esk52_0)
& app(esk50_0,esk52_0) = esk51_0
& strictorderedP(esk50_0)
& ( ~ ssItem(X483)
| ~ ssList(X484)
| app(cons(X483,nil),X484) != esk52_0
| ~ ssItem(X485)
| ~ ssList(X486)
| app(X486,cons(X485,nil)) != esk50_0
| ~ lt(X485,X483) )
& ssItem(esk53_0)
& ssItem(esk54_0)
& ssList(esk55_0)
& ssList(esk56_0)
& ssList(esk57_0)
& app(app(app(app(esk55_0,cons(esk53_0,nil)),esk56_0),cons(esk54_0,nil)),esk57_0) = esk48_0
& leq(esk54_0,esk53_0)
& ( ssItem(esk58_0)
| ~ leq(esk53_0,esk54_0) )
& ( memberP(esk56_0,esk58_0)
| ~ leq(esk53_0,esk54_0) )
& ( ~ leq(esk53_0,esk58_0)
| ~ leq(esk58_0,esk54_0)
| ~ leq(esk53_0,esk54_0) )
& ( nil = esk51_0
| nil != esk50_0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
cnf(c_0_11,negated_conjecture,
app(app(app(app(esk55_0,cons(esk53_0,nil)),esk56_0),cons(esk54_0,nil)),esk57_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_12,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X449,X450,X451] :
( ~ ssList(X449)
| ~ ssList(X450)
| ~ ssList(X451)
| app(app(X449,X450),X451) = app(X449,app(X450,X451)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
cnf(c_0_14,negated_conjecture,
app(app(app(app(esk55_0,cons(esk53_0,nil)),esk56_0),cons(esk54_0,nil)),esk57_0) = esk50_0,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk56_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_18,plain,
! [X338,X339] :
( ~ ssList(X338)
| ~ ssItem(X339)
| ssList(cons(X339,X338)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_19,negated_conjecture,
( app(app(app(esk55_0,app(cons(esk53_0,nil),esk56_0)),cons(esk54_0,nil)),esk57_0) = esk50_0
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_20,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_22,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_23,plain,
! [X447,X448] :
( ~ ssList(X447)
| ~ ssItem(X448)
| cons(X448,X447) = app(cons(X448,nil),X447) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_24,negated_conjecture,
app(app(app(esk55_0,app(cons(esk53_0,nil),esk56_0)),cons(esk54_0,nil)),esk57_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_25,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,negated_conjecture,
app(app(app(esk55_0,cons(esk53_0,esk56_0)),cons(esk54_0,nil)),esk57_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_16]),c_0_22])]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk57_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,negated_conjecture,
( app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0)) = esk50_0
| ~ ssList(app(esk55_0,cons(esk53_0,esk56_0)))
| ~ ssList(cons(esk54_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_26]),c_0_27])]) ).
cnf(c_0_29,negated_conjecture,
ssItem(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_30,plain,
! [X357,X358] :
( ~ ssList(X357)
| ~ ssList(X358)
| ssList(app(X357,X358)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_31,negated_conjecture,
( app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0)) = esk50_0
| ~ ssList(app(esk55_0,cons(esk53_0,esk56_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_20]),c_0_21]),c_0_29])]) ).
cnf(c_0_32,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_33,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax33]) ).
fof(c_0_34,plain,
! [X469,X470] :
( ~ ssItem(X469)
| ~ ssItem(X470)
| ~ leq(X469,X470)
| X469 = X470
| lt(X469,X470) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax92])])]) ).
fof(c_0_35,plain,
! [X305,X306,X307,X308,X309,X310] :
( ( ~ strictorderedP(X305)
| ~ ssItem(X306)
| ~ ssItem(X307)
| ~ ssList(X308)
| ~ ssList(X309)
| ~ ssList(X310)
| app(app(X308,cons(X306,X309)),cons(X307,X310)) != X305
| lt(X306,X307)
| ~ ssList(X305) )
& ( ssItem(esk30_1(X305))
| strictorderedP(X305)
| ~ ssList(X305) )
& ( ssItem(esk31_1(X305))
| strictorderedP(X305)
| ~ ssList(X305) )
& ( ssList(esk32_1(X305))
| strictorderedP(X305)
| ~ ssList(X305) )
& ( ssList(esk33_1(X305))
| strictorderedP(X305)
| ~ ssList(X305) )
& ( ssList(esk34_1(X305))
| strictorderedP(X305)
| ~ ssList(X305) )
& ( app(app(esk32_1(X305),cons(esk30_1(X305),esk33_1(X305))),cons(esk31_1(X305),esk34_1(X305))) = X305
| strictorderedP(X305)
| ~ ssList(X305) )
& ( ~ lt(esk30_1(X305),esk31_1(X305))
| strictorderedP(X305)
| ~ ssList(X305) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax12])])])])]) ).
cnf(c_0_36,negated_conjecture,
( app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0)) = esk50_0
| ~ ssList(cons(esk53_0,esk56_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_17])]) ).
fof(c_0_37,plain,
! [X371,X372] :
( ~ ssItem(X371)
| ~ ssItem(X372)
| ~ lt(X371,X372)
| ~ lt(X372,X371) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])]) ).
cnf(c_0_38,plain,
( X1 = X2
| lt(X1,X2)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,negated_conjecture,
leq(esk54_0,esk53_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_40,plain,
( lt(X2,X3)
| ~ strictorderedP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_41,negated_conjecture,
app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_20]),c_0_16]),c_0_22])]) ).
cnf(c_0_42,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_43,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| ~ lt(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,negated_conjecture,
( esk54_0 = esk53_0
| lt(esk54_0,esk53_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_22]),c_0_29])]) ).
cnf(c_0_45,plain,
( lt(X1,X2)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_46,negated_conjecture,
app(app(esk55_0,cons(esk53_0,esk56_0)),cons(esk54_0,esk57_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_25]),c_0_27]),c_0_29])]) ).
cnf(c_0_47,negated_conjecture,
strictorderedP(esk50_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_48,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_42,c_0_12]) ).
cnf(c_0_49,negated_conjecture,
( esk54_0 = esk53_0
| ~ lt(esk53_0,esk54_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_29]),c_0_22])]) ).
cnf(c_0_50,negated_conjecture,
lt(esk53_0,esk54_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48]),c_0_27]),c_0_16]),c_0_17]),c_0_29]),c_0_22])]) ).
cnf(c_0_51,negated_conjecture,
esk54_0 = esk53_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).
cnf(c_0_52,negated_conjecture,
lt(esk53_0,esk53_0),
inference(rw,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_52]),c_0_52]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC160+1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.32 % Computer : n025.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % 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 04:30:58 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.50/1.79 % Version : CSE_E---1.7
% 1.50/1.79 % Problem : theBenchmark.p
% 1.50/1.79 % SZS status Theorem for theBenchmark.p
% 1.50/1.79 % SZS output start CNFRefutation
% See solution above
% 1.50/1.79 % Total time : 1.372s
%------------------------------------------------------------------------------