%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC099-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 : 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:16 PM UTC 2026
% Result : Unsatisfiable 2.46s 2.04s
% Output : CNFRefutation 2.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 22
% Syntax : Number of clauses : 65 ( 26 unt; 10 nHn; 61 RR)
% Number of literals : 154 ( 36 equ; 88 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 47 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
frontsegP(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
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(co1_11,negated_conjecture,
( nil = sk2
| ~ neq(sk1,nil)
| ~ frontsegP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_9,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ frontsegP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ equalelemsP(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause84,axiom,
( nil = X1
| ~ frontsegP(nil,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause84) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(clause64,axiom,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause64) ).
cnf(clause178,axiom,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause178) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause60,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause60) ).
cnf(co1_8,negated_conjecture,
equalelemsP(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause79,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(co1_12,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(c_0_22,negated_conjecture,
frontsegP(sk4,sk3),
co1_7 ).
cnf(c_0_23,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_24,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_25,negated_conjecture,
( nil = sk2
| ~ neq(sk1,nil)
| ~ frontsegP(sk2,sk1) ),
co1_11 ).
cnf(c_0_26,negated_conjecture,
frontsegP(sk2,sk1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( sk2 = nil
| ~ neq(sk1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_28,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_29,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_30,axiom,
ssList(nil),
clause8 ).
cnf(c_0_31,negated_conjecture,
( sk1 = nil
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_32,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ frontsegP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ equalelemsP(X1) ),
co1_9 ).
cnf(c_0_33,axiom,
( nil = X1
| ~ frontsegP(nil,X1)
| ~ ssList(X1) ),
clause84 ).
cnf(c_0_34,negated_conjecture,
( sk1 = nil
| frontsegP(nil,sk1) ),
inference(spm,[status(thm)],[c_0_26,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( ~ neq(sk1,X1)
| ~ frontsegP(sk2,X1)
| ~ segmentP(X1,sk1)
| ~ ssList(X1)
| ~ equalelemsP(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_24]),c_0_23]),c_0_24]) ).
cnf(c_0_36,negated_conjecture,
sk1 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_29])]) ).
cnf(c_0_37,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
clause56 ).
cnf(c_0_38,negated_conjecture,
( ~ neq(nil,X1)
| ~ frontsegP(sk2,X1)
| ~ ssList(X1)
| ~ equalelemsP(X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_36]),c_0_37]) ).
cnf(c_0_39,axiom,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
clause64 ).
cnf(c_0_40,axiom,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
clause178 ).
cnf(c_0_41,negated_conjecture,
( ~ neq(nil,cons(X1,nil))
| ~ frontsegP(sk2,cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_43,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause109 ).
cnf(c_0_44,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_45,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_46,negated_conjecture,
( cons(X1,nil) = nil
| ~ frontsegP(sk2,cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_28]),c_0_30])]) ).
cnf(c_0_47,plain,
( nil = X1
| frontsegP(X1,cons(skaf83(X1),X2))
| ~ frontsegP(skaf82(X1),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45])]) ).
cnf(c_0_48,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_49,negated_conjecture,
( cons(skaf83(sk2),nil) = nil
| sk2 = nil
| ~ frontsegP(skaf82(sk2),nil)
| ~ ssList(cons(skaf83(sk2),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_44]),c_0_30]),c_0_48])]) ).
cnf(c_0_50,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
clause60 ).
cnf(c_0_51,negated_conjecture,
equalelemsP(sk3),
co1_8 ).
cnf(c_0_52,negated_conjecture,
( cons(skaf83(sk2),nil) = nil
| sk2 = nil
| ~ ssList(cons(skaf83(sk2),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_45])]) ).
cnf(c_0_53,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_54,negated_conjecture,
equalelemsP(sk1),
inference(rw,[status(thm)],[c_0_51,c_0_24]) ).
cnf(c_0_55,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
clause79 ).
cnf(c_0_56,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
co1_12 ).
cnf(c_0_57,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_58,negated_conjecture,
( cons(skaf83(sk2),nil) = nil
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_44]),c_0_30])]) ).
cnf(c_0_59,negated_conjecture,
( ~ neq(sk1,sk1)
| ~ segmentP(sk1,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_54]),c_0_26]),c_0_29])]) ).
cnf(c_0_60,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_55]),c_0_30])]) ).
cnf(c_0_61,negated_conjecture,
neq(sk2,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_36])]) ).
cnf(c_0_62,negated_conjecture,
sk2 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_44]),c_0_30])]) ).
cnf(c_0_63,negated_conjecture,
~ neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_36]),c_0_36]),c_0_36]),c_0_36]),c_0_60])]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62]),c_0_63]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC099-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.16/0.32 % Computer : n014.cluster.edu
% 0.16/0.32 % Model : x86_64 x86_64
% 0.16/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.32 % Memory : 8042.1875MB
% 0.16/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.32 % CPULimit : 300
% 0.16/0.32 % WCLimit : 300
% 0.16/0.32 % DateTime : Tue May 5 04:26:21 EDT 2026
% 0.16/0.32 % CPUTime :
% 0.16/0.33 % start to proof: theBenchmark
% 2.46/2.04 % Version : CSE_E---1.7
% 2.46/2.04 % Problem : theBenchmark.p
% 2.46/2.04 % SZS status Unsatisfiable for theBenchmark.p
% 2.46/2.04 % SZS output start CNFRefutation
% See solution above
% 2.46/2.05 % Total time : 1.372s
%------------------------------------------------------------------------------