TSTP Solution File: COL121-2 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : COL121-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n028.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 : Sat May  4 07:29:13 EDT 2024

% Result   : Unsatisfiable 0.15s 0.42s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   37 (  13 unt;   0 nHn;  37 RR)
%            Number of literals    :   76 (   0 equ;  43 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-4 aty)
%            Number of variables   :   66 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Comb_Odiamond__strip__lemmaE_1,axiom,
    ( c_in(c_Pair(X5,c_Comb_Odiamond__strip__lemmaE__1(X1,X5,X4,X2),X2,X2),X1,tc_prod(X2,X2))
    | ~ c_Comb_Odiamond(X1,X2)
    | ~ c_in(c_Pair(X3,X4,X2,X2),X1,tc_prod(X2,X2))
    | ~ c_in(c_Pair(X3,X5,X2,X2),c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2)) ),
    file('/export/starexec/sandbox2/tmp/tmp.9Gz2h4b5xL/E---3.1_15245.p',cls_Comb_Odiamond__strip__lemmaE_1) ).

cnf(cls_conjecture_4,negated_conjecture,
    ( c_in(c_Pair(v_ya,v_x(X1),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
    | ~ c_in(c_Pair(v_y,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
    file('/export/starexec/sandbox2/tmp/tmp.9Gz2h4b5xL/E---3.1_15245.p',cls_conjecture_4) ).

cnf(cls_Comb_Odiamond__strip__lemmaE_0,axiom,
    ( c_in(c_Pair(X4,c_Comb_Odiamond__strip__lemmaE__1(X1,X5,X4,X2),X2,X2),c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2))
    | ~ c_Comb_Odiamond(X1,X2)
    | ~ c_in(c_Pair(X3,X4,X2,X2),X1,tc_prod(X2,X2))
    | ~ c_in(c_Pair(X3,X5,X2,X2),c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2)) ),
    file('/export/starexec/sandbox2/tmp/tmp.9Gz2h4b5xL/E---3.1_15245.p',cls_Comb_Odiamond__strip__lemmaE_0) ).

cnf(cls_conjecture_5,negated_conjecture,
    ( c_in(c_Pair(X1,v_x(X1),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
    | ~ c_in(c_Pair(v_y,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
    file('/export/starexec/sandbox2/tmp/tmp.9Gz2h4b5xL/E---3.1_15245.p',cls_conjecture_5) ).

cnf(cls_conjecture_2,negated_conjecture,
    c_in(c_Pair(v_ya,v_z,t_a,t_a),v_r,tc_prod(t_a,t_a)),
    file('/export/starexec/sandbox2/tmp/tmp.9Gz2h4b5xL/E---3.1_15245.p',cls_conjecture_2) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_Comb_Odiamond(v_r,t_a),
    file('/export/starexec/sandbox2/tmp/tmp.9Gz2h4b5xL/E---3.1_15245.p',cls_conjecture_0) ).

cnf(cls_conjecture_3,negated_conjecture,
    c_in(c_Pair(v_y,v_xaa,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)),
    file('/export/starexec/sandbox2/tmp/tmp.9Gz2h4b5xL/E---3.1_15245.p',cls_conjecture_3) ).

cnf(cls_Transitive__Closure_Ortrancl__trans_0,axiom,
    ( c_in(c_Pair(X5,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
    | ~ c_in(c_Pair(X1,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
    | ~ c_in(c_Pair(X5,X1,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3)) ),
    file('/export/starexec/sandbox2/tmp/tmp.9Gz2h4b5xL/E---3.1_15245.p',cls_Transitive__Closure_Ortrancl__trans_0) ).

cnf(cls_Transitive__Closure_Or__into__rtrancl_0,axiom,
    ( c_in(X1,c_Transitive__Closure_Ortrancl(X2,X3),tc_prod(X3,X3))
    | ~ c_in(X1,X2,tc_prod(X3,X3)) ),
    file('/export/starexec/sandbox2/tmp/tmp.9Gz2h4b5xL/E---3.1_15245.p',cls_Transitive__Closure_Or__into__rtrancl_0) ).

cnf(cls_conjecture_6,negated_conjecture,
    ( ~ c_in(c_Pair(v_xaa,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
    | ~ c_in(c_Pair(v_z,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
    file('/export/starexec/sandbox2/tmp/tmp.9Gz2h4b5xL/E---3.1_15245.p',cls_conjecture_6) ).

cnf(c_0_10,plain,
    ( c_in(c_Pair(X5,c_Comb_Odiamond__strip__lemmaE__1(X1,X5,X4,X2),X2,X2),X1,tc_prod(X2,X2))
    | ~ c_Comb_Odiamond(X1,X2)
    | ~ c_in(c_Pair(X3,X4,X2,X2),X1,tc_prod(X2,X2))
    | ~ c_in(c_Pair(X3,X5,X2,X2),c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2)) ),
    inference(fof_simplification,[status(thm)],[cls_Comb_Odiamond__strip__lemmaE_1]) ).

cnf(c_0_11,negated_conjecture,
    ( c_in(c_Pair(v_ya,v_x(X1),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
    | ~ c_in(c_Pair(v_y,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
    inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).

cnf(c_0_12,plain,
    ( c_in(c_Pair(X4,c_Comb_Odiamond__strip__lemmaE__1(X1,X5,X4,X2),X2,X2),c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2))
    | ~ c_Comb_Odiamond(X1,X2)
    | ~ c_in(c_Pair(X3,X4,X2,X2),X1,tc_prod(X2,X2))
    | ~ c_in(c_Pair(X3,X5,X2,X2),c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2)) ),
    inference(fof_simplification,[status(thm)],[cls_Comb_Odiamond__strip__lemmaE_0]) ).

cnf(c_0_13,negated_conjecture,
    ( c_in(c_Pair(X1,v_x(X1),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
    | ~ c_in(c_Pair(v_y,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
    inference(fof_simplification,[status(thm)],[cls_conjecture_5]) ).

cnf(c_0_14,plain,
    ( c_in(c_Pair(X5,c_Comb_Odiamond__strip__lemmaE__1(X1,X5,X4,X2),X2,X2),X1,tc_prod(X2,X2))
    | ~ c_Comb_Odiamond(X1,X2)
    | ~ c_in(c_Pair(X3,X4,X2,X2),X1,tc_prod(X2,X2))
    | ~ c_in(c_Pair(X3,X5,X2,X2),c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2)) ),
    c_0_10 ).

cnf(c_0_15,negated_conjecture,
    c_in(c_Pair(v_ya,v_z,t_a,t_a),v_r,tc_prod(t_a,t_a)),
    cls_conjecture_2 ).

cnf(c_0_16,negated_conjecture,
    c_Comb_Odiamond(v_r,t_a),
    cls_conjecture_0 ).

cnf(c_0_17,negated_conjecture,
    ( c_in(c_Pair(v_ya,v_x(X1),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
    | ~ c_in(c_Pair(v_y,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
    c_0_11 ).

cnf(c_0_18,negated_conjecture,
    c_in(c_Pair(v_y,v_xaa,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)),
    cls_conjecture_3 ).

cnf(c_0_19,plain,
    ( c_in(c_Pair(X4,c_Comb_Odiamond__strip__lemmaE__1(X1,X5,X4,X2),X2,X2),c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2))
    | ~ c_Comb_Odiamond(X1,X2)
    | ~ c_in(c_Pair(X3,X4,X2,X2),X1,tc_prod(X2,X2))
    | ~ c_in(c_Pair(X3,X5,X2,X2),c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2)) ),
    c_0_12 ).

cnf(c_0_20,plain,
    ( c_in(c_Pair(X5,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
    | ~ c_in(c_Pair(X1,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
    | ~ c_in(c_Pair(X5,X1,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3)) ),
    inference(fof_simplification,[status(thm)],[cls_Transitive__Closure_Ortrancl__trans_0]) ).

cnf(c_0_21,negated_conjecture,
    ( c_in(c_Pair(X1,v_x(X1),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
    | ~ c_in(c_Pair(v_y,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
    c_0_13 ).

cnf(c_0_22,plain,
    ( c_in(X1,c_Transitive__Closure_Ortrancl(X2,X3),tc_prod(X3,X3))
    | ~ c_in(X1,X2,tc_prod(X3,X3)) ),
    inference(fof_simplification,[status(thm)],[cls_Transitive__Closure_Or__into__rtrancl_0]) ).

cnf(c_0_23,negated_conjecture,
    ( c_in(c_Pair(X1,c_Comb_Odiamond__strip__lemmaE__1(v_r,X1,v_z,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a))
    | ~ c_in(c_Pair(v_ya,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).

cnf(c_0_24,negated_conjecture,
    c_in(c_Pair(v_ya,v_x(v_xaa),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ c_in(c_Pair(v_xaa,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
    | ~ c_in(c_Pair(v_z,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
    inference(fof_simplification,[status(thm)],[cls_conjecture_6]) ).

cnf(c_0_26,negated_conjecture,
    ( c_in(c_Pair(v_z,c_Comb_Odiamond__strip__lemmaE__1(v_r,X1,v_z,t_a),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
    | ~ c_in(c_Pair(v_ya,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_15]),c_0_16])]) ).

cnf(c_0_27,plain,
    ( c_in(c_Pair(X5,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
    | ~ c_in(c_Pair(X1,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
    | ~ c_in(c_Pair(X5,X1,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3)) ),
    c_0_20 ).

cnf(c_0_28,negated_conjecture,
    c_in(c_Pair(v_xaa,v_x(v_xaa),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)),
    inference(spm,[status(thm)],[c_0_21,c_0_18]) ).

cnf(c_0_29,plain,
    ( c_in(X1,c_Transitive__Closure_Ortrancl(X2,X3),tc_prod(X3,X3))
    | ~ c_in(X1,X2,tc_prod(X3,X3)) ),
    c_0_22 ).

cnf(c_0_30,negated_conjecture,
    c_in(c_Pair(v_x(v_xaa),c_Comb_Odiamond__strip__lemmaE__1(v_r,v_x(v_xaa),v_z,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a)),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_31,negated_conjecture,
    ( ~ c_in(c_Pair(v_xaa,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
    | ~ c_in(c_Pair(v_z,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
    c_0_25 ).

cnf(c_0_32,negated_conjecture,
    c_in(c_Pair(v_z,c_Comb_Odiamond__strip__lemmaE__1(v_r,v_x(v_xaa),v_z,t_a),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)),
    inference(spm,[status(thm)],[c_0_26,c_0_24]) ).

cnf(c_0_33,negated_conjecture,
    ( c_in(c_Pair(v_xaa,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
    | ~ c_in(c_Pair(v_x(v_xaa),X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_34,negated_conjecture,
    c_in(c_Pair(v_x(v_xaa),c_Comb_Odiamond__strip__lemmaE__1(v_r,v_x(v_xaa),v_z,t_a),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_35,negated_conjecture,
    ~ c_in(c_Pair(v_xaa,c_Comb_Odiamond__strip__lemmaE__1(v_r,v_x(v_xaa),v_z,t_a),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_36,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : COL121-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.10  % Command    : run_E %s %d THM
% 0.10/0.30  % Computer : n028.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 300
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Fri May  3 12:00:18 EDT 2024
% 0.10/0.30  % CPUTime    : 
% 0.15/0.40  Running first-order model finding
% 0.15/0.40  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.9Gz2h4b5xL/E---3.1_15245.p
% 0.15/0.42  # Version: 3.1.0
% 0.15/0.42  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42  # Starting sh5l with 300s (1) cores
% 0.15/0.42  # new_bool_3 with pid 15323 completed with status 0
% 0.15/0.42  # Result found by new_bool_3
% 0.15/0.42  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42  # Search class: FHHNF-FFMS32-SFFFFFNN
% 0.15/0.42  # partial match(1): FGHNF-FFMS32-SFFFFFNN
% 0.15/0.42  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42  # Starting G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S071I with 181s (1) cores
% 0.15/0.42  # G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S071I with pid 15327 completed with status 0
% 0.15/0.42  # Result found by G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S071I
% 0.15/0.42  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42  # Search class: FHHNF-FFMS32-SFFFFFNN
% 0.15/0.42  # partial match(1): FGHNF-FFMS32-SFFFFFNN
% 0.15/0.42  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42  # Starting G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S071I with 181s (1) cores
% 0.15/0.42  # Preprocessing time       : 0.001 s
% 0.15/0.42  # Presaturation interreduction done
% 0.15/0.42  
% 0.15/0.42  # Proof found!
% 0.15/0.42  # SZS status Unsatisfiable
% 0.15/0.42  # SZS output start CNFRefutation
% See solution above
% 0.15/0.42  # Parsed axioms                        : 10
% 0.15/0.42  # Removed by relevancy pruning/SinE    : 0
% 0.15/0.42  # Initial clauses                      : 10
% 0.15/0.42  # Removed in clause preprocessing      : 0
% 0.15/0.42  # Initial clauses in saturation        : 10
% 0.15/0.42  # Processed clauses                    : 103
% 0.15/0.42  # ...of these trivial                  : 0
% 0.15/0.42  # ...subsumed                          : 0
% 0.15/0.42  # ...remaining for further processing  : 103
% 0.15/0.42  # Other redundant clauses eliminated   : 0
% 0.15/0.42  # Clauses deleted for lack of memory   : 0
% 0.15/0.42  # Backward-subsumed                    : 0
% 0.15/0.42  # Backward-rewritten                   : 0
% 0.15/0.42  # Generated clauses                    : 271
% 0.15/0.42  # ...of the previous two non-redundant : 267
% 0.15/0.42  # ...aggressively subsumed             : 0
% 0.15/0.42  # Contextual simplify-reflections      : 0
% 0.15/0.42  # Paramodulations                      : 271
% 0.15/0.42  # Factorizations                       : 0
% 0.15/0.42  # NegExts                              : 0
% 0.15/0.42  # Equation resolutions                 : 0
% 0.15/0.42  # Disequality decompositions           : 0
% 0.15/0.42  # Total rewrite steps                  : 11
% 0.15/0.42  # ...of those cached                   : 7
% 0.15/0.42  # Propositional unsat checks           : 0
% 0.15/0.42  #    Propositional check models        : 0
% 0.15/0.42  #    Propositional check unsatisfiable : 0
% 0.15/0.42  #    Propositional clauses             : 0
% 0.15/0.42  #    Propositional clauses after purity: 0
% 0.15/0.42  #    Propositional unsat core size     : 0
% 0.15/0.42  #    Propositional preprocessing time  : 0.000
% 0.15/0.42  #    Propositional encoding time       : 0.000
% 0.15/0.42  #    Propositional solver time         : 0.000
% 0.15/0.42  #    Success case prop preproc time    : 0.000
% 0.15/0.42  #    Success case prop encoding time   : 0.000
% 0.15/0.42  #    Success case prop solver time     : 0.000
% 0.15/0.42  # Current number of processed clauses  : 93
% 0.15/0.42  #    Positive orientable unit clauses  : 56
% 0.15/0.42  #    Positive unorientable unit clauses: 0
% 0.15/0.42  #    Negative unit clauses             : 3
% 0.15/0.42  #    Non-unit-clauses                  : 34
% 0.15/0.42  # Current number of unprocessed clauses: 183
% 0.15/0.42  # ...number of literals in the above   : 441
% 0.15/0.42  # Current number of archived formulas  : 0
% 0.15/0.42  # Current number of archived clauses   : 10
% 0.15/0.42  # Clause-clause subsumption calls (NU) : 308
% 0.15/0.42  # Rec. Clause-clause subsumption calls : 292
% 0.15/0.42  # Non-unit clause-clause subsumptions  : 0
% 0.15/0.42  # Unit Clause-clause subsumption calls : 122
% 0.15/0.42  # Rewrite failures with RHS unbound    : 0
% 0.15/0.42  # BW rewrite match attempts            : 97
% 0.15/0.42  # BW rewrite match successes           : 0
% 0.15/0.42  # Condensation attempts                : 0
% 0.15/0.42  # Condensation successes               : 0
% 0.15/0.42  # Termbank termtop insertions          : 11706
% 0.15/0.42  # Search garbage collected termcells   : 30
% 0.15/0.42  
% 0.15/0.42  # -------------------------------------------------
% 0.15/0.42  # User time                : 0.007 s
% 0.15/0.42  # System time              : 0.005 s
% 0.15/0.42  # Total time               : 0.011 s
% 0.15/0.42  # Maximum resident set size: 1788 pages
% 0.15/0.42  
% 0.15/0.42  # -------------------------------------------------
% 0.15/0.42  # User time                : 0.008 s
% 0.15/0.42  # System time              : 0.006 s
% 0.15/0.42  # Total time               : 0.014 s
% 0.15/0.42  # Maximum resident set size: 1700 pages
% 0.15/0.42  % E---3.1 exiting
%------------------------------------------------------------------------------