%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC018-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 : n023.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:17:55 PM UTC 2026
% Result : Unsatisfiable 1.32s 1.72s
% Output : CNFRefutation 1.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of clauses : 48 ( 19 unt; 2 nHn; 48 RR)
% Number of literals : 109 ( 41 equ; 64 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_7,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_15,negated_conjecture,
( nil != sk1
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(sk2,X1)
| ~ frontsegP(sk1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_14,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause61,axiom,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause61) ).
cnf(co1_13,negated_conjecture,
( nil = sk2
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(sk2,X1)
| ~ frontsegP(sk1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_11,negated_conjecture,
( nil = sk4
| nil != sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(c_0_17,negated_conjecture,
app(sk3,sk5) = sk4,
co1_8 ).
cnf(c_0_18,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_19,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_20,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause119 ).
cnf(c_0_21,negated_conjecture,
app(sk1,sk5) = sk2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_23,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_24,negated_conjecture,
( sk5 = nil
| sk2 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_25,negated_conjecture,
( nil != sk1
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(sk2,X1)
| ~ frontsegP(sk1,X1) ),
co1_15 ).
cnf(c_0_26,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
co1_14 ).
cnf(c_0_27,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_28,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_29,negated_conjecture,
( app(sk1,nil) = sk2
| sk2 != nil ),
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( sk1 != nil
| ~ frontsegP(sk1,sk2)
| ~ frontsegP(sk2,sk2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_31,negated_conjecture,
( sk1 = sk2
| sk2 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_23])]) ).
cnf(c_0_32,negated_conjecture,
( sk2 != nil
| ~ frontsegP(sk2,sk2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,axiom,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
clause61 ).
cnf(c_0_34,negated_conjecture,
( nil = sk2
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(sk2,X1)
| ~ frontsegP(sk1,X1) ),
co1_13 ).
cnf(c_0_35,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_36,axiom,
ssList(nil),
clause8 ).
cnf(c_0_37,negated_conjecture,
sk2 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_27])]) ).
cnf(c_0_38,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause144 ).
cnf(c_0_39,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_40,negated_conjecture,
( nil = X1
| ~ frontsegP(sk1,X1)
| ~ frontsegP(sk2,X1)
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),c_0_37]) ).
cnf(c_0_41,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_38]),c_0_39]) ).
cnf(c_0_42,negated_conjecture,
( nil = sk4
| nil != sk3 ),
co1_11 ).
cnf(c_0_43,negated_conjecture,
( sk1 = nil
| ~ frontsegP(sk2,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_33]),c_0_23])]) ).
cnf(c_0_44,negated_conjecture,
frontsegP(sk2,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_45,negated_conjecture,
( sk2 = nil
| sk1 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_19]),c_0_18]) ).
cnf(c_0_46,negated_conjecture,
sk1 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC018-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 : n023.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:15:24 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.32/1.72 % Version : CSE_E---1.7
% 1.32/1.72 % Problem : theBenchmark.p
% 1.32/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.32/1.72 % SZS output start CNFRefutation
% See solution above
% 1.32/1.72 % Total time : 1.367s
%------------------------------------------------------------------------------