TSTP Solution File: SWC314-1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SWC314-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n017.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 21 04:25:34 EDT 2024

% Result   : Unsatisfiable 0.37s 0.55s
% Output   : CNFRefutation 0.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :   24
% Syntax   : Number of clauses     :   96 (  21 unt;  19 nHn;  96 RR)
%            Number of literals    :  267 ( 118 equ; 158 neg)
%            Maximal clause size   :   12 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   7 con; 0-2 aty)
%            Number of variables   :   78 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
    ( nil = sk3
    | nil != sk4 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

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

cnf(co1_15,negated_conjecture,
    ( app(cons(sk5,nil),sk6) = sk2
    | nil != sk1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).

cnf(co1_14,negated_conjecture,
    ( ssList(sk6)
    | nil != sk1 ),
    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(co1_5,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).

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_10,negated_conjecture,
    ( ssItem(sk5)
    | nil != sk1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).

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

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

cnf(co1_8,negated_conjecture,
    ( sk3 = X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | tl(sk4) != X2
    | app(X2,X3) != X1
    | ~ ssItem(X4)
    | cons(X4,nil) != X3
    | hd(sk4) != X4
    | ~ neq(nil,sk4)
    | ~ neq(nil,sk4)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

cnf(clause76,axiom,
    ( ssItem(hd(X1))
    | nil = X1
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).

cnf(clause75,axiom,
    ( ssList(tl(X1))
    | nil = X1
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).

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

cnf(co1_2,negated_conjecture,
    ssList(sk2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).

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_12,negated_conjecture,
    ( app(cons(sk5,nil),sk6) = sk2
    | nil = sk2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).

cnf(co1_9,negated_conjecture,
    ( ssItem(sk5)
    | nil = sk2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

cnf(co1_11,negated_conjecture,
    ( ssList(sk6)
    | nil = sk2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).

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(clause100,axiom,
    ( neq(X2,X1)
    | X2 = X1
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).

cnf(co1_13,negated_conjecture,
    ( nil = sk2
    | app(sk6,cons(sk5,nil)) != sk1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).

cnf(c_0_24,negated_conjecture,
    ( nil = sk3
    | nil != sk4 ),
    inference(fof_simplification,[status(thm)],[co1_7]) ).

cnf(c_0_25,plain,
    ( nil = X2
    | app(X1,X2) != nil
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(fof_simplification,[status(thm)],[clause119]) ).

cnf(c_0_26,negated_conjecture,
    ( app(cons(sk5,nil),sk6) = sk2
    | nil != sk1 ),
    inference(fof_simplification,[status(thm)],[co1_15]) ).

cnf(c_0_27,negated_conjecture,
    ( ssList(sk6)
    | nil != sk1 ),
    inference(fof_simplification,[status(thm)],[co1_14]) ).

cnf(c_0_28,negated_conjecture,
    ( nil = sk3
    | nil != sk4 ),
    c_0_24 ).

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

cnf(c_0_30,negated_conjecture,
    sk2 = sk4,
    co1_5 ).

cnf(c_0_31,plain,
    ( nil = X2
    | app(X1,X2) != nil
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    c_0_25 ).

cnf(c_0_32,negated_conjecture,
    ( app(cons(sk5,nil),sk6) = sk2
    | nil != sk1 ),
    c_0_26 ).

cnf(c_0_33,negated_conjecture,
    ( ssList(sk6)
    | nil != sk1 ),
    c_0_27 ).

cnf(c_0_34,negated_conjecture,
    ( sk1 = nil
    | sk2 != nil ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).

cnf(c_0_35,plain,
    ( ssList(cons(X1,X2))
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(fof_simplification,[status(thm)],[clause86]) ).

cnf(c_0_36,negated_conjecture,
    ( sk6 = nil
    | sk2 != nil
    | ~ ssList(cons(sk5,nil)) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]) ).

cnf(c_0_37,plain,
    ( ssList(cons(X1,X2))
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    c_0_35 ).

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

cnf(c_0_39,negated_conjecture,
    ( ssItem(sk5)
    | nil != sk1 ),
    inference(fof_simplification,[status(thm)],[co1_10]) ).

cnf(c_0_40,negated_conjecture,
    ( sk6 = nil
    | sk2 != nil
    | ~ ssItem(sk5) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).

cnf(c_0_41,negated_conjecture,
    ( ssItem(sk5)
    | nil != sk1 ),
    c_0_39 ).

cnf(c_0_42,plain,
    ( nil = X1
    | app(X1,X2) != nil
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(fof_simplification,[status(thm)],[clause118]) ).

cnf(c_0_43,negated_conjecture,
    ( sk6 = nil
    | sk2 != nil ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_34]) ).

cnf(c_0_44,plain,
    ( nil = X1
    | app(X1,X2) != nil
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    c_0_42 ).

cnf(c_0_45,negated_conjecture,
    ( app(cons(sk5,nil),nil) = sk2
    | sk2 != nil ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_43]),c_0_34]) ).

cnf(c_0_46,plain,
    ( cons(X1,X2) != X2
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(fof_simplification,[status(thm)],[clause99]) ).

cnf(c_0_47,negated_conjecture,
    ( cons(sk5,nil) = nil
    | sk2 != nil
    | ~ ssList(cons(sk5,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_38])]) ).

cnf(c_0_48,plain,
    ( cons(X1,X2) != X2
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    c_0_46 ).

cnf(c_0_49,negated_conjecture,
    ( cons(sk5,nil) = nil
    | sk2 != nil
    | ~ ssItem(sk5) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_37]),c_0_38])]) ).

cnf(c_0_50,negated_conjecture,
    ( sk3 = X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | tl(sk4) != X2
    | app(X2,X3) != X1
    | ~ ssItem(X4)
    | cons(X4,nil) != X3
    | hd(sk4) != X4
    | ~ neq(nil,sk4)
    | ~ neq(nil,sk4)
    | ~ neq(sk4,nil) ),
    inference(fof_simplification,[status(thm)],[co1_8]) ).

cnf(c_0_51,plain,
    ( ssItem(hd(X1))
    | nil = X1
    | ~ ssList(X1) ),
    inference(fof_simplification,[status(thm)],[clause76]) ).

cnf(c_0_52,plain,
    ( ssList(tl(X1))
    | nil = X1
    | ~ ssList(X1) ),
    inference(fof_simplification,[status(thm)],[clause75]) ).

cnf(c_0_53,negated_conjecture,
    ( sk2 != nil
    | ~ ssItem(sk5) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_38])]) ).

cnf(c_0_54,negated_conjecture,
    ( sk3 = X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | tl(sk4) != X2
    | app(X2,X3) != X1
    | ~ ssItem(X4)
    | cons(X4,nil) != X3
    | hd(sk4) != X4
    | ~ neq(nil,sk4)
    | ~ neq(nil,sk4)
    | ~ neq(sk4,nil) ),
    c_0_50 ).

cnf(c_0_55,plain,
    ( ssList(app(X2,X1))
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(fof_simplification,[status(thm)],[clause85]) ).

cnf(c_0_56,plain,
    ( ssItem(hd(X1))
    | nil = X1
    | ~ ssList(X1) ),
    c_0_51 ).

cnf(c_0_57,negated_conjecture,
    ssList(sk2),
    co1_2 ).

cnf(c_0_58,plain,
    ( ssList(tl(X1))
    | nil = X1
    | ~ ssList(X1) ),
    c_0_52 ).

cnf(c_0_59,plain,
    ( app(cons(X1,nil),X2) = cons(X1,X2)
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(fof_simplification,[status(thm)],[clause120]) ).

cnf(c_0_60,negated_conjecture,
    ( app(cons(sk5,nil),sk6) = sk2
    | nil = sk2 ),
    co1_12 ).

cnf(c_0_61,negated_conjecture,
    sk2 != nil,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_41]),c_0_34]) ).

cnf(c_0_62,negated_conjecture,
    ( ssItem(sk5)
    | nil = sk2 ),
    co1_9 ).

cnf(c_0_63,negated_conjecture,
    ( ssList(sk6)
    | nil = sk2 ),
    co1_11 ).

cnf(c_0_64,negated_conjecture,
    ( sk3 = X1
    | tl(sk4) != X2
    | hd(sk4) != X4
    | app(X2,X3) != X1
    | cons(X4,nil) != X3
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssItem(X4)
    | ~ neq(nil,sk4)
    | ~ neq(sk4,nil) ),
    inference(cn,[status(thm)],[c_0_54]) ).

cnf(c_0_65,plain,
    ( ssList(app(X2,X1))
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    c_0_55 ).

cnf(c_0_66,negated_conjecture,
    ( sk2 = nil
    | ssItem(hd(sk2)) ),
    inference(spm,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_67,negated_conjecture,
    ( sk2 = nil
    | ssList(tl(sk2)) ),
    inference(spm,[status(thm)],[c_0_58,c_0_57]) ).

cnf(c_0_68,plain,
    ( tl(cons(X1,X2)) = X2
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(fof_simplification,[status(thm)],[clause96]) ).

cnf(c_0_69,plain,
    ( app(cons(X1,nil),X2) = cons(X1,X2)
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    c_0_59 ).

cnf(c_0_70,negated_conjecture,
    app(cons(sk5,nil),sk6) = sk2,
    inference(sr,[status(thm)],[c_0_60,c_0_61]) ).

cnf(c_0_71,negated_conjecture,
    ssItem(sk5),
    inference(sr,[status(thm)],[c_0_62,c_0_61]) ).

cnf(c_0_72,negated_conjecture,
    ssList(sk6),
    inference(sr,[status(thm)],[c_0_63,c_0_61]) ).

cnf(c_0_73,plain,
    ( hd(cons(X1,X2)) = X1
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(fof_simplification,[status(thm)],[clause97]) ).

cnf(c_0_74,plain,
    ( neq(X2,X1)
    | X2 = X1
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(fof_simplification,[status(thm)],[clause100]) ).

cnf(c_0_75,negated_conjecture,
    ( app(tl(sk2),cons(hd(sk2),nil)) = sk1
    | ~ neq(nil,sk2)
    | ~ neq(sk2,nil)
    | ~ ssItem(hd(sk2))
    | ~ ssList(cons(hd(sk2),nil))
    | ~ ssList(tl(sk2)) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_29]),c_0_30]),c_0_30]),c_0_30]),c_0_30])])])])]),c_0_65]) ).

cnf(c_0_76,negated_conjecture,
    ssItem(hd(sk2)),
    inference(sr,[status(thm)],[c_0_66,c_0_61]) ).

cnf(c_0_77,negated_conjecture,
    ssList(tl(sk2)),
    inference(sr,[status(thm)],[c_0_67,c_0_61]) ).

cnf(c_0_78,plain,
    ( tl(cons(X1,X2)) = X2
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    c_0_68 ).

cnf(c_0_79,negated_conjecture,
    cons(sk5,sk6) = sk2,
    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,plain,
    ( hd(cons(X1,X2)) = X1
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    c_0_73 ).

cnf(c_0_81,plain,
    ( neq(X2,X1)
    | X2 = X1
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    c_0_74 ).

cnf(c_0_82,negated_conjecture,
    ( app(tl(sk2),cons(hd(sk2),nil)) = sk1
    | ~ neq(nil,sk2)
    | ~ neq(sk2,nil)
    | ~ ssList(cons(hd(sk2),nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76]),c_0_77])]) ).

cnf(c_0_83,negated_conjecture,
    tl(sk2) = sk6,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_71]),c_0_72])]) ).

cnf(c_0_84,negated_conjecture,
    hd(sk2) = sk5,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_79]),c_0_71]),c_0_72])]) ).

cnf(c_0_85,negated_conjecture,
    ( X1 = sk2
    | neq(sk2,X1)
    | ~ ssList(X1) ),
    inference(spm,[status(thm)],[c_0_81,c_0_57]) ).

cnf(c_0_86,negated_conjecture,
    ( app(sk6,cons(sk5,nil)) = sk1
    | ~ neq(nil,sk2)
    | ~ neq(sk2,nil)
    | ~ ssList(cons(sk5,nil)) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_83]),c_0_84]),c_0_84]) ).

cnf(c_0_87,negated_conjecture,
    neq(sk2,nil),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_38]),c_0_61]) ).

cnf(c_0_88,plain,
    ( X1 = nil
    | neq(nil,X1)
    | ~ ssList(X1) ),
    inference(spm,[status(thm)],[c_0_81,c_0_38]) ).

cnf(c_0_89,negated_conjecture,
    ( nil = sk2
    | app(sk6,cons(sk5,nil)) != sk1 ),
    inference(fof_simplification,[status(thm)],[co1_13]) ).

cnf(c_0_90,negated_conjecture,
    ( app(sk6,cons(sk5,nil)) = sk1
    | ~ neq(nil,sk2)
    | ~ ssList(cons(sk5,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_87])]) ).

cnf(c_0_91,negated_conjecture,
    neq(nil,sk2),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_57]),c_0_61]) ).

cnf(c_0_92,negated_conjecture,
    ( nil = sk2
    | app(sk6,cons(sk5,nil)) != sk1 ),
    c_0_89 ).

cnf(c_0_93,negated_conjecture,
    ( app(sk6,cons(sk5,nil)) = sk1
    | ~ ssList(cons(sk5,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_91])]) ).

cnf(c_0_94,negated_conjecture,
    ~ ssList(cons(sk5,nil)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_61]) ).

cnf(c_0_95,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_37]),c_0_71]),c_0_38])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14  % Problem    : SWC314-1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.15  % Command    : run_E %s %d THM
% 0.14/0.37  % Computer : n017.cluster.edu
% 0.14/0.37  % Model    : x86_64 x86_64
% 0.14/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37  % Memory   : 8042.1875MB
% 0.14/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37  % CPULimit   : 300
% 0.14/0.37  % WCLimit    : 300
% 0.14/0.37  % DateTime   : Sun May 19 03:33:08 EDT 2024
% 0.14/0.37  % CPUTime    : 
% 0.21/0.51  Running first-order theorem proving
% 0.21/0.51  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.37/0.55  # Version: 3.1.0
% 0.37/0.55  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.37/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.55  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.37/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.37/0.55  # Starting new_bool_1 with 300s (1) cores
% 0.37/0.55  # Starting sh5l with 300s (1) cores
% 0.37/0.55  # new_bool_1 with pid 18887 completed with status 0
% 0.37/0.55  # Result found by new_bool_1
% 0.37/0.55  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.37/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.55  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.37/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.37/0.55  # Starting new_bool_1 with 300s (1) cores
% 0.37/0.55  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/0.55  # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.37/0.55  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/0.55  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.37/0.55  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18889 completed with status 0
% 0.37/0.55  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.37/0.55  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.37/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.55  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.37/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.37/0.55  # Starting new_bool_1 with 300s (1) cores
% 0.37/0.55  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/0.55  # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.37/0.55  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/0.55  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.37/0.55  # Preprocessing time       : 0.003 s
% 0.37/0.55  # Presaturation interreduction done
% 0.37/0.55  
% 0.37/0.55  # Proof found!
% 0.37/0.55  # SZS status Unsatisfiable
% 0.37/0.55  # SZS output start CNFRefutation
% See solution above
% 0.37/0.55  # Parsed axioms                        : 201
% 0.37/0.55  # Removed by relevancy pruning/SinE    : 129
% 0.37/0.55  # Initial clauses                      : 72
% 0.37/0.55  # Removed in clause preprocessing      : 0
% 0.37/0.55  # Initial clauses in saturation        : 72
% 0.37/0.55  # Processed clauses                    : 239
% 0.37/0.55  # ...of these trivial                  : 3
% 0.37/0.55  # ...subsumed                          : 21
% 0.37/0.55  # ...remaining for further processing  : 215
% 0.37/0.55  # Other redundant clauses eliminated   : 17
% 0.37/0.55  # Clauses deleted for lack of memory   : 0
% 0.37/0.55  # Backward-subsumed                    : 24
% 0.37/0.55  # Backward-rewritten                   : 8
% 0.37/0.55  # Generated clauses                    : 448
% 0.37/0.55  # ...of the previous two non-redundant : 392
% 0.37/0.55  # ...aggressively subsumed             : 0
% 0.37/0.55  # Contextual simplify-reflections      : 12
% 0.37/0.55  # Paramodulations                      : 424
% 0.37/0.55  # Factorizations                       : 0
% 0.37/0.55  # NegExts                              : 0
% 0.37/0.55  # Equation resolutions                 : 21
% 0.37/0.55  # Disequality decompositions           : 0
% 0.37/0.55  # Total rewrite steps                  : 278
% 0.37/0.55  # ...of those cached                   : 259
% 0.37/0.55  # Propositional unsat checks           : 0
% 0.37/0.55  #    Propositional check models        : 0
% 0.37/0.55  #    Propositional check unsatisfiable : 0
% 0.37/0.55  #    Propositional clauses             : 0
% 0.37/0.55  #    Propositional clauses after purity: 0
% 0.37/0.55  #    Propositional unsat core size     : 0
% 0.37/0.55  #    Propositional preprocessing time  : 0.000
% 0.37/0.55  #    Propositional encoding time       : 0.000
% 0.37/0.55  #    Propositional solver time         : 0.000
% 0.37/0.55  #    Success case prop preproc time    : 0.000
% 0.37/0.55  #    Success case prop encoding time   : 0.000
% 0.37/0.55  #    Success case prop solver time     : 0.000
% 0.37/0.55  # Current number of processed clauses  : 103
% 0.37/0.55  #    Positive orientable unit clauses  : 19
% 0.37/0.55  #    Positive unorientable unit clauses: 0
% 0.37/0.55  #    Negative unit clauses             : 3
% 0.37/0.55  #    Non-unit-clauses                  : 81
% 0.37/0.55  # Current number of unprocessed clauses: 274
% 0.37/0.55  # ...number of literals in the above   : 1401
% 0.37/0.55  # Current number of archived formulas  : 0
% 0.37/0.55  # Current number of archived clauses   : 103
% 0.37/0.55  # Clause-clause subsumption calls (NU) : 2491
% 0.37/0.55  # Rec. Clause-clause subsumption calls : 588
% 0.37/0.55  # Non-unit clause-clause subsumptions  : 31
% 0.37/0.55  # Unit Clause-clause subsumption calls : 130
% 0.37/0.55  # Rewrite failures with RHS unbound    : 0
% 0.37/0.55  # BW rewrite match attempts            : 9
% 0.37/0.55  # BW rewrite match successes           : 9
% 0.37/0.55  # Condensation attempts                : 0
% 0.37/0.55  # Condensation successes               : 0
% 0.37/0.55  # Termbank termtop insertions          : 11160
% 0.37/0.55  # Search garbage collected termcells   : 875
% 0.37/0.55  
% 0.37/0.55  # -------------------------------------------------
% 0.37/0.55  # User time                : 0.019 s
% 0.37/0.55  # System time              : 0.006 s
% 0.37/0.55  # Total time               : 0.024 s
% 0.37/0.55  # Maximum resident set size: 2120 pages
% 0.37/0.55  
% 0.37/0.55  # -------------------------------------------------
% 0.37/0.55  # User time                : 0.022 s
% 0.37/0.55  # System time              : 0.009 s
% 0.37/0.55  # Total time               : 0.031 s
% 0.37/0.55  # Maximum resident set size: 1880 pages
% 0.37/0.55  % E---3.1 exiting
% 0.37/0.55  % E exiting
%------------------------------------------------------------------------------