↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : LAT230-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/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:30 PM UTC 2026

% Result   : Unsatisfiable 36.03s 5.82s
% Output   : CNFRefutation 36.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   73 (  73 unt;   0 nHn;  18 RR)
%            Number of literals    :   73 (  72 equ;   3 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    :    8 (   8 usr;   4 con; 0-4 aty)
%            Number of variables   :  105 (  19 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(absorption1,axiom,
    meet(X1,join(X1,X2)) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',absorption1) ).

cnf(complement_join,axiom,
    join(X1,complement(X1)) = one,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement_join) ).

cnf(commutativity_of_join,axiom,
    join(X1,X2) = join(X2,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_join) ).

cnf(commutativity_of_meet,axiom,
    meet(X1,X2) = meet(X2,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_meet) ).

cnf(absorption2,axiom,
    join(X1,meet(X1,X2)) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',absorption2) ).

cnf(prove_distributivity_hypothesis,hypothesis,
    meet(b,a) = a,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_distributivity_hypothesis) ).

cnf(associativity_of_join,axiom,
    join(join(X1,X2),X3) = join(X1,join(X2,X3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_join) ).

cnf(associativity_of_meet,axiom,
    meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_meet) ).

cnf(complement_meet,axiom,
    meet(X1,complement(X1)) = zero,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement_meet) ).

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

cnf(meet_join_complement,axiom,
    ifeq(join(X1,X2),one,ifeq(meet(X1,X2),zero,complement(X1),X2),X2) = X2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',meet_join_complement) ).

cnf(ifeq_axiom,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).

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

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

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

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

cnf(c_0_16,plain,
    meet(X1,one) = X1,
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

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

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

cnf(c_0_19,hypothesis,
    meet(b,a) = a,
    prove_distributivity_hypothesis ).

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

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

cnf(c_0_22,plain,
    meet(one,X1) = X1,
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_23,hypothesis,
    join(b,a) = b,
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

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

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

cnf(c_0_26,hypothesis,
    join(b,join(a,X1)) = join(b,X1),
    inference(spm,[status(thm)],[c_0_20,c_0_23]) ).

cnf(c_0_27,plain,
    join(X1,complement(meet(X1,X2))) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_14]),c_0_25]) ).

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

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

cnf(c_0_30,hypothesis,
    join(b,complement(a)) = join(one,b),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_14]),c_0_15]) ).

cnf(c_0_31,plain,
    join(one,X1) = one,
    inference(spm,[status(thm)],[c_0_13,c_0_22]) ).

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

cnf(c_0_33,plain,
    join(X1,complement(meet(X2,X1))) = one,
    inference(spm,[status(thm)],[c_0_27,c_0_17]) ).

cnf(c_0_34,plain,
    meet(X1,meet(X2,X1)) = meet(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_18]),c_0_28]) ).

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

cnf(c_0_36,axiom,
    join(meet(X1,X2),meet(X1,X3)) = meet(X1,join(meet(X1,X2),join(meet(X1,X3),meet(X2,join(X1,X3))))),
    equation_H18 ).

cnf(c_0_37,hypothesis,
    join(b,complement(a)) = one,
    inference(rw,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_38,plain,
    join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
    inference(spm,[status(thm)],[c_0_15,c_0_20]) ).

cnf(c_0_39,plain,
    join(X1,join(meet(X2,X1),X3)) = join(X1,X3),
    inference(spm,[status(thm)],[c_0_20,c_0_32]) ).

cnf(c_0_40,plain,
    join(meet(X1,X2),complement(meet(X2,X1))) = one,
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_41,plain,
    join(zero,X1) = X1,
    inference(spm,[status(thm)],[c_0_15,c_0_35]) ).

cnf(c_0_42,hypothesis,
    meet(b,join(X1,meet(b,complement(a)))) = join(meet(b,X1),meet(b,complement(a))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_16]),c_0_38]),c_0_39]) ).

cnf(c_0_43,plain,
    join(complement(meet(X1,X2)),meet(X2,X1)) = one,
    inference(spm,[status(thm)],[c_0_15,c_0_40]) ).

cnf(c_0_44,plain,
    meet(zero,X1) = zero,
    inference(spm,[status(thm)],[c_0_18,c_0_41]) ).

cnf(c_0_45,axiom,
    ifeq(join(X1,X2),one,ifeq(meet(X1,X2),zero,complement(X1),X2),X2) = X2,
    meet_join_complement ).

cnf(c_0_46,hypothesis,
    join(meet(b,complement(a)),meet(b,complement(meet(b,complement(a))))) = b,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_16]),c_0_17]),c_0_15]) ).

cnf(c_0_47,plain,
    meet(X1,meet(X2,complement(meet(X1,X2)))) = zero,
    inference(spm,[status(thm)],[c_0_29,c_0_28]) ).

cnf(c_0_48,plain,
    meet(X1,zero) = zero,
    inference(spm,[status(thm)],[c_0_17,c_0_44]) ).

cnf(c_0_49,plain,
    ifeq(join(X1,X2),one,ifeq(meet(X2,X1),zero,complement(X1),X2),X2) = X2,
    inference(spm,[status(thm)],[c_0_45,c_0_17]) ).

cnf(c_0_50,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    ifeq_axiom ).

cnf(c_0_51,hypothesis,
    join(complement(a),meet(b,complement(meet(b,complement(a))))) = one,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_46]),c_0_15]),c_0_37]) ).

cnf(c_0_52,plain,
    meet(X1,meet(X2,complement(meet(X2,X1)))) = zero,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_47]),c_0_48]),c_0_28]),c_0_17]) ).

cnf(c_0_53,plain,
    complement(complement(X1)) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_29]),c_0_15]),c_0_14]),c_0_50]),c_0_50]) ).

cnf(c_0_54,hypothesis,
    meet(b,complement(meet(b,complement(a)))) = a,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_51]),c_0_52]),c_0_53]),c_0_50]),c_0_50]) ).

cnf(c_0_55,plain,
    join(X1,join(X2,complement(join(X1,X2)))) = one,
    inference(spm,[status(thm)],[c_0_14,c_0_20]) ).

cnf(c_0_56,plain,
    meet(X1,meet(X2,join(meet(X1,X2),X3))) = meet(X1,X2),
    inference(spm,[status(thm)],[c_0_13,c_0_28]) ).

cnf(c_0_57,hypothesis,
    join(a,complement(meet(b,complement(a)))) = complement(meet(b,complement(a))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_54]),c_0_15]) ).

cnf(c_0_58,plain,
    join(X1,join(X2,X1)) = join(X1,X2),
    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(spm,[status(thm)],[c_0_36,c_0_31]),c_0_22]),c_0_22]),c_0_16]),c_0_22]),c_0_22]),c_0_22]) ).

cnf(c_0_59,hypothesis,
    join(b,join(X1,complement(join(a,X1)))) = one,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_55]),c_0_15]),c_0_31]) ).

cnf(c_0_60,plain,
    join(complement(meet(X1,X2)),meet(X2,join(meet(X1,X2),X3))) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_56]),c_0_15]) ).

cnf(c_0_61,hypothesis,
    meet(a,complement(meet(b,complement(a)))) = a,
    inference(spm,[status(thm)],[c_0_13,c_0_57]) ).

cnf(c_0_62,hypothesis,
    join(X1,join(b,complement(join(a,X1)))) = one,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_25]),c_0_20]),c_0_15]) ).

cnf(c_0_63,plain,
    meet(X1,join(X2,meet(X1,join(X3,complement(join(X1,X3)))))) = join(meet(X1,X2),meet(X1,join(X3,complement(join(X1,X3))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_55]),c_0_16]),c_0_38]),c_0_39]) ).

cnf(c_0_64,hypothesis,
    join(complement(a),meet(complement(meet(b,complement(a))),join(a,X1))) = one,
    inference(spm,[status(thm)],[c_0_60,c_0_61]) ).

cnf(c_0_65,hypothesis,
    join(a,meet(b,complement(a))) = b,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_54]),c_0_15]) ).

cnf(c_0_66,hypothesis,
    ifeq(meet(X1,join(b,complement(join(a,X1)))),zero,complement(X1),join(b,complement(join(a,X1)))) = join(b,complement(join(a,X1))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_62]),c_0_50]) ).

cnf(c_0_67,hypothesis,
    join(a,meet(complement(a),complement(meet(b,complement(a))))) = complement(meet(b,complement(a))),
    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)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_16]),c_0_17]),c_0_15]),c_0_57]),c_0_53]),c_0_65]),c_0_17]),c_0_54]),c_0_15]) ).

cnf(c_0_68,hypothesis,
    complement(meet(complement(a),complement(meet(b,complement(a))))) = b,
    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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_53]),c_0_18]),c_0_28]),c_0_17]),c_0_54]),c_0_17]),c_0_29]),c_0_53]),c_0_18]),c_0_50]),c_0_53]),c_0_18]) ).

cnf(c_0_69,negated_conjecture,
    join(complement(b),complement(a)) != complement(a),
    inference(fof_simplification,[status(thm)],[prove_distributivity]) ).

cnf(c_0_70,hypothesis,
    meet(complement(a),complement(meet(b,complement(a)))) = complement(b),
    inference(spm,[status(thm)],[c_0_53,c_0_68]) ).

cnf(c_0_71,negated_conjecture,
    join(complement(b),complement(a)) != complement(a),
    c_0_69 ).

cnf(c_0_72,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_70]),c_0_15]),c_0_71]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LAT230-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.45  % Computer : n015.cluster.edu
% 0.19/0.45  % Model    : x86_64 x86_64
% 0.19/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45  % Memory   : 8046.5625MB
% 0.19/0.45  % OS       : Linux 6.8.0-71-generic
% 0.19/0.45  % CPULimit : 300
% 0.19/0.45  % WCLimit  : 300
% 0.19/0.45  % DateTime : Sun Sep 20 23:25:05 UTC 2026
% 0.19/0.46  % CPUTime  : 
% 0.19/0.46  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.53  Running first-order theorem proving
% 0.24/0.53  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
% 36.03/5.82  % Version: 3.5.1
% 36.03/5.82  % Preprocessing class: FSSSSMSSSSSNFFN.
% 36.03/5.82  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.03/5.82  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 36.03/5.82  % Starting new_bool_3 with 300s (1) cores
% 36.03/5.82  % Starting new_bool_1 with 300s (1) cores
% 36.03/5.82  % Starting sh5l with 300s (1) cores
% 36.03/5.82  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 4165188 completed with status 0
% 36.03/5.82  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 36.03/5.82  % Preprocessing class: FSSSSMSSSSSNFFN.
% 36.03/5.82  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.03/5.82  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 36.03/5.82  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 36.03/5.82  % No SInE strategy applied
% 36.03/5.82  % Search class: FUUPM-FFSF32-MFFFFFNN
% 36.03/5.82  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 36.03/5.82  % Starting SubtermCWHack with 136s (1) cores
% 36.03/5.82  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 36.03/5.82  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 36.03/5.82  % Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 36.03/5.82  % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 36.03/5.82  % G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with pid 4165197 completed with status 0
% 36.03/5.82  % Result found by G-E--_208_B02_F1_AE_CS_SP_PS_S0Y
% 36.03/5.82  % Preprocessing class: FSSSSMSSSSSNFFN.
% 36.03/5.82  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.03/5.82  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 36.03/5.82  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 36.03/5.82  % No SInE strategy applied
% 36.03/5.82  % Search class: FUUPM-FFSF32-MFFFFFNN
% 36.03/5.82  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 36.03/5.82  % Starting SubtermCWHack with 136s (1) cores
% 36.03/5.82  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 36.03/5.82  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 36.03/5.82  % Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 36.03/5.82  % Preprocessing time       : 0.002 s
% 36.03/5.82  % Presaturation interreduction done
% 36.03/5.82  
% 36.03/5.82  % Proof found!
% 36.03/5.82  % SZS status Unsatisfiable
% 36.03/5.82  % SZS output start CNFRefutation
% See solution above
% 36.03/5.82  % Parsed axioms                        : 15
% 36.03/5.82  % Removed by relevancy pruning/SinE    : 0
% 36.03/5.82  % Initial clauses                      : 15
% 36.03/5.82  % Removed in clause preprocessing      : 0
% 36.03/5.82  % Initial clauses in saturation        : 15
% 36.03/5.82  % Processed clauses                    : 6084
% 36.03/5.82  % ...of these trivial                  : 3385
% 36.03/5.82  % ...subsumed                          : 2023
% 36.03/5.82  % ...remaining for further processing  : 676
% 36.03/5.82  % Other redundant clauses eliminated   : 0
% 36.03/5.82  % Clauses deleted for lack of memory   : 0
% 36.03/5.82  % Backward-subsumed                    : 0
% 36.03/5.82  % Backward-rewritten                   : 45
% 36.03/5.82  % Generated clauses                    : 213776
% 36.03/5.82  % ...of the previous two non-redundant : 110559
% 36.03/5.82  % ...aggressively subsumed             : 0
% 36.03/5.82  % Contextual simplify-reflections      : 0
% 36.03/5.82  % Paramodulations                      : 213776
% 36.03/5.82  % Factorizations                       : 0
% 36.03/5.82  % NegExts                              : 0
% 36.03/5.82  % Equation resolutions                 : 0
% 36.03/5.82  % Disequality decompositions           : 0
% 36.03/5.82  % Total rewrite steps                  : 507549
% 36.03/5.82  % ...of those cached                   : 431850
% 36.03/5.82  % Propositional unsat checks           : 0
% 36.03/5.82  %    Propositional check models        : 0
% 36.03/5.82  %    Propositional check unsatisfiable : 0
% 36.03/5.82  %    Propositional clauses             : 0
% 36.03/5.82  %    Propositional clauses after purity: 0
% 36.03/5.82  %    Propositional unsat core size     : 0
% 36.03/5.82  %    Propositional preprocessing time  : 0.000
% 36.03/5.82  %    Propositional encoding time       : 0.000
% 36.03/5.82  %    Propositional solver time         : 0.000
% 36.03/5.82  %    Success case prop preproc time    : 0.000
% 36.03/5.82  %    Success case prop encoding time   : 0.000
% 36.03/5.82  %    Success case prop solver time     : 0.000
% 36.03/5.82  % Current number of processed clauses  : 616
% 36.03/5.82  %    Positive orientable unit clauses  : 603
% 36.03/5.82  %    Positive unorientable unit clauses: 12
% 36.03/5.82  %    Negative unit clauses             : 1
% 36.03/5.82  %    Non-unit-clauses                  : 0
% 36.03/5.82  % Current number of unprocessed clauses: 104147
% 36.03/5.82  % ...number of literals in the above   : 104147
% 36.03/5.82  % Current number of archived formulas  : 0
% 36.03/5.82  % Current number of archived clauses   : 60
% 36.03/5.82  % Clause-clause subsumption calls (NU) : 0
% 36.03/5.82  % Rec. Clause-clause subsumption calls : 0
% 36.03/5.82  % Non-unit clause-clause subsumptions  : 0
% 36.03/5.82  % Unit Clause-clause subsumption calls : 357
% 36.03/5.82  % Rewrite failures with RHS unbound    : 1754
% 36.03/5.82  % BW rewrite match attempts            : 7063
% 36.03/5.82  % BW rewrite match successes           : 1423
% 36.03/5.82  % Condensation attempts                : 0
% 36.03/5.82  % Condensation successes               : 0
% 36.03/5.82  % Termbank termtop insertions          : 3577032
% 36.03/5.82  % Search garbage collected termcells   : 2
% 36.03/5.82  
% 36.03/5.82  % -------------------------------------------------
% 36.03/5.82  % User time                : 4.878 s
% 36.03/5.82  % System time              : 0.217 s
% 36.03/5.82  % Total time               : 5.095 s
% 36.03/5.82  % Maximum resident set size: 3384 pages
% 36.03/5.82  
% 36.03/5.82  % -------------------------------------------------
% 36.03/5.82  % User time                : 24.213 s
% 36.03/5.82  % System time              : 1.065 s
% 36.03/5.82  % Total time               : 25.277 s
% 36.03/5.82  % Maximum resident set size: 4608 pages
% 36.03/5.82  % E exiting
%------------------------------------------------------------------------------