↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEU833^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 : 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 : Wed Sep 30 08:25:48 AM UTC 2026

% Result   : Theorem 0.16s 0.32s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    6 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :   18 (   2 equ;   0 cnn)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :   30 (  14   ~;   5   |;   5   &;   5   @)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    3 (   3   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   2 usr;   3 con; 0-2 aty)
%            Number of variables   :    8 (   4   ^;   4   !;   0   ?;   8   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    a: $tType ).

thf(decl_23,type,
    epred1_0: a > $o ).

thf(decl_24,type,
    esk1_0: a ).

thf(cGAZING_THM24_pme,conjecture,
    ! [X1: a > $o] :
      ( ( ^ [X2: a] :
            ( ( X1 @ X2 )
            & ~ $true ) )
      = ( ^ [X2: a] : ~ $true ) ),
    file('/export/starexec/sandbox2/tmp/tmp.HSkcU8Oa9D/E---3.1_172822.p',cGAZING_THM24_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ! [X1: a > $o] :
        ( ( ^ [X2: a] :
              ( ( X1 @ X2 )
              & ~ $true ) )
        = ( ^ [X2: a] : ~ $true ) ),
    inference(assume_negation,[status(cth)],[cGAZING_THM24_pme]) ).

thf(c_0_2,negated_conjecture,
    ~ ! [X1: a > $o,X4: a] :
        ( ( ( X1 @ X4 )
          & ~ $true )
      <=> ~ $true ),
    inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])]) ).

thf(c_0_3,negated_conjecture,
    ( ( ~ ( epred1_0 @ esk1_0 )
      | $true
      | $true )
    & ( ( epred1_0 @ esk1_0 )
      | ~ $true )
    & ( ~ $true
      | ~ $true ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])]) ).

thf(c_0_4,negated_conjecture,
    ( ~ $true
    | ~ $true ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_5,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[c_0_4]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU833^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.08/0.24  % Computer : n011.cluster.edu
% 0.08/0.24  % Model    : x86_64 x86_64
% 0.08/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.24  % Memory   : 8046.5625MB
% 0.08/0.24  % OS       : Linux 6.8.0-71-generic
% 0.08/0.24  % CPULimit : 300
% 0.08/0.24  % WCLimit  : 300
% 0.08/0.24  % DateTime : Tue Sep 29 14:39:40 UTC 2026
% 0.08/0.25  % CPUTime  : 
% 0.08/0.25  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.29  Running higher-order theorem proving
% 0.16/0.30  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.HSkcU8Oa9D/E---3.1_172822.p
% 0.16/0.32  % Version: 3.5.1-ho
% 0.16/0.32  % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.16/0.32  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.32  % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.16/0.32  % Starting post_as_ho10 with 300s (1) cores
% 0.16/0.32  % Starting new_bool_9 with 300s (1) cores
% 0.16/0.32  % Starting sh5l with 300s (1) cores
% 0.16/0.32  % post_as_ho10 with pid 172851 completed with status 0
% 0.16/0.32  % Result found by post_as_ho10
% 0.16/0.32  % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.16/0.32  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.32  % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.16/0.32  % Starting post_as_ho10 with 300s (1) cores
% 0.16/0.32  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.32  % No SInE strategy applied
% 0.16/0.32  % Search class: HUHNF-FFSF00-SSSFFFNN
% 0.16/0.32  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.32  % Starting SubtermCWHack with 28s (1) cores
% 0.16/0.32  % SubtermCWHack with pid 172859 completed with status 0
% 0.16/0.32  % Result found by SubtermCWHack
% 0.16/0.32  % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.16/0.32  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.32  % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.16/0.32  % Starting post_as_ho10 with 300s (1) cores
% 0.16/0.32  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.32  % No SInE strategy applied
% 0.16/0.32  % Search class: HUHNF-FFSF00-SSSFFFNN
% 0.16/0.32  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.32  % Starting SubtermCWHack with 28s (1) cores
% 0.16/0.32  % Preprocessing time       : 0.001 s
% 0.16/0.32  
% 0.16/0.32  % Proof found!
% 0.16/0.32  % SZS status Theorem
% 0.16/0.32  % SZS output start CNFRefutation
% See solution above
% 0.16/0.32  % Parsed axioms                        : 2
% 0.16/0.32  % Removed by relevancy pruning/SinE    : 0
% 0.16/0.32  % Initial clauses                      : 4
% 0.16/0.32  % Removed in clause preprocessing      : 2
% 0.16/0.32  % Initial clauses in saturation        : 2
% 0.16/0.32  % Processed clauses                    : 1
% 0.16/0.32  % ...of these trivial                  : 0
% 0.16/0.32  % ...subsumed                          : 0
% 0.16/0.32  % ...remaining for further processing  : 0
% 0.16/0.32  % Other redundant clauses eliminated   : 0
% 0.16/0.32  % Clauses deleted for lack of memory   : 0
% 0.16/0.32  % Backward-subsumed                    : 0
% 0.16/0.32  % Backward-rewritten                   : 0
% 0.16/0.32  % Generated clauses                    : 0
% 0.16/0.32  % ...of the previous two non-redundant : 0
% 0.16/0.32  % ...aggressively subsumed             : 0
% 0.16/0.32  % Contextual simplify-reflections      : 0
% 0.16/0.32  % Paramodulations                      : 0
% 0.16/0.32  % Factorizations                       : 0
% 0.16/0.32  % NegExts                              : 0
% 0.16/0.32  % Equation resolutions                 : 0
% 0.16/0.32  % Disequality decompositions           : 0
% 0.16/0.32  % Total rewrite steps                  : 0
% 0.16/0.32  % ...of those cached                   : 0
% 0.16/0.32  % Propositional unsat checks           : 0
% 0.16/0.32  %    Propositional check models        : 0
% 0.16/0.32  %    Propositional check unsatisfiable : 0
% 0.16/0.32  %    Propositional clauses             : 0
% 0.16/0.32  %    Propositional clauses after purity: 0
% 0.16/0.32  %    Propositional unsat core size     : 0
% 0.16/0.32  %    Propositional preprocessing time  : 0.000
% 0.16/0.32  %    Propositional encoding time       : 0.000
% 0.16/0.32  %    Propositional solver time         : 0.000
% 0.16/0.32  %    Success case prop preproc time    : 0.000
% 0.16/0.32  %    Success case prop encoding time   : 0.000
% 0.16/0.32  %    Success case prop solver time     : 0.000
% 0.16/0.32  % Current number of processed clauses  : 0
% 0.16/0.32  %    Positive orientable unit clauses  : 0
% 0.16/0.32  %    Positive unorientable unit clauses: 0
% 0.16/0.32  %    Negative unit clauses             : 0
% 0.16/0.32  %    Non-unit-clauses                  : 0
% 0.16/0.32  % Current number of unprocessed clauses: 1
% 0.16/0.32  % ...number of literals in the above   : 1
% 0.16/0.32  % Current number of archived formulas  : 0
% 0.16/0.32  % Current number of archived clauses   : 0
% 0.16/0.32  % Clause-clause subsumption calls (NU) : 0
% 0.16/0.32  % Rec. Clause-clause subsumption calls : 0
% 0.16/0.32  % Non-unit clause-clause subsumptions  : 0
% 0.16/0.32  % Unit Clause-clause subsumption calls : 0
% 0.16/0.32  % Rewrite failures with RHS unbound    : 0
% 0.16/0.32  % BW rewrite match attempts            : 0
% 0.16/0.32  % BW rewrite match successes           : 0
% 0.16/0.32  % Condensation attempts                : 0
% 0.16/0.32  % Condensation successes               : 0
% 0.16/0.32  % Termbank termtop insertions          : 232
% 0.16/0.32  % Search garbage collected termcells   : 82
% 0.16/0.32  
% 0.16/0.32  % -------------------------------------------------
% 0.16/0.32  % User time                : 0.002 s
% 0.16/0.32  % System time              : 0.002 s
% 0.16/0.32  % Total time               : 0.004 s
% 0.16/0.32  % Maximum resident set size: 3576 pages
% 0.16/0.32  
% 0.16/0.32  % -------------------------------------------------
% 0.16/0.32  % User time                : 0.003 s
% 0.16/0.32  % System time              : 0.007 s
% 0.16/0.32  % Total time               : 0.010 s
% 0.16/0.32  % Maximum resident set size: 4608 pages
% 0.16/0.32  % E exiting
%------------------------------------------------------------------------------