↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GEO191+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n020.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:27:39 PM UTC 2026

% Result   : Theorem 0.47s 0.47s
% Output   : CNFRefutation 0.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   58 (  16 unt;   0 def)
%            Number of atoms       :  150 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  128 (  36   ~;  74   |;  10   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   88 (   0 sgn  44   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(con,conjecture,
    ! [X1,X2,X4,X5] :
      ( ( ( apart_point_and_line(intersection_point(X1,X2),X5)
          | apart_point_and_line(intersection_point(X1,X2),X4) )
        & convergent_lines(X4,X5)
        & convergent_lines(X1,X2) )
     => ( apart_point_and_line(intersection_point(X4,X5),X2)
        | apart_point_and_line(intersection_point(X4,X5),X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

fof(apart6,axiom,
    ! [X1,X2,X3] :
      ( convergent_lines(X1,X2)
     => ( convergent_lines(X2,X3)
        | convergent_lines(X1,X3) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',apart6) ).

fof(apart3,axiom,
    ! [X1] : ~ convergent_lines(X1,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',apart3) ).

fof(con2,axiom,
    ! [X1,X2,X3] :
      ( convergent_lines(X1,X2)
     => ( ( apart_point_and_line(X3,X2)
          | apart_point_and_line(X3,X1) )
       => distinct_points(X3,intersection_point(X1,X2)) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',con2) ).

fof(ceq3,axiom,
    ! [X1,X2] :
      ( convergent_lines(X1,X2)
     => distinct_lines(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',ceq3) ).

fof(apart1,axiom,
    ! [X1] : ~ distinct_points(X1,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',apart1) ).

fof(apart4,axiom,
    ! [X1,X2,X3] :
      ( distinct_points(X1,X2)
     => ( distinct_points(X2,X3)
        | distinct_points(X1,X3) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',apart4) ).

fof(cu1,axiom,
    ! [X1,X2,X4,X5] :
      ( ( distinct_lines(X4,X5)
        & distinct_points(X1,X2) )
     => ( apart_point_and_line(X2,X5)
        | apart_point_and_line(X2,X4)
        | apart_point_and_line(X1,X5)
        | apart_point_and_line(X1,X4) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',cu1) ).

fof(c_0_8,negated_conjecture,
    ~ ! [X1,X2,X4,X5] :
        ( ( ( apart_point_and_line(intersection_point(X1,X2),X5)
            | apart_point_and_line(intersection_point(X1,X2),X4) )
          & convergent_lines(X4,X5)
          & convergent_lines(X1,X2) )
       => ( apart_point_and_line(intersection_point(X4,X5),X2)
          | apart_point_and_line(intersection_point(X4,X5),X1) ) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(c_0_9,plain,
    ! [X15,X16,X17] :
      ( convergent_lines(X16,X17)
      | convergent_lines(X15,X17)
      | ~ convergent_lines(X15,X16) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart6])])]) ).

fof(c_0_10,negated_conjecture,
    ( ~ apart_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0)
    & ~ apart_point_and_line(intersection_point(esk3_0,esk4_0),esk1_0)
    & ( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk4_0)
      | apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0) )
    & convergent_lines(esk3_0,esk4_0)
    & convergent_lines(esk1_0,esk2_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).

fof(c_0_11,plain,
    ! [X1] : ~ convergent_lines(X1,X1),
    inference(fof_simplification,[status(thm)],[apart3]) ).

cnf(c_0_12,plain,
    ( ~ convergent_lines(X1,X2)
    | convergent_lines(X2,X3)
    | convergent_lines(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    convergent_lines(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_14,plain,
    ! [X8] : ~ convergent_lines(X8,X8),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_11])]) ).

cnf(c_0_15,negated_conjecture,
    ( convergent_lines(esk2_0,X1)
    | convergent_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,plain,
    ~ convergent_lines(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    ( convergent_lines(X1,X2)
    | convergent_lines(esk1_0,X2)
    | convergent_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_15]) ).

fof(c_0_18,plain,
    ! [X21,X22,X23] :
      ( ( ~ convergent_lines(X21,X22)
        | distinct_points(X23,intersection_point(X21,X22))
        | ~ apart_point_and_line(X23,X22) )
      & ( ~ convergent_lines(X21,X22)
        | distinct_points(X23,intersection_point(X21,X22))
        | ~ apart_point_and_line(X23,X21) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con2])])])]) ).

cnf(c_0_19,negated_conjecture,
    ( convergent_lines(esk2_0,X1)
    | convergent_lines(X1,esk1_0) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,plain,
    ( ~ convergent_lines(X3,X2)
    | ~ apart_point_and_line(X1,X2)
    | distinct_points(X1,intersection_point(X3,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_21,negated_conjecture,
    convergent_lines(esk3_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_22,negated_conjecture,
    ( convergent_lines(X1,X2)
    | convergent_lines(esk2_0,X2)
    | convergent_lines(X1,esk1_0) ),
    inference(spm,[status(thm)],[c_0_12,c_0_19]) ).

fof(c_0_23,plain,
    ! [X34,X35] :
      ( distinct_lines(X34,X35)
      | ~ convergent_lines(X34,X35) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])])]) ).

fof(c_0_24,plain,
    ! [X1] : ~ distinct_points(X1,X1),
    inference(fof_simplification,[status(thm)],[apart1]) ).

fof(c_0_25,plain,
    ! [X9,X10,X11] :
      ( distinct_points(X10,X11)
      | distinct_points(X9,X11)
      | ~ distinct_points(X9,X10) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart4])])]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ apart_point_and_line(X1,esk4_0)
    | distinct_points(X1,intersection_point(esk3_0,esk4_0)) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_27,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk4_0)
    | apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_28,negated_conjecture,
    ( convergent_lines(X1,esk1_0)
    | convergent_lines(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_16,c_0_22]) ).

fof(c_0_29,plain,
    ! [X24,X25,X26,X27] :
      ( apart_point_and_line(X25,X27)
      | apart_point_and_line(X25,X26)
      | apart_point_and_line(X24,X27)
      | apart_point_and_line(X24,X26)
      | ~ distinct_lines(X26,X27)
      | ~ distinct_points(X24,X25) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])])]) ).

cnf(c_0_30,plain,
    ( ~ convergent_lines(X1,X2)
    | distinct_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_31,negated_conjecture,
    convergent_lines(esk2_0,esk1_0),
    inference(spm,[status(thm)],[c_0_16,c_0_15]) ).

fof(c_0_32,plain,
    ! [X6] : ~ distinct_points(X6,X6),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_24])]) ).

cnf(c_0_33,plain,
    ( ~ distinct_points(X1,X2)
    | distinct_points(X2,X3)
    | distinct_points(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_34,negated_conjecture,
    ( distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk3_0,esk4_0))
    | apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_35,negated_conjecture,
    ( convergent_lines(esk4_0,X1)
    | convergent_lines(esk3_0,X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_21]) ).

cnf(c_0_36,negated_conjecture,
    ( convergent_lines(X1,X2)
    | convergent_lines(esk1_0,X2)
    | convergent_lines(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_12,c_0_28]) ).

cnf(c_0_37,plain,
    ( ~ distinct_lines(X3,X4)
    | ~ distinct_points(X1,X2)
    | apart_point_and_line(X2,X4)
    | apart_point_and_line(X2,X3)
    | apart_point_and_line(X1,X4)
    | apart_point_and_line(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_38,negated_conjecture,
    distinct_lines(esk2_0,esk1_0),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_39,plain,
    ~ distinct_points(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_40,negated_conjecture,
    ( distinct_points(intersection_point(esk3_0,esk4_0),X1)
    | distinct_points(intersection_point(esk1_0,esk2_0),X1)
    | apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0) ),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_41,negated_conjecture,
    ( convergent_lines(X1,X2)
    | convergent_lines(esk4_0,X2)
    | convergent_lines(esk3_0,X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_35]) ).

cnf(c_0_42,plain,
    ( ~ convergent_lines(X2,X3)
    | ~ apart_point_and_line(X1,X2)
    | distinct_points(X1,intersection_point(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_43,negated_conjecture,
    ( convergent_lines(X1,esk2_0)
    | convergent_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_36]) ).

cnf(c_0_44,negated_conjecture,
    ( ~ distinct_points(X1,X2)
    | apart_point_and_line(X2,esk1_0)
    | apart_point_and_line(X2,esk2_0)
    | apart_point_and_line(X1,esk1_0)
    | apart_point_and_line(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_45,negated_conjecture,
    ( distinct_points(intersection_point(esk3_0,esk4_0),intersection_point(esk1_0,esk2_0))
    | apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0) ),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_46,negated_conjecture,
    ~ apart_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_47,negated_conjecture,
    ~ apart_point_and_line(intersection_point(esk3_0,esk4_0),esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_48,negated_conjecture,
    ( convergent_lines(esk3_0,X1)
    | convergent_lines(X1,esk4_0) ),
    inference(spm,[status(thm)],[c_0_16,c_0_41]) ).

cnf(c_0_49,negated_conjecture,
    ( ~ apart_point_and_line(X2,X1)
    | distinct_points(X2,intersection_point(X1,esk2_0))
    | convergent_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_50,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
    | apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
    | apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_47]) ).

cnf(c_0_51,negated_conjecture,
    ( ~ apart_point_and_line(X2,X1)
    | distinct_points(X2,intersection_point(X1,esk4_0))
    | convergent_lines(esk3_0,X1) ),
    inference(spm,[status(thm)],[c_0_42,c_0_48]) ).

cnf(c_0_52,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
    | apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_16]),c_0_39]) ).

cnf(c_0_53,negated_conjecture,
    ( distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk3_0,esk4_0))
    | apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_16]) ).

cnf(c_0_54,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
    | apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_53]),c_0_46]),c_0_47]) ).

cnf(c_0_55,negated_conjecture,
    ( ~ apart_point_and_line(X2,X1)
    | distinct_points(X2,intersection_point(esk1_0,X1))
    | convergent_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_20,c_0_15]) ).

cnf(c_0_56,negated_conjecture,
    apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_54]),c_0_16]),c_0_39]) ).

cnf(c_0_57,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_16]),c_0_39]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GEO191+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.36  % Computer : n020.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Sun Sep 20 13:17:32 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.41  Running first-order theorem proving
% 0.08/0.41  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.47/0.47  % Version: 3.5.1
% 0.47/0.47  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.47/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.47/0.47  % Starting new_bool_3 with 300s (1) cores
% 0.47/0.47  % Starting new_bool_1 with 300s (1) cores
% 0.47/0.47  % Starting sh5l with 300s (1) cores
% 0.47/0.47  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 580901 completed with status 0
% 0.47/0.47  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.47/0.47  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.47/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.47/0.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.47/0.47  % No SInE strategy applied
% 0.47/0.47  % Search class: FGUNF-FFSS22-SFFFFFNN
% 0.47/0.47  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.47/0.47  % Starting SubtermCWHack with 136s (1) cores
% 0.47/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.47/0.47  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.47/0.47  % Starting new_bool_3 with 136s (1) cores
% 0.47/0.47  % Starting new_bool_1 with 136s (1) cores
% 0.47/0.47  % new_bool_3 with pid 580911 completed with status 0
% 0.47/0.47  % Result found by new_bool_3
% 0.47/0.47  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.47/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.47/0.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.47/0.47  % No SInE strategy applied
% 0.47/0.47  % Search class: FGUNF-FFSS22-SFFFFFNN
% 0.47/0.47  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.47/0.47  % Starting SubtermCWHack with 136s (1) cores
% 0.47/0.47  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.47/0.47  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.47/0.47  % Starting new_bool_3 with 136s (1) cores
% 0.47/0.47  % Preprocessing time       : 0.001 s
% 0.47/0.47  % Presaturation interreduction done
% 0.47/0.47  
% 0.47/0.47  % Proof found!
% 0.47/0.47  % SZS status Theorem
% 0.47/0.47  % SZS output start CNFRefutation
% See solution above
% 0.47/0.47  % Parsed axioms                        : 13
% 0.47/0.47  % Removed by relevancy pruning/SinE    : 0
% 0.47/0.47  % Initial clauses                      : 19
% 0.47/0.47  % Removed in clause preprocessing      : 0
% 0.47/0.47  % Initial clauses in saturation        : 19
% 0.47/0.47  % Processed clauses                    : 355
% 0.47/0.47  % ...of these trivial                  : 3
% 0.47/0.47  % ...subsumed                          : 124
% 0.47/0.47  % ...remaining for further processing  : 228
% 0.47/0.47  % Other redundant clauses eliminated   : 0
% 0.47/0.47  % Clauses deleted for lack of memory   : 0
% 0.47/0.47  % Backward-subsumed                    : 8
% 0.47/0.47  % Backward-rewritten                   : 26
% 0.47/0.47  % Generated clauses                    : 1517
% 0.47/0.47  % ...of the previous two non-redundant : 1289
% 0.47/0.47  % ...aggressively subsumed             : 0
% 0.47/0.47  % Contextual simplify-reflections      : 1
% 0.47/0.47  % Paramodulations                      : 1401
% 0.47/0.47  % Factorizations                       : 116
% 0.47/0.47  % NegExts                              : 0
% 0.47/0.47  % Equation resolutions                 : 0
% 0.47/0.47  % Disequality decompositions           : 0
% 0.47/0.47  % Total rewrite steps                  : 247
% 0.47/0.47  % ...of those cached                   : 235
% 0.47/0.47  % Propositional unsat checks           : 0
% 0.47/0.47  %    Propositional check models        : 0
% 0.47/0.47  %    Propositional check unsatisfiable : 0
% 0.47/0.47  %    Propositional clauses             : 0
% 0.47/0.47  %    Propositional clauses after purity: 0
% 0.47/0.47  %    Propositional unsat core size     : 0
% 0.47/0.47  %    Propositional preprocessing time  : 0.000
% 0.47/0.47  %    Propositional encoding time       : 0.000
% 0.47/0.47  %    Propositional solver time         : 0.000
% 0.47/0.47  %    Success case prop preproc time    : 0.000
% 0.47/0.47  %    Success case prop encoding time   : 0.000
% 0.47/0.47  %    Success case prop solver time     : 0.000
% 0.47/0.47  % Current number of processed clauses  : 175
% 0.47/0.47  %    Positive orientable unit clauses  : 14
% 0.47/0.47  %    Positive unorientable unit clauses: 0
% 0.47/0.47  %    Negative unit clauses             : 5
% 0.47/0.47  %    Non-unit-clauses                  : 156
% 0.47/0.47  % Current number of unprocessed clauses: 951
% 0.47/0.47  % ...number of literals in the above   : 4306
% 0.47/0.47  % Current number of archived formulas  : 0
% 0.47/0.47  % Current number of archived clauses   : 53
% 0.47/0.47  % Clause-clause subsumption calls (NU) : 2878
% 0.47/0.47  % Rec. Clause-clause subsumption calls : 1653
% 0.47/0.47  % Non-unit clause-clause subsumptions  : 129
% 0.47/0.47  % Unit Clause-clause subsumption calls : 171
% 0.47/0.47  % Rewrite failures with RHS unbound    : 0
% 0.47/0.47  % BW rewrite match attempts            : 5
% 0.47/0.47  % BW rewrite match successes           : 5
% 0.47/0.47  % Condensation attempts                : 0
% 0.47/0.47  % Condensation successes               : 0
% 0.47/0.47  % Termbank termtop insertions          : 22217
% 0.47/0.47  % Search garbage collected termcells   : 246
% 0.47/0.47  
% 0.47/0.47  % -------------------------------------------------
% 0.47/0.47  % User time                : 0.038 s
% 0.47/0.47  % System time              : 0.004 s
% 0.47/0.47  % Total time               : 0.042 s
% 0.47/0.47  % Maximum resident set size: 3648 pages
% 0.47/0.47  
% 0.47/0.47  % -------------------------------------------------
% 0.47/0.47  % User time                : 0.158 s
% 0.47/0.47  % System time              : 0.023 s
% 0.47/0.47  % Total time               : 0.181 s
% 0.47/0.47  % Maximum resident set size: 4608 pages
% 0.47/0.47  % E exiting
%------------------------------------------------------------------------------