↑ 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  : GRP684-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/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 12:44:44 PM UTC 2026

% Result   : Unsatisfiable 0.18s 0.51s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   86 (  86 unt;   0 nHn;   6 RR)
%            Number of literals    :   86 (  85 equ;   5 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :  181 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c01,axiom,
    ld(X1,mult(X1,X1)) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c01) ).

cnf(c03,axiom,
    mult(X1,ld(X1,X2)) = ld(X1,mult(X1,X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c03) ).

cnf(c02,axiom,
    rd(mult(X1,X1),X1) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).

cnf(c04,axiom,
    mult(rd(X1,X2),X2) = rd(mult(X1,X2),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c04) ).

cnf(c07,axiom,
    ld(X1,mult(X1,ld(X2,X2))) = rd(mult(rd(X1,X1),X2),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c07) ).

cnf(c05,axiom,
    ld(ld(X1,X2),mult(ld(X1,X2),mult(X3,X4))) = mult(ld(X1,mult(X1,X3)),X4),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c05) ).

cnf(c06,axiom,
    rd(mult(mult(X1,X2),rd(X3,X4)),rd(X3,X4)) = mult(X1,rd(mult(X2,X4),X4)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06) ).

cnf(goals,negated_conjecture,
    rd(mult(a,mult(b,c)),mult(b,c)) != rd(mult(a,c),c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

cnf(c_0_8,axiom,
    ld(X1,mult(X1,X1)) = X1,
    c01 ).

cnf(c_0_9,axiom,
    mult(X1,ld(X1,X2)) = ld(X1,mult(X1,X2)),
    c03 ).

cnf(c_0_10,axiom,
    rd(mult(X1,X1),X1) = X1,
    c02 ).

cnf(c_0_11,axiom,
    mult(rd(X1,X2),X2) = rd(mult(X1,X2),X2),
    c04 ).

cnf(c_0_12,plain,
    mult(X1,ld(X1,X1)) = X1,
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,axiom,
    ld(X1,mult(X1,ld(X2,X2))) = rd(mult(rd(X1,X1),X2),X2),
    c07 ).

cnf(c_0_14,plain,
    mult(rd(X1,X1),X1) = X1,
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,plain,
    mult(X1,ld(X1,ld(X1,X1))) = ld(X1,X1),
    inference(spm,[status(thm)],[c_0_9,c_0_12]) ).

cnf(c_0_16,plain,
    mult(X1,ld(X1,ld(X2,X2))) = mult(rd(rd(X1,X1),X2),X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_9]),c_0_11]) ).

cnf(c_0_17,plain,
    mult(rd(rd(X1,X1),X1),X1) = rd(X1,X1),
    inference(spm,[status(thm)],[c_0_11,c_0_14]) ).

cnf(c_0_18,axiom,
    ld(ld(X1,X2),mult(ld(X1,X2),mult(X3,X4))) = mult(ld(X1,mult(X1,X3)),X4),
    c05 ).

cnf(c_0_19,plain,
    ld(X1,X1) = rd(X1,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).

cnf(c_0_20,plain,
    mult(ld(X1,X2),ld(ld(X1,X2),mult(X3,X4))) = mult(mult(X1,ld(X1,X3)),X4),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_9]),c_0_9]) ).

cnf(c_0_21,plain,
    mult(X1,ld(X1,rd(X2,X2))) = mult(rd(rd(X1,X1),X2),X2),
    inference(spm,[status(thm)],[c_0_16,c_0_19]) ).

cnf(c_0_22,plain,
    mult(ld(X1,X2),ld(ld(X1,X2),X3)) = mult(mult(rd(rd(X1,X1),X3),X3),X3),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_14]),c_0_21]) ).

cnf(c_0_23,plain,
    mult(ld(X1,X2),ld(ld(X1,X2),X1)) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_14]) ).

cnf(c_0_24,plain,
    mult(rd(X1,X1),ld(rd(X1,X1),X1)) = ld(rd(X1,X1),X1),
    inference(spm,[status(thm)],[c_0_9,c_0_14]) ).

cnf(c_0_25,plain,
    mult(X1,rd(X1,X1)) = X1,
    inference(rw,[status(thm)],[c_0_12,c_0_19]) ).

cnf(c_0_26,plain,
    ld(rd(X1,X1),X1) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_19]),c_0_24]) ).

cnf(c_0_27,plain,
    mult(rd(rd(rd(X1,X1),rd(X1,X1)),X1),X1) = rd(X1,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_19]),c_0_25]) ).

cnf(c_0_28,axiom,
    rd(mult(mult(X1,X2),rd(X3,X4)),rd(X3,X4)) = mult(X1,rd(mult(X2,X4),X4)),
    c06 ).

cnf(c_0_29,plain,
    mult(mult(rd(X1,X1),ld(rd(X1,X1),X2)),X3) = mult(X1,ld(X1,mult(X2,X3))),
    inference(spm,[status(thm)],[c_0_20,c_0_26]) ).

cnf(c_0_30,plain,
    mult(mult(X1,ld(X1,X2)),ld(mult(X1,ld(X1,X2)),X1)) = X1,
    inference(spm,[status(thm)],[c_0_23,c_0_9]) ).

cnf(c_0_31,plain,
    mult(ld(rd(X1,X1),X2),ld(ld(rd(X1,X1),X2),X1)) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_27]),c_0_14]) ).

cnf(c_0_32,plain,
    mult(rd(mult(X1,X2),rd(X3,X4)),rd(X3,X4)) = mult(X1,mult(rd(X2,X4),X4)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_11]),c_0_11]) ).

cnf(c_0_33,plain,
    mult(X1,mult(X1,ld(X1,X2))) = mult(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_26]),c_0_14]),c_0_9]) ).

cnf(c_0_34,plain,
    mult(X1,ld(X1,ld(rd(X1,X1),X2))) = ld(rd(X1,X1),X2),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_35,plain,
    mult(rd(X1,rd(X2,X3)),rd(X2,X3)) = mult(X1,mult(rd(rd(X1,X1),X3),X3)),
    inference(spm,[status(thm)],[c_0_32,c_0_25]) ).

cnf(c_0_36,plain,
    mult(X1,mult(rd(rd(X1,X1),X2),X2)) = mult(X1,rd(X2,X2)),
    inference(spm,[status(thm)],[c_0_33,c_0_21]) ).

cnf(c_0_37,plain,
    mult(rd(X1,rd(X1,X1)),rd(X1,X1)) = rd(X1,rd(X1,X1)),
    inference(spm,[status(thm)],[c_0_11,c_0_25]) ).

cnf(c_0_38,plain,
    mult(rd(X1,rd(X2,X3)),rd(X2,X3)) = mult(rd(X1,X1),mult(rd(X1,X3),X3)),
    inference(spm,[status(thm)],[c_0_32,c_0_14]) ).

cnf(c_0_39,plain,
    rd(rd(X1,X1),rd(X1,X1)) = rd(X1,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_34]),c_0_19]),c_0_14]) ).

cnf(c_0_40,plain,
    mult(rd(X1,X1),ld(rd(X1,X1),mult(X2,X3))) = mult(mult(X1,ld(X1,X2)),X3),
    inference(spm,[status(thm)],[c_0_20,c_0_19]) ).

cnf(c_0_41,plain,
    mult(rd(X1,rd(X2,X3)),rd(X2,X3)) = mult(X1,rd(X3,X3)),
    inference(rw,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_42,plain,
    rd(X1,rd(X1,X1)) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_14]),c_0_14]) ).

cnf(c_0_43,plain,
    mult(rd(X1,rd(X2,X1)),rd(X2,X1)) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_14]),c_0_14]) ).

cnf(c_0_44,plain,
    mult(ld(X1,X2),ld(ld(X1,X2),X3)) = mult(mult(X1,ld(X1,X3)),rd(X3,X3)),
    inference(spm,[status(thm)],[c_0_20,c_0_25]) ).

cnf(c_0_45,plain,
    mult(mult(X1,ld(X1,X2)),X3) = mult(X1,ld(X1,mult(X2,X3))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_39]),c_0_29]),c_0_40]) ).

cnf(c_0_46,plain,
    mult(rd(X1,X2),X2) = mult(X1,rd(X2,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_39]) ).

cnf(c_0_47,plain,
    mult(rd(X1,mult(rd(X2,X1),X1)),mult(rd(X2,X1),X1)) = X1,
    inference(spm,[status(thm)],[c_0_43,c_0_11]) ).

cnf(c_0_48,plain,
    mult(rd(X1,rd(X2,rd(X3,X1))),rd(X2,rd(X3,X1))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_43]),c_0_14]) ).

cnf(c_0_49,plain,
    mult(ld(X1,X2),ld(ld(X1,X2),X3)) = mult(X1,ld(X1,X3)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45]),c_0_25]) ).

cnf(c_0_50,plain,
    rd(mult(X1,X2),X2) = mult(X1,rd(X2,X2)),
    inference(rw,[status(thm)],[c_0_11,c_0_46]) ).

cnf(c_0_51,plain,
    mult(mult(X1,X2),rd(X3,X3)) = mult(X1,mult(X2,rd(X3,X3))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_41]),c_0_46]) ).

cnf(c_0_52,plain,
    mult(rd(rd(X1,rd(X2,X3)),X3),X3) = rd(X1,rd(X2,X3)),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_53,plain,
    mult(X1,ld(X1,mult(X2,ld(mult(X1,ld(X1,X2)),X1)))) = X1,
    inference(rw,[status(thm)],[c_0_30,c_0_45]) ).

cnf(c_0_54,plain,
    mult(X1,ld(X1,mult(mult(X1,X2),X3))) = mult(mult(X1,X2),X3),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_9]),c_0_33]) ).

cnf(c_0_55,plain,
    mult(mult(rd(X1,X1),rd(X2,X2)),X2) = mult(X1,ld(X1,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_49]),c_0_46]) ).

cnf(c_0_56,plain,
    mult(mult(X1,rd(X2,X2)),X2) = mult(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_50]),c_0_51]),c_0_25]) ).

cnf(c_0_57,plain,
    mult(X1,ld(X1,ld(X1,rd(X2,X2)))) = ld(X1,mult(rd(rd(X1,X1),X2),X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_16]),c_0_19]) ).

cnf(c_0_58,plain,
    mult(X1,ld(X1,ld(X1,X2))) = ld(X1,X2),
    inference(spm,[status(thm)],[c_0_30,c_0_23]) ).

cnf(c_0_59,plain,
    mult(rd(X1,X2),rd(X2,X2)) = rd(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_52]),c_0_25]) ).

cnf(c_0_60,plain,
    mult(mult(X1,X2),ld(mult(X1,X2),X1)) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_9]),c_0_33]) ).

cnf(c_0_61,plain,
    mult(X1,ld(X1,X2)) = mult(rd(X1,X1),X2),
    inference(rw,[status(thm)],[c_0_55,c_0_56]) ).

cnf(c_0_62,plain,
    ld(X1,mult(rd(rd(X1,X1),X2),X2)) = ld(X1,rd(X2,X2)),
    inference(rw,[status(thm)],[c_0_57,c_0_58]) ).

cnf(c_0_63,plain,
    mult(rd(rd(X1,X1),rd(X2,X1)),rd(X2,X1)) = rd(X1,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_17]),c_0_14]) ).

cnf(c_0_64,plain,
    rd(mult(X1,rd(X2,X2)),X2) = rd(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_46]),c_0_59]) ).

cnf(c_0_65,plain,
    mult(rd(mult(X1,X2),mult(X1,X2)),X1) = X1,
    inference(rw,[status(thm)],[c_0_60,c_0_61]) ).

cnf(c_0_66,plain,
    ld(X1,rd(rd(X2,X1),rd(X2,X1))) = ld(X1,rd(X1,X1)),
    inference(spm,[status(thm)],[c_0_62,c_0_63]) ).

cnf(c_0_67,plain,
    mult(rd(rd(X1,X2),X2),X2) = rd(X1,X2),
    inference(spm,[status(thm)],[c_0_47,c_0_43]) ).

cnf(c_0_68,plain,
    rd(mult(X1,mult(X2,rd(X3,X3))),X3) = rd(mult(X1,X2),X3),
    inference(spm,[status(thm)],[c_0_64,c_0_51]) ).

cnf(c_0_69,plain,
    mult(rd(mult(X1,X2),mult(X1,X2)),rd(X1,X1)) = rd(X1,X1),
    inference(spm,[status(thm)],[c_0_50,c_0_65]) ).

cnf(c_0_70,plain,
    mult(X1,rd(rd(X2,X3),rd(X2,X3))) = mult(X1,rd(X3,X3)),
    inference(rw,[status(thm)],[c_0_41,c_0_46]) ).

cnf(c_0_71,plain,
    mult(X1,rd(rd(X2,X1),rd(X2,X1))) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_66]),c_0_21]),c_0_67]),c_0_25]) ).

cnf(c_0_72,negated_conjecture,
    rd(mult(a,mult(b,c)),mult(b,c)) != rd(mult(a,c),c),
    inference(fof_simplification,[status(thm)],[goals]) ).

cnf(c_0_73,plain,
    rd(mult(X1,rd(mult(X2,X3),mult(X2,X3))),X2) = rd(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_64]) ).

cnf(c_0_74,plain,
    mult(X1,rd(mult(X2,rd(X3,X3)),mult(X2,rd(X3,X3)))) = mult(X1,rd(X3,X3)),
    inference(spm,[status(thm)],[c_0_70,c_0_50]) ).

cnf(c_0_75,plain,
    mult(X1,rd(mult(rd(X2,X1),X1),mult(rd(X2,X1),X1))) = X1,
    inference(spm,[status(thm)],[c_0_71,c_0_11]) ).

cnf(c_0_76,plain,
    rd(mult(X1,mult(rd(X2,X3),X3)),rd(X4,X3)) = rd(mult(X1,X2),rd(X4,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_32]),c_0_67]) ).

cnf(c_0_77,negated_conjecture,
    rd(mult(a,mult(b,c)),mult(b,c)) != rd(mult(a,c),c),
    c_0_72 ).

cnf(c_0_78,plain,
    rd(mult(X1,rd(X2,X2)),X3) = rd(X1,X3),
    inference(spm,[status(thm)],[c_0_73,c_0_74]) ).

cnf(c_0_79,plain,
    mult(rd(X1,X2),rd(mult(X3,mult(X4,rd(X2,X2))),mult(X3,mult(X4,rd(X2,X2))))) = rd(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_32]),c_0_32]),c_0_46]),c_0_46]) ).

cnf(c_0_80,negated_conjecture,
    mult(rd(a,mult(b,c)),mult(b,c)) != mult(rd(a,c),c),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_11]),c_0_11]) ).

cnf(c_0_81,plain,
    mult(X1,rd(X2,mult(X2,rd(X3,X3)))) = mult(X1,rd(X3,X3)),
    inference(rw,[status(thm)],[c_0_74,c_0_78]) ).

cnf(c_0_82,plain,
    mult(rd(X1,X2),rd(mult(X3,X2),mult(X3,X2))) = rd(X1,X2),
    inference(spm,[status(thm)],[c_0_79,c_0_25]) ).

cnf(c_0_83,negated_conjecture,
    mult(a,rd(mult(b,c),mult(b,c))) != mult(a,rd(c,c)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_46]),c_0_46]) ).

cnf(c_0_84,plain,
    mult(X1,rd(mult(X2,X3),mult(X2,X3))) = mult(X1,rd(X3,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_70]) ).

cnf(c_0_85,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_84])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP684-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n009.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 20 20:33:12 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/0.42  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.18/0.51  % Version: 3.5.1
% 0.18/0.51  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.51  % Starting new_bool_3 with 300s (1) cores
% 0.18/0.51  % Starting new_bool_1 with 300s (1) cores
% 0.18/0.51  % Starting sh5l with 300s (1) cores
% 0.18/0.51  % new_bool_3 with pid 11554 completed with status 0
% 0.18/0.51  % Result found by new_bool_3
% 0.18/0.51  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.51  % Starting new_bool_3 with 300s (1) cores
% 0.18/0.51  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.51  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.51  % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.18/0.51  % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.51  % Starting SubtermCWHack with 28s (1) cores
% 0.18/0.51  % SubtermCWHack with pid 11560 completed with status 0
% 0.18/0.51  % Result found by SubtermCWHack
% 0.18/0.51  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.51  % Starting new_bool_3 with 300s (1) cores
% 0.18/0.51  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.51  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.51  % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.18/0.51  % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.51  % Starting SubtermCWHack with 28s (1) cores
% 0.18/0.51  % Preprocessing time       : 0.001 s
% 0.18/0.51  
% 0.18/0.51  % Proof found!
% 0.18/0.51  % SZS status Unsatisfiable
% 0.18/0.51  % SZS output start CNFRefutation
% See solution above
% 0.18/0.51  % Parsed axioms                        : 8
% 0.18/0.51  % Removed by relevancy pruning/SinE    : 0
% 0.18/0.51  % Initial clauses                      : 8
% 0.18/0.51  % Removed in clause preprocessing      : 0
% 0.18/0.51  % Initial clauses in saturation        : 8
% 0.18/0.51  % Processed clauses                    : 381
% 0.18/0.51  % ...of these trivial                  : 162
% 0.18/0.51  % ...subsumed                          : 1
% 0.18/0.51  % ...remaining for further processing  : 218
% 0.18/0.51  % Other redundant clauses eliminated   : 0
% 0.18/0.51  % Clauses deleted for lack of memory   : 0
% 0.18/0.51  % Backward-subsumed                    : 0
% 0.18/0.51  % Backward-rewritten                   : 136
% 0.18/0.51  % Generated clauses                    : 11002
% 0.18/0.51  % ...of the previous two non-redundant : 5837
% 0.18/0.51  % ...aggressively subsumed             : 0
% 0.18/0.51  % Contextual simplify-reflections      : 0
% 0.18/0.51  % Paramodulations                      : 11002
% 0.18/0.51  % Factorizations                       : 0
% 0.18/0.51  % NegExts                              : 0
% 0.18/0.51  % Equation resolutions                 : 0
% 0.18/0.51  % Disequality decompositions           : 0
% 0.18/0.51  % Total rewrite steps                  : 18964
% 0.18/0.51  % ...of those cached                   : 15907
% 0.18/0.51  % Propositional unsat checks           : 0
% 0.18/0.51  %    Propositional check models        : 0
% 0.18/0.51  %    Propositional check unsatisfiable : 0
% 0.18/0.51  %    Propositional clauses             : 0
% 0.18/0.51  %    Propositional clauses after purity: 0
% 0.18/0.51  %    Propositional unsat core size     : 0
% 0.18/0.51  %    Propositional preprocessing time  : 0.000
% 0.18/0.51  %    Propositional encoding time       : 0.000
% 0.18/0.51  %    Propositional solver time         : 0.000
% 0.18/0.51  %    Success case prop preproc time    : 0.000
% 0.18/0.51  %    Success case prop encoding time   : 0.000
% 0.18/0.51  %    Success case prop solver time     : 0.000
% 0.18/0.51  % Current number of processed clauses  : 82
% 0.18/0.51  %    Positive orientable unit clauses  : 82
% 0.18/0.51  %    Positive unorientable unit clauses: 0
% 0.18/0.51  %    Negative unit clauses             : 0
% 0.18/0.51  %    Non-unit-clauses                  : 0
% 0.18/0.51  % Current number of unprocessed clauses: 3773
% 0.18/0.51  % ...number of literals in the above   : 3773
% 0.18/0.51  % Current number of archived formulas  : 0
% 0.18/0.51  % Current number of archived clauses   : 136
% 0.18/0.51  % Clause-clause subsumption calls (NU) : 0
% 0.18/0.51  % Rec. Clause-clause subsumption calls : 0
% 0.18/0.51  % Non-unit clause-clause subsumptions  : 0
% 0.18/0.51  % Unit Clause-clause subsumption calls : 1
% 0.18/0.51  % Rewrite failures with RHS unbound    : 22
% 0.18/0.51  % BW rewrite match attempts            : 432
% 0.18/0.51  % BW rewrite match successes           : 156
% 0.18/0.51  % Condensation attempts                : 0
% 0.18/0.51  % Condensation successes               : 0
% 0.18/0.51  % Termbank termtop insertions          : 138402
% 0.18/0.51  % Search garbage collected termcells   : 2
% 0.18/0.51  
% 0.18/0.51  % -------------------------------------------------
% 0.18/0.51  % User time                : 0.061 s
% 0.18/0.51  % System time              : 0.004 s
% 0.18/0.51  % Total time               : 0.064 s
% 0.18/0.51  % Maximum resident set size: 3632 pages
% 0.18/0.51  
% 0.18/0.51  % -------------------------------------------------
% 0.18/0.51  % User time                : 0.063 s
% 0.18/0.51  % System time              : 0.007 s
% 0.18/0.51  % Total time               : 0.070 s
% 0.18/0.51  % Maximum resident set size: 4608 pages
% 0.18/0.51  % E exiting
%------------------------------------------------------------------------------