↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n015.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:04:28 PM UTC 2026

% Result   : Unsatisfiable 3.77s 1.07s
% Output   : CNFRefutation 3.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   27
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   87 (  83 unt;   0 nHn;   9 RR)
%            Number of literals    :   95 (  94 equ;  11 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :  171 (  22 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(associativity_of_meet,axiom,
    meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).

cnf(idempotence_of_meet,axiom,
    meet(X1,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).

cnf(meet_join_complement,axiom,
    ( join(X1,X2) != one
    | meet(X1,X2) != zero
    | complement(X1) = X2 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-4.ax',meet_join_complement) ).

cnf(complement_meet,axiom,
    meet(X1,complement(X1)) = zero,
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-4.ax',complement_meet) ).

cnf(absorption2,axiom,
    join(X1,meet(X1,X2)) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption2) ).

cnf(commutativity_of_meet,axiom,
    meet(X1,X2) = meet(X2,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).

cnf(commutativity_of_join,axiom,
    join(X1,X2) = join(X2,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).

cnf(equation_H76,axiom,
    meet(X1,join(X2,meet(X3,join(X2,X4)))) = meet(X1,join(X2,meet(X3,join(X4,meet(X1,X2))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equation_H76) ).

cnf(absorption1,axiom,
    meet(X1,join(X1,X2)) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption1) ).

cnf(complement_join,axiom,
    join(X1,complement(X1)) = one,
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-4.ax',complement_join) ).

cnf(associativity_of_join,axiom,
    join(join(X1,X2),X3) = join(X1,join(X2,X3)),
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).

cnf(prove_distributivity,negated_conjecture,
    meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_distributivity) ).

cnf(c_0_12,axiom,
    meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
    associativity_of_meet ).

cnf(c_0_13,axiom,
    meet(X1,X1) = X1,
    idempotence_of_meet ).

cnf(c_0_14,plain,
    ( join(X1,X2) != one
    | meet(X1,X2) != zero
    | complement(X1) = X2 ),
    inference(fof_simplification,[status(thm)],[meet_join_complement]) ).

cnf(c_0_15,plain,
    meet(X1,meet(X1,X2)) = meet(X1,X2),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,axiom,
    meet(X1,complement(X1)) = zero,
    complement_meet ).

cnf(c_0_17,axiom,
    join(X1,meet(X1,X2)) = X1,
    absorption2 ).

cnf(c_0_18,plain,
    ( join(X1,X2) != one
    | meet(X1,X2) != zero
    | complement(X1) = X2 ),
    c_0_14 ).

cnf(c_0_19,axiom,
    meet(X1,X2) = meet(X2,X1),
    commutativity_of_meet ).

cnf(c_0_20,plain,
    meet(X1,zero) = zero,
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,plain,
    join(X1,zero) = X1,
    inference(spm,[status(thm)],[c_0_17,c_0_16]) ).

cnf(c_0_22,axiom,
    join(X1,X2) = join(X2,X1),
    commutativity_of_join ).

cnf(c_0_23,axiom,
    meet(X1,join(X2,meet(X3,join(X2,X4)))) = meet(X1,join(X2,meet(X3,join(X4,meet(X1,X2))))),
    equation_H76 ).

cnf(c_0_24,axiom,
    meet(X1,join(X1,X2)) = X1,
    absorption1 ).

cnf(c_0_25,axiom,
    join(X1,complement(X1)) = one,
    complement_join ).

cnf(c_0_26,plain,
    ( join(X1,X2) != one
    | meet(X2,X1) != zero
    | complement(X1) = X2 ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_27,plain,
    meet(X1,meet(X2,complement(meet(X1,X2)))) = zero,
    inference(spm,[status(thm)],[c_0_16,c_0_12]) ).

cnf(c_0_28,plain,
    meet(zero,X1) = zero,
    inference(spm,[status(thm)],[c_0_20,c_0_19]) ).

cnf(c_0_29,plain,
    join(zero,X1) = X1,
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_30,plain,
    meet(X1,join(complement(X1),meet(X2,join(complement(X1),X3)))) = meet(X1,join(complement(X1),meet(X2,X3))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_16]),c_0_21]) ).

cnf(c_0_31,plain,
    meet(X1,one) = X1,
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_32,plain,
    complement(complement(X1)) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_16]),c_0_22]),c_0_25])]) ).

cnf(c_0_33,plain,
    meet(X1,meet(X2,complement(meet(X2,X1)))) = zero,
    inference(spm,[status(thm)],[c_0_27,c_0_19]) ).

cnf(c_0_34,plain,
    meet(X1,meet(complement(X1),X2)) = zero,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_16]),c_0_28]) ).

cnf(c_0_35,plain,
    complement(zero) = one,
    inference(spm,[status(thm)],[c_0_25,c_0_29]) ).

cnf(c_0_36,plain,
    meet(X1,join(X2,X1)) = X1,
    inference(spm,[status(thm)],[c_0_24,c_0_22]) ).

cnf(c_0_37,plain,
    meet(X1,join(complement(X1),meet(X2,X1))) = meet(X1,join(complement(X1),X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_25]),c_0_31]),c_0_32]) ).

cnf(c_0_38,plain,
    meet(complement(X1),meet(X2,X1)) = zero,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_31]),c_0_12]) ).

cnf(c_0_39,plain,
    meet(one,X1) = X1,
    inference(spm,[status(thm)],[c_0_31,c_0_19]) ).

cnf(c_0_40,plain,
    meet(X1,meet(join(X2,X1),X3)) = meet(X1,X3),
    inference(spm,[status(thm)],[c_0_12,c_0_36]) ).

cnf(c_0_41,plain,
    meet(X1,meet(X2,join(complement(X2),complement(meet(X1,X2))))) = zero,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_21]),c_0_16]),c_0_12]),c_0_22]) ).

cnf(c_0_42,axiom,
    join(join(X1,X2),X3) = join(X1,join(X2,X3)),
    associativity_of_join ).

cnf(c_0_43,plain,
    join(one,X1) = one,
    inference(spm,[status(thm)],[c_0_24,c_0_39]) ).

cnf(c_0_44,plain,
    meet(X1,meet(X2,X1)) = meet(X2,X1),
    inference(spm,[status(thm)],[c_0_15,c_0_19]) ).

cnf(c_0_45,plain,
    meet(X1,join(complement(X1),complement(join(X2,X1)))) = zero,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_36]),c_0_22]) ).

cnf(c_0_46,plain,
    join(X1,join(complement(X1),X2)) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_25]),c_0_43]) ).

cnf(c_0_47,plain,
    meet(X1,join(complement(X1),meet(X1,X2))) = meet(X1,join(complement(X1),X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_37]),c_0_30]),c_0_44]),c_0_37]) ).

cnf(c_0_48,plain,
    join(complement(X1),complement(join(X2,X1))) = complement(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_45]),c_0_46])]) ).

cnf(c_0_49,plain,
    meet(X1,join(complement(X1),meet(X2,complement(meet(X1,X2))))) = zero,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_27]),c_0_21]),c_0_16]) ).

cnf(c_0_50,plain,
    meet(complement(X1),complement(join(X2,X1))) = complement(join(X2,X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_48]),c_0_19]) ).

cnf(c_0_51,plain,
    join(complement(X1),meet(X2,complement(meet(X1,X2)))) = complement(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_49]),c_0_46])]) ).

cnf(c_0_52,plain,
    meet(complement(X1),complement(meet(X1,X2))) = complement(X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_17]),c_0_19]) ).

cnf(c_0_53,plain,
    join(X1,meet(X2,complement(meet(complement(X1),X2)))) = X1,
    inference(spm,[status(thm)],[c_0_51,c_0_32]) ).

cnf(c_0_54,plain,
    meet(X1,complement(meet(complement(X1),X2))) = X1,
    inference(spm,[status(thm)],[c_0_52,c_0_32]) ).

cnf(c_0_55,plain,
    join(X1,meet(X2,complement(meet(X2,complement(X1))))) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_33]),c_0_35]),c_0_31]) ).

cnf(c_0_56,plain,
    meet(X1,complement(meet(X2,complement(X1)))) = X1,
    inference(spm,[status(thm)],[c_0_54,c_0_44]) ).

cnf(c_0_57,plain,
    meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
    inference(spm,[status(thm)],[c_0_12,c_0_24]) ).

cnf(c_0_58,plain,
    meet(X1,complement(meet(X1,complement(X2)))) = meet(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_55]),c_0_12]),c_0_19]),c_0_56]) ).

cnf(c_0_59,plain,
    join(complement(X1),complement(meet(X1,X2))) = complement(meet(X1,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_17]),c_0_22]) ).

cnf(c_0_60,plain,
    meet(X1,join(complement(X1),complement(join(X1,X2)))) = zero,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_41]),c_0_24]),c_0_22]) ).

cnf(c_0_61,plain,
    meet(X1,join(complement(X1),X2)) = meet(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_58]),c_0_47]),c_0_59]),c_0_58]) ).

cnf(c_0_62,plain,
    join(complement(X1),complement(join(X1,X2))) = complement(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_60]),c_0_46])]) ).

cnf(c_0_63,plain,
    meet(X1,complement(meet(X1,X2))) = meet(X1,complement(X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_58]),c_0_15]) ).

cnf(c_0_64,plain,
    meet(complement(X1),join(X1,X2)) = meet(complement(X1),X2),
    inference(spm,[status(thm)],[c_0_61,c_0_32]) ).

cnf(c_0_65,plain,
    meet(complement(X1),complement(join(X1,X2))) = complement(join(X1,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_62]),c_0_19]) ).

cnf(c_0_66,plain,
    complement(join(X1,X2)) = meet(complement(X1),complement(X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_63]),c_0_65]) ).

cnf(c_0_67,plain,
    complement(meet(complement(X1),complement(X2))) = join(X1,X2),
    inference(spm,[status(thm)],[c_0_32,c_0_66]) ).

cnf(c_0_68,plain,
    complement(meet(complement(X1),X2)) = join(X1,complement(X2)),
    inference(spm,[status(thm)],[c_0_67,c_0_32]) ).

cnf(c_0_69,plain,
    complement(meet(X1,X2)) = join(complement(X1),complement(X2)),
    inference(spm,[status(thm)],[c_0_68,c_0_32]) ).

cnf(c_0_70,plain,
    join(X1,meet(complement(X1),complement(X2))) = join(X1,complement(X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_64]),c_0_69]),c_0_32]),c_0_32]),c_0_66]) ).

cnf(c_0_71,plain,
    join(X1,meet(complement(X1),X2)) = join(X1,X2),
    inference(spm,[status(thm)],[c_0_70,c_0_32]) ).

cnf(c_0_72,plain,
    meet(X1,meet(X2,join(complement(X1),X3))) = meet(X1,meet(X2,X3)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_61]),c_0_61]) ).

cnf(c_0_73,plain,
    join(X1,meet(X2,X1)) = X1,
    inference(spm,[status(thm)],[c_0_17,c_0_19]) ).

cnf(c_0_74,plain,
    join(X1,meet(X2,join(X1,X3))) = join(X1,meet(X2,X3)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_71]),c_0_32]) ).

cnf(c_0_75,plain,
    join(X1,join(X2,X1)) = join(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_24]),c_0_42]) ).

cnf(c_0_76,plain,
    join(meet(X1,X2),meet(join(X1,X3),X2)) = meet(join(X1,X3),X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_57]),c_0_22]) ).

cnf(c_0_77,plain,
    join(X1,meet(X2,join(X3,X1))) = join(X1,meet(X2,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_74]) ).

cnf(c_0_78,plain,
    join(X1,meet(join(X1,X2),X3)) = join(X1,meet(X3,X2)),
    inference(spm,[status(thm)],[c_0_74,c_0_19]) ).

cnf(c_0_79,negated_conjecture,
    meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
    inference(fof_simplification,[status(thm)],[prove_distributivity]) ).

cnf(c_0_80,plain,
    meet(join(X1,X2),join(X3,X1)) = join(X1,meet(X3,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_36]),c_0_77]),c_0_78]) ).

cnf(c_0_81,plain,
    meet(X1,meet(X2,join(X3,X1))) = meet(X1,X2),
    inference(spm,[status(thm)],[c_0_40,c_0_19]) ).

cnf(c_0_82,plain,
    meet(join(X1,X2),join(X1,X3)) = join(X1,meet(X3,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_24]),c_0_74]),c_0_78]) ).

cnf(c_0_83,negated_conjecture,
    meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
    c_0_79 ).

cnf(c_0_84,plain,
    join(meet(X1,X2),meet(X1,X3)) = meet(X1,join(meet(X1,X2),X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_17]),c_0_19]) ).

cnf(c_0_85,plain,
    meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(X2,X3)),
    inference(spm,[status(thm)],[c_0_81,c_0_82]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LAT213-1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n015.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sun Sep 20 23:23:50 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.43  Running first-order theorem proving
% 0.14/0.43  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
% 3.77/1.07  % Version: 3.5.1
% 3.77/1.07  % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.77/1.07  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.77/1.07  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.77/1.07  % Starting new_bool_3 with 300s (1) cores
% 3.77/1.07  % Starting new_bool_1 with 300s (1) cores
% 3.77/1.07  % Starting sh5l with 300s (1) cores
% 3.77/1.07  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 4163555 completed with status 0
% 3.77/1.07  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 3.77/1.07  % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.77/1.07  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.77/1.07  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.77/1.07  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.77/1.07  % No SInE strategy applied
% 3.77/1.07  % Search class: FHUPM-FFSF21-MFFFFFNN
% 3.77/1.07  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.77/1.07  % Starting SubtermCWHack with 136s (1) cores
% 3.77/1.07  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.77/1.07  % Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 3.77/1.07  % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 3.77/1.07  % Starting new_bool_3 with 136s (1) cores
% 3.77/1.07  % G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with pid 4163565 completed with status 0
% 3.77/1.07  % Result found by G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S
% 3.77/1.07  % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.77/1.07  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.77/1.07  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.77/1.07  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.77/1.07  % No SInE strategy applied
% 3.77/1.07  % Search class: FHUPM-FFSF21-MFFFFFNN
% 3.77/1.07  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.77/1.07  % Starting SubtermCWHack with 136s (1) cores
% 3.77/1.07  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.77/1.07  % Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 3.77/1.07  % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 3.77/1.07  % Preprocessing time       : 0.002 s
% 3.77/1.07  % Presaturation interreduction done
% 3.77/1.07  
% 3.77/1.07  % Proof found!
% 3.77/1.07  % SZS status Unsatisfiable
% 3.77/1.07  % SZS output start CNFRefutation
% See solution above
% 3.77/1.07  % Parsed axioms                        : 13
% 3.77/1.07  % Removed by relevancy pruning/SinE    : 0
% 3.77/1.07  % Initial clauses                      : 13
% 3.77/1.07  % Removed in clause preprocessing      : 0
% 3.77/1.07  % Initial clauses in saturation        : 13
% 3.77/1.07  % Processed clauses                    : 2283
% 3.77/1.07  % ...of these trivial                  : 509
% 3.77/1.07  % ...subsumed                          : 1453
% 3.77/1.07  % ...remaining for further processing  : 321
% 3.77/1.07  % Other redundant clauses eliminated   : 0
% 3.77/1.07  % Clauses deleted for lack of memory   : 0
% 3.77/1.07  % Backward-subsumed                    : 0
% 3.77/1.07  % Backward-rewritten                   : 91
% 3.77/1.07  % Generated clauses                    : 25036
% 3.77/1.07  % ...of the previous two non-redundant : 14268
% 3.77/1.07  % ...aggressively subsumed             : 0
% 3.77/1.07  % Contextual simplify-reflections      : 0
% 3.77/1.07  % Paramodulations                      : 25011
% 3.77/1.07  % Factorizations                       : 0
% 3.77/1.07  % NegExts                              : 0
% 3.77/1.07  % Equation resolutions                 : 25
% 3.77/1.07  % Disequality decompositions           : 0
% 3.77/1.07  % Total rewrite steps                  : 54050
% 3.77/1.07  % ...of those cached                   : 44043
% 3.77/1.07  % Propositional unsat checks           : 0
% 3.77/1.07  %    Propositional check models        : 0
% 3.77/1.07  %    Propositional check unsatisfiable : 0
% 3.77/1.07  %    Propositional clauses             : 0
% 3.77/1.07  %    Propositional clauses after purity: 0
% 3.77/1.07  %    Propositional unsat core size     : 0
% 3.77/1.07  %    Propositional preprocessing time  : 0.000
% 3.77/1.07  %    Propositional encoding time       : 0.000
% 3.77/1.07  %    Propositional solver time         : 0.000
% 3.77/1.07  %    Success case prop preproc time    : 0.000
% 3.77/1.07  %    Success case prop encoding time   : 0.000
% 3.77/1.07  %    Success case prop solver time     : 0.000
% 3.77/1.07  % Current number of processed clauses  : 217
% 3.77/1.07  %    Positive orientable unit clauses  : 111
% 3.77/1.07  %    Positive unorientable unit clauses: 7
% 3.77/1.07  %    Negative unit clauses             : 0
% 3.77/1.07  %    Non-unit-clauses                  : 99
% 3.77/1.07  % Current number of unprocessed clauses: 11633
% 3.77/1.07  % ...number of literals in the above   : 14295
% 3.77/1.07  % Current number of archived formulas  : 0
% 3.77/1.07  % Current number of archived clauses   : 104
% 3.77/1.07  % Clause-clause subsumption calls (NU) : 6784
% 3.77/1.07  % Rec. Clause-clause subsumption calls : 6696
% 3.77/1.07  % Non-unit clause-clause subsumptions  : 1138
% 3.77/1.07  % Unit Clause-clause subsumption calls : 70
% 3.77/1.07  % Rewrite failures with RHS unbound    : 0
% 3.77/1.07  % BW rewrite match attempts            : 748
% 3.77/1.07  % BW rewrite match successes           : 340
% 3.77/1.07  % Condensation attempts                : 0
% 3.77/1.07  % Condensation successes               : 0
% 3.77/1.07  % Termbank termtop insertions          : 307223
% 3.77/1.07  % Search garbage collected termcells   : 8
% 3.77/1.07  
% 3.77/1.07  % -------------------------------------------------
% 3.77/1.07  % User time                : 0.541 s
% 3.77/1.07  % System time              : 0.035 s
% 3.77/1.07  % Total time               : 0.576 s
% 3.77/1.07  % Maximum resident set size: 3640 pages
% 3.77/1.07  
% 3.77/1.07  % -------------------------------------------------
% 3.77/1.07  % User time                : 2.377 s
% 3.77/1.07  % System time              : 0.157 s
% 3.77/1.07  % Total time               : 2.534 s
% 3.77/1.07  % Maximum resident set size: 4864 pages
% 3.77/1.07  % E exiting
%------------------------------------------------------------------------------