↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYO145^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:42:27 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(decl_23,type,
    cP: $i > $i > $o ).

thf(decl_24,type,
    esk1_1: $i > $i ).

thf(decl_25,type,
    esk2_0: $i ).

thf(cEXPVAR_BUG,conjecture,
    ( ! [X1: $i] :
      ? [X2: $i] : ( cP @ X1 @ X2 )
   => ! [X1: $i] :
      ? [X2: $i,X3: $i] :
        ( ( cP @ X2 @ X3 )
        & ( cP @ X1 @ X2 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.4LeUqRxa8K/E---3.1_310656.p',cEXPVAR_BUG) ).

thf(c_0_1,negated_conjecture,
    ~ ( ! [X1: $i] :
        ? [X2: $i] : ( cP @ X1 @ X2 )
     => ! [X1: $i] :
        ? [X2: $i,X3: $i] :
          ( ( cP @ X2 @ X3 )
          & ( cP @ X1 @ X2 ) ) ),
    inference(assume_negation,[status(cth)],[cEXPVAR_BUG]) ).

thf(c_0_2,negated_conjecture,
    ! [X9: $i,X12: $i,X13: $i] :
      ( ( cP @ X9 @ ( esk1_1 @ X9 ) )
      & ( ~ ( cP @ X12 @ X13 )
        | ~ ( cP @ esk2_0 @ X12 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).

thf(c_0_3,negated_conjecture,
    ! [X2: $i,X1: $i] :
      ( ~ ( cP @ X1 @ X2 )
      | ~ ( cP @ esk2_0 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X1: $i] : ( cP @ X1 @ ( esk1_1 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    ! [X1: $i] :
      ~ ( cP @ ( esk1_1 @ esk2_0 ) @ X1 ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

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

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