TSTP Solution File: SWC160-1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SWC160-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% 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 : Thu Aug 31 20:20:18 EDT 2023

% Result   : Unsatisfiable 0.54s 0.70s
% Output   : CNFRefutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :  102
% Syntax   : Number of formulae    :  152 (  34 unt;  79 typ;   0 def)
%            Number of atoms       :  187 (  26 equ)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :  232 ( 118   ~; 114   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    6 (   2 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    :   60 (  60 usr;  14 con; 0-2 aty)
%            Number of variables   :  104 (  16 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 ).

tff(decl_95,type,
    sk6: $i ).

tff(decl_96,type,
    sk7: $i ).

tff(decl_97,type,
    sk8: $i ).

tff(decl_98,type,
    sk9: $i ).

tff(decl_99,type,
    sk10: $i ).

tff(decl_100,type,
    sk11: $i ).

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/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).

cnf(clause72,axiom,
    ( duplicatefreeP(X1)
    | ssItem(X2)
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).

cnf(clause74,axiom,
    ( app(nil,X1) = X1
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).

cnf(clause8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).

cnf(clause86,axiom,
    ( ssList(cons(X1,X2))
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).

cnf(co1_16,negated_conjecture,
    app(app(app(app(sk8,cons(sk6,nil)),sk9),cons(sk7,nil)),sk10) = sk1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).

cnf(co1_6,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).

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(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_13,negated_conjecture,
    ssList(sk8),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).

cnf(co1_14,negated_conjecture,
    ssList(sk9),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).

cnf(co1_11,negated_conjecture,
    ssItem(sk6),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).

cnf(clause53,axiom,
    ssList(skaf42(X1,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause53) ).

cnf(co1_12,negated_conjecture,
    ssItem(sk7),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

cnf(co1_15,negated_conjecture,
    ssList(sk10),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).

cnf(clause85,axiom,
    ( ssList(app(X2,X1))
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).

cnf(clause181,axiom,
    ( lt(X2,X4)
    | app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
    | ~ ssList(X5)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X4)
    | ~ ssItem(X2)
    | ~ strictorderedP(X6)
    | ~ ssList(X6) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause181) ).

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(co1_1,negated_conjecture,
    ssList(sk1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).

cnf(clause147,axiom,
    ( lt(X1,X3)
    | ~ leq(X1,X2)
    | ~ lt(X2,X3)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause147) ).

cnf(co1_17,negated_conjecture,
    leq(sk7,sk6),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).

cnf(co1_9,negated_conjecture,
    strictorderedP(sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

cnf(clause63,axiom,
    ( ~ lt(X1,X1)
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause63) ).

cnf(c_0_23,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_24,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_23]) ).

cnf(c_0_25,axiom,
    ( duplicatefreeP(X1)
    | ssItem(X2)
    | ~ ssList(X1) ),
    clause72 ).

cnf(c_0_26,plain,
    ( ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(app(app(X3,cons(X2,X4)),cons(X2,X5)))
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssList(X3) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_27,axiom,
    ( app(nil,X1) = X1
    | ~ ssList(X1) ),
    clause74 ).

cnf(c_0_28,axiom,
    ssList(nil),
    clause8 ).

cnf(c_0_29,axiom,
    ( ssList(cons(X1,X2))
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    clause86 ).

cnf(c_0_30,negated_conjecture,
    app(app(app(app(sk8,cons(sk6,nil)),sk9),cons(sk7,nil)),sk10) = sk1,
    co1_16 ).

cnf(c_0_31,negated_conjecture,
    sk1 = sk3,
    co1_6 ).

cnf(c_0_32,plain,
    ( ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(app(cons(X2,X3),cons(X2,X4)))
    | ~ ssList(X4)
    | ~ ssList(X3) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),c_0_29]) ).

cnf(c_0_33,axiom,
    ( app(cons(X1,nil),X2) = cons(X1,X2)
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    clause120 ).

cnf(c_0_34,negated_conjecture,
    app(app(app(app(sk8,cons(sk6,nil)),sk9),cons(sk7,nil)),sk10) = sk3,
    inference(rw,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_35,axiom,
    ( app(app(X3,X2),X1) = app(X3,app(X2,X1))
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    clause149 ).

cnf(c_0_36,negated_conjecture,
    ssList(sk8),
    co1_13 ).

cnf(c_0_37,negated_conjecture,
    ssList(sk9),
    co1_14 ).

cnf(c_0_38,plain,
    ( ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(cons(X2,cons(X2,X3)))
    | ~ ssList(X3) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_28])]),c_0_29]) ).

cnf(c_0_39,negated_conjecture,
    ( app(app(app(sk8,app(cons(sk6,nil),sk9)),cons(sk7,nil)),sk10) = sk3
    | ~ ssList(cons(sk6,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[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_40,negated_conjecture,
    ssItem(sk6),
    co1_11 ).

cnf(c_0_41,plain,
    ( ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X3) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_29]),c_0_29]) ).

cnf(c_0_42,axiom,
    ssList(skaf42(X1,X2)),
    clause53 ).

cnf(c_0_43,negated_conjecture,
    app(app(app(sk8,app(cons(sk6,nil),sk9)),cons(sk7,nil)),sk10) = sk3,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_29]),c_0_40]),c_0_28])]) ).

cnf(c_0_44,plain,
    ( ssItem(X1)
    | ~ ssItem(X2) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_45,negated_conjecture,
    ssItem(sk7),
    co1_12 ).

cnf(c_0_46,negated_conjecture,
    app(app(app(sk8,cons(sk6,sk9)),cons(sk7,nil)),sk10) = sk3,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_33]),c_0_40]),c_0_37])]) ).

cnf(c_0_47,negated_conjecture,
    ssList(sk10),
    co1_15 ).

cnf(c_0_48,negated_conjecture,
    ssItem(X1),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_49,negated_conjecture,
    ( app(app(sk8,cons(sk6,sk9)),app(cons(sk7,nil),sk10)) = sk3
    | ~ ssList(app(sk8,cons(sk6,sk9)))
    | ~ ssList(cons(sk7,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_46]),c_0_47])]) ).

cnf(c_0_50,plain,
    ( ssList(cons(X1,X2))
    | ~ ssList(X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_48])]) ).

cnf(c_0_51,negated_conjecture,
    ( app(app(sk8,cons(sk6,sk9)),app(cons(sk7,nil),sk10)) = sk3
    | ~ ssList(app(sk8,cons(sk6,sk9))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_28])]) ).

cnf(c_0_52,axiom,
    ( ssList(app(X2,X1))
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    clause85 ).

cnf(c_0_53,axiom,
    ( lt(X2,X4)
    | app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
    | ~ ssList(X5)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X4)
    | ~ ssItem(X2)
    | ~ strictorderedP(X6)
    | ~ ssList(X6) ),
    clause181 ).

cnf(c_0_54,negated_conjecture,
    ( app(app(sk8,cons(sk6,sk9)),app(cons(sk7,nil),sk10)) = sk3
    | ~ ssList(cons(sk6,sk9)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_36])]) ).

cnf(c_0_55,axiom,
    ( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    clause157 ).

cnf(c_0_56,plain,
    ( lt(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
    inference(er,[status(thm)],[c_0_53]) ).

cnf(c_0_57,negated_conjecture,
    app(app(sk8,cons(sk6,sk9)),app(cons(sk7,nil),sk10)) = sk3,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_50]),c_0_37])]) ).

cnf(c_0_58,plain,
    ( app(cons(X1,X2),X3) = cons(X1,app(X2,X3))
    | ~ ssList(X3)
    | ~ ssList(X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_48])]) ).

cnf(c_0_59,negated_conjecture,
    ssList(sk1),
    co1_1 ).

cnf(c_0_60,axiom,
    ( lt(X1,X3)
    | ~ leq(X1,X2)
    | ~ lt(X2,X3)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1) ),
    clause147 ).

cnf(c_0_61,negated_conjecture,
    leq(sk7,sk6),
    co1_17 ).

cnf(c_0_62,plain,
    ( lt(X1,X2)
    | ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_48]),c_0_48])]) ).

cnf(c_0_63,negated_conjecture,
    app(app(sk8,cons(sk6,sk9)),cons(sk7,app(nil,sk10))) = sk3,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_47]),c_0_28])]) ).

cnf(c_0_64,negated_conjecture,
    ssList(sk3),
    inference(rw,[status(thm)],[c_0_59,c_0_31]) ).

cnf(c_0_65,negated_conjecture,
    strictorderedP(sk3),
    co1_9 ).

cnf(c_0_66,negated_conjecture,
    ( lt(sk7,X1)
    | ~ lt(sk6,X1)
    | ~ ssItem(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_40]),c_0_45])]) ).

cnf(c_0_67,negated_conjecture,
    ( lt(sk6,sk7)
    | ~ ssList(app(nil,sk10)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_37]),c_0_36]),c_0_65])]) ).

cnf(c_0_68,axiom,
    ( ~ lt(X1,X1)
    | ~ ssItem(X1) ),
    clause63 ).

cnf(c_0_69,negated_conjecture,
    ( lt(sk7,X1)
    | ~ lt(sk6,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_48])]) ).

cnf(c_0_70,negated_conjecture,
    lt(sk6,sk7),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_27]),c_0_47])]) ).

cnf(c_0_71,plain,
    ~ lt(X1,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_48])]) ).

cnf(c_0_72,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem    : SWC160-1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.11  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.10/0.30  % Computer : n029.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 300
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Mon Aug 28 15:25:26 EDT 2023
% 0.10/0.31  % CPUTime  : 
% 0.52/0.58  start to proof: theBenchmark
% 0.54/0.70  % Version  : CSE_E---1.5
% 0.54/0.70  % Problem  : theBenchmark.p
% 0.54/0.70  % Proof found
% 0.54/0.70  % SZS status Theorem for theBenchmark.p
% 0.54/0.70  % SZS output start Proof
% See solution above
% 0.54/0.70  % Total time : 0.102000 s
% 0.54/0.70  % SZS output end Proof
% 0.54/0.70  % Total time : 0.108000 s
%------------------------------------------------------------------------------