↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : NUM283-1.005 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n009.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 01:44:36 PM UTC 2026

% Result   : Unsatisfiable 5.62s 1.35s
% Output   : CNFRefutation 5.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   34
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   65 (  48 unt;   0 nHn;  37 RR)
%            Number of literals    :   88 (   0 equ;  26 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :  121 (  19 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   70 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(add,axiom,
    ( ~ sum(X1,X2,X3)
    | sum(X1,s(X2),s(X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add) ).

cnf(add_0,axiom,
    sum(X1,n0,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_0) ).

cnf(times,axiom,
    ( ~ product(X4,X2,X1)
    | ~ sum(X1,X2,X3)
    | product(s(X4),X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',times) ).

cnf(times1,axiom,
    product(s(n0),X1,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',times1) ).

cnf(factorial,axiom,
    ( ~ product(s(X1),X2,X3)
    | ~ factorial(X1,X2)
    | factorial(s(X1),X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',factorial) ).

cnf(factorial_0,axiom,
    factorial(n0,s(n0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',factorial_0) ).

cnf(prove_factorial,negated_conjecture,
    ~ factorial(s(s(s(s(s(n0))))),X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_factorial) ).

cnf(c_0_7,plain,
    ( ~ sum(X1,X2,X3)
    | sum(X1,s(X2),s(X3)) ),
    inference(fof_simplification,[status(thm)],[add]) ).

cnf(c_0_8,plain,
    ( ~ sum(X1,X2,X3)
    | sum(X1,s(X2),s(X3)) ),
    c_0_7 ).

cnf(c_0_9,axiom,
    sum(X1,n0,X1),
    add_0 ).

cnf(c_0_10,plain,
    sum(X1,s(n0),s(X1)),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_11,plain,
    sum(X1,s(s(n0)),s(s(X1))),
    inference(spm,[status(thm)],[c_0_8,c_0_10]) ).

cnf(c_0_12,plain,
    sum(X1,s(s(s(n0))),s(s(s(X1)))),
    inference(spm,[status(thm)],[c_0_8,c_0_11]) ).

cnf(c_0_13,plain,
    sum(X1,s(s(s(s(n0)))),s(s(s(s(X1))))),
    inference(spm,[status(thm)],[c_0_8,c_0_12]) ).

cnf(c_0_14,plain,
    sum(X1,s(s(s(s(s(n0))))),s(s(s(s(s(X1)))))),
    inference(spm,[status(thm)],[c_0_8,c_0_13]) ).

cnf(c_0_15,plain,
    sum(X1,s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(X1))))))),
    inference(spm,[status(thm)],[c_0_8,c_0_14]) ).

cnf(c_0_16,plain,
    sum(X1,s(s(s(s(s(s(s(n0))))))),s(s(s(s(s(s(s(X1)))))))),
    inference(spm,[status(thm)],[c_0_8,c_0_15]) ).

cnf(c_0_17,plain,
    sum(X1,s(s(s(s(s(s(s(s(n0)))))))),s(s(s(s(s(s(s(s(X1))))))))),
    inference(spm,[status(thm)],[c_0_8,c_0_16]) ).

cnf(c_0_18,plain,
    sum(X1,s(s(s(s(s(s(s(s(s(n0))))))))),s(s(s(s(s(s(s(s(s(X1)))))))))),
    inference(spm,[status(thm)],[c_0_8,c_0_17]) ).

cnf(c_0_19,plain,
    sum(X1,s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(s(s(s(s(s(s(s(X1))))))))))),
    inference(spm,[status(thm)],[c_0_8,c_0_18]) ).

cnf(c_0_20,plain,
    sum(X1,s(s(s(s(s(s(s(s(s(s(s(n0))))))))))),s(s(s(s(s(s(s(s(s(s(s(X1)))))))))))),
    inference(spm,[status(thm)],[c_0_8,c_0_19]) ).

cnf(c_0_21,plain,
    sum(X1,s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(X1))))))))))))),
    inference(spm,[status(thm)],[c_0_8,c_0_20]) ).

cnf(c_0_22,plain,
    sum(X1,s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(X1)))))))))))))),
    inference(spm,[status(thm)],[c_0_8,c_0_21]) ).

cnf(c_0_23,plain,
    sum(X1,s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(X1))))))))))))))),
    inference(spm,[status(thm)],[c_0_8,c_0_22]) ).

cnf(c_0_24,plain,
    sum(X1,s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(X1)))))))))))))))),
    inference(spm,[status(thm)],[c_0_8,c_0_23]) ).

cnf(c_0_25,plain,
    sum(X1,s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(X1))))))))))))))))),
    inference(spm,[status(thm)],[c_0_8,c_0_24]) ).

cnf(c_0_26,plain,
    sum(X1,s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(X1)))))))))))))))))),
    inference(spm,[status(thm)],[c_0_8,c_0_25]) ).

cnf(c_0_27,plain,
    sum(X1,s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(X1))))))))))))))))))),
    inference(spm,[status(thm)],[c_0_8,c_0_26]) ).

cnf(c_0_28,plain,
    sum(X1,s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(X1)))))))))))))))))))),
    inference(spm,[status(thm)],[c_0_8,c_0_27]) ).

cnf(c_0_29,plain,
    sum(X1,s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(X1))))))))))))))))))))),
    inference(spm,[status(thm)],[c_0_8,c_0_28]) ).

cnf(c_0_30,plain,
    sum(X1,s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(X1)))))))))))))))))))))),
    inference(spm,[status(thm)],[c_0_8,c_0_29]) ).

cnf(c_0_31,plain,
    ( ~ product(X4,X2,X1)
    | ~ sum(X1,X2,X3)
    | product(s(X4),X2,X3) ),
    inference(fof_simplification,[status(thm)],[times]) ).

cnf(c_0_32,plain,
    sum(X1,s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(X1))))))))))))))))))))))),
    inference(spm,[status(thm)],[c_0_8,c_0_30]) ).

cnf(c_0_33,plain,
    ( ~ product(X4,X2,X1)
    | ~ sum(X1,X2,X3)
    | product(s(X4),X2,X3) ),
    c_0_31 ).

cnf(c_0_34,axiom,
    product(s(n0),X1,X1),
    times1 ).

cnf(c_0_35,plain,
    sum(X1,s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(X1)))))))))))))))))))))))),
    inference(spm,[status(thm)],[c_0_8,c_0_32]) ).

cnf(c_0_36,plain,
    ( ~ sum(X1,X1,X2)
    | product(s(s(n0)),X1,X2) ),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_37,plain,
    sum(X1,s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(X1))))))))))))))))))))))))),
    inference(spm,[status(thm)],[c_0_8,c_0_35]) ).

cnf(c_0_38,plain,
    product(s(s(n0)),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))))))))))))))))))))))))))))))))))))),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_39,plain,
    ( ~ product(s(X1),X2,X3)
    | ~ factorial(X1,X2)
    | factorial(s(X1),X3) ),
    inference(fof_simplification,[status(thm)],[factorial]) ).

cnf(c_0_40,plain,
    ( ~ sum(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))))))))))))))))))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))))))))),X1)
    | product(s(s(s(n0))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))))))))),X1) ),
    inference(spm,[status(thm)],[c_0_33,c_0_38]) ).

cnf(c_0_41,plain,
    product(s(s(n0)),s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))),
    inference(spm,[status(thm)],[c_0_36,c_0_15]) ).

cnf(c_0_42,plain,
    ( ~ product(s(X1),X2,X3)
    | ~ factorial(X1,X2)
    | factorial(s(X1),X3) ),
    c_0_39 ).

cnf(c_0_43,plain,
    product(s(s(s(n0))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))),
    inference(spm,[status(thm)],[c_0_40,c_0_37]) ).

cnf(c_0_44,plain,
    ( ~ sum(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))),s(s(s(s(s(s(n0)))))),X1)
    | product(s(s(s(n0))),s(s(s(s(s(s(n0)))))),X1) ),
    inference(spm,[status(thm)],[c_0_33,c_0_41]) ).

cnf(c_0_45,plain,
    product(s(s(n0)),s(s(n0)),s(s(s(s(n0))))),
    inference(spm,[status(thm)],[c_0_36,c_0_11]) ).

cnf(c_0_46,plain,
    ( ~ factorial(n0,X1)
    | factorial(s(n0),X1) ),
    inference(spm,[status(thm)],[c_0_42,c_0_34]) ).

cnf(c_0_47,axiom,
    factorial(n0,s(n0)),
    factorial_0 ).

cnf(c_0_48,plain,
    ( ~ sum(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))))))))),X1)
    | product(s(s(s(s(n0)))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))))))))),X1) ),
    inference(spm,[status(thm)],[c_0_33,c_0_43]) ).

cnf(c_0_49,plain,
    product(s(s(s(n0))),s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))))))),
    inference(spm,[status(thm)],[c_0_44,c_0_15]) ).

cnf(c_0_50,plain,
    ( ~ sum(s(s(s(s(n0)))),s(s(n0)),X1)
    | product(s(s(s(n0))),s(s(n0)),X1) ),
    inference(spm,[status(thm)],[c_0_33,c_0_45]) ).

cnf(c_0_51,plain,
    product(s(s(n0)),s(n0),s(s(n0))),
    inference(spm,[status(thm)],[c_0_36,c_0_10]) ).

cnf(c_0_52,plain,
    factorial(s(n0),s(n0)),
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_53,plain,
    product(s(s(s(s(n0)))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))),
    inference(spm,[status(thm)],[c_0_48,c_0_37]) ).

cnf(c_0_54,plain,
    ( ~ sum(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))),s(s(s(s(s(s(n0)))))),X1)
    | product(s(s(s(s(n0)))),s(s(s(s(s(s(n0)))))),X1) ),
    inference(spm,[status(thm)],[c_0_33,c_0_49]) ).

cnf(c_0_55,plain,
    product(s(s(s(n0))),s(s(n0)),s(s(s(s(s(s(n0))))))),
    inference(spm,[status(thm)],[c_0_50,c_0_11]) ).

cnf(c_0_56,plain,
    factorial(s(s(n0)),s(s(n0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_51]),c_0_52])]) ).

cnf(c_0_57,plain,
    ( ~ sum(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))))))))),X1)
    | product(s(s(s(s(s(n0))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))))))))),X1) ),
    inference(spm,[status(thm)],[c_0_33,c_0_53]) ).

cnf(c_0_58,plain,
    product(s(s(s(s(n0)))),s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))))))))))))),
    inference(spm,[status(thm)],[c_0_54,c_0_15]) ).

cnf(c_0_59,plain,
    factorial(s(s(s(n0))),s(s(s(s(s(s(n0))))))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_55]),c_0_56])]) ).

cnf(c_0_60,negated_conjecture,
    ~ factorial(s(s(s(s(s(n0))))),X1),
    inference(fof_simplification,[status(thm)],[prove_factorial]) ).

cnf(c_0_61,plain,
    product(s(s(s(s(s(n0))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))),
    inference(spm,[status(thm)],[c_0_57,c_0_37]) ).

cnf(c_0_62,plain,
    factorial(s(s(s(s(n0)))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))))))))))))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_58]),c_0_59])]) ).

cnf(c_0_63,negated_conjecture,
    ~ factorial(s(s(s(s(s(n0))))),X1),
    c_0_60 ).

cnf(c_0_64,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_61]),c_0_62])]),c_0_63]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : NUM283-1.005 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.44  % Computer : n009.cluster.edu
% 0.17/0.44  % Model    : x86_64 x86_64
% 0.17/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44  % Memory   : 8046.5625MB
% 0.17/0.44  % OS       : Linux 6.8.0-71-generic
% 0.17/0.44  % CPULimit : 300
% 0.17/0.44  % WCLimit  : 300
% 0.17/0.44  % DateTime : Mon Sep 21 02:20:12 UTC 2026
% 0.17/0.44  % CPUTime  : 
% 0.17/0.44  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.51  Running first-order theorem proving
% 0.26/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
% 5.62/1.35  % Version: 3.5.1
% 5.62/1.35  % Preprocessing class: FSSSSMSSSSSNFFN.
% 5.62/1.35  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.62/1.35  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.62/1.35  % Starting new_bool_3 with 300s (1) cores
% 5.62/1.35  % Starting new_bool_1 with 300s (1) cores
% 5.62/1.35  % Starting sh5l with 300s (1) cores
% 5.62/1.35  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 632799 completed with status 0
% 5.62/1.35  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 5.62/1.35  % Preprocessing class: FSSSSMSSSSSNFFN.
% 5.62/1.35  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.62/1.35  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.62/1.35  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.62/1.35  % No SInE strategy applied
% 5.62/1.35  % Search class: FHUNS-FFSF11-MFFFFFNN
% 5.62/1.35  % partial match(1): FHUNS-FFSF21-MFFFFFNN
% 5.62/1.35  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.62/1.35  % Starting SubtermCWHack with 136s (1) cores
% 5.62/1.35  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 5.62/1.35  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 5.62/1.35  % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 5.62/1.35  % Starting new_bool_3 with 136s (1) cores
% 5.62/1.35  % new_bool_3 with pid 632810 completed with status 0
% 5.62/1.35  % Result found by new_bool_3
% 5.62/1.35  % Preprocessing class: FSSSSMSSSSSNFFN.
% 5.62/1.35  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.62/1.35  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.62/1.35  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.62/1.35  % No SInE strategy applied
% 5.62/1.35  % Search class: FHUNS-FFSF11-MFFFFFNN
% 5.62/1.35  % partial match(1): FHUNS-FFSF21-MFFFFFNN
% 5.62/1.35  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.62/1.35  % Starting SubtermCWHack with 136s (1) cores
% 5.62/1.35  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 5.62/1.35  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 5.62/1.35  % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 5.62/1.35  % Starting new_bool_3 with 136s (1) cores
% 5.62/1.35  % Preprocessing time       : 0.002 s
% 5.62/1.35  % Presaturation interreduction done
% 5.62/1.35  
% 5.62/1.35  % Proof found!
% 5.62/1.35  % SZS status Unsatisfiable
% 5.62/1.35  % SZS output start CNFRefutation
% See solution above
% 5.62/1.35  % Parsed axioms                        : 7
% 5.62/1.35  % Removed by relevancy pruning/SinE    : 0
% 5.62/1.35  % Initial clauses                      : 7
% 5.62/1.35  % Removed in clause preprocessing      : 0
% 5.62/1.35  % Initial clauses in saturation        : 7
% 5.62/1.35  % Processed clauses                    : 1535
% 5.62/1.35  % ...of these trivial                  : 0
% 5.62/1.35  % ...subsumed                          : 18
% 5.62/1.35  % ...remaining for further processing  : 1517
% 5.62/1.35  % Other redundant clauses eliminated   : 0
% 5.62/1.35  % Clauses deleted for lack of memory   : 0
% 5.62/1.35  % Backward-subsumed                    : 0
% 5.62/1.35  % Backward-rewritten                   : 0
% 5.62/1.35  % Generated clauses                    : 1605
% 5.62/1.35  % ...of the previous two non-redundant : 1604
% 5.62/1.35  % ...aggressively subsumed             : 0
% 5.62/1.35  % Contextual simplify-reflections      : 0
% 5.62/1.35  % Paramodulations                      : 1605
% 5.62/1.35  % Factorizations                       : 0
% 5.62/1.35  % NegExts                              : 0
% 5.62/1.35  % Equation resolutions                 : 0
% 5.62/1.35  % Disequality decompositions           : 0
% 5.62/1.35  % Total rewrite steps                  : 4
% 5.62/1.35  % ...of those cached                   : 0
% 5.62/1.35  % Propositional unsat checks           : 0
% 5.62/1.35  %    Propositional check models        : 0
% 5.62/1.35  %    Propositional check unsatisfiable : 0
% 5.62/1.35  %    Propositional clauses             : 0
% 5.62/1.35  %    Propositional clauses after purity: 0
% 5.62/1.35  %    Propositional unsat core size     : 0
% 5.62/1.35  %    Propositional preprocessing time  : 0.000
% 5.62/1.35  %    Propositional encoding time       : 0.000
% 5.62/1.35  %    Propositional solver time         : 0.000
% 5.62/1.35  %    Success case prop preproc time    : 0.000
% 5.62/1.35  %    Success case prop encoding time   : 0.000
% 5.62/1.35  %    Success case prop solver time     : 0.000
% 5.62/1.35  % Current number of processed clauses  : 1510
% 5.62/1.35  %    Positive orientable unit clauses  : 562
% 5.62/1.35  %    Positive unorientable unit clauses: 0
% 5.62/1.35  %    Negative unit clauses             : 25
% 5.62/1.35  %    Non-unit-clauses                  : 923
% 5.62/1.35  % Current number of unprocessed clauses: 82
% 5.62/1.35  % ...number of literals in the above   : 99
% 5.62/1.35  % Current number of archived formulas  : 0
% 5.62/1.35  % Current number of archived clauses   : 7
% 5.62/1.35  % Clause-clause subsumption calls (NU) : 132729
% 5.62/1.35  % Rec. Clause-clause subsumption calls : 132729
% 5.62/1.35  % Non-unit clause-clause subsumptions  : 0
% 5.62/1.35  % Unit Clause-clause subsumption calls : 2411
% 5.62/1.35  % Rewrite failures with RHS unbound    : 0
% 5.62/1.35  % BW rewrite match attempts            : 119692
% 5.62/1.35  % BW rewrite match successes           : 0
% 5.62/1.35  % Condensation attempts                : 0
% 5.62/1.35  % Condensation successes               : 0
% 5.62/1.35  % Termbank termtop insertions          : 214589
% 5.62/1.35  % Search garbage collected termcells   : 15
% 5.62/1.35  
% 5.62/1.35  % -------------------------------------------------
% 5.62/1.35  % User time                : 0.707 s
% 5.62/1.35  % System time              : 0.083 s
% 5.62/1.35  % Total time               : 0.791 s
% 5.62/1.35  % Maximum resident set size: 3636 pages
% 5.62/1.35  
% 5.62/1.35  % -------------------------------------------------
% 5.62/1.35  % User time                : 3.774 s
% 5.62/1.35  % System time              : 0.218 s
% 5.62/1.35  % Total time               : 3.992 s
% 5.62/1.35  % Maximum resident set size: 4608 pages
% 5.62/1.35  % E exiting
%------------------------------------------------------------------------------