↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEU694^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n012.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:14 AM UTC 2026

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

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

thf(decl_24,type,
    func: $i > $i > $i > $o ).

thf(decl_25,type,
    ap: $i > $i > $i > $i > $i ).

thf(decl_26,type,
    esk1_0: $i ).

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

thf(decl_28,type,
    esk3_0: $i ).

thf(decl_29,type,
    esk4_0: $i ).

thf(ap2apEq2,conjecture,
    ! [X1: $i,X2: $i,X3: $i] :
      ( ( func @ X1 @ X2 @ X3 )
     => ! [X4: $i] :
          ( ( in @ X4 @ X1 )
         => ( ( ap @ X1 @ X2 @ X3 @ X4 )
            = ( ap @ X1 @ X2 @ X3 @ X4 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.lhr4EEXwFb/E---3.1_163456.p',ap2apEq2) ).

thf(c_0_1,negated_conjecture,
    ~ ! [X1: $i,X2: $i,X3: $i] :
        ( ( func @ X1 @ X2 @ X3 )
       => ! [X4: $i] :
            ( ( in @ X4 @ X1 )
           => ( ( ap @ X1 @ X2 @ X3 @ X4 )
              = ( ap @ X1 @ X2 @ X3 @ X4 ) ) ) ),
    inference(assume_negation,[status(cth)],[ap2apEq2]) ).

thf(c_0_2,negated_conjecture,
    ( ( func @ esk1_0 @ esk2_0 @ esk3_0 )
    & ( in @ esk4_0 @ esk1_0 )
    & ( ( ap @ esk1_0 @ esk2_0 @ esk3_0 @ esk4_0 )
     != ( ap @ esk1_0 @ esk2_0 @ esk3_0 @ esk4_0 ) ) ),
    inference(fof_nnf,[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,
    ( ( ap @ esk1_0 @ esk2_0 @ esk3_0 @ esk4_0 )
   != ( ap @ esk1_0 @ esk2_0 @ esk3_0 @ esk4_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

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