↑ 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  : ITP004+1 : TPTP v9.3.1. Bugfixed v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n007.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:55:36 PM UTC 2026

% Result   : Theorem 0.24s 5.86s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   19 (   9 unt;   0 def)
%            Number of atoms       :   42 (   7 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   38 (  15   ~;  13   |;   6   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   3 con; 0-3 aty)
%            Number of variables   :   51 (   1 sgn  31   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(thm_2Epred__set_2EIN__DELETE,axiom,
    ! [X1,X15,X12,X17] :
      ( p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X1,X12),s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),c_2Epred__set_2EDELETE_2E2(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X15),s(X1,X17))))))
    <=> ( s(X1,X12) != s(X1,X17)
        & p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X1,X12),s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X15)))) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm_2Epred__set_2EIN__DELETE) ).

fof(thm_2Epred__set_2EREST__DEF,axiom,
    ! [X1,X15] : s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),c_2Epred__set_2EREST_2E1(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X15))) = s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),c_2Epred__set_2EDELETE_2E2(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X15),s(X1,c_2Epred__set_2ECHOICE_2E1(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X15))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm_2Epred__set_2EREST__DEF) ).

fof(thm_2Epred__set_2ESUBSET__DEF,axiom,
    ! [X1,X15,X16] :
      ( p(s(tyop_2Emin_2Ebool,c_2Epred__set_2ESUBSET_2E2(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X15),s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X16))))
    <=> ! [X5] :
          ( p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X1,X5),s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X15))))
         => p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X1,X5),s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X16)))) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm_2Epred__set_2ESUBSET__DEF) ).

fof(thm_2Epred__set_2EREST__SUBSET,conjecture,
    ! [X1,X15] : p(s(tyop_2Emin_2Ebool,c_2Epred__set_2ESUBSET_2E2(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),c_2Epred__set_2EREST_2E1(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X15))),s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X15)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm_2Epred__set_2EREST__SUBSET) ).

fof(c_0_4,plain,
    ! [X1,X15,X12,X17] :
      ( p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X1,X12),s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),c_2Epred__set_2EDELETE_2E2(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X15),s(X1,X17))))))
    <=> ( s(X1,X12) != s(X1,X17)
        & p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X1,X12),s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X15)))) ) ),
    inference(fof_simplification,[status(thm)],[thm_2Epred__set_2EIN__DELETE]) ).

fof(c_0_5,plain,
    ! [X45,X46,X47,X48] :
      ( ( p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X45,X47),s(tyop_2Emin_2Efun(X45,tyop_2Emin_2Ebool),c_2Epred__set_2EDELETE_2E2(s(tyop_2Emin_2Efun(X45,tyop_2Emin_2Ebool),X46),s(X45,X48))))))
        | s(X45,X47) = s(X45,X48)
        | ~ p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X45,X47),s(tyop_2Emin_2Efun(X45,tyop_2Emin_2Ebool),X46)))) )
      & ( ~ p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X45,X47),s(tyop_2Emin_2Efun(X45,tyop_2Emin_2Ebool),c_2Epred__set_2EDELETE_2E2(s(tyop_2Emin_2Efun(X45,tyop_2Emin_2Ebool),X46),s(X45,X48))))))
        | s(X45,X47) != s(X45,X48) )
      & ( ~ p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X45,X47),s(tyop_2Emin_2Efun(X45,tyop_2Emin_2Ebool),c_2Epred__set_2EDELETE_2E2(s(tyop_2Emin_2Efun(X45,tyop_2Emin_2Ebool),X46),s(X45,X48))))))
        | p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X45,X47),s(tyop_2Emin_2Efun(X45,tyop_2Emin_2Ebool),X46)))) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).

fof(c_0_6,plain,
    ! [X40,X41] : s(tyop_2Emin_2Efun(X40,tyop_2Emin_2Ebool),c_2Epred__set_2EREST_2E1(s(tyop_2Emin_2Efun(X40,tyop_2Emin_2Ebool),X41))) = s(tyop_2Emin_2Efun(X40,tyop_2Emin_2Ebool),c_2Epred__set_2EDELETE_2E2(s(tyop_2Emin_2Efun(X40,tyop_2Emin_2Ebool),X41),s(X40,c_2Epred__set_2ECHOICE_2E1(s(tyop_2Emin_2Efun(X40,tyop_2Emin_2Ebool),X41))))),
    inference(variable_rename,[status(thm)],[thm_2Epred__set_2EREST__DEF]) ).

cnf(c_0_7,plain,
    ( ~ p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X1,X2),s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),c_2Epred__set_2EDELETE_2E2(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X3),s(X1,X4))))))
    | p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X1,X2),s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X3)))) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),c_2Epred__set_2EREST_2E1(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X2))) = s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),c_2Epred__set_2EDELETE_2E2(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X2),s(X1,c_2Epred__set_2ECHOICE_2E1(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X2))))),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_9,plain,
    ! [X30,X31,X32,X33,X34,X35,X36] :
      ( ( p(s(tyop_2Emin_2Ebool,c_2Epred__set_2ESUBSET_2E2(s(tyop_2Emin_2Efun(X34,tyop_2Emin_2Ebool),X35),s(tyop_2Emin_2Efun(X34,tyop_2Emin_2Ebool),X36))))
        | ~ p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X34,esk4_3(X34,X35,X36)),s(tyop_2Emin_2Efun(X34,tyop_2Emin_2Ebool),X36)))) )
      & ( p(s(tyop_2Emin_2Ebool,c_2Epred__set_2ESUBSET_2E2(s(tyop_2Emin_2Efun(X34,tyop_2Emin_2Ebool),X35),s(tyop_2Emin_2Efun(X34,tyop_2Emin_2Ebool),X36))))
        | p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X34,esk4_3(X34,X35,X36)),s(tyop_2Emin_2Efun(X34,tyop_2Emin_2Ebool),X35)))) )
      & ( p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X30,X33),s(tyop_2Emin_2Efun(X30,tyop_2Emin_2Ebool),X32))))
        | ~ p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X30,X33),s(tyop_2Emin_2Efun(X30,tyop_2Emin_2Ebool),X31))))
        | ~ p(s(tyop_2Emin_2Ebool,c_2Epred__set_2ESUBSET_2E2(s(tyop_2Emin_2Efun(X30,tyop_2Emin_2Ebool),X31),s(tyop_2Emin_2Efun(X30,tyop_2Emin_2Ebool),X32)))) ) ),
    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)],[thm_2Epred__set_2ESUBSET__DEF])])])])])])]) ).

fof(c_0_10,negated_conjecture,
    ~ ! [X1,X15] : p(s(tyop_2Emin_2Ebool,c_2Epred__set_2ESUBSET_2E2(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),c_2Epred__set_2EREST_2E1(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X15))),s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X15)))),
    inference(assume_negation,[status(cth)],[thm_2Epred__set_2EREST__SUBSET]) ).

cnf(c_0_11,plain,
    ( ~ p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X1,X2),s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),c_2Epred__set_2EREST_2E1(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X3))))))
    | p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X1,X2),s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X3)))) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,plain,
    ( p(s(tyop_2Emin_2Ebool,c_2Epred__set_2ESUBSET_2E2(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X2),s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X3))))
    | p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X1,esk4_3(X1,X2,X3)),s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X2)))) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_13,negated_conjecture,
    ~ p(s(tyop_2Emin_2Ebool,c_2Epred__set_2ESUBSET_2E2(s(tyop_2Emin_2Efun(esk1_0,tyop_2Emin_2Ebool),c_2Epred__set_2EREST_2E1(s(tyop_2Emin_2Efun(esk1_0,tyop_2Emin_2Ebool),esk2_0))),s(tyop_2Emin_2Efun(esk1_0,tyop_2Emin_2Ebool),esk2_0)))),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).

cnf(c_0_14,plain,
    ( ~ p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X1,esk4_3(X1,X2,X3)),s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X3))))
    | p(s(tyop_2Emin_2Ebool,c_2Epred__set_2ESUBSET_2E2(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X2),s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X3)))) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,plain,
    ( p(s(tyop_2Emin_2Ebool,c_2Ebool_2EIN_2E2(s(X1,esk4_3(X1,c_2Epred__set_2EREST_2E1(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X2)),X3)),s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X2))))
    | p(s(tyop_2Emin_2Ebool,c_2Epred__set_2ESUBSET_2E2(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),c_2Epred__set_2EREST_2E1(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X2))),s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X3)))) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,negated_conjecture,
    ~ p(s(tyop_2Emin_2Ebool,c_2Epred__set_2ESUBSET_2E2(s(tyop_2Emin_2Efun(esk1_0,tyop_2Emin_2Ebool),c_2Epred__set_2EREST_2E1(s(tyop_2Emin_2Efun(esk1_0,tyop_2Emin_2Ebool),esk2_0))),s(tyop_2Emin_2Efun(esk1_0,tyop_2Emin_2Ebool),esk2_0)))),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_17,plain,
    p(s(tyop_2Emin_2Ebool,c_2Epred__set_2ESUBSET_2E2(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),c_2Epred__set_2EREST_2E1(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X2))),s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X2)))),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : ITP004+1 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/5.46  % Computer : n007.cluster.edu
% 0.18/5.46  % Model    : x86_64 x86_64
% 0.18/5.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.46  % Memory   : 8046.5625MB
% 0.18/5.46  % OS       : Linux 6.8.0-71-generic
% 0.18/5.46  % CPULimit : 300
% 0.18/5.46  % WCLimit  : 300
% 0.18/5.46  % DateTime : Sun Sep 20 21:38:11 UTC 2026
% 0.18/5.47  % CPUTime  : 
% 0.18/5.47  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/5.53  Running first-order theorem proving
% 0.24/5.53  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.24/5.86  % Version: 3.5.1
% 0.24/5.86  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/5.86  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.86  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/5.86  % Starting new_bool_3 with 300s (1) cores
% 0.24/5.86  % Starting new_bool_1 with 300s (1) cores
% 0.24/5.86  % Starting sh5l with 300s (1) cores
% 0.24/5.86  % sh5l with pid 3607702 completed with status 0
% 0.24/5.86  % Result found by sh5l
% 0.24/5.86  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/5.86  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.86  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/5.86  % Starting new_bool_3 with 300s (1) cores
% 0.24/5.86  % Starting new_bool_1 with 300s (1) cores
% 0.24/5.86  % Starting sh5l with 300s (1) cores
% 0.24/5.86  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.24/5.86  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.24/5.86  % Search class: FGHSM-FFMF32-DFFFFFNN
% 0.24/5.86  % partial match(1): FGHSM-FFMF32-SFFFFFNN
% 0.24/5.86  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/5.86  % Starting SubtermCWHack with 28s (1) cores
% 0.24/5.86  % SubtermCWHack with pid 3607705 completed with status 0
% 0.24/5.86  % Result found by SubtermCWHack
% 0.24/5.86  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/5.86  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.86  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/5.86  % Starting new_bool_3 with 300s (1) cores
% 0.24/5.86  % Starting new_bool_1 with 300s (1) cores
% 0.24/5.86  % Starting sh5l with 300s (1) cores
% 0.24/5.86  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.24/5.86  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.24/5.86  % Search class: FGHSM-FFMF32-DFFFFFNN
% 0.24/5.86  % partial match(1): FGHSM-FFMF32-SFFFFFNN
% 0.24/5.86  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/5.86  % Starting SubtermCWHack with 28s (1) cores
% 0.24/5.86  % Preprocessing time       : 0.001 s
% 0.24/5.86  
% 0.24/5.86  % Proof found!
% 0.24/5.86  % SZS status Theorem
% 0.24/5.86  % SZS output start CNFRefutation
% See solution above
% 0.24/5.86  % Parsed axioms                        : 31
% 0.24/5.86  % Removed by relevancy pruning/SinE    : 20
% 0.24/5.86  % Initial clauses                      : 16
% 0.24/5.86  % Removed in clause preprocessing      : 0
% 0.24/5.86  % Initial clauses in saturation        : 16
% 0.24/5.86  % Processed clauses                    : 905
% 0.24/5.86  % ...of these trivial                  : 0
% 0.24/5.86  % ...subsumed                          : 811
% 0.24/5.86  % ...remaining for further processing  : 94
% 0.24/5.86  % Other redundant clauses eliminated   : 0
% 0.24/5.86  % Clauses deleted for lack of memory   : 0
% 0.24/5.86  % Backward-subsumed                    : 3
% 0.24/5.86  % Backward-rewritten                   : 1
% 0.24/5.86  % Generated clauses                    : 16101
% 0.24/5.86  % ...of the previous two non-redundant : 14510
% 0.24/5.86  % ...aggressively subsumed             : 0
% 0.24/5.86  % Contextual simplify-reflections      : 1
% 0.24/5.86  % Paramodulations                      : 15847
% 0.24/5.86  % Factorizations                       : 238
% 0.24/5.86  % NegExts                              : 0
% 0.24/5.86  % Equation resolutions                 : 16
% 0.24/5.86  % Disequality decompositions           : 0
% 0.24/5.86  % Total rewrite steps                  : 1448
% 0.24/5.86  % ...of those cached                   : 1326
% 0.24/5.86  % Propositional unsat checks           : 0
% 0.24/5.86  %    Propositional check models        : 0
% 0.24/5.86  %    Propositional check unsatisfiable : 0
% 0.24/5.86  %    Propositional clauses             : 0
% 0.24/5.86  %    Propositional clauses after purity: 0
% 0.24/5.86  %    Propositional unsat core size     : 0
% 0.24/5.86  %    Propositional preprocessing time  : 0.000
% 0.24/5.86  %    Propositional encoding time       : 0.000
% 0.24/5.86  %    Propositional solver time         : 0.000
% 0.24/5.86  %    Success case prop preproc time    : 0.000
% 0.24/5.86  %    Success case prop encoding time   : 0.000
% 0.24/5.86  %    Success case prop solver time     : 0.000
% 0.24/5.86  % Current number of processed clauses  : 90
% 0.24/5.86  %    Positive orientable unit clauses  : 8
% 0.24/5.86  %    Positive unorientable unit clauses: 2
% 0.24/5.86  %    Negative unit clauses             : 3
% 0.24/5.86  %    Non-unit-clauses                  : 77
% 0.24/5.86  % Current number of unprocessed clauses: 13611
% 0.24/5.86  % ...number of literals in the above   : 70046
% 0.24/5.86  % Current number of archived formulas  : 0
% 0.24/5.86  % Current number of archived clauses   : 4
% 0.24/5.86  % Clause-clause subsumption calls (NU) : 2384
% 0.24/5.86  % Rec. Clause-clause subsumption calls : 1774
% 0.24/5.86  % Non-unit clause-clause subsumptions  : 709
% 0.24/5.86  % Unit Clause-clause subsumption calls : 45
% 0.24/5.86  % Rewrite failures with RHS unbound    : 107
% 0.24/5.86  % BW rewrite match attempts            : 64
% 0.24/5.86  % BW rewrite match successes           : 8
% 0.24/5.86  % Condensation attempts                : 0
% 0.24/5.86  % Condensation successes               : 0
% 0.24/5.86  % Termbank termtop insertions          : 589132
% 0.24/5.86  % Search garbage collected termcells   : 429
% 0.24/5.86  
% 0.24/5.86  % -------------------------------------------------
% 0.24/5.86  % User time                : 0.278 s
% 0.24/5.86  % System time              : 0.016 s
% 0.24/5.86  % Total time               : 0.294 s
% 0.24/5.86  % Maximum resident set size: 3696 pages
% 0.24/5.86  
% 0.24/5.86  % -------------------------------------------------
% 0.24/5.86  % User time                : 0.282 s
% 0.24/5.86  % System time              : 0.023 s
% 0.24/5.86  % Total time               : 0.305 s
% 0.24/5.86  % Maximum resident set size: 4608 pages
% 0.24/5.86  % E exiting
%------------------------------------------------------------------------------