↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n006.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:48 AM UTC 2026

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

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

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

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

thf(cE1FUNC,conjecture,
    ( ! [X1: $i] :
        ( ( f @ X1 )
        = ( g @ X1 ) )
   => ( ( p @ f )
     => ( p @ g ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.rqx6ESsg7y/E---3.1_1002079.p',cE1FUNC) ).

thf(c_0_1,negated_conjecture,
    ~ ( ! [X1: $i] :
          ( ( f @ X1 )
          = ( g @ X1 ) )
     => ( ( p @ f )
       => ( p @ g ) ) ),
    inference(assume_negation,[status(cth)],[cE1FUNC]) ).

thf(c_0_2,negated_conjecture,
    ! [X3: $i] :
      ( ( ( f @ X3 )
        = ( g @ X3 ) )
      & ( p @ f )
      & ~ ( p @ g ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).

thf(c_0_3,negated_conjecture,
    ! [X1: $i] :
      ( ( f @ X1 )
      = ( g @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    p @ f,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    f = g,
    inference(pos_ext,[status(thm)],[c_0_3]) ).

thf(c_0_6,negated_conjecture,
    ~ ( p @ g ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYO350^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.18  % Computer : n006.cluster.edu
% 0.11/0.18  % Model    : x86_64 x86_64
% 0.11/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.18  % Memory   : 8046.5625MB
% 0.11/0.18  % OS       : Linux 6.8.0-71-generic
% 0.11/0.18  % CPULimit : 300
% 0.11/0.18  % WCLimit  : 300
% 0.11/0.18  % DateTime : Tue Sep 29 16:47:54 UTC 2026
% 0.11/0.18  % CPUTime  : 
% 0.11/0.18  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.22  Running higher-order theorem proving
% 0.11/0.23  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.rqx6ESsg7y/E---3.1_1002079.p
% 0.11/0.25  % Version: 3.5.1-ho
% 0.11/0.25  % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.11/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.25  % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.11/0.25  % Starting post_as_ho10 with 300s (1) cores
% 0.11/0.25  % Starting new_bool_9 with 300s (1) cores
% 0.11/0.25  % Starting sh5l with 300s (1) cores
% 0.11/0.25  % ehoh_best_nonlift_nonlambdatoforall with pid 1002092 completed with status 0
% 0.11/0.25  % Result found by ehoh_best_nonlift_nonlambdatoforall
% 0.11/0.25  % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.11/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.25  % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.11/0.25  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.25  % No SInE strategy applied
% 0.11/0.25  % Search class: HUUSF-FFSF11-SSSFFFNN
% 0.11/0.25  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.25  % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.25  % Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.11/0.25  % Starting sh5l with 136s (1) cores
% 0.11/0.25  % Starting new_bool_1 with 136s (1) cores
% 0.11/0.25  % Starting new_bool_2 with 136s (1) cores
% 0.11/0.25  % ehoh_best_nonlift_nonlambdatoforall with pid 1002098 completed with status 0
% 0.11/0.25  % Result found by ehoh_best_nonlift_nonlambdatoforall
% 0.11/0.25  % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.11/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.25  % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.11/0.25  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.25  % No SInE strategy applied
% 0.11/0.25  % Search class: HUUSF-FFSF11-SSSFFFNN
% 0.11/0.25  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.25  % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.25  % Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.11/0.25  % Preprocessing time       : 0.001 s
% 0.11/0.25  % Presaturation interreduction done
% 0.11/0.25  
% 0.11/0.25  % Proof found!
% 0.11/0.25  % SZS status Theorem
% 0.11/0.25  % SZS output start CNFRefutation
% See solution above
% 0.11/0.25  % Parsed axioms                        : 4
% 0.11/0.25  % Removed by relevancy pruning/SinE    : 0
% 0.11/0.25  % Initial clauses                      : 6
% 0.11/0.25  % Removed in clause preprocessing      : 3
% 0.11/0.25  % Initial clauses in saturation        : 3
% 0.11/0.25  % Processed clauses                    : 7
% 0.11/0.25  % ...of these trivial                  : 0
% 0.11/0.25  % ...subsumed                          : 0
% 0.11/0.25  % ...remaining for further processing  : 7
% 0.11/0.25  % Other redundant clauses eliminated   : 0
% 0.11/0.25  % Clauses deleted for lack of memory   : 0
% 0.11/0.25  % Backward-subsumed                    : 0
% 0.11/0.25  % Backward-rewritten                   : 1
% 0.11/0.25  % Generated clauses                    : 3
% 0.11/0.25  % ...of the previous two non-redundant : 2
% 0.11/0.25  % ...aggressively subsumed             : 0
% 0.11/0.25  % Contextual simplify-reflections      : 0
% 0.11/0.25  % Paramodulations                      : 0
% 0.11/0.25  % Factorizations                       : 0
% 0.11/0.25  % NegExts                              : 0
% 0.11/0.25  % Equation resolutions                 : 0
% 0.11/0.25  % Disequality decompositions           : 0
% 0.11/0.25  % Total rewrite steps                  : 1
% 0.11/0.25  % ...of those cached                   : 0
% 0.11/0.25  % Propositional unsat checks           : 0
% 0.11/0.25  %    Propositional check models        : 0
% 0.11/0.25  %    Propositional check unsatisfiable : 0
% 0.11/0.25  %    Propositional clauses             : 0
% 0.11/0.25  %    Propositional clauses after purity: 0
% 0.11/0.25  %    Propositional unsat core size     : 0
% 0.11/0.25  %    Propositional preprocessing time  : 0.000
% 0.11/0.25  %    Propositional encoding time       : 0.000
% 0.11/0.25  %    Propositional solver time         : 0.000
% 0.11/0.25  %    Success case prop preproc time    : 0.000
% 0.11/0.25  %    Success case prop encoding time   : 0.000
% 0.11/0.25  %    Success case prop solver time     : 0.000
% 0.11/0.25  % Current number of processed clauses  : 3
% 0.11/0.25  %    Positive orientable unit clauses  : 2
% 0.11/0.25  %    Positive unorientable unit clauses: 0
% 0.11/0.25  %    Negative unit clauses             : 1
% 0.11/0.25  %    Non-unit-clauses                  : 0
% 0.11/0.25  % Current number of unprocessed clauses: 1
% 0.11/0.25  % ...number of literals in the above   : 1
% 0.11/0.25  % Current number of archived formulas  : 0
% 0.11/0.25  % Current number of archived clauses   : 4
% 0.11/0.25  % Clause-clause subsumption calls (NU) : 0
% 0.11/0.25  % Rec. Clause-clause subsumption calls : 0
% 0.11/0.25  % Non-unit clause-clause subsumptions  : 0
% 0.11/0.25  % Unit Clause-clause subsumption calls : 0
% 0.11/0.25  % Rewrite failures with RHS unbound    : 0
% 0.11/0.25  % BW rewrite match attempts            : 3
% 0.11/0.25  % BW rewrite match successes           : 1
% 0.11/0.25  % Condensation attempts                : 0
% 0.11/0.25  % Condensation successes               : 0
% 0.11/0.25  % Termbank termtop insertions          : 178
% 0.11/0.25  % Search garbage collected termcells   : 33
% 0.11/0.25  
% 0.11/0.25  % -------------------------------------------------
% 0.11/0.25  % User time                : 0.002 s
% 0.11/0.25  % System time              : 0.002 s
% 0.11/0.25  % Total time               : 0.004 s
% 0.11/0.25  % Maximum resident set size: 3624 pages
% 0.11/0.25  
% 0.11/0.25  % -------------------------------------------------
% 0.11/0.25  % User time                : 0.006 s
% 0.11/0.25  % System time              : 0.011 s
% 0.11/0.25  % Total time               : 0.017 s
% 0.11/0.25  % Maximum resident set size: 4864 pages
% 0.11/0.25  % E exiting
%------------------------------------------------------------------------------