↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GRP211-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n019.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:38:59 PM UTC 2026

% Result   : Unsatisfiable 0.14s 0.68s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   30
%            Number of leaves      :   16
% Syntax   : Number of clauses     :   77 (  19 unt;  48 nHn;  64 RR)
%            Number of literals    :  185 ( 184 equ;  60 neg)
%            Maximal clause size   :   10 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-2 aty)
%            Number of variables   :   48 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(associativity,axiom,
    multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).

cnf(left_inverse,axiom,
    multiply(inverse(X1),X1) = identity,
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).

cnf(left_identity,axiom,
    multiply(identity,X1) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).

cnf(prove_this_22,negated_conjecture,
    ( multiply(sk_c4,sk_c7) = sk_c8
    | multiply(sk_c3,sk_c7) = sk_c8 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_22) ).

cnf(prove_this_17,negated_conjecture,
    ( multiply(sk_c4,sk_c7) = sk_c8
    | inverse(sk_c3) = sk_c8 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_17) ).

cnf(prove_this_21,negated_conjecture,
    ( inverse(sk_c4) = sk_c8
    | multiply(sk_c3,sk_c7) = sk_c8 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_21) ).

cnf(prove_this_3,negated_conjecture,
    ( multiply(sk_c8,sk_c6) = sk_c7
    | multiply(sk_c1,sk_c2) = sk_c8 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_3) ).

cnf(prove_this_16,negated_conjecture,
    ( inverse(sk_c4) = sk_c8
    | inverse(sk_c3) = sk_c8 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_16) ).

cnf(prove_this_8,negated_conjecture,
    ( multiply(sk_c8,sk_c6) = sk_c7
    | inverse(sk_c1) = sk_c2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_8) ).

cnf(prove_this_4,negated_conjecture,
    ( multiply(sk_c5,sk_c8) = sk_c6
    | multiply(sk_c1,sk_c2) = sk_c8 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_4) ).

cnf(prove_this_5,negated_conjecture,
    ( inverse(sk_c5) = sk_c8
    | multiply(sk_c1,sk_c2) = sk_c8 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_5) ).

cnf(prove_this_9,negated_conjecture,
    ( multiply(sk_c5,sk_c8) = sk_c6
    | inverse(sk_c1) = sk_c2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_9) ).

cnf(prove_this_26,negated_conjecture,
    ( inverse(X6) != sk_c8
    | multiply(X6,sk_c8) != X5
    | multiply(sk_c8,X5) != sk_c7
    | multiply(X4,sk_c7) != sk_c8
    | inverse(X4) != sk_c8
    | multiply(X3,sk_c7) != sk_c8
    | inverse(X3) != sk_c8
    | multiply(X2,sk_c7) != sk_c8
    | inverse(X1) != X2
    | multiply(X1,X2) != sk_c8 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_26) ).

cnf(prove_this_10,negated_conjecture,
    ( inverse(sk_c5) = sk_c8
    | inverse(sk_c1) = sk_c2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_10) ).

cnf(prove_this_20,negated_conjecture,
    ( inverse(sk_c5) = sk_c8
    | inverse(sk_c3) = sk_c8 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_20) ).

cnf(prove_this_25,negated_conjecture,
    ( inverse(sk_c5) = sk_c8
    | multiply(sk_c3,sk_c7) = sk_c8 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_25) ).

cnf(c_0_16,axiom,
    multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
    associativity ).

cnf(c_0_17,axiom,
    multiply(inverse(X1),X1) = identity,
    left_inverse ).

cnf(c_0_18,axiom,
    multiply(identity,X1) = X1,
    left_identity ).

cnf(c_0_19,plain,
    multiply(inverse(X1),multiply(X1,X2)) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).

cnf(c_0_20,negated_conjecture,
    ( multiply(sk_c4,sk_c7) = sk_c8
    | multiply(sk_c3,sk_c7) = sk_c8 ),
    prove_this_22 ).

cnf(c_0_21,negated_conjecture,
    ( multiply(sk_c4,sk_c7) = sk_c8
    | multiply(inverse(sk_c3),sk_c8) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_22,negated_conjecture,
    ( multiply(sk_c4,sk_c7) = sk_c8
    | inverse(sk_c3) = sk_c8 ),
    prove_this_17 ).

cnf(c_0_23,negated_conjecture,
    ( multiply(sk_c8,sk_c8) = sk_c7
    | multiply(sk_c4,sk_c7) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_24,negated_conjecture,
    ( multiply(sk_c8,sk_c8) = sk_c7
    | multiply(inverse(sk_c4),sk_c8) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_19,c_0_23]) ).

cnf(c_0_25,negated_conjecture,
    ( inverse(sk_c4) = sk_c8
    | multiply(sk_c3,sk_c7) = sk_c8 ),
    prove_this_21 ).

cnf(c_0_26,negated_conjecture,
    ( multiply(sk_c8,sk_c8) = sk_c7
    | multiply(sk_c3,sk_c7) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_27,negated_conjecture,
    ( multiply(sk_c8,sk_c6) = sk_c7
    | multiply(sk_c1,sk_c2) = sk_c8 ),
    prove_this_3 ).

cnf(c_0_28,negated_conjecture,
    ( multiply(sk_c8,sk_c8) = sk_c7
    | multiply(inverse(sk_c3),sk_c8) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_19,c_0_26]) ).

cnf(c_0_29,negated_conjecture,
    ( inverse(sk_c4) = sk_c8
    | inverse(sk_c3) = sk_c8 ),
    prove_this_16 ).

cnf(c_0_30,negated_conjecture,
    ( multiply(sk_c8,sk_c6) = sk_c7
    | multiply(inverse(sk_c1),sk_c8) = sk_c2 ),
    inference(spm,[status(thm)],[c_0_19,c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    ( multiply(sk_c8,sk_c6) = sk_c7
    | inverse(sk_c1) = sk_c2 ),
    prove_this_8 ).

cnf(c_0_32,negated_conjecture,
    ( inverse(sk_c4) = sk_c8
    | multiply(sk_c8,sk_c8) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    ( multiply(sk_c8,sk_c6) = sk_c7
    | multiply(sk_c1,multiply(sk_c2,X1)) = multiply(sk_c8,X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_27]) ).

cnf(c_0_34,negated_conjecture,
    ( multiply(sk_c2,sk_c8) = sk_c2
    | multiply(sk_c8,sk_c6) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_35,negated_conjecture,
    multiply(sk_c8,sk_c8) = sk_c7,
    inference(spm,[status(thm)],[c_0_24,c_0_32]) ).

cnf(c_0_36,negated_conjecture,
    ( multiply(sk_c1,sk_c2) = sk_c7
    | multiply(sk_c8,sk_c6) = sk_c7 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).

cnf(c_0_37,negated_conjecture,
    ( multiply(sk_c5,sk_c8) = sk_c6
    | multiply(sk_c1,sk_c2) = sk_c8 ),
    prove_this_4 ).

cnf(c_0_38,negated_conjecture,
    ( sk_c7 = sk_c8
    | multiply(sk_c8,sk_c6) = sk_c7 ),
    inference(spm,[status(thm)],[c_0_27,c_0_36]) ).

cnf(c_0_39,negated_conjecture,
    multiply(inverse(sk_c8),sk_c7) = sk_c8,
    inference(spm,[status(thm)],[c_0_19,c_0_35]) ).

cnf(c_0_40,negated_conjecture,
    ( multiply(sk_c1,sk_c2) = sk_c8
    | multiply(inverse(sk_c5),sk_c6) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_19,c_0_37]) ).

cnf(c_0_41,negated_conjecture,
    ( sk_c6 = sk_c8
    | sk_c7 = sk_c8 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_38]),c_0_39]) ).

cnf(c_0_42,negated_conjecture,
    ( sk_c7 = sk_c8
    | multiply(sk_c1,sk_c2) = sk_c8
    | multiply(inverse(sk_c5),sk_c8) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_43,negated_conjecture,
    ( inverse(sk_c5) = sk_c8
    | multiply(sk_c1,sk_c2) = sk_c8 ),
    prove_this_5 ).

cnf(c_0_44,negated_conjecture,
    ( sk_c7 = sk_c8
    | multiply(sk_c1,sk_c2) = sk_c8 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_35])]) ).

cnf(c_0_45,negated_conjecture,
    ( sk_c7 = sk_c8
    | multiply(inverse(sk_c1),sk_c8) = sk_c2 ),
    inference(spm,[status(thm)],[c_0_19,c_0_44]) ).

cnf(c_0_46,negated_conjecture,
    ( multiply(sk_c5,sk_c8) = sk_c6
    | inverse(sk_c1) = sk_c2 ),
    prove_this_9 ).

cnf(c_0_47,negated_conjecture,
    ( sk_c7 = sk_c8
    | multiply(sk_c2,sk_c8) = sk_c2
    | multiply(sk_c5,sk_c8) = sk_c6 ),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_48,negated_conjecture,
    ( sk_c7 = sk_c8
    | multiply(sk_c2,sk_c8) = sk_c2
    | multiply(inverse(sk_c5),sk_c6) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_19,c_0_47]) ).

cnf(c_0_49,negated_conjecture,
    ( inverse(X6) != sk_c8
    | multiply(X6,sk_c8) != X5
    | multiply(sk_c8,X5) != sk_c7
    | multiply(X4,sk_c7) != sk_c8
    | inverse(X4) != sk_c8
    | multiply(X3,sk_c7) != sk_c8
    | inverse(X3) != sk_c8
    | multiply(X2,sk_c7) != sk_c8
    | inverse(X1) != X2
    | multiply(X1,X2) != sk_c8 ),
    inference(fof_simplification,[status(thm)],[prove_this_26]) ).

cnf(c_0_50,negated_conjecture,
    ( sk_c7 = sk_c8
    | multiply(sk_c2,sk_c8) = sk_c2
    | multiply(inverse(sk_c5),sk_c8) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_48,c_0_41]) ).

cnf(c_0_51,negated_conjecture,
    ( inverse(sk_c5) = sk_c8
    | inverse(sk_c1) = sk_c2 ),
    prove_this_10 ).

cnf(c_0_52,negated_conjecture,
    ( inverse(X6) != sk_c8
    | multiply(X6,sk_c8) != X5
    | multiply(sk_c8,X5) != sk_c7
    | multiply(X4,sk_c7) != sk_c8
    | inverse(X4) != sk_c8
    | multiply(X3,sk_c7) != sk_c8
    | inverse(X3) != sk_c8
    | multiply(X2,sk_c7) != sk_c8
    | inverse(X1) != X2
    | multiply(X1,X2) != sk_c8 ),
    c_0_49 ).

cnf(c_0_53,negated_conjecture,
    ( sk_c7 = sk_c8
    | inverse(sk_c1) = sk_c2
    | multiply(sk_c2,sk_c8) = sk_c2 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_35])]) ).

cnf(c_0_54,negated_conjecture,
    ( inverse(X4) != sk_c8
    | inverse(X3) != sk_c8
    | inverse(X1) != sk_c8
    | multiply(X4,sk_c7) != sk_c8
    | multiply(X3,sk_c7) != sk_c8
    | multiply(X2,inverse(X2)) != sk_c8
    | multiply(inverse(X2),sk_c7) != sk_c8
    | multiply(sk_c8,multiply(X1,sk_c8)) != sk_c7 ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_52])]) ).

cnf(c_0_55,negated_conjecture,
    ( inverse(sk_c5) = sk_c8
    | inverse(sk_c3) = sk_c8 ),
    prove_this_20 ).

cnf(c_0_56,negated_conjecture,
    ( sk_c7 = sk_c8
    | multiply(sk_c2,sk_c8) = sk_c2 ),
    inference(spm,[status(thm)],[c_0_45,c_0_53]) ).

cnf(c_0_57,negated_conjecture,
    ( inverse(X3) != sk_c8
    | inverse(X2) != sk_c8
    | multiply(X3,sk_c7) != sk_c8
    | multiply(X2,sk_c7) != sk_c8
    | multiply(X1,inverse(X1)) != sk_c8
    | multiply(inverse(X1),sk_c7) != sk_c8
    | multiply(sk_c8,multiply(sk_c3,sk_c8)) != sk_c7
    | inverse(sk_c5) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_54,c_0_55]) ).

cnf(c_0_58,negated_conjecture,
    ( inverse(sk_c5) = sk_c8
    | multiply(sk_c3,sk_c7) = sk_c8 ),
    prove_this_25 ).

cnf(c_0_59,negated_conjecture,
    ( identity = sk_c8
    | sk_c7 = sk_c8 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_56]),c_0_17]) ).

cnf(c_0_60,negated_conjecture,
    ( inverse(X2) != sk_c8
    | multiply(X2,sk_c7) != sk_c8
    | multiply(X1,inverse(X1)) != sk_c8
    | multiply(inverse(X1),sk_c7) != sk_c8
    | multiply(sk_c8,multiply(sk_c3,sk_c8)) != sk_c7
    | inverse(sk_c5) = sk_c8 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_55]),c_0_58]) ).

cnf(c_0_61,negated_conjecture,
    ( sk_c7 = sk_c8
    | multiply(sk_c8,X1) = X1 ),
    inference(spm,[status(thm)],[c_0_18,c_0_59]) ).

cnf(c_0_62,negated_conjecture,
    ( multiply(X1,inverse(X1)) != sk_c8
    | multiply(inverse(X1),sk_c7) != sk_c8
    | multiply(sk_c8,multiply(sk_c3,sk_c8)) != sk_c7
    | inverse(sk_c5) = sk_c8 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_55]),c_0_58]) ).

cnf(c_0_63,negated_conjecture,
    sk_c7 = sk_c8,
    inference(spm,[status(thm)],[c_0_35,c_0_61]) ).

cnf(c_0_64,negated_conjecture,
    ( multiply(sk_c3,sk_c8) != sk_c8
    | multiply(sk_c8,sk_c7) != sk_c8
    | multiply(sk_c8,multiply(sk_c3,sk_c8)) != sk_c7
    | inverse(sk_c5) = sk_c8 ),
    inference(spm,[status(thm)],[c_0_62,c_0_55]) ).

cnf(c_0_65,negated_conjecture,
    identity = sk_c8,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_63]),c_0_17]) ).

cnf(c_0_66,negated_conjecture,
    ( multiply(sk_c3,sk_c8) != sk_c8
    | multiply(sk_c8,multiply(sk_c3,sk_c8)) != sk_c8
    | inverse(sk_c5) = sk_c8 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_63]),c_0_63]),c_0_35]),c_0_63])]) ).

cnf(c_0_67,plain,
    multiply(sk_c8,X1) = X1,
    inference(rw,[status(thm)],[c_0_18,c_0_65]) ).

cnf(c_0_68,negated_conjecture,
    ( inverse(sk_c5) = sk_c8
    | multiply(sk_c3,sk_c8) = sk_c8 ),
    inference(rw,[status(thm)],[c_0_58,c_0_63]) ).

cnf(c_0_69,plain,
    multiply(inverse(X1),X1) = sk_c8,
    inference(rw,[status(thm)],[c_0_17,c_0_65]) ).

cnf(c_0_70,negated_conjecture,
    inverse(sk_c5) = sk_c8,
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67])]),c_0_68]) ).

cnf(c_0_71,plain,
    multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
    inference(spm,[status(thm)],[c_0_19,c_0_19]) ).

cnf(c_0_72,negated_conjecture,
    sk_c5 = sk_c8,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_67]) ).

cnf(c_0_73,plain,
    multiply(X1,sk_c8) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_69]),c_0_71]) ).

cnf(c_0_74,negated_conjecture,
    inverse(sk_c8) = sk_c8,
    inference(rw,[status(thm)],[c_0_70,c_0_72]) ).

cnf(c_0_75,negated_conjecture,
    ( inverse(X1) != sk_c8
    | multiply(X1,inverse(X1)) != sk_c8 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_63]),c_0_63]),c_0_63]),c_0_63]),c_0_73]),c_0_67]),c_0_73]),c_0_73]),c_0_73])])])]),c_0_74])]) ).

cnf(c_0_76,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_74]),c_0_67])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP211-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.56  % Computer : n019.cluster.edu
% 0.11/0.56  % Model    : x86_64 x86_64
% 0.11/0.56  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.56  % Memory   : 8046.5625MB
% 0.11/0.56  % OS       : Linux 6.8.0-71-generic
% 0.11/0.56  % CPULimit : 300
% 0.11/0.56  % WCLimit  : 300
% 0.11/0.56  % DateTime : Sun Sep 20 20:06:50 UTC 2026
% 0.04/0.56  % CPUTime  : 
% 0.04/0.56  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.60  Running first-order theorem proving
% 0.04/0.60  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
% 0.14/0.68  % Version: 3.5.1
% 0.14/0.68  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.68  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.68  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.68  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.68  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.68  % Starting sh5l with 300s (1) cores
% 0.14/0.68  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 810616 completed with status 0
% 0.14/0.68  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.14/0.68  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.68  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.68  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.68  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.68  % No SInE strategy applied
% 0.14/0.68  % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.14/0.68  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.68  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.68  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/0.68  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.68  % Starting new_bool_3 with 136s (1) cores
% 0.14/0.68  % Starting new_bool_1 with 136s (1) cores
% 0.14/0.68  % new_bool_3 with pid 810624 completed with status 0
% 0.14/0.68  % Result found by new_bool_3
% 0.14/0.68  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.68  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.68  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.68  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.68  % No SInE strategy applied
% 0.14/0.68  % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.14/0.68  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.68  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.68  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/0.68  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.68  % Starting new_bool_3 with 136s (1) cores
% 0.14/0.68  % Preprocessing time       : 0.001 s
% 0.14/0.68  % Presaturation interreduction done
% 0.14/0.68  
% 0.14/0.68  % Proof found!
% 0.14/0.68  % SZS status Unsatisfiable
% 0.14/0.68  % SZS output start CNFRefutation
% See solution above
% 0.14/0.68  % Parsed axioms                        : 29
% 0.14/0.68  % Removed by relevancy pruning/SinE    : 0
% 0.14/0.68  % Initial clauses                      : 29
% 0.14/0.68  % Removed in clause preprocessing      : 0
% 0.14/0.68  % Initial clauses in saturation        : 29
% 0.14/0.68  % Processed clauses                    : 1046
% 0.14/0.68  % ...of these trivial                  : 118
% 0.14/0.68  % ...subsumed                          : 405
% 0.14/0.68  % ...remaining for further processing  : 523
% 0.14/0.68  % Other redundant clauses eliminated   : 8
% 0.14/0.68  % Clauses deleted for lack of memory   : 0
% 0.14/0.68  % Backward-subsumed                    : 105
% 0.14/0.68  % Backward-rewritten                   : 365
% 0.14/0.68  % Generated clauses                    : 2662
% 0.14/0.68  % ...of the previous two non-redundant : 2640
% 0.14/0.68  % ...aggressively subsumed             : 0
% 0.14/0.68  % Contextual simplify-reflections      : 52
% 0.14/0.68  % Paramodulations                      : 2656
% 0.14/0.68  % Factorizations                       : 2
% 0.14/0.68  % NegExts                              : 0
% 0.14/0.68  % Equation resolutions                 : 8
% 0.14/0.68  % Disequality decompositions           : 0
% 0.14/0.68  % Total rewrite steps                  : 1774
% 0.14/0.68  % ...of those cached                   : 1658
% 0.14/0.68  % Propositional unsat checks           : 0
% 0.14/0.68  %    Propositional check models        : 0
% 0.14/0.68  %    Propositional check unsatisfiable : 0
% 0.14/0.68  %    Propositional clauses             : 0
% 0.14/0.68  %    Propositional clauses after purity: 0
% 0.14/0.68  %    Propositional unsat core size     : 0
% 0.14/0.68  %    Propositional preprocessing time  : 0.000
% 0.14/0.68  %    Propositional encoding time       : 0.000
% 0.14/0.68  %    Propositional solver time         : 0.000
% 0.14/0.68  %    Success case prop preproc time    : 0.000
% 0.14/0.68  %    Success case prop encoding time   : 0.000
% 0.14/0.68  %    Success case prop solver time     : 0.000
% 0.14/0.68  % Current number of processed clauses  : 21
% 0.14/0.68  %    Positive orientable unit clauses  : 19
% 0.14/0.68  %    Positive unorientable unit clauses: 0
% 0.14/0.68  %    Negative unit clauses             : 0
% 0.14/0.68  %    Non-unit-clauses                  : 2
% 0.14/0.68  % Current number of unprocessed clauses: 768
% 0.14/0.68  % ...number of literals in the above   : 4086
% 0.14/0.68  % Current number of archived formulas  : 0
% 0.14/0.68  % Current number of archived clauses   : 499
% 0.14/0.68  % Clause-clause subsumption calls (NU) : 4503
% 0.14/0.68  % Rec. Clause-clause subsumption calls : 1785
% 0.14/0.68  % Non-unit clause-clause subsumptions  : 536
% 0.14/0.68  % Unit Clause-clause subsumption calls : 136
% 0.14/0.68  % Rewrite failures with RHS unbound    : 0
% 0.14/0.68  % BW rewrite match attempts            : 50
% 0.14/0.68  % BW rewrite match successes           : 42
% 0.14/0.68  % Condensation attempts                : 0
% 0.14/0.68  % Condensation successes               : 0
% 0.14/0.68  % Termbank termtop insertions          : 41911
% 0.14/0.68  % Search garbage collected termcells   : 29
% 0.14/0.68  
% 0.14/0.68  % -------------------------------------------------
% 0.14/0.68  % User time                : 0.068 s
% 0.14/0.68  % System time              : 0.004 s
% 0.14/0.68  % Total time               : 0.072 s
% 0.14/0.68  % Maximum resident set size: 3648 pages
% 0.14/0.68  
% 0.14/0.68  % -------------------------------------------------
% 0.14/0.68  % User time                : 0.334 s
% 0.14/0.68  % System time              : 0.020 s
% 0.14/0.68  % Total time               : 0.355 s
% 0.14/0.68  % Maximum resident set size: 4864 pages
% 0.14/0.68  % E exiting
%------------------------------------------------------------------------------