↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n008.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:08 AM UTC 2026

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

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

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

thf(conj,conjecture,
    ( ( p
      @ ^ [X1: $i] : ( f @ X1 ) )
   => ( p @ f ) ),
    file('/export/starexec/sandbox2/tmp/tmp.hLsvWa7D0L/E---3.1_3363443.p',conj) ).

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

thf(c_0_2,negated_conjecture,
    ~ $true,
    inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])])]) ).

thf(c_0_3,negated_conjecture,
    ~ $true,
    inference(fof_nnf,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ~ $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  : SYO009^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.17  % Computer : n008.cluster.edu
% 0.10/0.17  % Model    : x86_64 x86_64
% 0.10/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17  % Memory   : 8046.5625MB
% 0.10/0.17  % OS       : Linux 6.8.0-71-generic
% 0.10/0.17  % CPULimit : 300
% 0.10/0.17  % WCLimit  : 300
% 0.10/0.17  % DateTime : Tue Sep 29 16:21:54 UTC 2026
% 0.10/0.17  % CPUTime  : 
% 0.10/0.17  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.22  Running higher-order theorem proving
% 0.10/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.hLsvWa7D0L/E---3.1_3363443.p
% 0.10/0.24  % Version: 3.5.1-ho
% 0.10/0.24  % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.10/0.24  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.24  % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.10/0.24  % Starting post_as_ho10 with 300s (1) cores
% 0.10/0.24  % Starting new_bool_9 with 300s (1) cores
% 0.10/0.24  % Starting sh5l with 300s (1) cores
% 0.10/0.24  % sh5l with pid 3363459 completed with status 0
% 0.10/0.24  % Result found by sh5l
% 0.10/0.24  % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.10/0.24  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.24  % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.10/0.24  % Starting post_as_ho10 with 300s (1) cores
% 0.10/0.24  % Starting new_bool_9 with 300s (1) cores
% 0.10/0.24  % Starting sh5l with 300s (1) cores
% 0.10/0.24  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.24  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.24  % Search class: HUHPF-FFSF00-SSSFFFNN
% 0.10/0.24  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.24  % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.24  % SubtermCWHack with pid 3363461 completed with status 0
% 0.10/0.24  % Result found by SubtermCWHack
% 0.10/0.24  % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.10/0.24  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.24  % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.10/0.24  % Starting post_as_ho10 with 300s (1) cores
% 0.10/0.24  % Starting new_bool_9 with 300s (1) cores
% 0.10/0.24  % Starting sh5l with 300s (1) cores
% 0.10/0.24  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.24  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.24  % Search class: HUHPF-FFSF00-SSSFFFNN
% 0.10/0.24  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.24  % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.24  % Preprocessing time       : 0.001 s
% 0.10/0.24  
% 0.10/0.24  % Proof found!
% 0.10/0.24  % SZS status Theorem
% 0.10/0.24  % SZS output start CNFRefutation
% See solution above
% 0.10/0.24  % Parsed axioms                        : 3
% 0.10/0.24  % Removed by relevancy pruning/SinE    : 2
% 0.10/0.24  % Initial clauses                      : 1
% 0.10/0.24  % Removed in clause preprocessing      : 0
% 0.10/0.24  % Initial clauses in saturation        : 1
% 0.10/0.24  % Processed clauses                    : 1
% 0.10/0.24  % ...of these trivial                  : 0
% 0.10/0.24  % ...subsumed                          : 0
% 0.10/0.24  % ...remaining for further processing  : 0
% 0.10/0.24  % Other redundant clauses eliminated   : 0
% 0.10/0.24  % Clauses deleted for lack of memory   : 0
% 0.10/0.24  % Backward-subsumed                    : 0
% 0.10/0.24  % Backward-rewritten                   : 0
% 0.10/0.24  % Generated clauses                    : 0
% 0.10/0.24  % ...of the previous two non-redundant : 0
% 0.10/0.24  % ...aggressively subsumed             : 0
% 0.10/0.24  % Contextual simplify-reflections      : 0
% 0.10/0.24  % Paramodulations                      : 0
% 0.10/0.24  % Factorizations                       : 0
% 0.10/0.24  % NegExts                              : 0
% 0.10/0.24  % Equation resolutions                 : 0
% 0.10/0.24  % Disequality decompositions           : 0
% 0.10/0.24  % Total rewrite steps                  : 0
% 0.10/0.24  % ...of those cached                   : 0
% 0.10/0.24  % Propositional unsat checks           : 0
% 0.10/0.24  %    Propositional check models        : 0
% 0.10/0.24  %    Propositional check unsatisfiable : 0
% 0.10/0.24  %    Propositional clauses             : 0
% 0.10/0.24  %    Propositional clauses after purity: 0
% 0.10/0.24  %    Propositional unsat core size     : 0
% 0.10/0.24  %    Propositional preprocessing time  : 0.000
% 0.10/0.24  %    Propositional encoding time       : 0.000
% 0.10/0.24  %    Propositional solver time         : 0.000
% 0.10/0.24  %    Success case prop preproc time    : 0.000
% 0.10/0.24  %    Success case prop encoding time   : 0.000
% 0.10/0.24  %    Success case prop solver time     : 0.000
% 0.10/0.24  % Current number of processed clauses  : 0
% 0.10/0.24  %    Positive orientable unit clauses  : 0
% 0.10/0.24  %    Positive unorientable unit clauses: 0
% 0.10/0.24  %    Negative unit clauses             : 0
% 0.10/0.24  %    Non-unit-clauses                  : 0
% 0.10/0.24  % Current number of unprocessed clauses: 0
% 0.10/0.24  % ...number of literals in the above   : 0
% 0.10/0.24  % Current number of archived formulas  : 0
% 0.10/0.24  % Current number of archived clauses   : 0
% 0.10/0.24  % Clause-clause subsumption calls (NU) : 0
% 0.10/0.24  % Rec. Clause-clause subsumption calls : 0
% 0.10/0.24  % Non-unit clause-clause subsumptions  : 0
% 0.10/0.24  % Unit Clause-clause subsumption calls : 0
% 0.10/0.24  % Rewrite failures with RHS unbound    : 0
% 0.10/0.24  % BW rewrite match attempts            : 0
% 0.10/0.24  % BW rewrite match successes           : 0
% 0.10/0.24  % Condensation attempts                : 0
% 0.10/0.24  % Condensation successes               : 0
% 0.10/0.24  % Termbank termtop insertions          : 56
% 0.10/0.24  % Search garbage collected termcells   : 14
% 0.10/0.24  
% 0.10/0.24  % -------------------------------------------------
% 0.10/0.24  % User time                : 0.002 s
% 0.10/0.24  % System time              : 0.002 s
% 0.10/0.24  % Total time               : 0.003 s
% 0.10/0.24  % Maximum resident set size: 3572 pages
% 0.10/0.24  
% 0.10/0.24  % -------------------------------------------------
% 0.10/0.24  % User time                : 0.002 s
% 0.10/0.24  % System time              : 0.007 s
% 0.10/0.24  % Total time               : 0.009 s
% 0.10/0.24  % Maximum resident set size: 4608 pages
% 0.10/0.25  % E exiting
%------------------------------------------------------------------------------