%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC048-1 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n005.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:03 PM UTC 2026
% Result : Unsatisfiable 1.29s 1.72s
% Output : CNFRefutation 1.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of clauses : 45 ( 16 unt; 9 nHn; 45 RR)
% Number of literals : 97 ( 31 equ; 49 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( nil = sk2
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ rearsegP(sk2,X1)
| ~ rearsegP(sk1,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_11,negated_conjecture,
( nil = sk4
| neq(sk3,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_12,negated_conjecture,
( nil = sk4
| rearsegP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_10,negated_conjecture,
( nil != sk1
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ rearsegP(sk2,X1)
| ~ rearsegP(sk1,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_9,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(clause59,axiom,
( rearsegP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause59) ).
cnf(clause81,axiom,
( rearsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause81) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_14,negated_conjecture,
( nil = sk3
| rearsegP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(clause58,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause58) ).
cnf(clause82,axiom,
( nil = X1
| ~ rearsegP(nil,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause82) ).
cnf(c_0_15,negated_conjecture,
( nil = sk2
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ rearsegP(sk2,X1)
| ~ rearsegP(sk1,X1) ),
co1_8 ).
cnf(c_0_16,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_17,negated_conjecture,
( nil = sk4
| neq(sk3,nil) ),
co1_11 ).
cnf(c_0_18,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_19,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_20,negated_conjecture,
( nil = sk4
| rearsegP(sk4,sk3) ),
co1_12 ).
cnf(c_0_21,negated_conjecture,
( nil != sk1
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ rearsegP(sk2,X1)
| ~ rearsegP(sk1,X1) ),
co1_10 ).
cnf(c_0_22,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
co1_9 ).
cnf(c_0_23,negated_conjecture,
( sk2 = nil
| ~ neq(X1,nil)
| ~ rearsegP(sk3,X1)
| ~ rearsegP(sk2,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,negated_conjecture,
( sk2 = nil
| neq(sk3,nil) ),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_26,negated_conjecture,
( sk2 = nil
| rearsegP(sk2,sk3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_18]),c_0_18]) ).
cnf(c_0_27,negated_conjecture,
( sk3 != nil
| ~ neq(X1,nil)
| ~ rearsegP(sk3,X1)
| ~ rearsegP(sk2,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_16]),c_0_16]) ).
cnf(c_0_28,negated_conjecture,
( neq(sk2,nil)
| sk3 != nil ),
inference(rw,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_29,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_30,negated_conjecture,
( sk2 = nil
| ~ rearsegP(sk3,sk3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),c_0_26]) ).
cnf(c_0_31,axiom,
( rearsegP(X1,X1)
| ~ ssList(X1) ),
clause59 ).
cnf(c_0_32,axiom,
( rearsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
clause81 ).
cnf(c_0_33,axiom,
ssList(nil),
clause8 ).
cnf(c_0_34,negated_conjecture,
( sk3 != nil
| ~ rearsegP(sk3,sk2)
| ~ rearsegP(sk2,sk2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_35,negated_conjecture,
sk2 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_25])]) ).
cnf(c_0_36,plain,
rearsegP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_32]),c_0_33])]) ).
cnf(c_0_37,negated_conjecture,
( nil = sk3
| rearsegP(sk4,sk3) ),
co1_14 ).
cnf(c_0_38,negated_conjecture,
( sk3 != nil
| ~ rearsegP(sk3,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_35]),c_0_35]),c_0_36])]) ).
cnf(c_0_39,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
clause58 ).
cnf(c_0_40,negated_conjecture,
( sk3 = nil
| rearsegP(sk2,sk3) ),
inference(rw,[status(thm)],[c_0_37,c_0_18]) ).
cnf(c_0_41,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_25])]) ).
cnf(c_0_42,axiom,
( nil = X1
| ~ rearsegP(nil,X1)
| ~ ssList(X1) ),
clause82 ).
cnf(c_0_43,negated_conjecture,
rearsegP(nil,sk3),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_35]),c_0_41]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_25])]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC048-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n005.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 04:19:00 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.29/1.72 % Version : CSE_E---1.7
% 1.29/1.72 % Problem : theBenchmark.p
% 1.29/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.29/1.72 % SZS output start CNFRefutation
% See solution above
% 1.29/1.72 % Total time : 1.374s
%------------------------------------------------------------------------------