%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC118+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 : n018.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:21 PM UTC 2026
% Result : Theorem 1.30s 1.73s
% Output : CNFRefutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 15 unt; 0 def)
% Number of atoms : 166 ( 51 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 209 ( 73 ~; 68 |; 50 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn 30 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X5,X3),X6) != X4
| ~ totalorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X3
& leq(X7,X9) ) ) ) )
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(cons(X11,nil),X12) = X6
& ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssList(X14)
& app(X14,cons(X13,nil)) = X3
& leq(X13,X11) ) ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( nil = X2
& nil = X1 )
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X5,X3),X6) != X4
| ~ totalorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X3
& leq(X7,X9) ) ) ) )
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(cons(X11,nil),X12) = X6
& ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssList(X14)
& app(X14,cons(X13,nil)) = X3
& leq(X13,X11) ) ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( nil = X2
& nil = X1 )
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_5,plain,
! [X253,X254,X257,X258] :
( ( ssList(esk8_2(X253,X254))
| ~ segmentP(X253,X254)
| ~ ssList(X254)
| ~ ssList(X253) )
& ( ssList(esk9_2(X253,X254))
| ~ segmentP(X253,X254)
| ~ ssList(X254)
| ~ ssList(X253) )
& ( app(app(esk8_2(X253,X254),X254),esk9_2(X253,X254)) = X253
| ~ segmentP(X253,X254)
| ~ ssList(X254)
| ~ ssList(X253) )
& ( ~ ssList(X257)
| ~ ssList(X258)
| app(app(X257,X254),X258) != X253
| segmentP(X253,X254)
| ~ ssList(X254)
| ~ ssList(X253) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])]) ).
fof(c_0_6,negated_conjecture,
! [X482,X483,X484,X485,X486,X487,X488,X489] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ssList(esk52_0)
& ssList(esk53_0)
& app(app(esk52_0,esk50_0),esk53_0) = esk51_0
& totalorderedP(esk50_0)
& ( ~ ssItem(X482)
| ~ ssList(X483)
| app(X483,cons(X482,nil)) != esk52_0
| ~ ssItem(X484)
| ~ ssList(X485)
| app(cons(X484,nil),X485) != esk50_0
| ~ leq(X482,X484) )
& ( ~ ssItem(X486)
| ~ ssList(X487)
| app(cons(X486,nil),X487) != esk53_0
| ~ ssItem(X488)
| ~ ssList(X489)
| app(X489,cons(X488,nil)) != esk50_0
| ~ leq(X488,X486) )
& ( nil = esk51_0
| nil != esk50_0 )
& ( nil != esk49_0
| nil != esk48_0 )
& ( ~ neq(esk48_0,nil)
| ~ segmentP(esk49_0,esk48_0) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_7,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( ~ neq(esk48_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
app(app(esk52_0,esk50_0),esk53_0) = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( nil != esk49_0
| nil != esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
( ~ segmentP(esk51_0,esk50_0)
| ~ neq(esk50_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_11]),c_0_9]),c_0_11]) ).
cnf(c_0_21,negated_conjecture,
segmentP(esk51_0,esk50_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]),c_0_17]),c_0_18])]) ).
fof(c_0_22,plain,
! [X334,X335] :
( ( ~ neq(X334,X335)
| X334 != X335
| ~ ssList(X335)
| ~ ssList(X334) )
& ( X334 = X335
| neq(X334,X335)
| ~ ssList(X335)
| ~ ssList(X334) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_23,negated_conjecture,
( nil = esk51_0
| nil != esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
( esk50_0 != nil
| esk51_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_11]),c_0_9]) ).
cnf(c_0_25,negated_conjecture,
~ neq(esk50_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_26,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_28,negated_conjecture,
esk50_0 != nil,
inference(csr,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,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_25,c_0_26]),c_0_27]),c_0_16])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC118+1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.11 % 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.32 % Computer : n018.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Tue May 5 04:27:47 EDT 2026
% 0.13/0.32 % CPUTime :
% 0.13/0.33 % start to proof: theBenchmark
% 1.30/1.73 % Version : CSE_E---1.7
% 1.30/1.73 % Problem : theBenchmark.p
% 1.30/1.73 % SZS status Theorem for theBenchmark.p
% 1.30/1.73 % SZS output start CNFRefutation
% See solution above
% 1.30/1.73 % Total time : 1.373s
%------------------------------------------------------------------------------