%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC241+1 : TPTP v9.2.1. Released v2.4.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 : n014.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:51 PM UTC 2026
% Result : Theorem 1.36s 1.74s
% Output : CNFRefutation 1.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 23 ( 10 unt; 0 def)
% Number of atoms : 153 ( 40 equ)
% Maximal formula atoms : 46 ( 6 avg)
% Number of connectives : 208 ( 78 ~; 80 |; 37 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 43 ( 0 sgn 24 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ lt(X5,X8)
| leq(X5,X8) ) ) ) )
| ( nil != X3
& ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ~ ssList(X11)
| app(app(X10,cons(X9,nil)),X11) != X3
| ? [X12] :
( ssItem(X12)
& ~ leq(X12,X9)
& memberP(X10,X12)
& memberP(X11,X12)
& leq(X9,X12) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax93,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( X1 != X2
& leq(X1,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax93) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ lt(X5,X8)
| leq(X5,X8) ) ) ) )
| ( nil != X3
& ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ~ ssList(X11)
| app(app(X10,cons(X9,nil)),X11) != X3
| ? [X12] :
( ssItem(X12)
& ~ leq(X12,X9)
& memberP(X10,X12)
& memberP(X11,X12)
& leq(X9,X12) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_3,negated_conjecture,
! [X476,X477,X478,X483] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& nil != esk48_0
& ( ssItem(esk52_3(X476,X477,X478))
| ~ ssList(X478)
| app(app(X477,cons(X476,nil)),X478) != esk48_0
| ~ ssList(X477)
| ~ ssItem(X476) )
& ( memberP(X477,esk52_3(X476,X477,X478))
| ~ ssList(X478)
| app(app(X477,cons(X476,nil)),X478) != esk48_0
| ~ ssList(X477)
| ~ ssItem(X476) )
& ( memberP(X478,esk52_3(X476,X477,X478))
| ~ ssList(X478)
| app(app(X477,cons(X476,nil)),X478) != esk48_0
| ~ ssList(X477)
| ~ ssItem(X476) )
& ( lt(X476,esk52_3(X476,X477,X478))
| ~ ssList(X478)
| app(app(X477,cons(X476,nil)),X478) != esk48_0
| ~ ssList(X477)
| ~ ssItem(X476) )
& ( ~ leq(X476,esk52_3(X476,X477,X478))
| ~ ssList(X478)
| app(app(X477,cons(X476,nil)),X478) != esk48_0
| ~ ssList(X477)
| ~ ssItem(X476) )
& ( ssItem(esk53_0)
| nil = esk50_0 )
& ( ssList(esk54_0)
| nil = esk50_0 )
& ( ssList(esk55_0)
| nil = esk50_0 )
& ( app(app(esk54_0,cons(esk53_0,nil)),esk55_0) = esk50_0
| nil = esk50_0 )
& ( ~ ssItem(X483)
| leq(X483,esk53_0)
| ~ memberP(esk54_0,X483)
| ~ memberP(esk55_0,X483)
| ~ leq(esk53_0,X483)
| 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_2])])])])]) ).
cnf(c_0_4,negated_conjecture,
( app(app(esk54_0,cons(esk53_0,nil)),esk55_0) = esk50_0
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
nil != esk48_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
( ssList(esk55_0)
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
( ssList(esk54_0)
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( ssItem(esk53_0)
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_10,plain,
! [X465,X466] :
( ( X465 != X466
| ~ lt(X465,X466)
| ~ ssItem(X466)
| ~ ssItem(X465) )
& ( leq(X465,X466)
| ~ lt(X465,X466)
| ~ ssItem(X466)
| ~ ssItem(X465) )
& ( X465 = X466
| ~ leq(X465,X466)
| lt(X465,X466)
| ~ ssItem(X466)
| ~ ssItem(X465) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax93])])])]) ).
cnf(c_0_11,negated_conjecture,
( lt(X1,esk52_3(X1,X2,X3))
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
app(app(esk54_0,cons(esk53_0,nil)),esk55_0) = esk48_0,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_5]),c_0_6]) ).
cnf(c_0_13,negated_conjecture,
ssList(esk55_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_5]),c_0_6]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk54_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_5]),c_0_6]) ).
cnf(c_0_15,negated_conjecture,
ssItem(esk53_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_5]),c_0_6]) ).
cnf(c_0_16,negated_conjecture,
( ssItem(esk52_3(X1,X2,X3))
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_17,negated_conjecture,
( ~ leq(X1,esk52_3(X1,X2,X3))
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_18,plain,
( leq(X1,X2)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
lt(esk53_0,esk52_3(esk53_0,esk54_0,esk55_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14]),c_0_15])]) ).
cnf(c_0_20,negated_conjecture,
ssItem(esk52_3(esk53_0,esk54_0,esk55_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_12]),c_0_13]),c_0_14]),c_0_15])]) ).
cnf(c_0_21,negated_conjecture,
~ leq(esk53_0,esk52_3(esk53_0,esk54_0,esk55_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_12]),c_0_13]),c_0_14]),c_0_15])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_15])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC241+1 : TPTP v9.2.1. Released v2.4.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.14/0.32 % Computer : n014.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Tue May 5 04:37:51 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 1.36/1.74 % Version : CSE_E---1.7
% 1.36/1.74 % Problem : theBenchmark.p
% 1.36/1.74 % SZS status Theorem for theBenchmark.p
% 1.36/1.74 % SZS output start CNFRefutation
% See solution above
% 1.36/1.74 % Total time : 1.371s
%------------------------------------------------------------------------------