%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC193-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 : n008.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:41 PM UTC 2026
% Result : Unsatisfiable 1.38s 1.75s
% Output : CNFRefutation 1.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 28
% Syntax : Number of clauses : 83 ( 33 unt; 3 nHn; 81 RR)
% Number of literals : 208 ( 60 equ; 129 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 67 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_12,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_10,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_8,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_11,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause64,axiom,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause64) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause180,axiom,
( X2 = X3
| app(X1,cons(X2,cons(X3,X4))) != X5
| ~ ssList(X4)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ equalelemsP(X5)
| ~ ssList(X5) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause180) ).
cnf(co1_9,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_14,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_13,negated_conjecture,
sk5 != sk6,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause127,axiom,
( X2 = X1
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause127) ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(c_0_28,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
co1_12 ).
cnf(c_0_29,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_30,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk3,
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_32,negated_conjecture,
ssList(sk7),
co1_10 ).
cnf(c_0_33,negated_conjecture,
( app(app(sk7,app(cons(sk5,nil),cons(sk6,nil))),sk8) = sk3
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_34,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_35,negated_conjecture,
ssItem(sk5),
co1_8 ).
cnf(c_0_36,negated_conjecture,
( app(app(sk7,cons(sk5,cons(sk6,nil))),sk8) = sk3
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_37,negated_conjecture,
ssList(sk8),
co1_11 ).
cnf(c_0_38,negated_conjecture,
( app(sk7,app(cons(sk5,cons(sk6,nil)),sk8)) = sk3
| ~ ssList(cons(sk5,cons(sk6,nil)))
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_36]),c_0_32]),c_0_37])]) ).
cnf(c_0_39,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_40,axiom,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
clause64 ).
cnf(c_0_41,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
clause101 ).
cnf(c_0_42,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_43,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_44,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause118 ).
cnf(c_0_45,axiom,
( X2 = X3
| app(X1,cons(X2,cons(X3,X4))) != X5
| ~ ssList(X4)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ equalelemsP(X5)
| ~ ssList(X5) ),
clause180 ).
cnf(c_0_46,negated_conjecture,
( app(sk7,cons(sk5,app(cons(sk6,nil),sk8))) = sk3
| ~ ssList(cons(sk5,cons(sk6,nil)))
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_35]),c_0_37])]) ).
cnf(c_0_47,negated_conjecture,
ssItem(sk6),
co1_9 ).
cnf(c_0_48,plain,
( equalelemsP(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_49,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
co1_14 ).
cnf(c_0_50,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_43,c_0_29]) ).
cnf(c_0_51,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_52,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_53,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),cons(sk6,nil)) = nil
| sk3 != nil
| ~ ssList(app(app(sk7,cons(sk5,nil)),cons(sk6,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_30]),c_0_37])]) ).
cnf(c_0_54,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_55,plain,
( X1 = X2
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(app(X3,cons(X1,cons(X2,X4))))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ equalelemsP(app(X3,cons(X1,cons(X2,X4)))) ),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_56,negated_conjecture,
( app(sk7,cons(sk5,cons(sk6,sk8))) = sk3
| ~ ssList(cons(sk5,cons(sk6,nil)))
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_34]),c_0_47]),c_0_37])]) ).
cnf(c_0_57,negated_conjecture,
sk5 != sk6,
co1_13 ).
cnf(c_0_58,negated_conjecture,
( equalelemsP(sk3)
| ~ neq(sk4,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_59,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_60,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_61,axiom,
ssList(nil),
clause8 ).
cnf(c_0_62,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause119 ).
cnf(c_0_63,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),cons(sk6,nil)) = nil
| sk3 != nil
| ~ ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(cons(sk6,nil)) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_64,negated_conjecture,
( ~ ssList(cons(sk5,cons(sk6,nil)))
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil))
| ~ equalelemsP(sk3) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_47]),c_0_35]),c_0_50]),c_0_37]),c_0_32])]),c_0_57]) ).
cnf(c_0_65,negated_conjecture,
( sk4 = nil
| equalelemsP(sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_61])]) ).
cnf(c_0_66,negated_conjecture,
( cons(sk6,nil) = nil
| sk3 != nil
| ~ ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(cons(sk6,nil)) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,negated_conjecture,
( sk4 = nil
| ~ ssList(cons(sk5,cons(sk6,nil)))
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_68,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_69,negated_conjecture,
( cons(sk6,nil) = nil
| sk3 != nil
| ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_54]),c_0_32])]) ).
cnf(c_0_70,negated_conjecture,
( sk4 = nil
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_35])]) ).
cnf(c_0_71,negated_conjecture,
( cons(sk6,nil) = nil
| sk3 != nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_68]),c_0_47]),c_0_61])]) ).
cnf(c_0_72,axiom,
( X2 = X1
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause127 ).
cnf(c_0_73,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_74,negated_conjecture,
( sk4 = nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_68]),c_0_47]),c_0_61])]) ).
cnf(c_0_75,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_76,negated_conjecture,
( cons(sk6,nil) = nil
| sk3 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_68]),c_0_35]),c_0_61])]) ).
cnf(c_0_77,negated_conjecture,
( sk3 = sk4
| ~ segmentP(sk3,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_60]),c_0_50])]) ).
cnf(c_0_78,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_68]),c_0_35]),c_0_61])]) ).
cnf(c_0_79,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_47]),c_0_61])]) ).
cnf(c_0_80,negated_conjecture,
~ segmentP(sk3,nil),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78]),c_0_78]),c_0_79]) ).
cnf(c_0_81,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
clause56 ).
cnf(c_0_82,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC193-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.11 % 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.13/0.32 % Computer : n008.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Tue May 5 04:33:43 EDT 2026
% 0.13/0.32 % CPUTime :
% 0.13/0.33 % start to proof: theBenchmark
% 1.38/1.75 % Version : CSE_E---1.7
% 1.38/1.75 % Problem : theBenchmark.p
% 1.38/1.75 % SZS status Unsatisfiable for theBenchmark.p
% 1.38/1.75 % SZS output start CNFRefutation
% See solution above
% 1.38/1.75 % Total time : 1.371s
%------------------------------------------------------------------------------