↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : KLE170+1.004 : TPTP v9.3.1. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:59:01 PM UTC 2026

% Result   : Theorem 4.74s 6.10s
% Output   : CNFRefutation 4.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   98 (  77 unt;   0 def)
%            Number of atoms       :  121 (  52 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   46 (  23   ~;  19   |;   1   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :  172 (   7 sgn  54   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(additive_associativity,axiom,
    ! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',additive_associativity) ).

fof(additive_idempotence,axiom,
    ! [X1] : addition(X1,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',additive_idempotence) ).

fof(order,axiom,
    ! [X1,X2] :
      ( leq(X1,X2)
    <=> addition(X1,X2) = X2 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',order) ).

fof(additive_commutativity,axiom,
    ! [X1,X2] : addition(X1,X2) = addition(X2,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',additive_commutativity) ).

fof(star_unfold_left,axiom,
    ! [X1] : leq(addition(one,multiplication(star(X1),X1)),star(X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',star_unfold_left) ).

fof(star_unfold_right,axiom,
    ! [X1] : leq(addition(one,multiplication(X1,star(X1))),star(X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',star_unfold_right) ).

fof(right_distributivity,axiom,
    ! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',right_distributivity) ).

fof(multiplicative_right_identity,axiom,
    ! [X1] : multiplication(X1,one) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',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/benchmark/Axioms/KLE002+0.ax',left_distributivity) ).

fof(multiplicative_left_identity,axiom,
    ! [X1] : multiplication(one,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',multiplicative_left_identity) ).

fof(star_induction_left,axiom,
    ! [X1,X2,X3] :
      ( leq(addition(multiplication(X1,X2),X3),X2)
     => leq(multiplication(star(X1),X3),X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',star_induction_left) ).

fof(star_induction_right,axiom,
    ! [X1,X2,X3] :
      ( leq(addition(multiplication(X1,X2),X3),X1)
     => leq(multiplication(X3,star(X2)),X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',star_induction_right) ).

fof(multiplicative_associativity,axiom,
    ! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',multiplicative_associativity) ).

fof(a,conjecture,
    leq(multiplication(a,multiplication(a,multiplication(a,a))),star(a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a) ).

fof(c_0_14,plain,
    ! [X6,X7,X8] : addition(X8,addition(X7,X6)) = addition(addition(X8,X7),X6),
    inference(variable_rename,[status(thm)],[additive_associativity]) ).

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

fof(c_0_16,plain,
    ! [X24,X25] :
      ( ( leq(X24,X25)
        | addition(X24,X25) != X25 )
      & ( addition(X24,X25) = X25
        | ~ leq(X24,X25) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])]) ).

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

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

fof(c_0_19,plain,
    ! [X4,X5] : addition(X4,X5) = addition(X5,X4),
    inference(variable_rename,[status(thm)],[additive_commutativity]) ).

cnf(c_0_20,plain,
    ( addition(X1,X2) != X2
    | leq(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_21,plain,
    addition(X1,addition(X1,X2)) = addition(X1,X2),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

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

fof(c_0_23,plain,
    ! [X27] : leq(addition(one,multiplication(star(X27),X27)),star(X27)),
    inference(variable_rename,[status(thm)],[star_unfold_left]) ).

cnf(c_0_24,plain,
    leq(X1,addition(X1,X2)),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_25,plain,
    addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
    inference(spm,[status(thm)],[c_0_22,c_0_17]) ).

cnf(c_0_26,plain,
    ( ~ leq(X1,X2)
    | addition(X1,X2) = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_27,plain,
    leq(addition(one,multiplication(star(X1),X1)),star(X1)),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

fof(c_0_28,plain,
    ! [X26] : leq(addition(one,multiplication(X26,star(X26))),star(X26)),
    inference(variable_rename,[status(thm)],[star_unfold_right]) ).

cnf(c_0_29,plain,
    leq(X1,addition(X2,addition(X3,X1))),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_30,plain,
    addition(one,addition(star(X1),multiplication(star(X1),X1))) = star(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_17]),c_0_22]) ).

fof(c_0_31,plain,
    ! [X16,X17,X18] : multiplication(X16,addition(X17,X18)) = addition(multiplication(X16,X17),multiplication(X16,X18)),
    inference(variable_rename,[status(thm)],[right_distributivity]) ).

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

fof(c_0_33,plain,
    ! [X19,X20,X21] : multiplication(addition(X19,X20),X21) = addition(multiplication(X19,X21),multiplication(X20,X21)),
    inference(variable_rename,[status(thm)],[left_distributivity]) ).

cnf(c_0_34,plain,
    leq(addition(one,multiplication(X1,star(X1))),star(X1)),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_35,plain,
    leq(multiplication(star(X1),X1),star(X1)),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

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

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

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

cnf(c_0_39,plain,
    addition(one,addition(star(X1),multiplication(X1,star(X1)))) = star(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_34]),c_0_17]),c_0_22]) ).

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

fof(c_0_41,plain,
    ! [X28,X29,X30] :
      ( leq(multiplication(star(X28),X30),X29)
      | ~ leq(addition(multiplication(X28,X29),X30),X29) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_left])])]) ).

cnf(c_0_42,plain,
    addition(star(X1),multiplication(star(X1),X1)) = star(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_35]),c_0_22]) ).

cnf(c_0_43,plain,
    addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_22]) ).

cnf(c_0_44,plain,
    ( multiplication(addition(X1,X3),X2) != multiplication(X3,X2)
    | leq(multiplication(X1,X2),multiplication(X3,X2)) ),
    inference(spm,[status(thm)],[c_0_20,c_0_38]) ).

cnf(c_0_45,plain,
    addition(one,star(X1)) = star(X1),
    inference(spm,[status(thm)],[c_0_21,c_0_39]) ).

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

fof(c_0_47,plain,
    ! [X31,X32,X33] :
      ( leq(multiplication(X33,star(X32)),X31)
      | ~ leq(addition(multiplication(X31,X32),X33),X31) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_right])])]) ).

cnf(c_0_48,plain,
    ( ~ leq(addition(multiplication(X1,X2),X3),X2)
    | leq(multiplication(star(X1),X3),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_41]) ).

cnf(c_0_49,plain,
    leq(multiplication(X1,star(X1)),star(X1)),
    inference(spm,[status(thm)],[c_0_29,c_0_39]) ).

cnf(c_0_50,plain,
    multiplication(star(X1),addition(X1,one)) = star(X1),
    inference(rw,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_51,plain,
    leq(X1,multiplication(star(X2),X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).

cnf(c_0_52,plain,
    ( ~ leq(addition(multiplication(X1,X2),X3),X1)
    | leq(multiplication(X3,star(X2)),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_47]) ).

fof(c_0_53,plain,
    ! [X11,X12,X13] : multiplication(X11,multiplication(X12,X13)) = multiplication(multiplication(X11,X12),X13),
    inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).

cnf(c_0_54,plain,
    ( ~ leq(addition(X2,multiplication(X1,X3)),X3)
    | leq(multiplication(star(X1),X2),X3) ),
    inference(spm,[status(thm)],[c_0_48,c_0_22]) ).

cnf(c_0_55,plain,
    addition(star(X1),multiplication(X1,star(X1))) = star(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_49]),c_0_22]) ).

cnf(c_0_56,plain,
    leq(X1,X1),
    inference(spm,[status(thm)],[c_0_20,c_0_18]) ).

cnf(c_0_57,plain,
    multiplication(star(X1),addition(one,X1)) = star(X1),
    inference(spm,[status(thm)],[c_0_50,c_0_22]) ).

cnf(c_0_58,plain,
    leq(addition(X1,one),star(X1)),
    inference(spm,[status(thm)],[c_0_51,c_0_50]) ).

cnf(c_0_59,plain,
    ( ~ leq(addition(X1,multiplication(X3,X2)),X3)
    | leq(multiplication(X1,star(X2)),X3) ),
    inference(spm,[status(thm)],[c_0_52,c_0_22]) ).

cnf(c_0_60,plain,
    multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
    inference(split_conjunct,[status(thm)],[c_0_53]) ).

cnf(c_0_61,plain,
    ( ~ leq(multiplication(X1,X2),X2)
    | leq(multiplication(star(X1),multiplication(X1,X2)),X2) ),
    inference(spm,[status(thm)],[c_0_48,c_0_18]) ).

cnf(c_0_62,plain,
    leq(multiplication(star(X1),star(X1)),star(X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]) ).

cnf(c_0_63,plain,
    multiplication(star(star(X1)),star(X1)) = star(star(X1)),
    inference(spm,[status(thm)],[c_0_57,c_0_45]) ).

cnf(c_0_64,plain,
    addition(X1,star(X1)) = star(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_58]),c_0_17]),c_0_45]) ).

cnf(c_0_65,plain,
    ( ~ leq(multiplication(addition(X1,X3),X2),X3)
    | leq(multiplication(X1,multiplication(X2,star(X2))),X3) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_38]),c_0_60]) ).

cnf(c_0_66,plain,
    leq(multiplication(star(star(X1)),multiplication(star(X1),star(X1))),star(X1)),
    inference(spm,[status(thm)],[c_0_61,c_0_62]) ).

cnf(c_0_67,plain,
    multiplication(star(star(X1)),multiplication(star(X1),X2)) = multiplication(star(star(X1)),X2),
    inference(spm,[status(thm)],[c_0_60,c_0_63]) ).

cnf(c_0_68,plain,
    leq(multiplication(X1,X2),multiplication(star(X1),X2)),
    inference(spm,[status(thm)],[c_0_44,c_0_64]) ).

cnf(c_0_69,plain,
    ( ~ leq(multiplication(star(X1),X2),star(X1))
    | leq(multiplication(X1,multiplication(X2,star(X2))),star(X1)) ),
    inference(spm,[status(thm)],[c_0_65,c_0_64]) ).

cnf(c_0_70,plain,
    leq(star(star(X1)),star(X1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67]),c_0_63]) ).

cnf(c_0_71,plain,
    leq(multiplication(X1,addition(one,X1)),star(X1)),
    inference(spm,[status(thm)],[c_0_68,c_0_57]) ).

cnf(c_0_72,plain,
    ( ~ leq(addition(multiplication(X1,multiplication(X2,X4)),X3),X4)
    | leq(multiplication(star(multiplication(X1,X2)),X3),X4) ),
    inference(spm,[status(thm)],[c_0_48,c_0_60]) ).

cnf(c_0_73,plain,
    leq(multiplication(X1,multiplication(X1,star(X1))),star(X1)),
    inference(spm,[status(thm)],[c_0_69,c_0_35]) ).

cnf(c_0_74,plain,
    leq(star(X1),star(star(X1))),
    inference(spm,[status(thm)],[c_0_51,c_0_63]) ).

cnf(c_0_75,plain,
    addition(star(X1),star(star(X1))) = star(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_70]),c_0_22]) ).

cnf(c_0_76,plain,
    leq(multiplication(X1,X2),addition(X3,multiplication(X1,addition(X4,X2)))),
    inference(spm,[status(thm)],[c_0_29,c_0_36]) ).

cnf(c_0_77,plain,
    addition(star(X1),multiplication(X1,addition(one,X1))) = star(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_71]),c_0_22]) ).

cnf(c_0_78,plain,
    ( ~ leq(multiplication(X1,addition(X2,X3)),X3)
    | leq(multiplication(star(X1),multiplication(X1,X2)),X3) ),
    inference(spm,[status(thm)],[c_0_54,c_0_36]) ).

cnf(c_0_79,plain,
    ( ~ leq(addition(X3,multiplication(X1,multiplication(X2,X4))),X4)
    | leq(multiplication(star(multiplication(X1,X2)),X3),X4) ),
    inference(spm,[status(thm)],[c_0_72,c_0_22]) ).

cnf(c_0_80,plain,
    addition(star(X1),multiplication(X1,multiplication(X1,star(X1)))) = star(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_73]),c_0_22]) ).

cnf(c_0_81,plain,
    star(star(X1)) = star(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_74]),c_0_75]) ).

fof(c_0_82,negated_conjecture,
    ~ leq(multiplication(a,multiplication(a,multiplication(a,a))),star(a)),
    inference(assume_negation,[status(cth)],[a]) ).

cnf(c_0_83,plain,
    addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_22]),c_0_17]) ).

cnf(c_0_84,plain,
    leq(multiplication(X1,X1),star(X1)),
    inference(spm,[status(thm)],[c_0_76,c_0_77]) ).

cnf(c_0_85,plain,
    ( ~ leq(multiplication(X1,star(X2)),star(X2))
    | leq(multiplication(star(X1),X1),star(X2)) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_45]),c_0_37]) ).

cnf(c_0_86,plain,
    leq(multiplication(star(multiplication(X1,X1)),star(X1)),star(X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_56])]) ).

cnf(c_0_87,plain,
    multiplication(star(X1),star(X1)) = star(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_81]),c_0_81]) ).

fof(c_0_88,negated_conjecture,
    ~ leq(multiplication(a,multiplication(a,multiplication(a,a))),star(a)),
    inference(fof_simplification,[status(thm)],[c_0_82]) ).

cnf(c_0_89,plain,
    ( addition(X2,addition(X1,X3)) != addition(X2,X3)
    | leq(X1,addition(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_20,c_0_83]) ).

cnf(c_0_90,plain,
    addition(multiplication(X1,X1),star(X1)) = star(X1),
    inference(spm,[status(thm)],[c_0_26,c_0_84]) ).

cnf(c_0_91,plain,
    leq(star(multiplication(X1,X1)),star(X1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_81]),c_0_87]) ).

fof(c_0_92,negated_conjecture,
    ~ leq(multiplication(a,multiplication(a,multiplication(a,a))),star(a)),
    inference(fof_nnf,[status(thm)],[c_0_88]) ).

cnf(c_0_93,plain,
    leq(multiplication(X1,X1),addition(X2,star(X1))),
    inference(spm,[status(thm)],[c_0_89,c_0_90]) ).

cnf(c_0_94,plain,
    addition(star(X1),star(multiplication(X1,X1))) = star(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_91]),c_0_22]) ).

cnf(c_0_95,negated_conjecture,
    ~ leq(multiplication(a,multiplication(a,multiplication(a,a))),star(a)),
    inference(split_conjunct,[status(thm)],[c_0_92]) ).

cnf(c_0_96,plain,
    leq(multiplication(X1,multiplication(X1,multiplication(X1,X1))),star(X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_60]) ).

cnf(c_0_97,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_96])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : KLE170+1.004 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.42  % Computer : n016.cluster.edu
% 0.15/5.42  % Model    : x86_64 x86_64
% 0.15/5.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/5.42  % Memory   : 8046.5625MB
% 0.15/5.42  % OS       : Linux 6.8.0-71-generic
% 0.15/5.42  % CPULimit : 300
% 0.15/5.42  % WCLimit  : 300
% 0.15/5.42  % DateTime : Sun Sep 20 22:53:46 UTC 2026
% 0.15/5.42  % CPUTime  : 
% 0.15/5.42  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.46  Running first-order theorem proving
% 0.15/5.46  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
% 4.74/6.10  % Version: 3.5.1
% 4.74/6.10  % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.74/6.10  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.74/6.10  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.74/6.10  % Starting new_bool_3 with 300s (1) cores
% 4.74/6.10  % Starting new_bool_1 with 300s (1) cores
% 4.74/6.10  % Starting sh5l with 300s (1) cores
% 4.74/6.10  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 968341 completed with status 0
% 4.74/6.10  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.74/6.10  % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.74/6.10  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.74/6.10  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.74/6.10  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.74/6.10  % No SInE strategy applied
% 4.74/6.10  % Search class: FHUSM-FFSF21-MFFFFFNN
% 4.74/6.10  % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 4.74/6.10  % Starting SubtermCWHack with 136s (1) cores
% 4.74/6.10  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.74/6.10  % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 4.74/6.10  % Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 4.74/6.10  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 4.74/6.10  % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 968350 completed with status 0
% 4.74/6.10  % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 4.74/6.10  % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.74/6.10  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.74/6.10  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.74/6.10  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.74/6.10  % No SInE strategy applied
% 4.74/6.10  % Search class: FHUSM-FFSF21-MFFFFFNN
% 4.74/6.10  % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 4.74/6.10  % Starting SubtermCWHack with 136s (1) cores
% 4.74/6.10  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.74/6.10  % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 4.74/6.10  % Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 4.74/6.10  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 4.74/6.10  % Preprocessing time       : 0.001 s
% 4.74/6.10  % Presaturation interreduction done
% 4.74/6.10  
% 4.74/6.10  % Proof found!
% 4.74/6.10  % SZS status Theorem
% 4.74/6.10  % SZS output start CNFRefutation
% See solution above
% 4.74/6.10  % Parsed axioms                        : 17
% 4.74/6.10  % Removed by relevancy pruning/SinE    : 0
% 4.74/6.10  % Initial clauses                      : 18
% 4.74/6.10  % Removed in clause preprocessing      : 0
% 4.74/6.10  % Initial clauses in saturation        : 18
% 4.74/6.10  % Processed clauses                    : 4544
% 4.74/6.10  % ...of these trivial                  : 631
% 4.74/6.10  % ...subsumed                          : 3090
% 4.74/6.10  % ...remaining for further processing  : 823
% 4.74/6.10  % Other redundant clauses eliminated   : 38
% 4.74/6.10  % Clauses deleted for lack of memory   : 0
% 4.74/6.10  % Backward-subsumed                    : 6
% 4.74/6.10  % Backward-rewritten                   : 106
% 4.74/6.10  % Generated clauses                    : 41220
% 4.74/6.10  % ...of the previous two non-redundant : 29975
% 4.74/6.10  % ...aggressively subsumed             : 0
% 4.74/6.10  % Contextual simplify-reflections      : 0
% 4.74/6.10  % Paramodulations                      : 41182
% 4.74/6.10  % Factorizations                       : 0
% 4.74/6.10  % NegExts                              : 0
% 4.74/6.10  % Equation resolutions                 : 38
% 4.74/6.10  % Disequality decompositions           : 0
% 4.74/6.10  % Total rewrite steps                  : 44452
% 4.74/6.10  % ...of those cached                   : 39476
% 4.74/6.10  % Propositional unsat checks           : 0
% 4.74/6.10  %    Propositional check models        : 0
% 4.74/6.10  %    Propositional check unsatisfiable : 0
% 4.74/6.10  %    Propositional clauses             : 0
% 4.74/6.10  %    Propositional clauses after purity: 0
% 4.74/6.10  %    Propositional unsat core size     : 0
% 4.74/6.10  %    Propositional preprocessing time  : 0.000
% 4.74/6.10  %    Propositional encoding time       : 0.000
% 4.74/6.10  %    Propositional solver time         : 0.000
% 4.74/6.10  %    Success case prop preproc time    : 0.000
% 4.74/6.10  %    Success case prop encoding time   : 0.000
% 4.74/6.10  %    Success case prop solver time     : 0.000
% 4.74/6.10  % Current number of processed clauses  : 693
% 4.74/6.10  %    Positive orientable unit clauses  : 285
% 4.74/6.10  %    Positive unorientable unit clauses: 8
% 4.74/6.10  %    Negative unit clauses             : 0
% 4.74/6.10  %    Non-unit-clauses                  : 400
% 4.74/6.10  % Current number of unprocessed clauses: 25258
% 4.74/6.10  % ...number of literals in the above   : 43207
% 4.74/6.10  % Current number of archived formulas  : 0
% 4.74/6.10  % Current number of archived clauses   : 130
% 4.74/6.10  % Clause-clause subsumption calls (NU) : 47899
% 4.74/6.10  % Rec. Clause-clause subsumption calls : 47810
% 4.74/6.10  % Non-unit clause-clause subsumptions  : 2986
% 4.74/6.10  % Unit Clause-clause subsumption calls : 2087
% 4.74/6.10  % Rewrite failures with RHS unbound    : 0
% 4.74/6.10  % BW rewrite match attempts            : 1419
% 4.74/6.10  % BW rewrite match successes           : 118
% 4.74/6.10  % Condensation attempts                : 0
% 4.74/6.10  % Condensation successes               : 0
% 4.74/6.10  % Termbank termtop insertions          : 505956
% 4.74/6.10  % Search garbage collected termcells   : 47
% 4.74/6.10  
% 4.74/6.10  % -------------------------------------------------
% 4.74/6.10  % User time                : 0.568 s
% 4.74/6.10  % System time              : 0.032 s
% 4.74/6.10  % Total time               : 0.599 s
% 4.74/6.10  % Maximum resident set size: 3648 pages
% 4.74/6.10  
% 4.74/6.10  % -------------------------------------------------
% 4.74/6.10  % User time                : 2.827 s
% 4.74/6.10  % System time              : 0.163 s
% 4.74/6.10  % Total time               : 2.989 s
% 4.74/6.10  % Maximum resident set size: 4608 pages
% 4.74/6.10  % E exiting
%------------------------------------------------------------------------------