↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n018.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 01:27:04 PM UTC 2026

% Result   : Theorem 0.25s 0.54s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   44 (  10 unt;   0 def)
%            Number of atoms       :  213 (   0 equ)
%            Maximal formula atoms :   60 (   4 avg)
%            Number of connectives :  289 ( 120   ~; 142   |;  26   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   11 (  10 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-3 aty)
%            Number of variables   :   76 (   1 sgn   9   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(open_world_closure,axiom,
    ! [X3,X4,X5] :
      ( ( ~ ? [X1,X2] :
              ( activates(X2,X1)
              & act(X1,X4)
              & aee(X1,X3)
              & proh(X1) )
        & target(X5)
        & action(X4)
        & agent(X3) )
     => ? [X6] :
          ( cnt(X6,X4,X5)
          & bearer(X6,X3)
          & permission(X6) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',open_world_closure) ).

fof(target_theater,axiom,
    target(theater_ds),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',target_theater) ).

fof(no_proh_modify,axiom,
    ~ ? [X1,X2] :
        ( activates(X2,X1)
        & act(X1,modify_act)
        & aee(X1,portal)
        & proh(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_proh_modify) ).

fof(action_modify,axiom,
    action(modify_act),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',action_modify) ).

fof(agent_portal,axiom,
    agent(portal),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',agent_portal) ).

fof(conjecture,conjecture,
    ? [X6] :
      ( cnt(X6,modify_act,theater_ds)
      & bearer(X6,portal)
      & permission(X6) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture) ).

fof(c_0_6,plain,
    ! [X8,X9,X10] :
      ( ( ~ target(X10)
        | ~ action(X9)
        | ~ agent(X8)
        | activates(esk2_3(X8,X9,X10),esk1_3(X8,X9,X10))
        | cnt(esk3_3(X8,X9,X10),X9,X10) )
      & ( ~ target(X10)
        | ~ action(X9)
        | ~ agent(X8)
        | activates(esk2_3(X8,X9,X10),esk1_3(X8,X9,X10))
        | bearer(esk3_3(X8,X9,X10),X8) )
      & ( ~ target(X10)
        | ~ action(X9)
        | ~ agent(X8)
        | activates(esk2_3(X8,X9,X10),esk1_3(X8,X9,X10))
        | permission(esk3_3(X8,X9,X10)) )
      & ( ~ target(X10)
        | ~ action(X9)
        | ~ agent(X8)
        | act(esk1_3(X8,X9,X10),X9)
        | cnt(esk3_3(X8,X9,X10),X9,X10) )
      & ( ~ target(X10)
        | ~ action(X9)
        | ~ agent(X8)
        | act(esk1_3(X8,X9,X10),X9)
        | bearer(esk3_3(X8,X9,X10),X8) )
      & ( ~ target(X10)
        | ~ action(X9)
        | ~ agent(X8)
        | act(esk1_3(X8,X9,X10),X9)
        | permission(esk3_3(X8,X9,X10)) )
      & ( ~ target(X10)
        | ~ action(X9)
        | ~ agent(X8)
        | aee(esk1_3(X8,X9,X10),X8)
        | cnt(esk3_3(X8,X9,X10),X9,X10) )
      & ( ~ target(X10)
        | ~ action(X9)
        | ~ agent(X8)
        | aee(esk1_3(X8,X9,X10),X8)
        | bearer(esk3_3(X8,X9,X10),X8) )
      & ( ~ target(X10)
        | ~ action(X9)
        | ~ agent(X8)
        | aee(esk1_3(X8,X9,X10),X8)
        | permission(esk3_3(X8,X9,X10)) )
      & ( ~ target(X10)
        | ~ action(X9)
        | ~ agent(X8)
        | proh(esk1_3(X8,X9,X10))
        | cnt(esk3_3(X8,X9,X10),X9,X10) )
      & ( ~ target(X10)
        | ~ action(X9)
        | ~ agent(X8)
        | proh(esk1_3(X8,X9,X10))
        | bearer(esk3_3(X8,X9,X10),X8) )
      & ( ~ target(X10)
        | ~ action(X9)
        | ~ agent(X8)
        | proh(esk1_3(X8,X9,X10))
        | permission(esk3_3(X8,X9,X10)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[open_world_closure])])])])])]) ).

cnf(c_0_7,plain,
    ( ~ target(X3)
    | ~ action(X2)
    | ~ agent(X1)
    | act(esk1_3(X1,X2,X3),X2)
    | bearer(esk3_3(X1,X2,X3),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_8,plain,
    target(theater_ds),
    inference(split_conjunct,[status(thm)],[target_theater]) ).

fof(c_0_9,plain,
    ! [X14,X15] :
      ( ~ activates(X15,X14)
      | ~ act(X14,modify_act)
      | ~ aee(X14,portal)
      | ~ proh(X14) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[no_proh_modify])])]) ).

cnf(c_0_10,plain,
    ( ~ agent(X1)
    | ~ action(X2)
    | act(esk1_3(X1,X2,theater_ds),X2)
    | bearer(esk3_3(X1,X2,theater_ds),X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,plain,
    action(modify_act),
    inference(split_conjunct,[status(thm)],[action_modify]) ).

cnf(c_0_12,plain,
    ( ~ activates(X2,X1)
    | ~ act(X1,modify_act)
    | ~ aee(X1,portal)
    | ~ proh(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,plain,
    ( ~ target(X3)
    | ~ action(X2)
    | ~ agent(X1)
    | activates(esk2_3(X1,X2,X3),esk1_3(X1,X2,X3))
    | cnt(esk3_3(X1,X2,X3),X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_14,plain,
    ( ~ target(X3)
    | ~ action(X2)
    | ~ agent(X1)
    | proh(esk1_3(X1,X2,X3))
    | cnt(esk3_3(X1,X2,X3),X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_15,plain,
    ( ~ target(X3)
    | ~ action(X2)
    | ~ agent(X1)
    | act(esk1_3(X1,X2,X3),X2)
    | cnt(esk3_3(X1,X2,X3),X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_16,plain,
    ( ~ target(X3)
    | ~ action(X2)
    | ~ agent(X1)
    | aee(esk1_3(X1,X2,X3),X1)
    | cnt(esk3_3(X1,X2,X3),X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_17,plain,
    ( ~ target(X3)
    | ~ action(X2)
    | ~ agent(X1)
    | activates(esk2_3(X1,X2,X3),esk1_3(X1,X2,X3))
    | bearer(esk3_3(X1,X2,X3),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_18,plain,
    ( ~ target(X3)
    | ~ action(X2)
    | ~ agent(X1)
    | proh(esk1_3(X1,X2,X3))
    | bearer(esk3_3(X1,X2,X3),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_19,plain,
    ( ~ agent(X1)
    | act(esk1_3(X1,modify_act,theater_ds),modify_act)
    | bearer(esk3_3(X1,modify_act,theater_ds),X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_20,plain,
    agent(portal),
    inference(split_conjunct,[status(thm)],[agent_portal]) ).

fof(c_0_21,negated_conjecture,
    ~ ? [X6] :
        ( cnt(X6,modify_act,theater_ds)
        & bearer(X6,portal)
        & permission(X6) ),
    inference(assume_negation,[status(cth)],[conjecture]) ).

cnf(c_0_22,plain,
    ( ~ agent(X1)
    | ~ action(X2)
    | ~ target(X3)
    | ~ aee(esk1_3(X1,X2,X3),portal)
    | ~ act(esk1_3(X1,X2,X3),modify_act)
    | cnt(esk3_3(X1,X2,X3),X2,X3) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).

cnf(c_0_23,plain,
    ( ~ agent(X1)
    | ~ action(X2)
    | act(esk1_3(X1,X2,theater_ds),X2)
    | cnt(esk3_3(X1,X2,theater_ds),X2,theater_ds) ),
    inference(spm,[status(thm)],[c_0_15,c_0_8]) ).

cnf(c_0_24,plain,
    ( ~ agent(X1)
    | ~ action(X2)
    | aee(esk1_3(X1,X2,theater_ds),X1)
    | cnt(esk3_3(X1,X2,theater_ds),X2,theater_ds) ),
    inference(spm,[status(thm)],[c_0_16,c_0_8]) ).

cnf(c_0_25,plain,
    ( ~ agent(X1)
    | ~ action(X2)
    | ~ target(X3)
    | ~ aee(esk1_3(X1,X2,X3),portal)
    | ~ act(esk1_3(X1,X2,X3),modify_act)
    | bearer(esk3_3(X1,X2,X3),X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_17]),c_0_18]) ).

cnf(c_0_26,plain,
    ( act(esk1_3(portal,modify_act,theater_ds),modify_act)
    | bearer(esk3_3(portal,modify_act,theater_ds),portal) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_27,plain,
    ( ~ target(X3)
    | ~ action(X2)
    | ~ agent(X1)
    | activates(esk2_3(X1,X2,X3),esk1_3(X1,X2,X3))
    | permission(esk3_3(X1,X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_28,plain,
    ( ~ target(X3)
    | ~ action(X2)
    | ~ agent(X1)
    | proh(esk1_3(X1,X2,X3))
    | permission(esk3_3(X1,X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_29,negated_conjecture,
    ! [X7] :
      ( ~ cnt(X7,modify_act,theater_ds)
      | ~ bearer(X7,portal)
      | ~ permission(X7) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).

cnf(c_0_30,plain,
    ( ~ agent(X1)
    | ~ aee(esk1_3(X1,modify_act,theater_ds),portal)
    | cnt(esk3_3(X1,modify_act,theater_ds),modify_act,theater_ds) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_8]),c_0_11])]) ).

cnf(c_0_31,plain,
    ( ~ agent(X1)
    | aee(esk1_3(X1,modify_act,theater_ds),X1)
    | cnt(esk3_3(X1,modify_act,theater_ds),modify_act,theater_ds) ),
    inference(spm,[status(thm)],[c_0_24,c_0_11]) ).

cnf(c_0_32,plain,
    ( ~ aee(esk1_3(portal,modify_act,theater_ds),portal)
    | bearer(esk3_3(portal,modify_act,theater_ds),portal) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_8]),c_0_11]),c_0_20])]) ).

cnf(c_0_33,plain,
    ( ~ target(X3)
    | ~ action(X2)
    | ~ agent(X1)
    | aee(esk1_3(X1,X2,X3),X1)
    | bearer(esk3_3(X1,X2,X3),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_34,plain,
    ( ~ agent(X1)
    | ~ action(X2)
    | ~ target(X3)
    | ~ aee(esk1_3(X1,X2,X3),portal)
    | ~ act(esk1_3(X1,X2,X3),modify_act)
    | permission(esk3_3(X1,X2,X3)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_27]),c_0_28]) ).

cnf(c_0_35,plain,
    ( ~ target(X3)
    | ~ action(X2)
    | ~ agent(X1)
    | act(esk1_3(X1,X2,X3),X2)
    | permission(esk3_3(X1,X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_36,negated_conjecture,
    ( ~ cnt(X1,modify_act,theater_ds)
    | ~ bearer(X1,portal)
    | ~ permission(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_37,plain,
    cnt(esk3_3(portal,modify_act,theater_ds),modify_act,theater_ds),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_20])]) ).

cnf(c_0_38,plain,
    bearer(esk3_3(portal,modify_act,theater_ds),portal),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_8]),c_0_11]),c_0_20])]) ).

cnf(c_0_39,plain,
    ( ~ agent(X1)
    | ~ target(X2)
    | ~ aee(esk1_3(X1,modify_act,X2),portal)
    | permission(esk3_3(X1,modify_act,X2)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_11])]) ).

cnf(c_0_40,plain,
    ( ~ target(X3)
    | ~ action(X2)
    | ~ agent(X1)
    | aee(esk1_3(X1,X2,X3),X1)
    | permission(esk3_3(X1,X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_41,negated_conjecture,
    ~ permission(esk3_3(portal,modify_act,theater_ds)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).

cnf(c_0_42,plain,
    ( ~ target(X1)
    | permission(esk3_3(portal,modify_act,X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_20]),c_0_11])]) ).

cnf(c_0_43,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_8])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : MGT111+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.06  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.44  % Computer : n018.cluster.edu
% 0.19/0.44  % Model    : x86_64 x86_64
% 0.19/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44  % Memory   : 8046.5625MB
% 0.19/0.44  % OS       : Linux 6.8.0-71-generic
% 0.19/0.44  % CPULimit : 300
% 0.19/0.44  % WCLimit  : 300
% 0.19/0.44  % DateTime : Mon Sep 21 01:28:58 UTC 2026
% 0.19/0.45  % CPUTime  : 
% 0.19/0.45  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.50  Running first-order theorem proving
% 0.19/0.50  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.25/0.54  % Version: 3.5.1
% 0.25/0.54  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.54  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.54  % Starting new_bool_3 with 300s (1) cores
% 0.25/0.54  % Starting new_bool_1 with 300s (1) cores
% 0.25/0.54  % Starting sh5l with 300s (1) cores
% 0.25/0.54  % new_bool_3 with pid 677666 completed with status 0
% 0.25/0.54  % Result found by new_bool_3
% 0.25/0.54  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.54  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.54  % Starting new_bool_3 with 300s (1) cores
% 0.25/0.54  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.54  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.54  % Search class: FGHNF-FFMS33-SFFFFFNN
% 0.25/0.54  % partial match(1): FGHNF-FFMM33-SFFFFFNN
% 0.25/0.54  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.54  % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.54  % SubtermCWHack with pid 677669 completed with status 0
% 0.25/0.54  % Result found by SubtermCWHack
% 0.25/0.54  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.54  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.54  % Starting new_bool_3 with 300s (1) cores
% 0.25/0.54  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.54  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.54  % Search class: FGHNF-FFMS33-SFFFFFNN
% 0.25/0.54  % partial match(1): FGHNF-FFMM33-SFFFFFNN
% 0.25/0.54  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.54  % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.54  % Preprocessing time       : 0.001 s
% 0.25/0.54  
% 0.25/0.54  % Proof found!
% 0.25/0.54  % SZS status Theorem
% 0.25/0.54  % SZS output start CNFRefutation
% See solution above
% 0.25/0.54  % Parsed axioms                        : 7
% 0.25/0.54  % Removed by relevancy pruning/SinE    : 1
% 0.25/0.54  % Initial clauses                      : 17
% 0.25/0.54  % Removed in clause preprocessing      : 0
% 0.25/0.54  % Initial clauses in saturation        : 17
% 0.25/0.54  % Processed clauses                    : 45
% 0.25/0.54  % ...of these trivial                  : 0
% 0.25/0.54  % ...subsumed                          : 5
% 0.25/0.54  % ...remaining for further processing  : 40
% 0.25/0.54  % Other redundant clauses eliminated   : 0
% 0.25/0.54  % Clauses deleted for lack of memory   : 0
% 0.25/0.54  % Backward-subsumed                    : 3
% 0.25/0.54  % Backward-rewritten                   : 3
% 0.25/0.54  % Generated clauses                    : 39
% 0.25/0.54  % ...of the previous two non-redundant : 32
% 0.25/0.54  % ...aggressively subsumed             : 0
% 0.25/0.54  % Contextual simplify-reflections      : 3
% 0.25/0.54  % Paramodulations                      : 39
% 0.25/0.54  % Factorizations                       : 0
% 0.25/0.54  % NegExts                              : 0
% 0.25/0.54  % Equation resolutions                 : 0
% 0.25/0.54  % Disequality decompositions           : 0
% 0.25/0.54  % Total rewrite steps                  : 61
% 0.25/0.54  % ...of those cached                   : 56
% 0.25/0.54  % Propositional unsat checks           : 0
% 0.25/0.54  %    Propositional check models        : 0
% 0.25/0.54  %    Propositional check unsatisfiable : 0
% 0.25/0.54  %    Propositional clauses             : 0
% 0.25/0.54  %    Propositional clauses after purity: 0
% 0.25/0.54  %    Propositional unsat core size     : 0
% 0.25/0.54  %    Propositional preprocessing time  : 0.000
% 0.25/0.54  %    Propositional encoding time       : 0.000
% 0.25/0.54  %    Propositional solver time         : 0.000
% 0.25/0.54  %    Success case prop preproc time    : 0.000
% 0.25/0.54  %    Success case prop encoding time   : 0.000
% 0.25/0.54  %    Success case prop solver time     : 0.000
% 0.25/0.54  % Current number of processed clauses  : 34
% 0.25/0.54  %    Positive orientable unit clauses  : 5
% 0.25/0.54  %    Positive unorientable unit clauses: 0
% 0.25/0.54  %    Negative unit clauses             : 1
% 0.25/0.54  %    Non-unit-clauses                  : 28
% 0.25/0.54  % Current number of unprocessed clauses: 1
% 0.25/0.54  % ...number of literals in the above   : 2
% 0.25/0.54  % Current number of archived formulas  : 0
% 0.25/0.54  % Current number of archived clauses   : 6
% 0.25/0.54  % Clause-clause subsumption calls (NU) : 117
% 0.25/0.54  % Rec. Clause-clause subsumption calls : 21
% 0.25/0.54  % Non-unit clause-clause subsumptions  : 10
% 0.25/0.54  % Unit Clause-clause subsumption calls : 39
% 0.25/0.54  % Rewrite failures with RHS unbound    : 0
% 0.25/0.54  % BW rewrite match attempts            : 2
% 0.25/0.54  % BW rewrite match successes           : 2
% 0.25/0.54  % Condensation attempts                : 0
% 0.25/0.54  % Condensation successes               : 0
% 0.25/0.54  % Termbank termtop insertions          : 2173
% 0.25/0.54  % Search garbage collected termcells   : 165
% 0.25/0.54  
% 0.25/0.54  % -------------------------------------------------
% 0.25/0.54  % User time                : 0.006 s
% 0.25/0.54  % System time              : 0.002 s
% 0.25/0.54  % Total time               : 0.008 s
% 0.25/0.54  % Maximum resident set size: 3636 pages
% 0.25/0.54  
% 0.25/0.54  % -------------------------------------------------
% 0.25/0.54  % User time                : 0.008 s
% 0.25/0.54  % System time              : 0.006 s
% 0.25/0.54  % Total time               : 0.013 s
% 0.25/0.54  % Maximum resident set size: 4608 pages
% 0.25/0.54  % E exiting
%------------------------------------------------------------------------------