TSTP Solution File: LAT095-1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : LAT095-1 : TPTP v8.2.0. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n025.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 23:23:35 EDT 2024

% Result   : Unsatisfiable 0.81s 0.59s
% Output   : CNFRefutation 0.81s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   31
%            Number of leaves      :    2
% Syntax   : Number of clauses     :   48 (  48 unt;   0 nHn;   4 RR)
%            Number of literals    :   48 (  47 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :   13 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :  119 (  28 sgn)

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

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

cnf(c_0_2,axiom,
    join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)),meet(join(meet(X2,meet(meet(join(X2,X4),join(X5,X2)),X2)),meet(X6,join(X2,meet(meet(join(X2,X4),join(X5,X2)),X2)))),join(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
    single_axiom ).

cnf(c_0_3,plain,
    join(meet(join(meet(X1,join(meet(X2,X3),meet(X3,join(X2,X3)))),meet(join(meet(X2,X3),meet(X3,join(X2,X3))),join(X1,join(meet(X2,X3),meet(X3,join(X2,X3)))))),X4),meet(join(meet(X1,join(join(meet(join(meet(X2,X3),meet(X3,join(X2,X3))),X5),meet(X6,join(meet(X2,X3),meet(X3,join(X2,X3))))),join(meet(X2,X3),meet(X3,join(X2,X3))))),meet(X3,join(X1,join(join(meet(join(meet(X2,X3),meet(X3,join(X2,X3))),X5),meet(X6,join(meet(X2,X3),meet(X3,join(X2,X3))))),join(meet(X2,X3),meet(X3,join(X2,X3))))))),join(join(meet(X1,join(meet(X2,X3),meet(X3,join(X2,X3)))),meet(join(meet(X2,X3),meet(X3,join(X2,X3))),join(X1,join(meet(X2,X3),meet(X3,join(X2,X3)))))),X4))) = join(meet(X2,X3),meet(X3,join(X2,X3))),
    inference(spm,[status(thm)],[c_0_2,c_0_2]) ).

cnf(c_0_4,plain,
    join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)),meet(join(meet(X6,join(join(meet(X2,X7),meet(X8,X2)),X2)),meet(join(meet(X2,meet(meet(join(X2,X7),join(X8,X2)),X2)),meet(X9,join(X2,meet(meet(join(X2,X7),join(X8,X2)),X2)))),join(X6,join(join(meet(X2,X7),meet(X8,X2)),X2)))),join(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
    inference(spm,[status(thm)],[c_0_3,c_0_2]) ).

cnf(c_0_5,plain,
    join(meet(join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X2),meet(X2,join(join(meet(X1,X2),meet(X2,join(X1,X2))),X2))),X3),meet(X2,join(join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X2),meet(X2,join(join(meet(X1,X2),meet(X2,join(X1,X2))),X2))),X3))) = X2,
    inference(spm,[status(thm)],[c_0_4,c_0_2]) ).

cnf(c_0_6,plain,
    join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)),meet(X2,join(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
    inference(spm,[status(thm)],[c_0_3,c_0_5]) ).

cnf(c_0_7,plain,
    join(meet(X1,X2),meet(X1,join(X1,X2))) = X1,
    inference(spm,[status(thm)],[c_0_5,c_0_5]) ).

cnf(c_0_8,plain,
    join(meet(X1,join(join(meet(X2,X3),meet(X4,X2)),X2)),meet(X2,join(X1,join(join(meet(X2,X3),meet(X4,X2)),X2)))) = X2,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_6]),c_0_6]),c_0_6]),c_0_7]) ).

cnf(c_0_9,plain,
    join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(X2,join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
    inference(spm,[status(thm)],[c_0_6,c_0_8]) ).

cnf(c_0_10,plain,
    join(meet(X1,join(join(meet(X2,X3),meet(X4,X2)),X2)),meet(join(meet(X2,meet(meet(join(X2,X3),join(X4,X2)),X2)),meet(X5,join(X2,meet(meet(join(X2,X3),join(X4,X2)),X2)))),join(X1,join(join(meet(X2,X3),meet(X4,X2)),X2)))) = X2,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_2]),c_0_2]),c_0_7]) ).

cnf(c_0_11,plain,
    join(meet(X1,meet(meet(join(X1,X2),join(X3,X1)),X1)),meet(X4,join(X1,meet(meet(join(X1,X2),join(X3,X1)),X1)))) = X1,
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,plain,
    join(meet(X1,X2),meet(X2,join(X1,X2))) = X2,
    inference(spm,[status(thm)],[c_0_2,c_0_11]) ).

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

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

cnf(c_0_15,plain,
    join(join(meet(X1,X2),meet(X3,X1)),X1) = X1,
    inference(spm,[status(thm)],[c_0_10,c_0_14]) ).

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

cnf(c_0_17,plain,
    join(X1,meet(X1,join(meet(join(X1,X2),X1),X1))) = X1,
    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(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_2,c_0_16]),c_0_15]),c_0_15]),c_0_16]),c_0_15]),c_0_15]),c_0_15]),c_0_13]),c_0_13]),c_0_14]),c_0_15]),c_0_15]),c_0_15]),c_0_15]),c_0_15]),c_0_16]),c_0_15]),c_0_15]),c_0_7]) ).

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

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

cnf(c_0_20,plain,
    meet(X1,meet(X1,join(X2,X1))) = meet(X1,join(X2,X1)),
    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_18,c_0_10]),c_0_11]),c_0_15]),c_0_18]),c_0_11]),c_0_15]),c_0_11]),c_0_15]) ).

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

cnf(c_0_22,plain,
    join(meet(X1,join(meet(X1,X1),X1)),X1) = meet(X1,join(meet(X1,X1),X1)),
    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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_19]),c_0_20]),c_0_18]),c_0_15]),c_0_20]),c_0_13]),c_0_13]),c_0_14]),c_0_15]),c_0_19]),c_0_18]),c_0_20]),c_0_18]),c_0_7]) ).

cnf(c_0_23,plain,
    meet(X1,join(meet(X1,X1),X1)) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_22]) ).

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

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

cnf(c_0_26,plain,
    meet(X1,X1) = X1,
    inference(spm,[status(thm)],[c_0_18,c_0_23]) ).

cnf(c_0_27,plain,
    join(X1,X1) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23]) ).

cnf(c_0_28,plain,
    meet(X1,join(meet(join(X1,X2),join(X3,X1)),X1)) = X1,
    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_24,c_0_25]),c_0_20]),c_0_26]),c_0_18]),c_0_20]),c_0_18]),c_0_27]),c_0_20]) ).

cnf(c_0_29,plain,
    join(X1,meet(X2,X1)) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_26]),c_0_27]) ).

cnf(c_0_30,plain,
    meet(X1,join(meet(X1,join(X2,X1)),X1)) = X1,
    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_28,c_0_11]),c_0_13]),c_0_26]),c_0_13]),c_0_26]),c_0_13]),c_0_26]),c_0_13]),c_0_26]) ).

cnf(c_0_31,plain,
    join(meet(X1,join(X2,X1)),X1) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_21]) ).

cnf(c_0_32,plain,
    meet(X1,join(X2,X1)) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_31]),c_0_18]),c_0_18]),c_0_27]) ).

cnf(c_0_33,plain,
    join(join(X1,X2),X2) = join(X1,X2),
    inference(spm,[status(thm)],[c_0_29,c_0_32]) ).

cnf(c_0_34,plain,
    join(meet(X1,X2),X1) = X1,
    inference(rw,[status(thm)],[c_0_21,c_0_33]) ).

cnf(c_0_35,plain,
    meet(join(X1,X2),X1) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_16]),c_0_29]) ).

cnf(c_0_36,plain,
    join(X1,join(X2,X1)) = join(X2,X1),
    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_2,c_0_32]),c_0_32]),c_0_15]),c_0_32]),c_0_13]),c_0_26]),c_0_13]),c_0_27]),c_0_29]),c_0_15]),c_0_32]),c_0_32]),c_0_7]) ).

cnf(c_0_37,plain,
    join(X1,join(X1,X2)) = join(X1,X2),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_38,plain,
    join(meet(X1,X2),X2) = X2,
    inference(rw,[status(thm)],[c_0_12,c_0_32]) ).

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

cnf(c_0_40,plain,
    meet(X1,join(X1,X2)) = X1,
    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_2,c_0_37]),c_0_32]),c_0_38]),c_0_32]),c_0_38]),c_0_15]),c_0_11]),c_0_15]),c_0_32]),c_0_38]),c_0_32]),c_0_38]),c_0_27]) ).

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

cnf(c_0_42,negated_conjecture,
    join(b,a) != join(a,b),
    inference(fof_simplification,[status(thm)],[prove_wal_axioms_4]) ).

cnf(c_0_43,plain,
    join(join(X1,X2),X1) = join(X1,X2),
    inference(spm,[status(thm)],[c_0_29,c_0_40]) ).

cnf(c_0_44,plain,
    join(join(X1,X2),join(X2,X1)) = join(X2,X1),
    inference(spm,[status(thm)],[c_0_41,c_0_40]) ).

cnf(c_0_45,negated_conjecture,
    join(b,a) != join(a,b),
    c_0_42 ).

cnf(c_0_46,plain,
    join(X1,X2) = join(X2,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_44]) ).

cnf(c_0_47,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : LAT095-1 : TPTP v8.2.0. Released v2.6.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n025.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sun May 19 19:46:38 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.20/0.48  Running first-order theorem proving
% 0.20/0.48  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.81/0.59  # Version: 3.1.0
% 0.81/0.59  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.81/0.59  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.81/0.59  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.81/0.59  # Starting new_bool_3 with 300s (1) cores
% 0.81/0.59  # Starting new_bool_1 with 300s (1) cores
% 0.81/0.59  # Starting sh5l with 300s (1) cores
% 0.81/0.59  # new_bool_3 with pid 14776 completed with status 8
% 0.81/0.59  # new_bool_1 with pid 14777 completed with status 8
% 0.81/0.59  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 14775 completed with status 0
% 0.81/0.59  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.81/0.59  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.81/0.59  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.81/0.59  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.81/0.59  # No SInE strategy applied
% 0.81/0.59  # Search class: FUUPF-FFSF22-DFFFFFNN
% 0.81/0.59  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.81/0.59  # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.81/0.59  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.81/0.59  # Starting new_bool_3 with 136s (1) cores
% 0.81/0.59  # Starting G----_0015_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.81/0.59  # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.81/0.59  # G----_0015_C18_F1_SE_CS_SP_S0Y with pid 14785 completed with status 0
% 0.81/0.59  # Result found by G----_0015_C18_F1_SE_CS_SP_S0Y
% 0.81/0.59  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.81/0.59  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.81/0.59  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.81/0.59  # No SInE strategy applied
% 0.81/0.59  # Search class: FUUPF-FFSF22-DFFFFFNN
% 0.81/0.59  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.81/0.59  # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.81/0.59  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.81/0.59  # Starting new_bool_3 with 136s (1) cores
% 0.81/0.59  # Starting G----_0015_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.81/0.59  # Preprocessing time       : 0.001 s
% 0.81/0.59  
% 0.81/0.59  # Proof found!
% 0.81/0.59  # SZS status Unsatisfiable
% 0.81/0.59  # SZS output start CNFRefutation
% See solution above
% 0.81/0.59  # Parsed axioms                        : 2
% 0.81/0.59  # Removed by relevancy pruning/SinE    : 0
% 0.81/0.59  # Initial clauses                      : 2
% 0.81/0.59  # Removed in clause preprocessing      : 0
% 0.81/0.59  # Initial clauses in saturation        : 2
% 0.81/0.59  # Processed clauses                    : 289
% 0.81/0.59  # ...of these trivial                  : 197
% 0.81/0.59  # ...subsumed                          : 0
% 0.81/0.59  # ...remaining for further processing  : 92
% 0.81/0.59  # Other redundant clauses eliminated   : 0
% 0.81/0.59  # Clauses deleted for lack of memory   : 0
% 0.81/0.59  # Backward-subsumed                    : 0
% 0.81/0.59  # Backward-rewritten                   : 54
% 0.81/0.59  # Generated clauses                    : 5257
% 0.81/0.59  # ...of the previous two non-redundant : 2569
% 0.81/0.59  # ...aggressively subsumed             : 0
% 0.81/0.59  # Contextual simplify-reflections      : 0
% 0.81/0.59  # Paramodulations                      : 5257
% 0.81/0.59  # Factorizations                       : 0
% 0.81/0.59  # NegExts                              : 0
% 0.81/0.59  # Equation resolutions                 : 0
% 0.81/0.59  # Disequality decompositions           : 0
% 0.81/0.59  # Total rewrite steps                  : 23845
% 0.81/0.59  # ...of those cached                   : 22037
% 0.81/0.59  # Propositional unsat checks           : 0
% 0.81/0.59  #    Propositional check models        : 0
% 0.81/0.59  #    Propositional check unsatisfiable : 0
% 0.81/0.59  #    Propositional clauses             : 0
% 0.81/0.59  #    Propositional clauses after purity: 0
% 0.81/0.59  #    Propositional unsat core size     : 0
% 0.81/0.59  #    Propositional preprocessing time  : 0.000
% 0.81/0.59  #    Propositional encoding time       : 0.000
% 0.81/0.59  #    Propositional solver time         : 0.000
% 0.81/0.59  #    Success case prop preproc time    : 0.000
% 0.81/0.59  #    Success case prop encoding time   : 0.000
% 0.81/0.59  #    Success case prop solver time     : 0.000
% 0.81/0.59  # Current number of processed clauses  : 38
% 0.81/0.59  #    Positive orientable unit clauses  : 37
% 0.81/0.59  #    Positive unorientable unit clauses: 1
% 0.81/0.59  #    Negative unit clauses             : 0
% 0.81/0.59  #    Non-unit-clauses                  : 0
% 0.81/0.59  # Current number of unprocessed clauses: 2247
% 0.81/0.59  # ...number of literals in the above   : 2247
% 0.81/0.59  # Current number of archived formulas  : 0
% 0.81/0.59  # Current number of archived clauses   : 54
% 0.81/0.59  # Clause-clause subsumption calls (NU) : 0
% 0.81/0.59  # Rec. Clause-clause subsumption calls : 0
% 0.81/0.59  # Non-unit clause-clause subsumptions  : 0
% 0.81/0.59  # Unit Clause-clause subsumption calls : 25
% 0.81/0.59  # Rewrite failures with RHS unbound    : 0
% 0.81/0.59  # BW rewrite match attempts            : 474
% 0.81/0.59  # BW rewrite match successes           : 132
% 0.81/0.59  # Condensation attempts                : 0
% 0.81/0.59  # Condensation successes               : 0
% 0.81/0.59  # Termbank termtop insertions          : 262057
% 0.81/0.59  # Search garbage collected termcells   : 2
% 0.81/0.59  
% 0.81/0.59  # -------------------------------------------------
% 0.81/0.59  # User time                : 0.096 s
% 0.81/0.59  # System time              : 0.003 s
% 0.81/0.59  # Total time               : 0.099 s
% 0.81/0.59  # Maximum resident set size: 1548 pages
% 0.81/0.59  
% 0.81/0.59  # -------------------------------------------------
% 0.81/0.59  # User time                : 0.492 s
% 0.81/0.59  # System time              : 0.038 s
% 0.81/0.59  # Total time               : 0.530 s
% 0.81/0.59  # Maximum resident set size: 1692 pages
% 0.81/0.59  % E---3.1 exiting
% 0.81/0.59  % E exiting
%------------------------------------------------------------------------------