TSTP Solution File: SWC177-1 by E-SAT---3.1.00

View Problem - Process Solution

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

% Computer : n018.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:28:08 EDT 2024

% Result   : Unsatisfiable 0.21s 0.55s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   22
% Syntax   : Number of clauses     :   85 (  34 unt;   9 nHn;  85 RR)
%            Number of literals    :  206 (  49 equ; 121 neg)
%            Maximal clause size   :    9 (   2 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :   89 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_12,negated_conjecture,
    ~ neq(sk5,sk6),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

cnf(clause102,axiom,
    ( neq(X2,X1)
    | X2 = X1
    | ~ ssItem(X1)
    | ~ ssItem(X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause102) ).

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

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_7,negated_conjecture,
    ssItem(sk5),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

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

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

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

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

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

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

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(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(clause175,axiom,
    ( memberP(X4,X2)
    | app(X1,cons(X2,X3)) != X4
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ ssList(X4) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause175) ).

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

cnf(clause66,axiom,
    ( strictorderedP(cons(X1,nil))
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause66) ).

cnf(co1_17,negated_conjecture,
    ( cons(sk9,nil) = sk3
    | nil = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).

cnf(co1_14,negated_conjecture,
    ( ssItem(sk9)
    | nil = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).

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

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

cnf(c_0_22,negated_conjecture,
    ~ neq(sk5,sk6),
    inference(fof_simplification,[status(thm)],[co1_12]) ).

cnf(c_0_23,plain,
    ( neq(X2,X1)
    | X2 = X1
    | ~ ssItem(X1)
    | ~ ssItem(X2) ),
    inference(fof_simplification,[status(thm)],[clause102]) ).

cnf(c_0_24,negated_conjecture,
    app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
    co1_11 ).

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

cnf(c_0_26,plain,
    ( app(app(X3,X2),X1) = app(X3,app(X2,X1))
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    inference(fof_simplification,[status(thm)],[clause149]) ).

cnf(c_0_27,negated_conjecture,
    ~ neq(sk5,sk6),
    c_0_22 ).

cnf(c_0_28,plain,
    ( neq(X2,X1)
    | X2 = X1
    | ~ ssItem(X1)
    | ~ ssItem(X2) ),
    c_0_23 ).

cnf(c_0_29,negated_conjecture,
    ssItem(sk5),
    co1_7 ).

cnf(c_0_30,negated_conjecture,
    ssItem(sk6),
    co1_8 ).

cnf(c_0_31,negated_conjecture,
    app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk3,
    inference(rw,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_32,plain,
    ( app(app(X3,X2),X1) = app(X3,app(X2,X1))
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    c_0_26 ).

cnf(c_0_33,negated_conjecture,
    sk6 = sk5,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).

cnf(c_0_34,negated_conjecture,
    ssList(sk7),
    co1_9 ).

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,
    ( app(app(sk7,app(cons(sk5,nil),cons(sk5,nil))),sk8) = sk3
    | ~ ssList(cons(sk5,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]),c_0_33])]) ).

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,plain,
    ( app(cons(X1,nil),X2) = cons(X1,X2)
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(fof_simplification,[status(thm)],[clause120]) ).

cnf(c_0_40,negated_conjecture,
    app(app(sk7,app(cons(sk5,nil),cons(sk5,nil))),sk8) = sk3,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_29]),c_0_38])]) ).

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

cnf(c_0_42,negated_conjecture,
    ( app(app(sk7,cons(sk5,cons(sk5,nil))),sk8) = sk3
    | ~ ssList(cons(sk5,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_29])]) ).

cnf(c_0_43,negated_conjecture,
    app(app(sk7,cons(sk5,cons(sk5,nil))),sk8) = sk3,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_37]),c_0_29]),c_0_38])]) ).

cnf(c_0_44,negated_conjecture,
    ssList(sk8),
    co1_10 ).

cnf(c_0_45,negated_conjecture,
    app(app(app(sk7,cons(sk5,nil)),cons(sk5,nil)),sk8) = sk3,
    inference(spm,[status(thm)],[c_0_31,c_0_33]) ).

cnf(c_0_46,negated_conjecture,
    ( app(sk7,app(cons(sk5,cons(sk5,nil)),sk8)) = sk3
    | ~ ssList(cons(sk5,cons(sk5,nil))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_43]),c_0_34]),c_0_44])]) ).

cnf(c_0_47,negated_conjecture,
    ( app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk3
    | ~ ssList(app(sk7,cons(sk5,nil)))
    | ~ ssList(cons(sk5,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_32]),c_0_44])]) ).

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

cnf(c_0_49,negated_conjecture,
    ( app(sk7,app(cons(sk5,cons(sk5,nil)),sk8)) = sk3
    | ~ ssList(cons(sk5,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_37]),c_0_29])]) ).

cnf(c_0_50,plain,
    ( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    inference(fof_simplification,[status(thm)],[clause157]) ).

cnf(c_0_51,negated_conjecture,
    ( app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk3
    | ~ ssList(app(sk7,cons(sk5,nil))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_37]),c_0_29]),c_0_38])]) ).

cnf(c_0_52,plain,
    ( ssList(app(X2,X1))
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    c_0_48 ).

cnf(c_0_53,negated_conjecture,
    app(sk7,app(cons(sk5,cons(sk5,nil)),sk8)) = sk3,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_37]),c_0_29]),c_0_38])]) ).

cnf(c_0_54,plain,
    ( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    c_0_50 ).

cnf(c_0_55,plain,
    ( 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) ),
    inference(fof_simplification,[status(thm)],[clause181]) ).

cnf(c_0_56,negated_conjecture,
    ( app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk3
    | ~ ssList(cons(sk5,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_34])]) ).

cnf(c_0_57,plain,
    ( memberP(X4,X2)
    | app(X1,cons(X2,X3)) != X4
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ ssList(X4) ),
    inference(fof_simplification,[status(thm)],[clause175]) ).

cnf(c_0_58,negated_conjecture,
    ( app(sk7,cons(sk5,app(cons(sk5,nil),sk8))) = sk3
    | ~ ssList(cons(sk5,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_29]),c_0_44])]) ).

cnf(c_0_59,plain,
    ( 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) ),
    c_0_55 ).

cnf(c_0_60,negated_conjecture,
    app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk3,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_37]),c_0_29]),c_0_38])]) ).

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

cnf(c_0_62,plain,
    ( strictorderedP(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(fof_simplification,[status(thm)],[clause66]) ).

cnf(c_0_63,plain,
    ( memberP(X4,X2)
    | app(X1,cons(X2,X3)) != X4
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ ssList(X4) ),
    c_0_57 ).

cnf(c_0_64,negated_conjecture,
    app(sk7,cons(sk5,app(cons(sk5,nil),sk8))) = sk3,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_37]),c_0_29]),c_0_38])]) ).

cnf(c_0_65,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_59]) ).

cnf(c_0_66,negated_conjecture,
    app(app(sk7,cons(sk5,nil)),cons(sk5,sk8)) = sk3,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_41]),c_0_29]),c_0_44])]) ).

cnf(c_0_67,negated_conjecture,
    ssList(sk3),
    inference(rw,[status(thm)],[c_0_61,c_0_25]) ).

cnf(c_0_68,plain,
    ( strictorderedP(cons(X1,nil))
    | ~ ssItem(X1) ),
    c_0_62 ).

cnf(c_0_69,negated_conjecture,
    ( cons(sk9,nil) = sk3
    | nil = sk3 ),
    co1_17 ).

cnf(c_0_70,negated_conjecture,
    ( ssItem(sk9)
    | nil = sk3 ),
    co1_14 ).

cnf(c_0_71,plain,
    ( memberP(app(X1,cons(X2,X3)),X2)
    | ~ ssItem(X2)
    | ~ ssList(app(X1,cons(X2,X3)))
    | ~ ssList(X3)
    | ~ ssList(X1) ),
    inference(er,[status(thm)],[c_0_63]) ).

cnf(c_0_72,negated_conjecture,
    app(sk7,cons(sk5,cons(sk5,sk8))) = sk3,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_41]),c_0_29]),c_0_44])]) ).

cnf(c_0_73,plain,
    ( ~ lt(X1,X1)
    | ~ ssItem(X1) ),
    inference(fof_simplification,[status(thm)],[clause63]) ).

cnf(c_0_74,negated_conjecture,
    ( lt(sk5,sk5)
    | ~ strictorderedP(sk3) ),
    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_65,c_0_66]),c_0_29]),c_0_67]),c_0_44]),c_0_38]),c_0_34])]) ).

cnf(c_0_75,negated_conjecture,
    ( sk3 = nil
    | strictorderedP(sk3) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]) ).

cnf(c_0_76,negated_conjecture,
    ( memberP(sk3,sk5)
    | ~ ssList(cons(sk5,sk8)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_29]),c_0_67]),c_0_34])]) ).

cnf(c_0_77,plain,
    ( ~ lt(X1,X1)
    | ~ ssItem(X1) ),
    c_0_73 ).

cnf(c_0_78,negated_conjecture,
    ( sk3 = nil
    | lt(sk5,sk5) ),
    inference(spm,[status(thm)],[c_0_74,c_0_75]) ).

cnf(c_0_79,plain,
    ( ~ memberP(nil,X1)
    | ~ ssItem(X1) ),
    inference(fof_simplification,[status(thm)],[clause71]) ).

cnf(c_0_80,negated_conjecture,
    memberP(sk3,sk5),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_37]),c_0_29]),c_0_44])]) ).

cnf(c_0_81,negated_conjecture,
    sk3 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_29])]) ).

cnf(c_0_82,plain,
    ( ~ memberP(nil,X1)
    | ~ ssItem(X1) ),
    c_0_79 ).

cnf(c_0_83,negated_conjecture,
    memberP(nil,sk5),
    inference(rw,[status(thm)],[c_0_80,c_0_81]) ).

cnf(c_0_84,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_29])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWC177-1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n018.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Sun May 19 03:56:07 EDT 2024
% 0.14/0.34  % CPUTime    : 
% 0.21/0.47  Running first-order model finding
% 0.21/0.47  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.55  # Version: 3.1.0
% 0.21/0.55  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55  # Starting sh5l with 300s (1) cores
% 0.21/0.55  # sh5l with pid 6021 completed with status 0
% 0.21/0.55  # Result found by sh5l
% 0.21/0.55  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55  # Starting sh5l with 300s (1) cores
% 0.21/0.55  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.55  # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.21/0.55  # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.55  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.21/0.55  # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 6026 completed with status 0
% 0.21/0.55  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.21/0.55  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55  # Starting sh5l with 300s (1) cores
% 0.21/0.55  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.55  # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.21/0.55  # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.55  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.21/0.55  # Preprocessing time       : 0.003 s
% 0.21/0.55  # Presaturation interreduction done
% 0.21/0.55  
% 0.21/0.55  # Proof found!
% 0.21/0.55  # SZS status Unsatisfiable
% 0.21/0.55  # SZS output start CNFRefutation
% See solution above
% 0.21/0.55  # Parsed axioms                        : 203
% 0.21/0.55  # Removed by relevancy pruning/SinE    : 33
% 0.21/0.55  # Initial clauses                      : 170
% 0.21/0.55  # Removed in clause preprocessing      : 0
% 0.21/0.55  # Initial clauses in saturation        : 170
% 0.21/0.55  # Processed clauses                    : 689
% 0.21/0.55  # ...of these trivial                  : 11
% 0.21/0.55  # ...subsumed                          : 113
% 0.21/0.55  # ...remaining for further processing  : 565
% 0.21/0.55  # Other redundant clauses eliminated   : 42
% 0.21/0.55  # Clauses deleted for lack of memory   : 0
% 0.21/0.55  # Backward-subsumed                    : 16
% 0.21/0.55  # Backward-rewritten                   : 187
% 0.21/0.55  # Generated clauses                    : 1577
% 0.21/0.55  # ...of the previous two non-redundant : 1513
% 0.21/0.55  # ...aggressively subsumed             : 0
% 0.21/0.55  # Contextual simplify-reflections      : 51
% 0.21/0.55  # Paramodulations                      : 1531
% 0.21/0.55  # Factorizations                       : 0
% 0.21/0.55  # NegExts                              : 0
% 0.21/0.55  # Equation resolutions                 : 47
% 0.21/0.55  # Disequality decompositions           : 0
% 0.21/0.55  # Total rewrite steps                  : 1713
% 0.21/0.55  # ...of those cached                   : 1638
% 0.21/0.55  # Propositional unsat checks           : 0
% 0.21/0.55  #    Propositional check models        : 0
% 0.21/0.55  #    Propositional check unsatisfiable : 0
% 0.21/0.55  #    Propositional clauses             : 0
% 0.21/0.55  #    Propositional clauses after purity: 0
% 0.21/0.55  #    Propositional unsat core size     : 0
% 0.21/0.55  #    Propositional preprocessing time  : 0.000
% 0.21/0.55  #    Propositional encoding time       : 0.000
% 0.21/0.55  #    Propositional solver time         : 0.000
% 0.21/0.55  #    Success case prop preproc time    : 0.000
% 0.21/0.55  #    Success case prop encoding time   : 0.000
% 0.21/0.55  #    Success case prop solver time     : 0.000
% 0.21/0.55  # Current number of processed clauses  : 180
% 0.21/0.55  #    Positive orientable unit clauses  : 48
% 0.21/0.55  #    Positive unorientable unit clauses: 0
% 0.21/0.55  #    Negative unit clauses             : 1
% 0.21/0.55  #    Non-unit-clauses                  : 131
% 0.21/0.55  # Current number of unprocessed clauses: 1151
% 0.21/0.55  # ...number of literals in the above   : 5898
% 0.21/0.55  # Current number of archived formulas  : 0
% 0.21/0.55  # Current number of archived clauses   : 365
% 0.21/0.55  # Clause-clause subsumption calls (NU) : 19365
% 0.21/0.55  # Rec. Clause-clause subsumption calls : 6595
% 0.21/0.55  # Non-unit clause-clause subsumptions  : 180
% 0.21/0.55  # Unit Clause-clause subsumption calls : 600
% 0.21/0.55  # Rewrite failures with RHS unbound    : 0
% 0.21/0.55  # BW rewrite match attempts            : 44
% 0.21/0.55  # BW rewrite match successes           : 20
% 0.21/0.55  # Condensation attempts                : 0
% 0.21/0.55  # Condensation successes               : 0
% 0.21/0.55  # Termbank termtop insertions          : 39819
% 0.21/0.55  # Search garbage collected termcells   : 614
% 0.21/0.55  
% 0.21/0.55  # -------------------------------------------------
% 0.21/0.55  # User time                : 0.062 s
% 0.21/0.55  # System time              : 0.005 s
% 0.21/0.55  # Total time               : 0.067 s
% 0.21/0.55  # Maximum resident set size: 2232 pages
% 0.21/0.55  
% 0.21/0.55  # -------------------------------------------------
% 0.21/0.55  # User time                : 0.068 s
% 0.21/0.55  # System time              : 0.006 s
% 0.21/0.55  # Total time               : 0.073 s
% 0.21/0.55  # Maximum resident set size: 1876 pages
% 0.21/0.55  % E---3.1 exiting
%------------------------------------------------------------------------------