%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC240-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 : n029.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:51 PM UTC 2026
% Result : Unsatisfiable 6.77s 4.57s
% Output : CNFRefutation 6.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 29
% Syntax : Number of clauses : 103 ( 44 unt; 9 nHn; 88 RR)
% Number of literals : 228 ( 56 equ; 128 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 4 con; 0-3 aty)
% Number of variables : 115 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_13,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause58,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause58) ).
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause138) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(co1_7,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_14,negated_conjecture,
( sk6 = X1
| ~ ssItem(X1)
| ~ memberP(sk3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
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(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause179,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause169,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause169) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_9,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(c_0_29,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_30,negated_conjecture,
ssItem(sk6),
co1_13 ).
cnf(c_0_31,negated_conjecture,
( app(cons(sk6,nil),X1) = cons(sk6,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_33,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_34,negated_conjecture,
app(cons(sk6,nil),sk1) = cons(sk6,sk1),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
clause58 ).
cnf(c_0_36,negated_conjecture,
( ssList(cons(sk6,sk1))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_32])]) ).
cnf(c_0_37,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause138 ).
cnf(c_0_38,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause109 ).
cnf(c_0_39,negated_conjecture,
nil != sk1,
co1_7 ).
cnf(c_0_40,negated_conjecture,
( rearsegP(cons(sk6,sk1),nil)
| ~ ssList(cons(sk6,nil)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_42,axiom,
ssList(nil),
clause8 ).
cnf(c_0_43,negated_conjecture,
( sk6 = X1
| ~ ssItem(X1)
| ~ memberP(sk3,X1) ),
co1_14 ).
cnf(c_0_44,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_45,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_46,negated_conjecture,
cons(skaf83(sk1),skaf82(sk1)) = sk1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_32]),c_0_39]) ).
cnf(c_0_47,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_48,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_49,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause131 ).
cnf(c_0_50,negated_conjecture,
rearsegP(cons(sk6,sk1),nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_30]),c_0_42])]) ).
cnf(c_0_51,negated_conjecture,
( sk6 = X1
| ~ memberP(sk1,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_52,negated_conjecture,
memberP(sk1,skaf83(sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48])]) ).
cnf(c_0_53,plain,
( rearsegP(cons(X1,X2),nil)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_41]) ).
cnf(c_0_54,negated_conjecture,
( app(skaf46(cons(sk6,sk1),nil),nil) = cons(sk6,sk1)
| ~ ssList(cons(sk6,sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_42])]) ).
cnf(c_0_55,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_56,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_57,negated_conjecture,
skaf83(sk1) = sk6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_47])]) ).
cnf(c_0_58,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_59,negated_conjecture,
( rearsegP(cons(sk6,X1),nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_30]) ).
cnf(c_0_60,negated_conjecture,
( app(skaf46(cons(sk6,sk1),nil),nil) = cons(sk6,sk1)
| ~ ssList(cons(sk6,nil)) ),
inference(spm,[status(thm)],[c_0_54,c_0_36]) ).
cnf(c_0_61,plain,
app(skaf46(X1,X2),nil) = skaf46(X1,X2),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
clause179 ).
cnf(c_0_63,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_64,negated_conjecture,
cons(sk6,skaf82(sk1)) = sk1,
inference(rw,[status(thm)],[c_0_46,c_0_57]) ).
cnf(c_0_65,negated_conjecture,
ssItem(hd(sk1)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_32]),c_0_39]) ).
cnf(c_0_66,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause97 ).
cnf(c_0_67,negated_conjecture,
rearsegP(cons(sk6,nil),nil),
inference(spm,[status(thm)],[c_0_59,c_0_42]) ).
cnf(c_0_68,negated_conjecture,
( skaf46(cons(sk6,sk1),nil) = cons(sk6,sk1)
| ~ ssList(cons(sk6,nil)) ),
inference(rw,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_69,plain,
( ~ ssItem(X1)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4))) ),
inference(er,[status(thm)],[c_0_62]) ).
cnf(c_0_70,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_71,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_72,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_73,negated_conjecture,
skaf82(sk1) = tl(sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_30]),c_0_48])]) ).
cnf(c_0_74,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_75,negated_conjecture,
( memberP(cons(hd(sk1),X1),hd(sk1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_65]) ).
cnf(c_0_76,negated_conjecture,
hd(sk1) = sk6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_64]),c_0_30]),c_0_48])]) ).
cnf(c_0_77,negated_conjecture,
( skaf46(cons(sk6,nil),nil) = cons(sk6,nil)
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_67]),c_0_61]),c_0_42])]) ).
cnf(c_0_78,negated_conjecture,
skaf46(cons(sk6,sk1),nil) = cons(sk6,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_41]),c_0_30]),c_0_42])]) ).
cnf(c_0_79,plain,
( ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ duplicatefreeP(app(X1,cons(X2,X3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]),c_0_72])]) ).
cnf(c_0_80,negated_conjecture,
cons(sk6,tl(sk1)) = sk1,
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_57]),c_0_32])]),c_0_39]),c_0_73]) ).
cnf(c_0_81,negated_conjecture,
ssList(tl(sk1)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_32]),c_0_39]) ).
cnf(c_0_82,negated_conjecture,
( memberP(cons(sk6,X1),sk6)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76]),c_0_76]) ).
cnf(c_0_83,negated_conjecture,
skaf46(cons(sk6,nil),nil) = cons(sk6,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_41]),c_0_30]),c_0_42])]) ).
cnf(c_0_84,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_85,negated_conjecture,
ssList(cons(sk6,sk1)),
inference(spm,[status(thm)],[c_0_56,c_0_78]) ).
cnf(c_0_86,negated_conjecture,
( ~ memberP(X1,sk6)
| ~ ssList(app(X1,sk1))
| ~ ssList(X1)
| ~ duplicatefreeP(app(X1,sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_30]),c_0_81])]) ).
cnf(c_0_87,negated_conjecture,
memberP(cons(sk6,nil),sk6),
inference(spm,[status(thm)],[c_0_82,c_0_42]) ).
cnf(c_0_88,negated_conjecture,
ssList(cons(sk6,nil)),
inference(spm,[status(thm)],[c_0_56,c_0_83]) ).
cnf(c_0_89,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_90,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(cons(sk6,sk1)) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_91,negated_conjecture,
~ duplicatefreeP(cons(sk6,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_34]),c_0_87]),c_0_85]),c_0_88])]) ).
cnf(c_0_92,plain,
( app(nil,cons(X1,X2)) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_89,c_0_41]) ).
cnf(c_0_93,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
co1_9 ).
cnf(c_0_94,negated_conjecture,
ssItem(X1),
inference(sr,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_95,negated_conjecture,
( app(nil,cons(sk6,X1)) = cons(sk6,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_92,c_0_30]) ).
cnf(c_0_96,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_97,negated_conjecture,
( memberP(X1,sk5(X2,X1,X3))
| app(app(X1,cons(X3,nil)),X2) != sk1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_94])]) ).
cnf(c_0_98,negated_conjecture,
app(nil,cons(sk6,nil)) = cons(sk6,nil),
inference(spm,[status(thm)],[c_0_95,c_0_42]) ).
cnf(c_0_99,plain,
~ memberP(nil,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_94])]) ).
cnf(c_0_100,negated_conjecture,
( app(cons(sk6,nil),X1) != sk1
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_42])]),c_0_99]) ).
cnf(c_0_101,negated_conjecture,
app(cons(sk6,nil),tl(sk1)) = sk1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_81]),c_0_80]) ).
cnf(c_0_102,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_81]),c_0_101])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC240-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.14/0.33 % Computer : n029.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue May 5 04:37:29 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 6.77/4.57 % Version : CSE_E---1.7
% 6.77/4.57 % Problem : theBenchmark.p
% 6.77/4.57 % SZS status Unsatisfiable for theBenchmark.p
% 6.77/4.57 % SZS output start CNFRefutation
% See solution above
% 6.77/4.59 % Total time : 3.372s
%------------------------------------------------------------------------------