%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC092+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 : n009.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:14 PM UTC 2026
% Result : Theorem 1.67s 1.82s
% Output : CNFRefutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 46 ( 18 unt; 0 def)
% Number of atoms : 182 ( 39 equ)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 220 ( 84 ~; 77 |; 38 &)
% ( 2 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 65 ( 0 sgn 35 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ! [X6] :
( ssList(X6)
=> ( app(X3,X6) != X4
| ~ strictorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(cons(X7,nil),X8) = X6
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(X10,cons(X9,nil)) = X3
& lt(X9,X7) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
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(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ! [X6] :
( ssList(X6)
=> ( app(X3,X6) != X4
| ~ strictorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(cons(X7,nil),X8) = X6
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(X10,cons(X9,nil)) = X3
& lt(X9,X7) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_9,plain,
! [X245,X246,X249,X250] :
( ( ssList(esk8_2(X245,X246))
| ~ segmentP(X245,X246)
| ~ ssList(X246)
| ~ ssList(X245) )
& ( ssList(esk9_2(X245,X246))
| ~ segmentP(X245,X246)
| ~ ssList(X246)
| ~ ssList(X245) )
& ( app(app(esk8_2(X245,X246),X246),esk9_2(X245,X246)) = X245
| ~ segmentP(X245,X246)
| ~ ssList(X246)
| ~ ssList(X245) )
& ( ~ ssList(X249)
| ~ ssList(X250)
| app(app(X249,X246),X250) != X245
| segmentP(X245,X246)
| ~ ssList(X246)
| ~ ssList(X245) ) ),
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_10,negated_conjecture,
! [X472,X474,X475,X476,X477] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& neq(esk49_0,nil)
& ( ~ ssList(X472)
| ~ neq(X472,nil)
| ~ segmentP(esk49_0,X472)
| ~ segmentP(esk48_0,X472) )
& ssList(esk52_0)
& app(esk50_0,esk52_0) = esk51_0
& strictorderedP(esk50_0)
& ( ~ ssItem(X474)
| ~ ssList(X475)
| app(cons(X474,nil),X475) != esk52_0
| ~ ssItem(X476)
| ~ ssList(X477)
| app(X477,cons(X476,nil)) != esk50_0
| ~ lt(X476,X474) )
& ( nil = esk51_0
| nil != esk50_0 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
cnf(c_0_11,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_9]) ).
fof(c_0_12,plain,
! [X352] :
( ~ ssList(X352)
| app(nil,X352) = X352 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_13,plain,
! [X347,X348] :
( ~ ssList(X347)
| ~ ssList(X348)
| ssList(app(X347,X348)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_14,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk49_0,X1)
| ~ segmentP(esk48_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_17,plain,
! [X406] :
( ~ ssList(X406)
| segmentP(X406,X406) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,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_11]) ).
cnf(c_0_20,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_22,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,negated_conjecture,
( ~ segmentP(esk50_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_24,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_26,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[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_27,negated_conjecture,
app(esk50_0,esk52_0) = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_29,negated_conjecture,
( ~ segmentP(esk51_0,esk50_0)
| ~ neq(esk50_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_30,negated_conjecture,
segmentP(esk51_0,esk50_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25]),c_0_28])]) ).
fof(c_0_31,plain,
! [X326,X327] :
( ( ~ neq(X326,X327)
| X326 != X327
| ~ ssList(X327)
| ~ ssList(X326) )
& ( X326 = X327
| neq(X326,X327)
| ~ ssList(X327)
| ~ ssList(X326) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
fof(c_0_32,plain,
! [X411] :
( ~ ssList(X411)
| segmentP(X411,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
cnf(c_0_33,negated_conjecture,
~ neq(esk50_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_34,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_35,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_36,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_37,negated_conjecture,
neq(esk49_0,nil),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_38,negated_conjecture,
( nil = esk51_0
| nil != esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_39,negated_conjecture,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_21]),c_0_25])]) ).
cnf(c_0_40,negated_conjecture,
( ~ segmentP(esk51_0,nil)
| ~ neq(nil,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_35]),c_0_21]),c_0_25])]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_36,c_0_16]) ).
cnf(c_0_42,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_37,c_0_16]) ).
cnf(c_0_43,negated_conjecture,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
cnf(c_0_44,negated_conjecture,
~ neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_35]),c_0_41])]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC092+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 : n009.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:24:56 EDT 2026
% 0.13/0.32 % CPUTime :
% 0.13/0.33 % start to proof: theBenchmark
% 1.67/1.82 % Version : CSE_E---1.7
% 1.67/1.82 % Problem : theBenchmark.p
% 1.67/1.82 % SZS status Theorem for theBenchmark.p
% 1.67/1.82 % SZS output start CNFRefutation
% See solution above
% 1.67/1.82 % Total time : 1.375s
%------------------------------------------------------------------------------