↑ 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  : SYO090^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/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 : Wed Sep 30 08:43:49 AM UTC 2026

% Result   : Theorem 0.24s 0.28s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   13 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :  167 (   0 equ;   0 cnn)
%            Maximal formula atoms :   62 (  12 avg)
%            Number of connectives :  279 ( 125   ~;  96   |;  55   &;   0   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   8 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   4 usr;   5 con; 0-0 aty)
%            Number of variables   :    0 (   0   ^;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_23,type,
    t: $o ).

thf(decl_24,type,
    s: $o ).

thf(decl_25,type,
    q: $o ).

thf(decl_26,type,
    p: $o ).

thf(cDMG8,conjecture,
    ( ( ~ ( ~ ( ( ~ ( ( ~ ( p
                          & q )
                      | ~ ( s
                          & t ) )
                    & q )
                | ~ ( s
                    & t ) )
              & q )
          | ~ ( s
              & t ) )
      | ~ q
      | ~ s
      | ~ t )
   => ( ~ ( ( ~ ( ( ~ ( ( ~ ( p
                            & q )
                        | ~ ( s
                            & t ) )
                      & q )
                  | ~ ( s
                      & t ) )
                & q )
            | ~ ( s
                & t ) )
          & q )
      | ~ ( s
          & t ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.KOF9C95EWG/E---3.1_1264748.p',cDMG8) ).

thf(c_0_1,negated_conjecture,
    ~ ( ( ~ ( ~ ( ( ~ ( ( ~ ( p
                            & q )
                        | ~ ( s
                            & t ) )
                      & q )
                  | ~ ( s
                      & t ) )
                & q )
            | ~ ( s
                & t ) )
        | ~ q
        | ~ s
        | ~ t )
     => ( ~ ( ( ~ ( ( ~ ( ( ~ ( p
                              & q )
                          | ~ ( s
                              & t ) )
                        & q )
                    | ~ ( s
                        & t ) )
                  & q )
              | ~ ( s
                  & t ) )
            & q )
        | ~ ( s
            & t ) ) ),
    inference(assume_negation,[status(cth)],[cDMG8]) ).

thf(c_0_2,negated_conjecture,
    ~ ( ( ~ ( ~ ( ( ~ ( ( ~ ( p
                            & q )
                        | ~ ( s
                            & t ) )
                      & q )
                  | ~ ( s
                      & t ) )
                & q )
            | ~ ( s
                & t ) )
        | ~ q
        | ~ s
        | ~ t )
     => ( ~ ( ( ~ ( ( ~ ( ( ~ ( p
                              & q )
                          | ~ ( s
                              & t ) )
                        & q )
                    | ~ ( s
                        & t ) )
                  & q )
              | ~ ( s
                  & t ) )
            & q )
        | ~ ( s
            & t ) ) ),
    inference(fof_simplification,[status(thm)],[c_0_1]) ).

thf(c_0_3,negated_conjecture,
    ( ( p
      | ~ q
      | ~ s
      | ~ t
      | ~ q
      | ~ s
      | ~ t )
    & ( q
      | ~ q
      | ~ s
      | ~ t
      | ~ q
      | ~ s
      | ~ t )
    & ( s
      | ~ q
      | ~ s
      | ~ t
      | ~ q
      | ~ s
      | ~ t )
    & ( t
      | ~ q
      | ~ s
      | ~ t
      | ~ q
      | ~ s
      | ~ t )
    & ( q
      | ~ q
      | ~ s
      | ~ t )
    & ( s
      | ~ q
      | ~ s
      | ~ t )
    & ( t
      | ~ q
      | ~ s
      | ~ t )
    & ( ~ p
      | ~ q
      | ~ s
      | ~ t
      | ~ q
      | ~ s
      | ~ t )
    & ( q
      | ~ q
      | ~ s
      | ~ t )
    & ( s
      | ~ q
      | ~ s
      | ~ t )
    & ( t
      | ~ q
      | ~ s
      | ~ t )
    & q
    & s
    & t ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

thf(c_0_4,negated_conjecture,
    ( p
    | ~ q
    | ~ s
    | ~ t
    | ~ q
    | ~ s
    | ~ t ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_5,negated_conjecture,
    ( ~ p
    | ~ q
    | ~ s
    | ~ t
    | ~ q
    | ~ s
    | ~ t ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_6,negated_conjecture,
    ( p
    | ~ t
    | ~ s
    | ~ q ),
    inference(cn,[status(thm)],[c_0_4]) ).

thf(c_0_7,negated_conjecture,
    t,
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_8,negated_conjecture,
    s,
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_9,negated_conjecture,
    q,
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_10,negated_conjecture,
    ( ~ t
    | ~ s
    | ~ q
    | ~ p ),
    inference(cn,[status(thm)],[c_0_5]) ).

thf(c_0_11,negated_conjecture,
    p,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9])]) ).

thf(c_0_12,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_7]),c_0_8]),c_0_9]),c_0_11])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO090^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.21  % Computer : n020.cluster.edu
% 0.11/0.21  % Model    : x86_64 x86_64
% 0.11/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.21  % Memory   : 8046.5625MB
% 0.11/0.21  % OS       : Linux 6.8.0-71-generic
% 0.11/0.21  % CPULimit : 300
% 0.11/0.21  % WCLimit  : 300
% 0.11/0.21  % DateTime : Tue Sep 29 16:34:19 UTC 2026
% 0.11/0.21  % CPUTime  : 
% 0.11/0.21  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.26  Running higher-order theorem proving
% 0.11/0.27  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.KOF9C95EWG/E---3.1_1264748.p
% 0.24/0.28  % Version: 3.5.1-ho
% 0.24/0.28  % Preprocessing class: HSMSSLSSSSSNFFN.
% 0.24/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.28  % Starting new_ho_10 with 1500s (5) cores
% 0.24/0.28  % Starting sh5l with 300s (1) cores
% 0.24/0.28  % Starting new_bool_1 with 300s (1) cores
% 0.24/0.28  % Starting new_bool_2 with 300s (1) cores
% 0.24/0.28  % new_ho_10 with pid 1264783 completed with status 0
% 0.24/0.28  % Result found by new_ho_10
% 0.24/0.28  % Preprocessing class: HSMSSLSSSSSNFFN.
% 0.24/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.28  % Starting new_ho_10 with 1500s (5) cores
% 0.24/0.28  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.28  % No SInE strategy applied
% 0.24/0.28  % Search class: HHHNF-FFSS00-SFFFFFNN
% 0.24/0.28  % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.28  % Starting SubtermCWHack with 151s (1) cores
% 0.24/0.28  % Starting new_ho_10 with 901s (1) cores
% 0.24/0.28  % Starting sh5l with 151s (1) cores
% 0.24/0.28  % Starting new_bool_1 with 151s (1) cores
% 0.24/0.28  % Starting new_bool_2 with 146s (1) cores
% 0.24/0.28  % SubtermCWHack with pid 1264787 completed with status 0
% 0.24/0.28  % Result found by SubtermCWHack
% 0.24/0.28  % Preprocessing class: HSMSSLSSSSSNFFN.
% 0.24/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.28  % Starting new_ho_10 with 1500s (5) cores
% 0.24/0.28  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.28  % No SInE strategy applied
% 0.24/0.28  % Search class: HHHNF-FFSS00-SFFFFFNN
% 0.24/0.28  % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.28  % Starting SubtermCWHack with 151s (1) cores
% 0.24/0.28  % Preprocessing time       : 0.001 s
% 0.24/0.28  
% 0.24/0.28  % Proof found!
% 0.24/0.28  % SZS status Theorem
% 0.24/0.28  % SZS output start CNFRefutation
% See solution above
% 0.24/0.28  % Parsed axioms                        : 5
% 0.24/0.28  % Removed by relevancy pruning/SinE    : 0
% 0.24/0.28  % Initial clauses                      : 18
% 0.24/0.28  % Removed in clause preprocessing      : 13
% 0.24/0.28  % Initial clauses in saturation        : 5
% 0.24/0.28  % Processed clauses                    : 5
% 0.24/0.28  % ...of these trivial                  : 0
% 0.24/0.28  % ...subsumed                          : 0
% 0.24/0.28  % ...remaining for further processing  : 4
% 0.24/0.28  % Other redundant clauses eliminated   : 0
% 0.24/0.28  % Clauses deleted for lack of memory   : 0
% 0.24/0.28  % Backward-subsumed                    : 0
% 0.24/0.28  % Backward-rewritten                   : 0
% 0.24/0.28  % Generated clauses                    : 0
% 0.24/0.28  % ...of the previous two non-redundant : 0
% 0.24/0.28  % ...aggressively subsumed             : 0
% 0.24/0.28  % Contextual simplify-reflections      : 0
% 0.24/0.28  % Paramodulations                      : 0
% 0.24/0.28  % Factorizations                       : 0
% 0.24/0.28  % NegExts                              : 0
% 0.24/0.28  % Equation resolutions                 : 0
% 0.24/0.28  % Disequality decompositions           : 0
% 0.24/0.28  % Total rewrite steps                  : 7
% 0.24/0.28  % ...of those cached                   : 3
% 0.24/0.28  % Propositional unsat checks           : 0
% 0.24/0.28  %    Propositional check models        : 0
% 0.24/0.28  %    Propositional check unsatisfiable : 0
% 0.24/0.28  %    Propositional clauses             : 0
% 0.24/0.28  %    Propositional clauses after purity: 0
% 0.24/0.28  %    Propositional unsat core size     : 0
% 0.24/0.28  %    Propositional preprocessing time  : 0.000
% 0.24/0.28  %    Propositional encoding time       : 0.000
% 0.24/0.28  %    Propositional solver time         : 0.000
% 0.24/0.28  %    Success case prop preproc time    : 0.000
% 0.24/0.28  %    Success case prop encoding time   : 0.000
% 0.24/0.28  %    Success case prop solver time     : 0.000
% 0.24/0.28  % Current number of processed clauses  : 4
% 0.24/0.28  %    Positive orientable unit clauses  : 4
% 0.24/0.28  %    Positive unorientable unit clauses: 0
% 0.24/0.28  %    Negative unit clauses             : 0
% 0.24/0.28  %    Non-unit-clauses                  : 0
% 0.24/0.28  % Current number of unprocessed clauses: 0
% 0.24/0.28  % ...number of literals in the above   : 0
% 0.24/0.28  % Current number of archived formulas  : 0
% 0.24/0.28  % Current number of archived clauses   : 0
% 0.24/0.28  % Clause-clause subsumption calls (NU) : 0
% 0.24/0.28  % Rec. Clause-clause subsumption calls : 0
% 0.24/0.28  % Non-unit clause-clause subsumptions  : 0
% 0.24/0.28  % Unit Clause-clause subsumption calls : 0
% 0.24/0.28  % Rewrite failures with RHS unbound    : 0
% 0.24/0.28  % BW rewrite match attempts            : 0
% 0.24/0.28  % BW rewrite match successes           : 0
% 0.24/0.28  % Condensation attempts                : 0
% 0.24/0.28  % Condensation successes               : 0
% 0.24/0.28  % Termbank termtop insertions          : 1098
% 0.24/0.28  % Search garbage collected termcells   : 153
% 0.24/0.28  
% 0.24/0.28  % -------------------------------------------------
% 0.24/0.28  % User time                : 0.004 s
% 0.24/0.28  % System time              : 0.001 s
% 0.24/0.28  % Total time               : 0.005 s
% 0.24/0.28  % Maximum resident set size: 3880 pages
% 0.24/0.28  
% 0.24/0.28  % -------------------------------------------------
% 0.24/0.28  % User time                : 0.008 s
% 0.24/0.28  % System time              : 0.007 s
% 0.24/0.28  % Total time               : 0.016 s
% 0.24/0.28  % Maximum resident set size: 4864 pages
% 0.24/0.28  % E exiting
%------------------------------------------------------------------------------