↑ Up

E-SAT---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : FLD012-4 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n012.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:23:07 PM UTC 2026

% Result   : Unsatisfiable 13.62s 2.13s
% Output   : CNFRefutation 13.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   23
% Syntax   : Number of clauses     :   93 (  39 unt;   7 nHn;  93 RR)
%            Number of literals    :  214 (   0 equ; 126 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-1 aty)
%            Number of variables   :  177 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(associativity_multiplication_1,axiom,
    ( ~ product(X5,X6,X3)
    | ~ product(X4,X6,X2)
    | ~ product(X1,X4,X5)
    | product(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',associativity_multiplication_1) ).

cnf(existence_of_identity_multiplication,axiom,
    ( ~ defined(X1)
    | product(multiplicative_identity,X1,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_identity_multiplication) ).

cnf(commutativity_multiplication,axiom,
    ( ~ product(X2,X1,X3)
    | product(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',commutativity_multiplication) ).

cnf(existence_of_inverse_multiplication,axiom,
    ( ~ defined(X1)
    | sum(additive_identity,X1,additive_identity)
    | product(multiplicative_inverse(X1),X1,multiplicative_identity) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_inverse_multiplication) ).

cnf(product_7,negated_conjecture,
    product(a,b,u),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_7) ).

cnf(not_sum_6,negated_conjecture,
    ~ sum(additive_identity,b,additive_identity),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_sum_6) ).

cnf(product_8,negated_conjecture,
    product(multiplicative_inverse(a),multiplicative_inverse(b),v),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_8) ).

cnf(not_sum_5,negated_conjecture,
    ~ sum(additive_identity,a,additive_identity),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_sum_5) ).

cnf(a_is_defined,hypothesis,
    defined(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).

cnf(b_is_defined,hypothesis,
    defined(b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).

cnf(distributivity_2,axiom,
    ( ~ sum(X6,X7,X3)
    | ~ product(X5,X2,X7)
    | ~ product(X4,X2,X6)
    | ~ sum(X4,X5,X1)
    | product(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',distributivity_2) ).

cnf(existence_of_identity_addition,axiom,
    ( ~ defined(X1)
    | sum(additive_identity,X1,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_identity_addition) ).

cnf(v_is_defined,hypothesis,
    defined(v),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',v_is_defined) ).

cnf(u_is_defined,hypothesis,
    defined(u),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_is_defined) ).

cnf(not_product_9,negated_conjecture,
    ~ product(multiplicative_identity,multiplicative_inverse(u),v),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_product_9) ).

cnf(distributivity_1,axiom,
    ( ~ product(X5,X7,X2)
    | ~ product(X4,X7,X1)
    | ~ product(X6,X7,X3)
    | ~ sum(X4,X5,X6)
    | sum(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',distributivity_1) ).

cnf(well_definedness_of_additive_identity,axiom,
    defined(additive_identity),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',well_definedness_of_additive_identity) ).

cnf(commutativity_addition,axiom,
    ( ~ sum(X2,X1,X3)
    | sum(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).

cnf(existence_of_inverse_addition,axiom,
    ( ~ defined(X1)
    | sum(additive_inverse(X1),X1,additive_identity) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_inverse_addition) ).

cnf(associativity_addition_1,axiom,
    ( ~ sum(X5,X6,X3)
    | ~ sum(X4,X6,X2)
    | ~ sum(X1,X4,X5)
    | sum(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',associativity_addition_1) ).

cnf(well_definedness_of_multiplicative_identity,axiom,
    defined(multiplicative_identity),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',well_definedness_of_multiplicative_identity) ).

cnf(associativity_addition_2,axiom,
    ( ~ sum(X4,X6,X3)
    | ~ sum(X5,X2,X6)
    | ~ sum(X4,X5,X1)
    | sum(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',associativity_addition_2) ).

cnf(different_identities,axiom,
    ~ sum(additive_identity,additive_identity,multiplicative_identity),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',different_identities) ).

cnf(c_0_23,plain,
    ( ~ product(X5,X6,X3)
    | ~ product(X4,X6,X2)
    | ~ product(X1,X4,X5)
    | product(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[associativity_multiplication_1]) ).

cnf(c_0_24,plain,
    ( ~ defined(X1)
    | product(multiplicative_identity,X1,X1) ),
    inference(fof_simplification,[status(thm)],[existence_of_identity_multiplication]) ).

cnf(c_0_25,plain,
    ( ~ product(X2,X1,X3)
    | product(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[commutativity_multiplication]) ).

cnf(c_0_26,plain,
    ( ~ defined(X1)
    | sum(additive_identity,X1,additive_identity)
    | product(multiplicative_inverse(X1),X1,multiplicative_identity) ),
    inference(fof_simplification,[status(thm)],[existence_of_inverse_multiplication]) ).

cnf(c_0_27,plain,
    ( ~ product(X5,X6,X3)
    | ~ product(X4,X6,X2)
    | ~ product(X1,X4,X5)
    | product(X1,X2,X3) ),
    c_0_23 ).

cnf(c_0_28,plain,
    ( ~ defined(X1)
    | product(multiplicative_identity,X1,X1) ),
    c_0_24 ).

cnf(c_0_29,plain,
    ( ~ product(X2,X1,X3)
    | product(X1,X2,X3) ),
    c_0_25 ).

cnf(c_0_30,plain,
    ( ~ defined(X1)
    | sum(additive_identity,X1,additive_identity)
    | product(multiplicative_inverse(X1),X1,multiplicative_identity) ),
    c_0_26 ).

cnf(c_0_31,plain,
    ( ~ defined(X3)
    | ~ product(X4,X3,X2)
    | ~ product(X1,X4,multiplicative_identity)
    | product(X1,X2,X3) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_32,negated_conjecture,
    product(a,b,u),
    product_7 ).

cnf(c_0_33,negated_conjecture,
    ~ sum(additive_identity,b,additive_identity),
    inference(fof_simplification,[status(thm)],[not_sum_6]) ).

cnf(c_0_34,plain,
    ( ~ defined(X1)
    | sum(additive_identity,X1,additive_identity)
    | product(X1,multiplicative_inverse(X1),multiplicative_identity) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_35,negated_conjecture,
    product(multiplicative_inverse(a),multiplicative_inverse(b),v),
    product_8 ).

cnf(c_0_36,negated_conjecture,
    ~ sum(additive_identity,a,additive_identity),
    inference(fof_simplification,[status(thm)],[not_sum_5]) ).

cnf(c_0_37,plain,
    ( ~ defined(X1)
    | ~ defined(X3)
    | ~ product(X1,X3,X2)
    | sum(additive_identity,X1,additive_identity)
    | product(multiplicative_inverse(X1),X2,X3) ),
    inference(spm,[status(thm)],[c_0_31,c_0_30]) ).

cnf(c_0_38,negated_conjecture,
    product(b,a,u),
    inference(spm,[status(thm)],[c_0_29,c_0_32]) ).

cnf(c_0_39,hypothesis,
    defined(a),
    a_is_defined ).

cnf(c_0_40,hypothesis,
    defined(b),
    b_is_defined ).

cnf(c_0_41,negated_conjecture,
    ~ sum(additive_identity,b,additive_identity),
    c_0_33 ).

cnf(c_0_42,plain,
    ( ~ defined(X3)
    | ~ product(X1,X4,X3)
    | ~ product(X4,multiplicative_inverse(X3),X2)
    | sum(additive_identity,X3,additive_identity)
    | product(X1,X2,multiplicative_identity) ),
    inference(spm,[status(thm)],[c_0_27,c_0_34]) ).

cnf(c_0_43,negated_conjecture,
    product(multiplicative_inverse(b),multiplicative_inverse(a),v),
    inference(spm,[status(thm)],[c_0_29,c_0_35]) ).

cnf(c_0_44,negated_conjecture,
    ~ sum(additive_identity,a,additive_identity),
    c_0_36 ).

cnf(c_0_45,negated_conjecture,
    product(multiplicative_inverse(b),u,a),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40])]),c_0_41]) ).

cnf(c_0_46,plain,
    ( ~ sum(X6,X7,X3)
    | ~ product(X5,X2,X7)
    | ~ product(X4,X2,X6)
    | ~ sum(X4,X5,X1)
    | product(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[distributivity_2]) ).

cnf(c_0_47,plain,
    ( ~ defined(X1)
    | sum(additive_identity,X1,X1) ),
    inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).

cnf(c_0_48,negated_conjecture,
    ( ~ product(X1,multiplicative_inverse(b),a)
    | product(X1,v,multiplicative_identity) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_39])]),c_0_44]) ).

cnf(c_0_49,negated_conjecture,
    product(u,multiplicative_inverse(b),a),
    inference(spm,[status(thm)],[c_0_29,c_0_45]) ).

cnf(c_0_50,plain,
    ( ~ sum(X6,X7,X3)
    | ~ product(X5,X2,X7)
    | ~ product(X4,X2,X6)
    | ~ sum(X4,X5,X1)
    | product(X1,X2,X3) ),
    c_0_46 ).

cnf(c_0_51,plain,
    ( ~ defined(X1)
    | sum(additive_identity,X1,X1) ),
    c_0_47 ).

cnf(c_0_52,negated_conjecture,
    product(u,v,multiplicative_identity),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_53,hypothesis,
    defined(v),
    v_is_defined ).

cnf(c_0_54,hypothesis,
    defined(u),
    u_is_defined ).

cnf(c_0_55,negated_conjecture,
    ~ product(multiplicative_identity,multiplicative_inverse(u),v),
    inference(fof_simplification,[status(thm)],[not_product_9]) ).

cnf(c_0_56,plain,
    ( ~ product(X5,X7,X2)
    | ~ product(X4,X7,X1)
    | ~ product(X6,X7,X3)
    | ~ sum(X4,X5,X6)
    | sum(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[distributivity_1]) ).

cnf(c_0_57,plain,
    ( ~ sum(X4,X5,X1)
    | ~ defined(X3)
    | ~ product(X5,X2,X3)
    | ~ product(X4,X2,additive_identity)
    | product(X1,X2,X3) ),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_58,plain,
    ( ~ defined(X1)
    | product(X1,multiplicative_identity,X1) ),
    inference(spm,[status(thm)],[c_0_29,c_0_28]) ).

cnf(c_0_59,axiom,
    defined(additive_identity),
    well_definedness_of_additive_identity ).

cnf(c_0_60,negated_conjecture,
    ( sum(additive_identity,u,additive_identity)
    | product(multiplicative_inverse(u),multiplicative_identity,v) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_52]),c_0_53]),c_0_54])]) ).

cnf(c_0_61,negated_conjecture,
    ~ product(multiplicative_identity,multiplicative_inverse(u),v),
    c_0_55 ).

cnf(c_0_62,plain,
    ( ~ sum(X2,X1,X3)
    | sum(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[commutativity_addition]) ).

cnf(c_0_63,plain,
    ( ~ defined(X1)
    | sum(additive_inverse(X1),X1,additive_identity) ),
    inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).

cnf(c_0_64,plain,
    ( ~ product(X5,X7,X2)
    | ~ product(X4,X7,X1)
    | ~ product(X6,X7,X3)
    | ~ sum(X4,X5,X6)
    | sum(X1,X2,X3) ),
    c_0_56 ).

cnf(c_0_65,plain,
    ( ~ sum(additive_identity,X3,X1)
    | ~ defined(X2)
    | ~ product(X3,multiplicative_identity,X2)
    | product(X1,multiplicative_identity,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]) ).

cnf(c_0_66,negated_conjecture,
    sum(additive_identity,u,additive_identity),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_60]),c_0_61]) ).

cnf(c_0_67,plain,
    ( ~ sum(X5,X6,X3)
    | ~ sum(X4,X6,X2)
    | ~ sum(X1,X4,X5)
    | sum(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[associativity_addition_1]) ).

cnf(c_0_68,plain,
    ( ~ sum(X2,X1,X3)
    | sum(X1,X2,X3) ),
    c_0_62 ).

cnf(c_0_69,plain,
    ( ~ defined(X1)
    | sum(additive_inverse(X1),X1,additive_identity) ),
    c_0_63 ).

cnf(c_0_70,plain,
    ( ~ sum(X5,X4,multiplicative_identity)
    | ~ defined(X3)
    | ~ product(X5,X3,X1)
    | ~ product(X4,X3,X2)
    | sum(X1,X2,X3) ),
    inference(spm,[status(thm)],[c_0_64,c_0_28]) ).

cnf(c_0_71,axiom,
    defined(multiplicative_identity),
    well_definedness_of_multiplicative_identity ).

cnf(c_0_72,negated_conjecture,
    ( ~ product(X1,X3,u)
    | ~ product(X3,v,X2)
    | product(X1,X2,multiplicative_identity) ),
    inference(spm,[status(thm)],[c_0_27,c_0_52]) ).

cnf(c_0_73,negated_conjecture,
    ( ~ defined(X1)
    | ~ product(u,multiplicative_identity,X1)
    | product(additive_identity,multiplicative_identity,X1) ),
    inference(spm,[status(thm)],[c_0_65,c_0_66]) ).

cnf(c_0_74,plain,
    ( ~ sum(X4,X6,X3)
    | ~ sum(X5,X2,X6)
    | ~ sum(X4,X5,X1)
    | sum(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[associativity_addition_2]) ).

cnf(c_0_75,plain,
    ( ~ sum(X5,X6,X3)
    | ~ sum(X4,X6,X2)
    | ~ sum(X1,X4,X5)
    | sum(X1,X2,X3) ),
    c_0_67 ).

cnf(c_0_76,plain,
    ( ~ defined(X1)
    | sum(X1,additive_inverse(X1),additive_identity) ),
    inference(spm,[status(thm)],[c_0_68,c_0_69]) ).

cnf(c_0_77,plain,
    ( ~ defined(X3)
    | ~ product(additive_identity,X3,X1)
    | ~ product(multiplicative_identity,X3,X2)
    | sum(X1,X2,X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_51]),c_0_71])]) ).

cnf(c_0_78,negated_conjecture,
    ( ~ product(X1,multiplicative_identity,u)
    | product(X1,v,multiplicative_identity) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_28]),c_0_53])]) ).

cnf(c_0_79,negated_conjecture,
    product(additive_identity,multiplicative_identity,u),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_58]),c_0_54])]) ).

cnf(c_0_80,plain,
    ( ~ sum(X4,X6,X3)
    | ~ sum(X5,X2,X6)
    | ~ sum(X4,X5,X1)
    | sum(X1,X2,X3) ),
    c_0_74 ).

cnf(c_0_81,plain,
    ( ~ defined(X1)
    | sum(X1,additive_identity,X1) ),
    inference(spm,[status(thm)],[c_0_68,c_0_51]) ).

cnf(c_0_82,plain,
    ( ~ sum(X1,X4,X3)
    | ~ sum(X4,additive_inverse(X3),X2)
    | ~ defined(X3)
    | sum(X1,X2,additive_identity) ),
    inference(spm,[status(thm)],[c_0_75,c_0_76]) ).

cnf(c_0_83,plain,
    ( ~ defined(X2)
    | ~ product(additive_identity,X2,X1)
    | sum(X1,X2,X2) ),
    inference(spm,[status(thm)],[c_0_77,c_0_28]) ).

cnf(c_0_84,negated_conjecture,
    product(additive_identity,v,multiplicative_identity),
    inference(spm,[status(thm)],[c_0_78,c_0_79]) ).

cnf(c_0_85,plain,
    ( ~ sum(X4,X3,X1)
    | ~ sum(X4,X3,X2)
    | ~ defined(X3)
    | sum(X1,additive_identity,X2) ),
    inference(spm,[status(thm)],[c_0_80,c_0_81]) ).

cnf(c_0_86,plain,
    ( ~ sum(X1,X2,X2)
    | ~ defined(X2)
    | sum(X1,additive_identity,additive_identity) ),
    inference(spm,[status(thm)],[c_0_82,c_0_76]) ).

cnf(c_0_87,negated_conjecture,
    sum(multiplicative_identity,v,v),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_53])]) ).

cnf(c_0_88,plain,
    ~ sum(additive_identity,additive_identity,multiplicative_identity),
    inference(fof_simplification,[status(thm)],[different_identities]) ).

cnf(c_0_89,plain,
    ( ~ sum(X2,additive_identity,X1)
    | ~ defined(X2)
    | sum(X1,additive_identity,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_81]),c_0_59])]) ).

cnf(c_0_90,negated_conjecture,
    sum(multiplicative_identity,additive_identity,additive_identity),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_53])]) ).

cnf(c_0_91,plain,
    ~ sum(additive_identity,additive_identity,multiplicative_identity),
    c_0_88 ).

cnf(c_0_92,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_71])]),c_0_91]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : FLD012-4 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.02  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.30  % Computer : n012.cluster.edu
% 0.04/0.30  % Model    : x86_64 x86_64
% 0.04/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30  % Memory   : 8046.5625MB
% 0.04/0.30  % OS       : Linux 6.8.0-71-generic
% 0.04/0.30  % CPULimit : 300
% 0.04/0.30  % WCLimit  : 300
% 0.04/0.30  % DateTime : Mon Sep 21 15:37:22 UTC 2026
% 0.04/0.30  % CPUTime  : 
% 0.04/0.30  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.33  Running first-order theorem proving
% 0.07/0.33  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 13.62/2.13  % Version: 3.5.1
% 13.62/2.13  % Preprocessing class: FSMSSMSSSSSNFFN.
% 13.62/2.13  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.62/2.13  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 13.62/2.13  % Starting new_bool_3 with 300s (1) cores
% 13.62/2.13  % Starting new_bool_1 with 300s (1) cores
% 13.62/2.13  % Starting sh5l with 300s (1) cores
% 13.62/2.13  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2671311 completed with status 0
% 13.62/2.13  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 13.62/2.13  % Preprocessing class: FSMSSMSSSSSNFFN.
% 13.62/2.13  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.62/2.13  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 13.62/2.13  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 13.62/2.13  % No SInE strategy applied
% 13.62/2.13  % Search class: FGUNF-FFMM21-SFFFFFNN
% 13.62/2.13  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 13.62/2.13  % Starting SubtermCWHack with 136s (1) cores
% 13.62/2.13  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 13.62/2.13  % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 13.62/2.13  % Starting new_bool_3 with 269s (1) cores
% 13.62/2.13  % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 13.62/2.13  % H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with pid 2671318 completed with status 0
% 13.62/2.13  % Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S2S
% 13.62/2.13  % Preprocessing class: FSMSSMSSSSSNFFN.
% 13.62/2.13  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.62/2.13  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 13.62/2.13  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 13.62/2.13  % No SInE strategy applied
% 13.62/2.13  % Search class: FGUNF-FFMM21-SFFFFFNN
% 13.62/2.13  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 13.62/2.13  % Starting SubtermCWHack with 136s (1) cores
% 13.62/2.13  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 13.62/2.13  % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 13.62/2.13  % Preprocessing time       : 0.001 s
% 13.62/2.13  % Presaturation interreduction done
% 13.62/2.13  
% 13.62/2.13  % Proof found!
% 13.62/2.13  % SZS status Unsatisfiable
% 13.62/2.13  % SZS output start CNFRefutation
% See solution above
% 13.62/2.13  % Parsed axioms                        : 35
% 13.62/2.13  % Removed by relevancy pruning/SinE    : 0
% 13.62/2.13  % Initial clauses                      : 35
% 13.62/2.13  % Removed in clause preprocessing      : 0
% 13.62/2.13  % Initial clauses in saturation        : 35
% 13.62/2.13  % Processed clauses                    : 8848
% 13.62/2.13  % ...of these trivial                  : 1104
% 13.62/2.13  % ...subsumed                          : 3633
% 13.62/2.13  % ...remaining for further processing  : 4111
% 13.62/2.13  % Other redundant clauses eliminated   : 0
% 13.62/2.13  % Clauses deleted for lack of memory   : 0
% 13.62/2.13  % Backward-subsumed                    : 32
% 13.62/2.13  % Backward-rewritten                   : 146
% 13.62/2.13  % Generated clauses                    : 147197
% 13.62/2.13  % ...of the previous two non-redundant : 123828
% 13.62/2.13  % ...aggressively subsumed             : 0
% 13.62/2.13  % Contextual simplify-reflections      : 39
% 13.62/2.13  % Paramodulations                      : 147167
% 13.62/2.13  % Factorizations                       : 30
% 13.62/2.13  % NegExts                              : 0
% 13.62/2.13  % Equation resolutions                 : 0
% 13.62/2.13  % Disequality decompositions           : 0
% 13.62/2.13  % Total rewrite steps                  : 89101
% 13.62/2.13  % ...of those cached                   : 88166
% 13.62/2.13  % Propositional unsat checks           : 0
% 13.62/2.13  %    Propositional check models        : 0
% 13.62/2.13  %    Propositional check unsatisfiable : 0
% 13.62/2.13  %    Propositional clauses             : 0
% 13.62/2.13  %    Propositional clauses after purity: 0
% 13.62/2.13  %    Propositional unsat core size     : 0
% 13.62/2.13  %    Propositional preprocessing time  : 0.000
% 13.62/2.13  %    Propositional encoding time       : 0.000
% 13.62/2.13  %    Propositional solver time         : 0.000
% 13.62/2.13  %    Success case prop preproc time    : 0.000
% 13.62/2.13  %    Success case prop encoding time   : 0.000
% 13.62/2.13  %    Success case prop solver time     : 0.000
% 13.62/2.13  % Current number of processed clauses  : 3898
% 13.62/2.13  %    Positive orientable unit clauses  : 1048
% 13.62/2.13  %    Positive unorientable unit clauses: 0
% 13.62/2.13  %    Negative unit clauses             : 4
% 13.62/2.13  %    Non-unit-clauses                  : 2846
% 13.62/2.13  % Current number of unprocessed clauses: 114959
% 13.62/2.13  % ...number of literals in the above   : 312659
% 13.62/2.13  % Current number of archived formulas  : 0
% 13.62/2.13  % Current number of archived clauses   : 213
% 13.62/2.13  % Clause-clause subsumption calls (NU) : 407779
% 13.62/2.13  % Rec. Clause-clause subsumption calls : 301701
% 13.62/2.13  % Non-unit clause-clause subsumptions  : 3698
% 13.62/2.13  % Unit Clause-clause subsumption calls : 63055
% 13.62/2.13  % Rewrite failures with RHS unbound    : 0
% 13.62/2.13  % BW rewrite match attempts            : 1206
% 13.62/2.13  % BW rewrite match successes           : 46
% 13.62/2.13  % Condensation attempts                : 0
% 13.62/2.13  % Condensation successes               : 0
% 13.62/2.13  % Termbank termtop insertions          : 2116089
% 13.62/2.13  % Search garbage collected termcells   : 120
% 13.62/2.13  
% 13.62/2.13  % -------------------------------------------------
% 13.62/2.13  % User time                : 1.674 s
% 13.62/2.13  % System time              : 0.078 s
% 13.62/2.13  % Total time               : 1.753 s
% 13.62/2.13  % Maximum resident set size: 3660 pages
% 13.62/2.13  
% 13.62/2.13  % -------------------------------------------------
% 13.62/2.13  % User time                : 8.484 s
% 13.62/2.13  % System time              : 0.342 s
% 13.62/2.13  % Total time               : 8.826 s
% 13.62/2.13  % Maximum resident set size: 4608 pages
% 13.62/2.13  % E exiting
%------------------------------------------------------------------------------