%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC279+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 : n026.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:19:00 PM UTC 2026
% Result : Theorem 1.34s 1.76s
% Output : CNFRefutation 1.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 23 ( 12 unt; 0 def)
% Number of atoms : 121 ( 18 equ)
% Maximal formula atoms : 33 ( 5 avg)
% Number of connectives : 150 ( 52 ~; 50 |; 32 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 20 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X3
& ? [X8] :
( ssItem(X8)
& ( ( ~ leq(X5,X8)
& memberP(X7,X8) )
| ( ~ leq(X8,X5)
& memberP(X6,X8) ) ) ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( app(app(X10,cons(X9,nil)),X11) != X1
| ! [X12] :
( ssItem(X12)
=> ( ( ~ memberP(X10,X12)
| leq(X12,X9) )
& ( ~ memberP(X11,X12)
| leq(X9,X12) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X3
& ? [X8] :
( ssItem(X8)
& ( ( ~ leq(X5,X8)
& memberP(X7,X8) )
| ( ~ leq(X8,X5)
& memberP(X6,X8) ) ) ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( app(app(X10,cons(X9,nil)),X11) != X1
| ! [X12] :
( ssItem(X12)
=> ( ( ~ memberP(X10,X12)
| leq(X12,X9) )
& ( ~ memberP(X11,X12)
| leq(X9,X12) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_2,negated_conjecture,
! [X476,X477,X478,X479] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ( leq(X476,X479)
| ~ memberP(X478,X479)
| ~ ssItem(X479)
| ~ ssList(X478)
| app(app(X477,cons(X476,nil)),X478) != esk50_0
| ~ ssList(X477)
| ~ ssItem(X476) )
& ( leq(X479,X476)
| ~ memberP(X477,X479)
| ~ ssItem(X479)
| ~ ssList(X478)
| app(app(X477,cons(X476,nil)),X478) != esk50_0
| ~ ssList(X477)
| ~ ssItem(X476) )
& ssItem(esk52_0)
& ssList(esk53_0)
& ssList(esk54_0)
& app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk48_0
& ssItem(esk55_0)
& ( memberP(esk54_0,esk55_0)
| memberP(esk53_0,esk55_0) )
& ( ~ leq(esk52_0,esk55_0)
| memberP(esk53_0,esk55_0) )
& ( memberP(esk54_0,esk55_0)
| ~ leq(esk55_0,esk52_0) )
& ( ~ leq(esk52_0,esk55_0)
| ~ leq(esk55_0,esk52_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_1])])])])]) ).
cnf(c_0_3,negated_conjecture,
app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( leq(X1,X2)
| ~ memberP(X3,X2)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(X4,cons(X1,nil)),X3) != esk50_0
| ~ ssList(X4)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk50_0,
inference(rw,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
ssList(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( leq(X1,X2)
| ~ memberP(X3,X1)
| ~ ssItem(X1)
| ~ ssList(X4)
| app(app(X3,cons(X2,nil)),X4) != esk50_0
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( leq(esk52_0,X1)
| ~ memberP(esk54_0,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_8]),c_0_9])]) ).
cnf(c_0_12,negated_conjecture,
( memberP(esk54_0,esk55_0)
| memberP(esk53_0,esk55_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
ssItem(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
( memberP(esk53_0,esk55_0)
| ~ leq(esk52_0,esk55_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
( leq(X1,esk52_0)
| ~ memberP(esk53_0,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_6]),c_0_8]),c_0_7]),c_0_9])]) ).
cnf(c_0_16,negated_conjecture,
memberP(esk53_0,esk55_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( memberP(esk54_0,esk55_0)
| ~ leq(esk55_0,esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_18,negated_conjecture,
leq(esk55_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_13])]) ).
cnf(c_0_19,negated_conjecture,
( ~ leq(esk52_0,esk55_0)
| ~ leq(esk55_0,esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_20,negated_conjecture,
memberP(esk54_0,esk55_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
~ leq(esk52_0,esk55_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_18])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_20]),c_0_13])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC279+1 : TPTP v9.2.1. Released v2.4.0.
% 0.11/0.13 % 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.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue May 5 04:41:53 EDT 2026
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % start to proof: theBenchmark
% 1.34/1.76 % Version : CSE_E---1.7
% 1.34/1.76 % Problem : theBenchmark.p
% 1.34/1.76 % SZS status Theorem for theBenchmark.p
% 1.34/1.76 % SZS output start CNFRefutation
% See solution above
% 1.34/1.76 % Total time : 1.372s
%------------------------------------------------------------------------------