TSTP Solution File: SWC119-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWC119-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n028.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 : Thu Aug 31 20:19:58 EDT 2023
% Result : Unsatisfiable 2.73s 2.80s
% Output : CNFRefutation 2.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 119
% Syntax : Number of formulae : 241 ( 51 unt; 73 typ; 0 def)
% Number of atoms : 446 ( 130 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 549 ( 271 ~; 278 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 82 ( 65 >; 17 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 54 ( 54 usr; 8 con; 0-2 aty)
% Number of variables : 205 ( 20 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
nil: $i ).
tff(decl_23,type,
equalelemsP: $i > $o ).
tff(decl_24,type,
duplicatefreeP: $i > $o ).
tff(decl_25,type,
strictorderedP: $i > $o ).
tff(decl_26,type,
totalorderedP: $i > $o ).
tff(decl_27,type,
strictorderP: $i > $o ).
tff(decl_28,type,
totalorderP: $i > $o ).
tff(decl_29,type,
cyclefreeP: $i > $o ).
tff(decl_30,type,
ssList: $i > $o ).
tff(decl_31,type,
skac3: $i ).
tff(decl_32,type,
ssItem: $i > $o ).
tff(decl_33,type,
skac2: $i ).
tff(decl_34,type,
singletonP: $i > $o ).
tff(decl_35,type,
skaf83: $i > $i ).
tff(decl_36,type,
skaf82: $i > $i ).
tff(decl_37,type,
skaf81: $i > $i ).
tff(decl_38,type,
skaf80: $i > $i ).
tff(decl_39,type,
skaf79: $i > $i ).
tff(decl_40,type,
skaf78: $i > $i ).
tff(decl_41,type,
skaf77: $i > $i ).
tff(decl_42,type,
skaf76: $i > $i ).
tff(decl_43,type,
skaf75: $i > $i ).
tff(decl_44,type,
skaf74: $i > $i ).
tff(decl_45,type,
skaf73: $i > $i ).
tff(decl_46,type,
skaf72: $i > $i ).
tff(decl_47,type,
skaf71: $i > $i ).
tff(decl_48,type,
skaf70: $i > $i ).
tff(decl_49,type,
skaf69: $i > $i ).
tff(decl_50,type,
skaf68: $i > $i ).
tff(decl_51,type,
skaf67: $i > $i ).
tff(decl_52,type,
skaf66: $i > $i ).
tff(decl_53,type,
skaf65: $i > $i ).
tff(decl_54,type,
skaf64: $i > $i ).
tff(decl_55,type,
skaf63: $i > $i ).
tff(decl_56,type,
skaf62: $i > $i ).
tff(decl_57,type,
skaf61: $i > $i ).
tff(decl_58,type,
skaf60: $i > $i ).
tff(decl_59,type,
skaf59: $i > $i ).
tff(decl_60,type,
skaf58: $i > $i ).
tff(decl_61,type,
skaf57: $i > $i ).
tff(decl_62,type,
skaf56: $i > $i ).
tff(decl_63,type,
skaf55: $i > $i ).
tff(decl_64,type,
skaf54: $i > $i ).
tff(decl_65,type,
skaf53: $i > $i ).
tff(decl_66,type,
skaf52: $i > $i ).
tff(decl_67,type,
skaf51: $i > $i ).
tff(decl_68,type,
skaf50: $i > $i ).
tff(decl_69,type,
skaf49: $i > $i ).
tff(decl_70,type,
skaf44: $i > $i ).
tff(decl_71,type,
skaf48: ( $i * $i ) > $i ).
tff(decl_72,type,
skaf47: ( $i * $i ) > $i ).
tff(decl_73,type,
skaf46: ( $i * $i ) > $i ).
tff(decl_74,type,
skaf45: ( $i * $i ) > $i ).
tff(decl_75,type,
skaf43: ( $i * $i ) > $i ).
tff(decl_76,type,
skaf42: ( $i * $i ) > $i ).
tff(decl_77,type,
geq: ( $i * $i ) > $o ).
tff(decl_78,type,
segmentP: ( $i * $i ) > $o ).
tff(decl_79,type,
rearsegP: ( $i * $i ) > $o ).
tff(decl_80,type,
frontsegP: ( $i * $i ) > $o ).
tff(decl_81,type,
leq: ( $i * $i ) > $o ).
tff(decl_82,type,
lt: ( $i * $i ) > $o ).
tff(decl_83,type,
cons: ( $i * $i ) > $i ).
tff(decl_84,type,
memberP: ( $i * $i ) > $o ).
tff(decl_85,type,
app: ( $i * $i ) > $i ).
tff(decl_86,type,
tl: $i > $i ).
tff(decl_87,type,
hd: $i > $i ).
tff(decl_88,type,
neq: ( $i * $i ) > $o ).
tff(decl_89,type,
gt: ( $i * $i ) > $o ).
tff(decl_90,type,
sk1: $i ).
tff(decl_91,type,
sk2: $i ).
tff(decl_92,type,
sk3: $i ).
tff(decl_93,type,
sk4: $i ).
tff(decl_94,type,
sk5: $i ).
cnf(co1_8,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_10,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_7,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
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(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(co1_9,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
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(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(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause176,axiom,
( X1 = X3
| ~ frontsegP(cons(X1,X2),cons(X3,X4))
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause176) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause174,axiom,
( frontsegP(X2,X4)
| ~ frontsegP(cons(X1,X2),cons(X3,X4))
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause174) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause109) ).
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(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(clause177,axiom,
( nil = X2
| X1 = X2
| nil = X1
| tl(X1) != tl(X2)
| hd(X1) != hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause177) ).
cnf(clause84,axiom,
( nil = X1
| ~ frontsegP(nil,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause84) ).
cnf(clause150,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause150) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause157) ).
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(clause60,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause60) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause137,axiom,
( frontsegP(app(X1,X3),X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause137) ).
cnf(clause141,axiom,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause141) ).
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(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(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
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_11,negated_conjecture,
( memberP(sk4,sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(co1_12,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause102,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(clause152,axiom,
( segmentP(X1,X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause152) ).
cnf(c_0_46,negated_conjecture,
( nil != sk2
| nil != sk1 ),
co1_8 ).
cnf(c_0_47,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_48,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
co1_10 ).
cnf(c_0_49,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_50,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_51,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_7 ).
cnf(c_0_52,negated_conjecture,
( sk1 != nil
| sk4 != nil ),
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause138 ).
cnf(c_0_54,negated_conjecture,
( cons(sk5,nil) = sk1
| ~ neq(sk4,nil) ),
inference(rw,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_56,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_50,c_0_47]) ).
cnf(c_0_57,axiom,
ssList(nil),
clause8 ).
cnf(c_0_58,negated_conjecture,
sk4 != nil,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_49]),c_0_52]) ).
cnf(c_0_59,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
co1_9 ).
cnf(c_0_60,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_53]) ).
cnf(c_0_61,negated_conjecture,
cons(sk5,nil) = sk1,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]),c_0_57])]),c_0_58]) ).
cnf(c_0_62,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_55]),c_0_56]),c_0_57])]),c_0_58]) ).
cnf(c_0_63,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause144 ).
cnf(c_0_64,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_65,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_66,negated_conjecture,
memberP(sk1,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]),c_0_57])]) ).
cnf(c_0_67,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_68,axiom,
( X1 = X3
| ~ frontsegP(cons(X1,X2),cons(X3,X4))
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X1) ),
clause176 ).
cnf(c_0_69,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_63]),c_0_64]) ).
cnf(c_0_70,negated_conjecture,
app(skaf42(sk1,sk5),cons(sk5,skaf43(sk5,sk1))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_62]),c_0_67])]) ).
cnf(c_0_71,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_72,axiom,
( frontsegP(X2,X4)
| ~ frontsegP(cons(X1,X2),cons(X3,X4))
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X1) ),
clause174 ).
cnf(c_0_73,negated_conjecture,
( sk5 = X1
| ~ frontsegP(sk1,cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_61]),c_0_62]),c_0_57])]) ).
cnf(c_0_74,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause109 ).
cnf(c_0_75,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_76,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_77,negated_conjecture,
( frontsegP(sk1,skaf42(sk1,sk5))
| ~ ssList(cons(sk5,skaf43(sk5,sk1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71])]) ).
cnf(c_0_78,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_79,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_80,negated_conjecture,
( frontsegP(nil,X1)
| ~ frontsegP(sk1,cons(X2,X1))
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_61]),c_0_62]),c_0_57])]) ).
cnf(c_0_81,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause97 ).
cnf(c_0_82,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_83,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_84,negated_conjecture,
( skaf83(X1) = sk5
| nil = X1
| ~ frontsegP(sk1,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]),c_0_76])]) ).
cnf(c_0_85,negated_conjecture,
frontsegP(sk1,skaf42(sk1,sk5)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_62]),c_0_79])]) ).
cnf(c_0_86,negated_conjecture,
( nil = X1
| frontsegP(nil,skaf82(X1))
| ~ frontsegP(sk1,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_74]),c_0_75]),c_0_76])]) ).
cnf(c_0_87,axiom,
( nil = X2
| X1 = X2
| nil = X1
| tl(X1) != tl(X2)
| hd(X1) != hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause177 ).
cnf(c_0_88,negated_conjecture,
hd(sk1) = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_61]),c_0_62]),c_0_57])]) ).
cnf(c_0_89,negated_conjecture,
tl(sk1) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_61]),c_0_62]),c_0_57])]) ).
cnf(c_0_90,negated_conjecture,
sk1 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_61]),c_0_62]),c_0_57])]) ).
cnf(c_0_91,plain,
( skaf83(X1) = hd(X1)
| nil = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_74]),c_0_75]),c_0_76])]) ).
cnf(c_0_92,negated_conjecture,
( skaf83(skaf42(sk1,sk5)) = sk5
| skaf42(sk1,sk5) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_71])]) ).
cnf(c_0_93,axiom,
( nil = X1
| ~ frontsegP(nil,X1)
| ~ ssList(X1) ),
clause84 ).
cnf(c_0_94,negated_conjecture,
( skaf42(sk1,sk5) = nil
| frontsegP(nil,skaf82(skaf42(sk1,sk5))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_85]),c_0_71])]) ).
cnf(c_0_95,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause150 ).
cnf(c_0_96,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_97,negated_conjecture,
( X1 = sk1
| nil = X1
| tl(X1) != nil
| hd(X1) != sk5
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89]),c_0_67])]),c_0_90]) ).
cnf(c_0_98,negated_conjecture,
( hd(skaf42(sk1,sk5)) = sk5
| skaf42(sk1,sk5) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_71])]) ).
cnf(c_0_99,plain,
( skaf82(X1) = tl(X1)
| nil = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_74]),c_0_75]),c_0_76])]) ).
cnf(c_0_100,negated_conjecture,
( skaf82(skaf42(sk1,sk5)) = nil
| skaf42(sk1,sk5) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_76])]) ).
cnf(c_0_101,plain,
( X1 = nil
| app(X2,X1) != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_57])]) ).
cnf(c_0_102,negated_conjecture,
( skaf42(sk1,sk5) = nil
| skaf42(sk1,sk5) = sk1
| tl(skaf42(sk1,sk5)) != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_71])]) ).
cnf(c_0_103,negated_conjecture,
( tl(skaf42(sk1,sk5)) = nil
| skaf42(sk1,sk5) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_71])]) ).
cnf(c_0_104,negated_conjecture,
( cons(sk5,skaf43(sk5,sk1)) = nil
| skaf42(sk1,sk5) != sk1
| ~ ssList(cons(sk5,skaf43(sk5,sk1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_70]),c_0_71])]) ).
cnf(c_0_105,negated_conjecture,
( skaf42(sk1,sk5) = sk1
| skaf42(sk1,sk5) = nil ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_106,negated_conjecture,
( cons(sk5,skaf43(sk5,sk1)) = nil
| skaf42(sk1,sk5) = nil
| ~ ssList(cons(sk5,skaf43(sk5,sk1))) ),
inference(spm,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_107,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause98 ).
cnf(c_0_108,negated_conjecture,
( cons(sk5,skaf43(sk5,sk1)) = nil
| skaf42(sk1,sk5) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_78]),c_0_62]),c_0_79])]) ).
cnf(c_0_109,negated_conjecture,
skaf42(sk1,sk5) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_62]),c_0_79])]) ).
cnf(c_0_110,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_111,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_112,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
clause60 ).
cnf(c_0_113,negated_conjecture,
frontsegP(sk1,nil),
inference(rw,[status(thm)],[c_0_85,c_0_109]) ).
cnf(c_0_114,negated_conjecture,
( cons(sk5,app(nil,X1)) = app(sk1,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_61]),c_0_62]),c_0_57])]) ).
cnf(c_0_115,plain,
( app(nil,skaf45(X1,nil)) = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_57])]) ).
cnf(c_0_116,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_117,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_118,negated_conjecture,
app(nil,skaf45(sk1,nil)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_113]),c_0_57]),c_0_67])]) ).
cnf(c_0_119,axiom,
( frontsegP(app(X1,X3),X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause137 ).
cnf(c_0_120,negated_conjecture,
( app(sk1,skaf45(X1,nil)) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_116])]) ).
cnf(c_0_121,negated_conjecture,
skaf45(sk1,nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_116])]) ).
cnf(c_0_122,negated_conjecture,
( frontsegP(app(sk1,X1),nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_113]),c_0_57]),c_0_67])]) ).
cnf(c_0_123,negated_conjecture,
app(sk1,sk1) = cons(sk5,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_67])]) ).
cnf(c_0_124,axiom,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
clause141 ).
cnf(c_0_125,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_126,negated_conjecture,
frontsegP(cons(sk5,sk1),nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_67])]) ).
cnf(c_0_127,negated_conjecture,
ssList(cons(sk5,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_123]),c_0_67])]) ).
cnf(c_0_128,negated_conjecture,
( memberP(app(X1,sk1),sk5)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_66]),c_0_62]),c_0_67])]) ).
cnf(c_0_129,negated_conjecture,
( app(sk1,X1) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_61]),c_0_62])]) ).
cnf(c_0_130,negated_conjecture,
app(nil,skaf45(cons(sk5,sk1),nil)) = cons(sk5,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_126]),c_0_57]),c_0_127])]) ).
cnf(c_0_131,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_132,negated_conjecture,
memberP(cons(sk5,sk1),sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_129]),c_0_67])]) ).
cnf(c_0_133,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_134,negated_conjecture,
skaf45(cons(sk5,sk1),nil) = cons(sk5,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_130]),c_0_116])]) ).
cnf(c_0_135,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_131]) ).
cnf(c_0_136,negated_conjecture,
( app(skaf42(cons(sk5,sk1),sk5),cons(sk5,skaf43(sk5,cons(sk5,sk1)))) = cons(sk5,sk1)
| ~ ssList(cons(sk5,sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_132]),c_0_62])]) ).
cnf(c_0_137,negated_conjecture,
( app(sk1,app(X1,X2)) = app(cons(sk5,X1),X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_129]),c_0_67])]) ).
cnf(c_0_138,negated_conjecture,
app(sk1,cons(sk5,sk1)) = cons(sk5,cons(sk5,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_134]),c_0_127])]) ).
cnf(c_0_139,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_140,negated_conjecture,
( ~ ssList(app(app(X1,cons(sk5,X2)),sk1))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ duplicatefreeP(app(app(X1,cons(sk5,X2)),sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_61]),c_0_62]),c_0_57])]) ).
cnf(c_0_141,negated_conjecture,
app(skaf42(cons(sk5,sk1),sk5),cons(sk5,skaf43(sk5,cons(sk5,sk1)))) = cons(sk5,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_136,c_0_127])]) ).
cnf(c_0_142,negated_conjecture,
app(cons(sk5,sk1),sk1) = cons(sk5,cons(sk5,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_123]),c_0_138]),c_0_67])]) ).
cnf(c_0_143,negated_conjecture,
ssList(cons(sk5,cons(sk5,sk1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_138]),c_0_67]),c_0_127])]) ).
cnf(c_0_144,negated_conjecture,
( memberP(sk4,sk5)
| ~ neq(sk4,nil) ),
co1_11 ).
cnf(c_0_145,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_139]) ).
cnf(c_0_146,negated_conjecture,
( frontsegP(cons(sk5,X1),sk1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_129]),c_0_67])]) ).
cnf(c_0_147,negated_conjecture,
( ssList(cons(sk5,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_129]),c_0_67])]) ).
cnf(c_0_148,negated_conjecture,
~ duplicatefreeP(cons(sk5,cons(sk5,sk1))),
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_140,c_0_141]),c_0_142]),c_0_143]),c_0_79]),c_0_71]),c_0_142])]) ).
cnf(c_0_149,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_150,negated_conjecture,
memberP(sk4,sk5),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_55]),c_0_56]),c_0_57])]),c_0_58]) ).
cnf(c_0_151,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
co1_12 ).
cnf(c_0_152,plain,
( segmentP(app(X1,X2),skaf45(X1,nil))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_115]),c_0_116]),c_0_57])]),c_0_64]) ).
cnf(c_0_153,negated_conjecture,
( app(sk1,skaf45(cons(sk5,X1),sk1)) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_146]),c_0_67])]),c_0_147]) ).
cnf(c_0_154,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_149]),c_0_143])]) ).
cnf(c_0_155,plain,
( segmentP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_96]),c_0_57])]),c_0_64]) ).
cnf(c_0_156,negated_conjecture,
app(skaf42(sk4,sk5),cons(sk5,skaf43(sk5,sk4))) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_150]),c_0_62]),c_0_56])]) ).
cnf(c_0_157,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk4,sk1) ),
inference(rw,[status(thm)],[c_0_151,c_0_47]) ).
cnf(c_0_158,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
clause102 ).
cnf(c_0_159,axiom,
( segmentP(X1,X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause152 ).
cnf(c_0_160,negated_conjecture,
( segmentP(cons(sk5,X1),sk1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_153]),c_0_121]),c_0_116]),c_0_67])]) ).
cnf(c_0_161,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_154])]) ).
cnf(c_0_162,negated_conjecture,
( segmentP(sk4,cons(sk5,skaf43(sk5,sk4)))
| ~ ssList(cons(sk5,skaf43(sk5,sk4))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_156]),c_0_71])]) ).
cnf(c_0_163,negated_conjecture,
( ~ segmentP(sk4,sk1)
| ~ ssItem(sk1)
| ~ ssItem(nil) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_157,c_0_158]),c_0_90]) ).
cnf(c_0_164,negated_conjecture,
( segmentP(X1,sk1)
| ~ segmentP(X1,cons(sk5,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_160]),c_0_67])]),c_0_161]) ).
cnf(c_0_165,negated_conjecture,
segmentP(sk4,cons(sk5,skaf43(sk5,sk4))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_78]),c_0_62]),c_0_79])]) ).
cnf(c_0_166,negated_conjecture,
~ segmentP(sk4,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_163,c_0_154]),c_0_154])]) ).
cnf(c_0_167,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_164,c_0_165]),c_0_56]),c_0_79])]),c_0_166]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC119-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Aug 28 18:30:25 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.56 start to proof: theBenchmark
% 2.73/2.80 % Version : CSE_E---1.5
% 2.73/2.80 % Problem : theBenchmark.p
% 2.73/2.80 % Proof found
% 2.73/2.80 % SZS status Theorem for theBenchmark.p
% 2.73/2.80 % SZS output start Proof
% See solution above
% 2.73/2.81 % Total time : 2.228000 s
% 2.73/2.81 % SZS output end Proof
% 2.73/2.81 % Total time : 2.233000 s
%------------------------------------------------------------------------------