↑ Up

E-SAT---3.5.1.THM-CRf.s

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

% Computer : n011.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:29:10 PM UTC 2026

% Result   : Theorem 0.26s 0.47s
% Output   : CNFRefutation 0.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   49 (  17 unt;   0 def)
%            Number of atoms       :  159 (  24 equ)
%            Maximal formula atoms :   27 (   3 avg)
%            Number of connectives :  175 (  65   ~;  65   |;  33   &)
%                                         (   9 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   1 con; 0-2 aty)
%            Number of variables   :   97 (   1 sgn  54   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(theorem_4_11,conjecture,
    ! [X9] :
    ? [X3,X5] :
      ( X3 != X5
      & ordered_by(X9,X3,X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_4_11) ).

fof(start_point_defn,axiom,
    ! [X3,X9] :
      ( start_point(X3,X9)
    <=> ( ! [X5] :
            ( ( incident_o(X5,X9)
              & X3 != X5 )
           => ordered_by(X9,X3,X5) )
        & incident_o(X3,X9) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+2.ax',start_point_defn) ).

fof(inner_point_defn,axiom,
    ! [X3,X1] :
      ( inner_point(X3,X1)
    <=> ( ~ end_point(X3,X1)
        & incident_c(X3,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+0.ax',inner_point_defn) ).

fof(o4,axiom,
    ! [X9] :
    ? [X3] : start_point(X3,X9),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+2.ax',o4) ).

fof(c3,axiom,
    ! [X1] :
    ? [X3] : inner_point(X3,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+0.ax',c3) ).

fof(o2,axiom,
    ! [X9] :
    ? [X1] :
      ( ! [X3] :
          ( incident_o(X3,X9)
        <=> incident_c(X3,X1) )
      & open(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+2.ax',o2) ).

fof(underlying_curve_defn,axiom,
    ! [X1,X9] :
      ( X1 = underlying_curve(X9)
    <=> ! [X3] :
          ( incident_o(X3,X9)
        <=> incident_c(X3,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+2.ax',underlying_curve_defn) ).

fof(end_point_defn,axiom,
    ! [X3,X1] :
      ( end_point(X3,X1)
    <=> ( ! [X2,X4] :
            ( ( incident_c(X3,X4)
              & incident_c(X3,X2)
              & part_of(X4,X1)
              & part_of(X2,X1) )
           => ( part_of(X4,X2)
              | part_of(X2,X4) ) )
        & incident_c(X3,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+0.ax',end_point_defn) ).

fof(open_defn,axiom,
    ! [X1] :
      ( open(X1)
    <=> ? [X3] : end_point(X3,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+0.ax',open_defn) ).

fof(c_0_9,negated_conjecture,
    ~ ! [X9] :
      ? [X3,X5] :
        ( X3 != X5
        & ordered_by(X9,X3,X5) ),
    inference(assume_negation,[status(cth)],[theorem_4_11]) ).

fof(c_0_10,plain,
    ! [X3,X9] :
      ( start_point(X3,X9)
    <=> ( ! [X5] :
            ( ( incident_o(X5,X9)
              & X3 != X5 )
           => ordered_by(X9,X3,X5) )
        & incident_o(X3,X9) ) ),
    inference(fof_simplification,[status(thm)],[start_point_defn]) ).

fof(c_0_11,plain,
    ! [X3,X1] :
      ( inner_point(X3,X1)
    <=> ( ~ end_point(X3,X1)
        & incident_c(X3,X1) ) ),
    inference(fof_simplification,[status(thm)],[inner_point_defn]) ).

fof(c_0_12,negated_conjecture,
    ~ ! [X9] :
      ? [X3,X5] :
        ( X3 != X5
        & ordered_by(X9,X3,X5) ),
    inference(fof_simplification,[status(thm)],[c_0_9]) ).

fof(c_0_13,plain,
    ! [X99,X100,X101,X102,X103] :
      ( ( start_point(X102,X103)
        | ~ incident_o(X102,X103)
        | ~ ordered_by(X103,X102,esk15_2(X102,X103)) )
      & ( start_point(X102,X103)
        | ~ incident_o(X102,X103)
        | incident_o(esk15_2(X102,X103),X103) )
      & ( start_point(X102,X103)
        | ~ incident_o(X102,X103)
        | X102 != esk15_2(X102,X103) )
      & ( ~ start_point(X99,X100)
        | ordered_by(X100,X99,X101)
        | ~ incident_o(X101,X100)
        | X99 = X101 )
      & ( ~ start_point(X99,X100)
        | incident_o(X99,X100) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])])])]) ).

fof(c_0_14,plain,
    ! [X131] : start_point(esk20_1(X131),X131),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[o4])]) ).

fof(c_0_15,plain,
    ! [X35,X36] :
      ( ( inner_point(X35,X36)
        | end_point(X35,X36)
        | ~ incident_c(X35,X36) )
      & ( ~ inner_point(X35,X36)
        | ~ end_point(X35,X36) )
      & ( ~ inner_point(X35,X36)
        | incident_c(X35,X36) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).

fof(c_0_16,plain,
    ! [X60] : inner_point(esk8_1(X60),X60),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c3])]) ).

fof(c_0_17,negated_conjecture,
    ! [X151,X152] :
      ( X151 = X152
      | ~ ordered_by(esk25_0,X151,X152) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).

cnf(c_0_18,plain,
    ( ~ start_point(X1,X3)
    | ~ incident_o(X2,X3)
    | ordered_by(X3,X1,X2)
    | X1 = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_19,plain,
    start_point(esk20_1(X1),X1),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_20,plain,
    ! [X114,X116,X117] :
      ( ( incident_o(X117,X114)
        | ~ incident_c(X117,esk17_1(X114)) )
      & ( incident_c(X116,esk17_1(X114))
        | ~ incident_o(X116,X114) )
      & open(esk17_1(X114)) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[o2])])])])])]) ).

cnf(c_0_21,plain,
    ( ~ inner_point(X1,X2)
    | incident_c(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_22,plain,
    inner_point(esk8_1(X1),X1),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_23,negated_conjecture,
    ( ~ ordered_by(esk25_0,X1,X2)
    | X1 = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_24,plain,
    ( ~ incident_o(X2,X1)
    | ordered_by(X1,esk20_1(X1),X2)
    | esk20_1(X1) = X2 ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_25,plain,
    ( ~ incident_c(X1,esk17_1(X2))
    | incident_o(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_26,plain,
    incident_c(esk8_1(X1),X1),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

fof(c_0_27,plain,
    ! [X143,X144,X145,X146,X147,X148] :
      ( ( X147 = underlying_curve(X148)
        | incident_c(esk24_2(X147,X148),X147)
        | incident_o(esk24_2(X147,X148),X148) )
      & ( X147 = underlying_curve(X148)
        | ~ incident_c(esk24_2(X147,X148),X147)
        | ~ incident_o(esk24_2(X147,X148),X148) )
      & ( X143 != underlying_curve(X144)
        | incident_o(X146,X144)
        | ~ incident_c(X146,X143) )
      & ( X143 != underlying_curve(X144)
        | incident_c(X145,X143)
        | ~ incident_o(X145,X144) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[underlying_curve_defn])])])])])])]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ incident_o(X1,esk25_0)
    | esk20_1(esk25_0) = X1 ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,plain,
    incident_o(esk8_1(esk17_1(X1)),X1),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,plain,
    ( X2 != underlying_curve(X3)
    | ~ incident_c(X1,X2)
    | incident_o(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    esk20_1(esk25_0) = esk8_1(esk17_1(esk25_0)),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_32,plain,
    ( X1 != underlying_curve(X2)
    | incident_o(esk8_1(X1),X2) ),
    inference(spm,[status(thm)],[c_0_30,c_0_26]) ).

fof(c_0_33,plain,
    ! [X27,X28,X29,X30,X31,X32] :
      ( ( end_point(X31,X32)
        | ~ incident_c(X31,X32)
        | ~ part_of(esk4_2(X31,X32),esk3_2(X31,X32)) )
      & ( end_point(X31,X32)
        | ~ incident_c(X31,X32)
        | ~ part_of(esk3_2(X31,X32),esk4_2(X31,X32)) )
      & ( end_point(X31,X32)
        | ~ incident_c(X31,X32)
        | incident_c(X31,esk4_2(X31,X32)) )
      & ( end_point(X31,X32)
        | ~ incident_c(X31,X32)
        | incident_c(X31,esk3_2(X31,X32)) )
      & ( end_point(X31,X32)
        | ~ incident_c(X31,X32)
        | part_of(esk4_2(X31,X32),X32) )
      & ( end_point(X31,X32)
        | ~ incident_c(X31,X32)
        | part_of(esk3_2(X31,X32),X32) )
      & ( ~ end_point(X27,X28)
        | part_of(X30,X29)
        | part_of(X29,X30)
        | ~ incident_c(X27,X30)
        | ~ incident_c(X27,X29)
        | ~ part_of(X30,X28)
        | ~ part_of(X29,X28) )
      & ( ~ end_point(X27,X28)
        | incident_c(X27,X28) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[end_point_defn])])])])])])]) ).

fof(c_0_34,plain,
    ! [X49,X51,X52] :
      ( ( open(X51)
        | ~ end_point(X52,X51) )
      & ( end_point(esk7_1(X49),X49)
        | ~ open(X49) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[open_defn])])])])])]) ).

cnf(c_0_35,negated_conjecture,
    ( ~ incident_o(X1,esk25_0)
    | esk8_1(esk17_1(esk25_0)) = X1 ),
    inference(rw,[status(thm)],[c_0_28,c_0_31]) ).

cnf(c_0_36,plain,
    incident_o(esk8_1(underlying_curve(X1)),X1),
    inference(er,[status(thm)],[c_0_32]) ).

cnf(c_0_37,plain,
    ( ~ end_point(X1,X2)
    | incident_c(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

cnf(c_0_38,plain,
    ( ~ open(X1)
    | end_point(esk7_1(X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

cnf(c_0_39,negated_conjecture,
    esk8_1(esk17_1(esk25_0)) = esk8_1(underlying_curve(esk25_0)),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_40,plain,
    ( ~ open(X1)
    | incident_c(esk7_1(X1),X1) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_41,plain,
    open(esk17_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_42,plain,
    ( ~ inner_point(X1,X2)
    | ~ end_point(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_43,negated_conjecture,
    ( ~ incident_o(X1,esk25_0)
    | esk8_1(underlying_curve(esk25_0)) = X1 ),
    inference(rw,[status(thm)],[c_0_35,c_0_39]) ).

cnf(c_0_44,plain,
    incident_o(esk7_1(esk17_1(X1)),X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_40]),c_0_41])]) ).

cnf(c_0_45,plain,
    ~ end_point(esk8_1(X1),X1),
    inference(spm,[status(thm)],[c_0_42,c_0_22]) ).

cnf(c_0_46,negated_conjecture,
    esk7_1(esk17_1(esk25_0)) = esk8_1(underlying_curve(esk25_0)),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_47,negated_conjecture,
    ~ end_point(esk8_1(underlying_curve(esk25_0)),esk17_1(esk25_0)),
    inference(spm,[status(thm)],[c_0_45,c_0_39]) ).

cnf(c_0_48,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_46]),c_0_41])]),c_0_47]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GEO126+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n011.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 12:00:25 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  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
% 0.26/0.47  % Version: 3.5.1
% 0.26/0.47  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.47  % Starting new_bool_3 with 300s (1) cores
% 0.26/0.47  % Starting new_bool_1 with 300s (1) cores
% 0.26/0.47  % Starting sh5l with 300s (1) cores
% 0.26/0.47  % new_bool_3 with pid 3569689 completed with status 9
% 0.26/0.47  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3569688 completed with status 0
% 0.26/0.47  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.26/0.47  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.47  % No SInE strategy applied
% 0.26/0.47  % Search class: FGHSS-FFMF32-SFFFFFNN
% 0.26/0.47  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.47  % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.26/0.47  % Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 253s (1) cores
% 0.26/0.47  % Starting new_bool_3 with 248s (1) cores
% 0.26/0.47  % Starting new_bool_1 with 241s (1) cores
% 0.26/0.47  % G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with pid 3569707 completed with status 0
% 0.26/0.47  % Result found by G-E--_207_B07_F1_AE_CS_SP_PS_S0Y
% 0.26/0.47  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.47  % No SInE strategy applied
% 0.26/0.47  % Search class: FGHSS-FFMF32-SFFFFFNN
% 0.26/0.47  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.47  % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.26/0.47  % Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 253s (1) cores
% 0.26/0.47  % Preprocessing time       : 0.003 s
% 0.26/0.47  % Presaturation interreduction done
% 0.26/0.47  
% 0.26/0.47  % Proof found!
% 0.26/0.47  % SZS status Theorem
% 0.26/0.47  % SZS output start CNFRefutation
% See solution above
% 0.26/0.47  % Parsed axioms                        : 28
% 0.26/0.47  % Removed by relevancy pruning/SinE    : 0
% 0.26/0.47  % Initial clauses                      : 86
% 0.26/0.47  % Removed in clause preprocessing      : 0
% 0.26/0.47  % Initial clauses in saturation        : 86
% 0.26/0.47  % Processed clauses                    : 326
% 0.26/0.47  % ...of these trivial                  : 1
% 0.26/0.47  % ...subsumed                          : 23
% 0.26/0.47  % ...remaining for further processing  : 302
% 0.26/0.47  % Other redundant clauses eliminated   : 4
% 0.26/0.47  % Clauses deleted for lack of memory   : 0
% 0.26/0.47  % Backward-subsumed                    : 4
% 0.26/0.47  % Backward-rewritten                   : 4
% 0.26/0.47  % Generated clauses                    : 501
% 0.26/0.47  % ...of the previous two non-redundant : 446
% 0.26/0.47  % ...aggressively subsumed             : 0
% 0.26/0.47  % Contextual simplify-reflections      : 5
% 0.26/0.47  % Paramodulations                      : 465
% 0.26/0.47  % Factorizations                       : 10
% 0.26/0.47  % NegExts                              : 0
% 0.26/0.47  % Equation resolutions                 : 26
% 0.26/0.47  % Disequality decompositions           : 0
% 0.26/0.47  % Total rewrite steps                  : 28
% 0.26/0.47  % ...of those cached                   : 13
% 0.26/0.47  % Propositional unsat checks           : 0
% 0.26/0.47  %    Propositional check models        : 0
% 0.26/0.47  %    Propositional check unsatisfiable : 0
% 0.26/0.47  %    Propositional clauses             : 0
% 0.26/0.47  %    Propositional clauses after purity: 0
% 0.26/0.47  %    Propositional unsat core size     : 0
% 0.26/0.47  %    Propositional preprocessing time  : 0.000
% 0.26/0.47  %    Propositional encoding time       : 0.000
% 0.26/0.47  %    Propositional solver time         : 0.000
% 0.26/0.47  %    Success case prop preproc time    : 0.000
% 0.26/0.47  %    Success case prop encoding time   : 0.000
% 0.26/0.47  %    Success case prop solver time     : 0.000
% 0.26/0.47  % Current number of processed clauses  : 207
% 0.26/0.47  %    Positive orientable unit clauses  : 16
% 0.26/0.47  %    Positive unorientable unit clauses: 0
% 0.26/0.47  %    Negative unit clauses             : 8
% 0.26/0.47  %    Non-unit-clauses                  : 183
% 0.26/0.47  % Current number of unprocessed clauses: 281
% 0.26/0.47  % ...number of literals in the above   : 1098
% 0.26/0.47  % Current number of archived formulas  : 0
% 0.26/0.47  % Current number of archived clauses   : 94
% 0.26/0.47  % Clause-clause subsumption calls (NU) : 7982
% 0.26/0.47  % Rec. Clause-clause subsumption calls : 3963
% 0.26/0.47  % Non-unit clause-clause subsumptions  : 32
% 0.26/0.47  % Unit Clause-clause subsumption calls : 1005
% 0.26/0.47  % Rewrite failures with RHS unbound    : 0
% 0.26/0.47  % BW rewrite match attempts            : 5
% 0.26/0.47  % BW rewrite match successes           : 2
% 0.26/0.47  % Condensation attempts                : 0
% 0.26/0.47  % Condensation successes               : 0
% 0.26/0.47  % Termbank termtop insertions          : 13844
% 0.26/0.47  % Search garbage collected termcells   : 1933
% 0.26/0.47  
% 0.26/0.47  % -------------------------------------------------
% 0.26/0.47  % User time                : 0.036 s
% 0.26/0.47  % System time              : 0.006 s
% 0.26/0.47  % Total time               : 0.042 s
% 0.26/0.47  % Maximum resident set size: 3932 pages
% 0.26/0.47  
% 0.26/0.47  % -------------------------------------------------
% 0.26/0.47  % User time                : 0.149 s
% 0.26/0.47  % System time              : 0.039 s
% 0.26/0.47  % Total time               : 0.188 s
% 0.26/0.47  % Maximum resident set size: 4864 pages
% 0.26/0.47  % E exiting
%------------------------------------------------------------------------------