%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC109-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 : n017.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:19 PM UTC 2026
% Result : Unsatisfiable 1.40s 1.75s
% Output : CNFRefutation 1.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 19
% Syntax : Number of clauses : 55 ( 17 unt; 12 nHn; 55 RR)
% Number of literals : 126 ( 48 equ; 68 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_23,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_23) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(co1_11,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_7,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_18,negated_conjecture,
( app(app(sk6,sk3),sk7) = sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_16,negated_conjecture,
( ssList(sk7)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(co1_15,negated_conjecture,
( ssList(sk6)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_22,negated_conjecture,
( nil = sk2
| ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_22) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause172,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(c_0_19,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
co1_23 ).
cnf(c_0_20,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_21,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_22,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_23,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
co1_11 ).
cnf(c_0_24,axiom,
ssList(nil),
clause8 ).
cnf(c_0_25,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
co1_7 ).
cnf(c_0_26,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause115 ).
cnf(c_0_27,negated_conjecture,
( neq(sk4,nil)
| sk3 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_28,negated_conjecture,
( sk4 = nil
| sk3 != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),c_0_25]) ).
cnf(c_0_29,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( neq(nil,nil)
| sk3 != nil ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( app(app(sk6,sk3),sk7) = sk4
| nil = sk3 ),
co1_18 ).
cnf(c_0_32,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_24])]) ).
cnf(c_0_33,negated_conjecture,
( ssList(sk7)
| nil = sk3 ),
co1_16 ).
cnf(c_0_34,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause118 ).
cnf(c_0_35,negated_conjecture,
app(app(sk6,sk3),sk7) = sk4,
inference(sr,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
ssList(sk7),
inference(sr,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( ssList(sk6)
| nil = sk3 ),
co1_15 ).
cnf(c_0_38,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_39,negated_conjecture,
( app(sk6,sk3) = nil
| sk4 != nil
| ~ ssList(app(sk6,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_40,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_41,negated_conjecture,
ssList(sk6),
inference(sr,[status(thm)],[c_0_37,c_0_32]) ).
cnf(c_0_42,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_38,c_0_21]) ).
cnf(c_0_43,negated_conjecture,
( nil = sk2
| ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
co1_22 ).
cnf(c_0_44,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause119 ).
cnf(c_0_45,negated_conjecture,
( app(sk6,sk3) = nil
| sk4 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42])]) ).
cnf(c_0_46,negated_conjecture,
( sk4 = nil
| ~ neq(sk3,nil)
| ~ segmentP(sk4,sk3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_20]),c_0_20]),c_0_21]),c_0_21]) ).
cnf(c_0_47,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_48,negated_conjecture,
sk4 != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_42]),c_0_41])]),c_0_32]) ).
cnf(c_0_49,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause172 ).
cnf(c_0_50,negated_conjecture,
~ segmentP(sk4,sk3),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_42]),c_0_24])]),c_0_48]),c_0_32]) ).
cnf(c_0_51,negated_conjecture,
( segmentP(sk4,X1)
| ~ segmentP(sk3,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_35]),c_0_41]),c_0_36]),c_0_42])]) ).
cnf(c_0_52,negated_conjecture,
~ segmentP(sk3,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_42])]) ).
cnf(c_0_53,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
clause57 ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC109-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.16/0.33 % Computer : n017.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 04:25:43 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.40/1.75 % Version : CSE_E---1.7
% 1.40/1.75 % Problem : theBenchmark.p
% 1.40/1.75 % SZS status Unsatisfiable for theBenchmark.p
% 1.40/1.75 % SZS output start CNFRefutation
% See solution above
% 1.40/1.75 % Total time : 1.369s
%------------------------------------------------------------------------------