%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC080-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 : n003.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:11 PM UTC 2026
% Result : Unsatisfiable 101.94s 57.13s
% Output : CNFRefutation 102.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of clauses : 44 ( 19 unt; 1 nHn; 42 RR)
% Number of literals : 101 ( 10 equ; 61 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 : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 34 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_14,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_16,negated_conjecture,
( neq(sk5,nil)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_18,negated_conjecture,
( frontsegP(sk3,sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_17,negated_conjecture,
( frontsegP(sk4,sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_15,negated_conjecture,
( ssList(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(c_0_16,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_17,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_18,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_19,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_20,axiom,
ssList(nil),
clause8 ).
cnf(c_0_21,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_22,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| ~ neq(sk4,nil) ),
co1_14 ).
cnf(c_0_23,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_24,negated_conjecture,
neq(sk2,nil),
c_0_17 ).
cnf(c_0_25,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_26,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_27,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_28,negated_conjecture,
( ~ neq(X1,nil)
| ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_29,plain,
( segmentP(X1,X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_30,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_31,negated_conjecture,
( ~ neq(X1,nil)
| ~ frontsegP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_32,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_33,negated_conjecture,
( neq(sk5,nil)
| ~ neq(sk4,nil) ),
co1_16 ).
cnf(c_0_34,negated_conjecture,
( frontsegP(sk3,sk5)
| ~ neq(sk4,nil) ),
co1_18 ).
cnf(c_0_35,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_36,negated_conjecture,
( frontsegP(sk4,sk5)
| ~ neq(sk4,nil) ),
co1_17 ).
cnf(c_0_37,negated_conjecture,
( ssList(sk5)
| ~ neq(sk4,nil) ),
co1_15 ).
cnf(c_0_38,negated_conjecture,
( ~ neq(X1,nil)
| ~ frontsegP(sk1,X1)
| ~ frontsegP(sk2,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_29]),c_0_32])]) ).
cnf(c_0_39,negated_conjecture,
neq(sk5,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_23]),c_0_24])]) ).
cnf(c_0_40,negated_conjecture,
frontsegP(sk1,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_23]),c_0_24])]) ).
cnf(c_0_41,negated_conjecture,
frontsegP(sk2,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_23]),c_0_23]),c_0_24])]) ).
cnf(c_0_42,negated_conjecture,
ssList(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_23]),c_0_24])]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC080-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.10 % 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.12/0.31 % Computer : n003.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Tue May 5 04:23:56 EDT 2026
% 0.12/0.31 % CPUTime :
% 0.12/0.32 % start to proof: theBenchmark
% 101.94/57.13 % Version : CSE_E---1.7
% 101.94/57.13 % Problem : theBenchmark.p
% 101.94/57.13 % SZS status Unsatisfiable for theBenchmark.p
% 101.94/57.13 % SZS output start CNFRefutation
% See solution above
% 102.31/57.51 % Total time : 42.227s
%------------------------------------------------------------------------------