TSTP Solution File: KLE078+1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : KLE078+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n011.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 18:04:05 EDT 2023

% Result   : Theorem 0.99s 0.58s
% Output   : CNFRefutation 0.99s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   94 (  91 unt;   0 def)
%            Number of atoms       :  100 (  99 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :    9 (   3   ~;   0   |;   4   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :  136 (  12 sgn;  49   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(domain2,axiom,
    ! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
    file('/export/starexec/sandbox2/tmp/tmp.B5d6MdaDFe/E---3.1_23567.p',domain2) ).

fof(multiplicative_left_identity,axiom,
    ! [X1] : multiplication(one,X1) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.B5d6MdaDFe/E---3.1_23567.p',multiplicative_left_identity) ).

fof(goals,conjecture,
    ! [X4] :
      ( ! [X5] :
          ( addition(domain(X5),antidomain(X5)) = one
          & multiplication(domain(X5),antidomain(X5)) = zero )
     => domain(antidomain(X4)) = antidomain(X4) ),
    file('/export/starexec/sandbox2/tmp/tmp.B5d6MdaDFe/E---3.1_23567.p',goals) ).

fof(domain5,axiom,
    ! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
    file('/export/starexec/sandbox2/tmp/tmp.B5d6MdaDFe/E---3.1_23567.p',domain5) ).

fof(domain3,axiom,
    ! [X4] : addition(domain(X4),one) = one,
    file('/export/starexec/sandbox2/tmp/tmp.B5d6MdaDFe/E---3.1_23567.p',domain3) ).

fof(additive_commutativity,axiom,
    ! [X1,X2] : addition(X1,X2) = addition(X2,X1),
    file('/export/starexec/sandbox2/tmp/tmp.B5d6MdaDFe/E---3.1_23567.p',additive_commutativity) ).

fof(additive_associativity,axiom,
    ! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
    file('/export/starexec/sandbox2/tmp/tmp.B5d6MdaDFe/E---3.1_23567.p',additive_associativity) ).

fof(additive_idempotence,axiom,
    ! [X1] : addition(X1,X1) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.B5d6MdaDFe/E---3.1_23567.p',additive_idempotence) ).

fof(domain1,axiom,
    ! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
    file('/export/starexec/sandbox2/tmp/tmp.B5d6MdaDFe/E---3.1_23567.p',domain1) ).

fof(multiplicative_right_identity,axiom,
    ! [X1] : multiplication(X1,one) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.B5d6MdaDFe/E---3.1_23567.p',multiplicative_right_identity) ).

fof(left_distributivity,axiom,
    ! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
    file('/export/starexec/sandbox2/tmp/tmp.B5d6MdaDFe/E---3.1_23567.p',left_distributivity) ).

fof(additive_identity,axiom,
    ! [X1] : addition(X1,zero) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.B5d6MdaDFe/E---3.1_23567.p',additive_identity) ).

fof(right_distributivity,axiom,
    ! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
    file('/export/starexec/sandbox2/tmp/tmp.B5d6MdaDFe/E---3.1_23567.p',right_distributivity) ).

fof(domain4,axiom,
    domain(zero) = zero,
    file('/export/starexec/sandbox2/tmp/tmp.B5d6MdaDFe/E---3.1_23567.p',domain4) ).

fof(left_annihilation,axiom,
    ! [X1] : multiplication(zero,X1) = zero,
    file('/export/starexec/sandbox2/tmp/tmp.B5d6MdaDFe/E---3.1_23567.p',left_annihilation) ).

fof(c_0_15,plain,
    ! [X9,X10] : domain(multiplication(X9,X10)) = domain(multiplication(X9,domain(X10))),
    inference(variable_rename,[status(thm)],[domain2]) ).

fof(c_0_16,plain,
    ! [X27] : multiplication(one,X27) = X27,
    inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).

fof(c_0_17,negated_conjecture,
    ~ ! [X4] :
        ( ! [X5] :
            ( addition(domain(X5),antidomain(X5)) = one
            & multiplication(domain(X5),antidomain(X5)) = zero )
       => domain(antidomain(X4)) = antidomain(X4) ),
    inference(assume_negation,[status(cth)],[goals]) ).

fof(c_0_18,plain,
    ! [X12,X13] : domain(addition(X12,X13)) = addition(domain(X12),domain(X13)),
    inference(variable_rename,[status(thm)],[domain5]) ).

cnf(c_0_19,plain,
    domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_20,plain,
    multiplication(one,X1) = X1,
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

fof(c_0_21,plain,
    ! [X11] : addition(domain(X11),one) = one,
    inference(variable_rename,[status(thm)],[domain3]) ).

fof(c_0_22,plain,
    ! [X28,X29] : addition(X28,X29) = addition(X29,X28),
    inference(variable_rename,[status(thm)],[additive_commutativity]) ).

fof(c_0_23,plain,
    ! [X30,X31,X32] : addition(X32,addition(X31,X30)) = addition(addition(X32,X31),X30),
    inference(variable_rename,[status(thm)],[additive_associativity]) ).

fof(c_0_24,plain,
    ! [X33] : addition(X33,X33) = X33,
    inference(variable_rename,[status(thm)],[additive_idempotence]) ).

fof(c_0_25,negated_conjecture,
    ! [X7] :
      ( addition(domain(X7),antidomain(X7)) = one
      & multiplication(domain(X7),antidomain(X7)) = zero
      & domain(antidomain(esk1_0)) != antidomain(esk1_0) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).

cnf(c_0_26,plain,
    domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_27,plain,
    domain(domain(X1)) = domain(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_20]) ).

cnf(c_0_28,plain,
    addition(domain(X1),one) = one,
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_29,plain,
    addition(X1,X2) = addition(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_30,plain,
    addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_31,plain,
    addition(X1,X1) = X1,
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_32,negated_conjecture,
    addition(domain(X1),antidomain(X1)) = one,
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_33,plain,
    domain(addition(X1,domain(X2))) = domain(addition(X1,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_26]) ).

cnf(c_0_34,plain,
    addition(one,domain(X1)) = one,
    inference(rw,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_35,plain,
    addition(X1,addition(X1,X2)) = addition(X1,X2),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

fof(c_0_36,plain,
    ! [X8] : addition(X8,multiplication(domain(X8),X8)) = multiplication(domain(X8),X8),
    inference(variable_rename,[status(thm)],[domain1]) ).

fof(c_0_37,plain,
    ! [X26] : multiplication(X26,one) = X26,
    inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).

cnf(c_0_38,negated_conjecture,
    addition(antidomain(X1),domain(X1)) = one,
    inference(rw,[status(thm)],[c_0_32,c_0_29]) ).

cnf(c_0_39,plain,
    domain(addition(one,X1)) = domain(one),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_40,plain,
    addition(X1,addition(X2,X1)) = addition(X2,X1),
    inference(spm,[status(thm)],[c_0_35,c_0_29]) ).

cnf(c_0_41,plain,
    addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_42,plain,
    multiplication(X1,one) = X1,
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

fof(c_0_43,plain,
    ! [X23,X24,X25] : multiplication(addition(X23,X24),X25) = addition(multiplication(X23,X25),multiplication(X24,X25)),
    inference(variable_rename,[status(thm)],[left_distributivity]) ).

fof(c_0_44,plain,
    ! [X14] : addition(X14,zero) = X14,
    inference(variable_rename,[status(thm)],[additive_identity]) ).

cnf(c_0_45,negated_conjecture,
    addition(antidomain(X1),addition(domain(X1),X2)) = addition(one,X2),
    inference(spm,[status(thm)],[c_0_30,c_0_38]) ).

fof(c_0_46,plain,
    ! [X20,X21,X22] : multiplication(X20,addition(X21,X22)) = addition(multiplication(X20,X21),multiplication(X20,X22)),
    inference(variable_rename,[status(thm)],[right_distributivity]) ).

cnf(c_0_47,plain,
    domain(addition(X1,one)) = domain(one),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_48,plain,
    domain(one) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_34]) ).

cnf(c_0_49,plain,
    multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_50,plain,
    addition(X1,zero) = X1,
    inference(split_conjunct,[status(thm)],[c_0_44]) ).

cnf(c_0_51,negated_conjecture,
    addition(antidomain(X1),domain(addition(X1,X2))) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_26]),c_0_34]) ).

cnf(c_0_52,plain,
    multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
    inference(split_conjunct,[status(thm)],[c_0_46]) ).

cnf(c_0_53,plain,
    domain(addition(X1,one)) = one,
    inference(rw,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_54,plain,
    addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_20]),c_0_29]) ).

cnf(c_0_55,negated_conjecture,
    multiplication(domain(X1),antidomain(X1)) = zero,
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_56,plain,
    addition(zero,X1) = X1,
    inference(spm,[status(thm)],[c_0_50,c_0_29]) ).

cnf(c_0_57,negated_conjecture,
    addition(antidomain(X1),domain(addition(X2,X1))) = one,
    inference(spm,[status(thm)],[c_0_51,c_0_40]) ).

cnf(c_0_58,plain,
    addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_42]),c_0_29]) ).

cnf(c_0_59,plain,
    domain(multiplication(X1,addition(X2,one))) = domain(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_53]),c_0_42]) ).

cnf(c_0_60,plain,
    multiplication(domain(X1),X1) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_54]),c_0_29]),c_0_34]),c_0_20]) ).

cnf(c_0_61,negated_conjecture,
    multiplication(addition(domain(X1),X2),antidomain(X1)) = multiplication(X2,antidomain(X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_55]),c_0_56]) ).

cnf(c_0_62,negated_conjecture,
    addition(domain(X1),antidomain(multiplication(X1,X2))) = one,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_29]) ).

cnf(c_0_63,plain,
    addition(X1,multiplication(domain(X1),X2)) = multiplication(domain(X1),addition(X1,X2)),
    inference(spm,[status(thm)],[c_0_52,c_0_60]) ).

cnf(c_0_64,negated_conjecture,
    multiplication(domain(X1),antidomain(domain(X1))) = zero,
    inference(spm,[status(thm)],[c_0_55,c_0_27]) ).

cnf(c_0_65,negated_conjecture,
    addition(domain(X1),antidomain(domain(X1))) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_27]),c_0_29]) ).

cnf(c_0_66,negated_conjecture,
    multiplication(antidomain(multiplication(X1,X2)),antidomain(X1)) = antidomain(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_20]) ).

cnf(c_0_67,negated_conjecture,
    multiplication(domain(X1),addition(X1,antidomain(domain(X1)))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_50]) ).

cnf(c_0_68,negated_conjecture,
    multiplication(antidomain(domain(X1)),antidomain(X1)) = antidomain(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_65]),c_0_20]) ).

cnf(c_0_69,negated_conjecture,
    addition(one,antidomain(X1)) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_38]),c_0_29]) ).

cnf(c_0_70,negated_conjecture,
    domain(addition(X1,antidomain(X1))) = one,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_38]),c_0_29]),c_0_48]) ).

cnf(c_0_71,negated_conjecture,
    addition(domain(multiplication(X1,X2)),antidomain(multiplication(X1,domain(X2)))) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_19]),c_0_29]) ).

cnf(c_0_72,plain,
    domain(zero) = zero,
    inference(split_conjunct,[status(thm)],[domain4]) ).

fof(c_0_73,plain,
    ! [X16] : multiplication(zero,X16) = zero,
    inference(variable_rename,[status(thm)],[left_annihilation]) ).

cnf(c_0_74,negated_conjecture,
    multiplication(addition(X1,domain(X2)),antidomain(X2)) = multiplication(X1,antidomain(X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_55]),c_0_50]) ).

cnf(c_0_75,negated_conjecture,
    multiplication(antidomain(X1),antidomain(domain(X1))) = antidomain(domain(X1)),
    inference(spm,[status(thm)],[c_0_66,c_0_67]) ).

cnf(c_0_76,negated_conjecture,
    addition(antidomain(X1),antidomain(domain(X1))) = antidomain(domain(X1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_68]),c_0_29]),c_0_69]),c_0_42]),c_0_29]) ).

cnf(c_0_77,negated_conjecture,
    domain(multiplication(X1,addition(X2,antidomain(X2)))) = domain(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_70]),c_0_42]) ).

cnf(c_0_78,negated_conjecture,
    multiplication(domain(X1),addition(antidomain(X1),X2)) = multiplication(domain(X1),X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_55]),c_0_56]) ).

cnf(c_0_79,negated_conjecture,
    multiplication(domain(X1),addition(X1,antidomain(X1))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_55]),c_0_50]) ).

cnf(c_0_80,negated_conjecture,
    antidomain(multiplication(domain(X1),domain(antidomain(X1)))) = one,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_55]),c_0_72]),c_0_56]) ).

cnf(c_0_81,plain,
    multiplication(zero,X1) = zero,
    inference(split_conjunct,[status(thm)],[c_0_73]) ).

cnf(c_0_82,negated_conjecture,
    multiplication(domain(addition(X1,X2)),antidomain(X2)) = multiplication(domain(X1),antidomain(X2)),
    inference(spm,[status(thm)],[c_0_74,c_0_26]) ).

cnf(c_0_83,negated_conjecture,
    antidomain(domain(X1)) = antidomain(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_75]),c_0_76]),c_0_29]),c_0_69]),c_0_42]) ).

cnf(c_0_84,negated_conjecture,
    domain(multiplication(domain(X1),antidomain(antidomain(X1)))) = domain(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_27]) ).

cnf(c_0_85,negated_conjecture,
    multiplication(domain(X1),domain(antidomain(X1))) = zero,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_19]),c_0_55]),c_0_72]),c_0_81]) ).

cnf(c_0_86,negated_conjecture,
    multiplication(domain(X1),antidomain(antidomain(X1))) = antidomain(antidomain(X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_70]),c_0_20]) ).

cnf(c_0_87,negated_conjecture,
    antidomain(multiplication(domain(X1),antidomain(antidomain(X1)))) = antidomain(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_83]) ).

cnf(c_0_88,negated_conjecture,
    multiplication(domain(X1),addition(X1,domain(antidomain(X1)))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_85]),c_0_50]) ).

cnf(c_0_89,negated_conjecture,
    domain(antidomain(antidomain(X1))) = domain(X1),
    inference(rw,[status(thm)],[c_0_84,c_0_86]) ).

cnf(c_0_90,negated_conjecture,
    antidomain(antidomain(antidomain(X1))) = antidomain(X1),
    inference(rw,[status(thm)],[c_0_87,c_0_86]) ).

cnf(c_0_91,negated_conjecture,
    domain(antidomain(esk1_0)) != antidomain(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_92,negated_conjecture,
    domain(X1) = antidomain(antidomain(X1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90]),c_0_38]),c_0_42]) ).

cnf(c_0_93,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_92]),c_0_90])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : KLE078+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n011.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 2400
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Oct  3 04:47:53 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 0.20/0.48  Running first-order theorem proving
% 0.20/0.48  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/tmp/tmp.B5d6MdaDFe/E---3.1_23567.p
% 0.99/0.58  # Version: 3.1pre001
% 0.99/0.58  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.99/0.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.99/0.58  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.99/0.58  # Starting new_bool_3 with 300s (1) cores
% 0.99/0.58  # Starting new_bool_1 with 300s (1) cores
% 0.99/0.58  # Starting sh5l with 300s (1) cores
% 0.99/0.58  # new_bool_1 with pid 23716 completed with status 0
% 0.99/0.58  # Result found by new_bool_1
% 0.99/0.58  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.99/0.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.99/0.58  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.99/0.58  # Starting new_bool_3 with 300s (1) cores
% 0.99/0.58  # Starting new_bool_1 with 300s (1) cores
% 0.99/0.58  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.99/0.58  # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.99/0.58  # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.99/0.58  # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.99/0.58  # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 23726 completed with status 0
% 0.99/0.58  # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 0.99/0.58  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.99/0.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.99/0.58  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.99/0.58  # Starting new_bool_3 with 300s (1) cores
% 0.99/0.58  # Starting new_bool_1 with 300s (1) cores
% 0.99/0.58  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.99/0.58  # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.99/0.58  # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.99/0.58  # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.99/0.58  # Preprocessing time       : 0.001 s
% 0.99/0.58  # Presaturation interreduction done
% 0.99/0.58  
% 0.99/0.58  # Proof found!
% 0.99/0.58  # SZS status Theorem
% 0.99/0.58  # SZS output start CNFRefutation
% See solution above
% 0.99/0.58  # Parsed axioms                        : 18
% 0.99/0.58  # Removed by relevancy pruning/SinE    : 1
% 0.99/0.58  # Initial clauses                      : 19
% 0.99/0.58  # Removed in clause preprocessing      : 0
% 0.99/0.58  # Initial clauses in saturation        : 19
% 0.99/0.58  # Processed clauses                    : 857
% 0.99/0.58  # ...of these trivial                  : 375
% 0.99/0.58  # ...subsumed                          : 269
% 0.99/0.58  # ...remaining for further processing  : 213
% 0.99/0.58  # Other redundant clauses eliminated   : 0
% 0.99/0.58  # Clauses deleted for lack of memory   : 0
% 0.99/0.58  # Backward-subsumed                    : 0
% 0.99/0.58  # Backward-rewritten                   : 112
% 0.99/0.58  # Generated clauses                    : 13544
% 0.99/0.58  # ...of the previous two non-redundant : 6666
% 0.99/0.58  # ...aggressively subsumed             : 0
% 0.99/0.58  # Contextual simplify-reflections      : 0
% 0.99/0.58  # Paramodulations                      : 13544
% 0.99/0.58  # Factorizations                       : 0
% 0.99/0.58  # NegExts                              : 0
% 0.99/0.58  # Equation resolutions                 : 0
% 0.99/0.58  # Total rewrite steps                  : 24032
% 0.99/0.58  # Propositional unsat checks           : 0
% 0.99/0.58  #    Propositional check models        : 0
% 0.99/0.58  #    Propositional check unsatisfiable : 0
% 0.99/0.58  #    Propositional clauses             : 0
% 0.99/0.58  #    Propositional clauses after purity: 0
% 0.99/0.58  #    Propositional unsat core size     : 0
% 0.99/0.58  #    Propositional preprocessing time  : 0.000
% 0.99/0.58  #    Propositional encoding time       : 0.000
% 0.99/0.58  #    Propositional solver time         : 0.000
% 0.99/0.58  #    Success case prop preproc time    : 0.000
% 0.99/0.58  #    Success case prop encoding time   : 0.000
% 0.99/0.58  #    Success case prop solver time     : 0.000
% 0.99/0.58  # Current number of processed clauses  : 82
% 0.99/0.58  #    Positive orientable unit clauses  : 76
% 0.99/0.58  #    Positive unorientable unit clauses: 6
% 0.99/0.58  #    Negative unit clauses             : 0
% 0.99/0.58  #    Non-unit-clauses                  : 0
% 0.99/0.58  # Current number of unprocessed clauses: 5716
% 0.99/0.58  # ...number of literals in the above   : 5716
% 0.99/0.58  # Current number of archived formulas  : 0
% 0.99/0.58  # Current number of archived clauses   : 131
% 0.99/0.58  # Clause-clause subsumption calls (NU) : 0
% 0.99/0.58  # Rec. Clause-clause subsumption calls : 0
% 0.99/0.58  # Non-unit clause-clause subsumptions  : 0
% 0.99/0.58  # Unit Clause-clause subsumption calls : 17
% 0.99/0.58  # Rewrite failures with RHS unbound    : 0
% 0.99/0.58  # BW rewrite match attempts            : 378
% 0.99/0.58  # BW rewrite match successes           : 175
% 0.99/0.58  # Condensation attempts                : 0
% 0.99/0.58  # Condensation successes               : 0
% 0.99/0.58  # Termbank termtop insertions          : 131794
% 0.99/0.58  
% 0.99/0.58  # -------------------------------------------------
% 0.99/0.58  # User time                : 0.084 s
% 0.99/0.58  # System time              : 0.008 s
% 0.99/0.58  # Total time               : 0.092 s
% 0.99/0.58  # Maximum resident set size: 1780 pages
% 0.99/0.58  
% 0.99/0.58  # -------------------------------------------------
% 0.99/0.58  # User time                : 0.084 s
% 0.99/0.58  # System time              : 0.011 s
% 0.99/0.58  # Total time               : 0.095 s
% 0.99/0.58  # Maximum resident set size: 1688 pages
% 0.99/0.58  % E---3.1 exiting
% 0.99/0.58  % E---3.1 exiting
%------------------------------------------------------------------------------