↑ Up

E---3.5.1.THM-CRf.s

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

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

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

thf(decl_23,type,
    j: a > a ).

thf(decl_24,type,
    g: ( a > a ) > a > a ).

thf(decl_25,type,
    h: a > a ).

thf(decl_26,type,
    f: ( a > a ) > a > a ).

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

thf(decl_28,type,
    esk2_0: a ).

thf(cEDEC_pme,conjecture,
    ( ( ! [X1: a > a,X2: a,X3: a > $o] :
          ( ( X3 @ ( f @ X1 @ X2 ) )
         => ( X3 @ ( g @ X1 @ X2 ) ) )
      & ! [X4: a,X3: a > $o] :
          ( ( X3 @ ( h @ X4 ) )
         => ( X3 @ ( j @ X4 ) ) ) )
   => ! [X5: ( a > a ) > $o] :
        ( ( X5 @ ( f @ h ) )
       => ( X5 @ ( g @ j ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.kKtNymugtZ/E---3.1_1297022.p',cEDEC_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ( ( ! [X1: a > a,X2: a,X3: a > $o] :
            ( ( X3 @ ( f @ X1 @ X2 ) )
           => ( X3 @ ( g @ X1 @ X2 ) ) )
        & ! [X4: a,X3: a > $o] :
            ( ( X3 @ ( h @ X4 ) )
           => ( X3 @ ( j @ X4 ) ) ) )
     => ! [X5: ( a > a ) > $o] :
          ( ( X5 @ ( f @ h ) )
         => ( X5 @ ( g @ j ) ) ) ),
    inference(assume_negation,[status(cth)],[cEDEC_pme]) ).

thf(c_0_2,negated_conjecture,
    ! [X12: a > a,X13: a,X14: a > $o,X15: a,X16: a > $o] :
      ( ( ~ ( X14 @ ( f @ X12 @ X13 ) )
        | ( X14 @ ( g @ X12 @ X13 ) ) )
      & ( ~ ( X16 @ ( h @ X15 ) )
        | ( X16 @ ( j @ X15 ) ) )
      & ( epred1_0 @ ( f @ h ) )
      & ~ ( epred1_0 @ ( g @ j ) ) ),
    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,
    ~ ( epred1_0 @ ( g @ j ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

thf(c_0_5,negated_conjecture,
    ! [X3: a > $o,X2: a] :
      ( ( X3 @ ( j @ X2 ) )
      | ~ ( X3 @ ( h @ X2 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_6,plain,
    ( ( g @ j )
   != ( f @ h ) ),
    inference(ext_sup,[status(thm)],[c_0_3,c_0_4]) ).

thf(c_0_7,negated_conjecture,
    ! [X2: a] :
      ( ( h @ X2 )
      = ( j @ X2 ) ),
    inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_5]) ).

thf(c_0_8,plain,
    ( ( g @ j @ esk2_0 )
   != ( f @ h @ esk2_0 ) ),
    inference(neg_ext,[status(thm)],[c_0_6]) ).

thf(c_0_9,negated_conjecture,
    h = j,
    inference(pos_ext,[status(thm)],[c_0_7]) ).

thf(c_0_10,negated_conjecture,
    ! [X1: a > a,X3: a > $o,X2: a] :
      ( ( X3 @ ( g @ X1 @ X2 ) )
      | ~ ( X3 @ ( f @ X1 @ X2 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_11,plain,
    ( ( g @ j @ esk2_0 )
   != ( f @ j @ esk2_0 ) ),
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

thf(c_0_12,negated_conjecture,
    ! [X1: a > a,X2: a] :
      ( ( g @ X1 @ X2 )
      = ( f @ X1 @ X2 ) ),
    inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_10]) ).

thf(c_0_13,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO364^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.20  % Computer : n020.cluster.edu
% 0.08/0.20  % Model    : x86_64 x86_64
% 0.08/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20  % Memory   : 8046.5625MB
% 0.08/0.20  % OS       : Linux 6.8.0-71-generic
% 0.08/0.20  % CPULimit : 300
% 0.08/0.20  % WCLimit  : 300
% 0.08/0.20  % DateTime : Tue Sep 29 16:50:04 UTC 2026
% 0.08/0.21  % CPUTime  : 
% 0.08/0.21  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.25  Running higher-order theorem proving
% 0.08/0.26  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.kKtNymugtZ/E---3.1_1297022.p
% 0.30/0.29  % Version: 3.5.1-ho
% 0.30/0.29  % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.30/0.29  % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.29  % Starting sh2lt with 1200s (4) cores
% 0.30/0.29  % Starting new_ho_10_unif with 300s (1) cores
% 0.30/0.29  % Starting full_lambda_6 with 300s (1) cores
% 0.30/0.29  % Starting post_as_ho1 with 300s (1) cores
% 0.30/0.29  % Starting ehoh_best3_rw with 300s (1) cores
% 0.30/0.29  % full_lambda_6 with pid 1297037 completed with status 0
% 0.30/0.29  % Result found by full_lambda_6
% 0.30/0.29  % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.30/0.29  % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.29  % Starting sh2lt with 1200s (4) cores
% 0.30/0.29  % Starting new_ho_10_unif with 300s (1) cores
% 0.30/0.29  % Starting full_lambda_6 with 300s (1) cores
% 0.30/0.29  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountTerms,hypos,4,,4,20000,1.0,true))
% 0.30/0.29  % SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.30/0.29  % Search class: HHUNF-FFSF21-SHHFFMBN
% 0.30/0.29  % partial match(1): HHUNF-FFSF11-SHHFFMBN
% 0.30/0.29  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.29  % Starting SubtermCWHack with 28s (1) cores
% 0.30/0.29  % SubtermCWHack with pid 1297040 completed with status 10
% 0.30/0.29  % Starting full_lambda_6 with 31s (1) cores
% 0.30/0.29  % full_lambda_6 with pid 1297050 completed with status 10
% 0.30/0.29  % Starting sh5l with 34s (1) cores
% 0.30/0.29  % sh5l with pid 1297052 completed with status 0
% 0.30/0.29  % Result found by sh5l
% 0.30/0.29  % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.30/0.29  % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.29  % Starting sh2lt with 1200s (4) cores
% 0.30/0.29  % Starting new_ho_10_unif with 300s (1) cores
% 0.30/0.29  % Starting full_lambda_6 with 300s (1) cores
% 0.30/0.29  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountTerms,hypos,4,,4,20000,1.0,true))
% 0.30/0.29  % SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.30/0.29  % Search class: HHUNF-FFSF21-SHHFFMBN
% 0.30/0.29  % partial match(1): HHUNF-FFSF11-SHHFFMBN
% 0.30/0.29  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.29  % Starting SubtermCWHack with 28s (1) cores
% 0.30/0.29  % SubtermCWHack with pid 1297040 completed with status 10
% 0.30/0.29  % Starting full_lambda_6 with 31s (1) cores
% 0.30/0.29  % full_lambda_6 with pid 1297050 completed with status 10
% 0.30/0.29  % Starting sh5l with 34s (1) cores
% 0.30/0.29  % Preprocessing time       : 0.001 s
% 0.30/0.29  % Presaturation interreduction done
% 0.30/0.29  
% 0.30/0.29  % Proof found!
% 0.30/0.29  % SZS status Theorem
% 0.30/0.29  % SZS output start CNFRefutation
% See solution above
% 0.30/0.29  % Parsed axioms                        : 6
% 0.30/0.29  % Removed by relevancy pruning/SinE    : 5
% 0.30/0.29  % Initial clauses                      : 4
% 0.30/0.29  % Removed in clause preprocessing      : 0
% 0.30/0.29  % Initial clauses in saturation        : 4
% 0.30/0.29  % Processed clauses                    : 18
% 0.30/0.29  % ...of these trivial                  : 1
% 0.30/0.29  % ...subsumed                          : 0
% 0.30/0.29  % ...remaining for further processing  : 17
% 0.30/0.29  % Other redundant clauses eliminated   : 0
% 0.30/0.29  % Clauses deleted for lack of memory   : 0
% 0.30/0.29  % Backward-subsumed                    : 0
% 0.30/0.29  % Backward-rewritten                   : 6
% 0.30/0.29  % Generated clauses                    : 12
% 0.30/0.29  % ...of the previous two non-redundant : 11
% 0.30/0.29  % ...aggressively subsumed             : 0
% 0.30/0.29  % Contextual simplify-reflections      : 0
% 0.30/0.29  % Paramodulations                      : 1
% 0.30/0.29  % Factorizations                       : 0
% 0.30/0.29  % NegExts                              : 2
% 0.30/0.29  % Equation resolutions                 : 0
% 0.30/0.29  % Disequality decompositions           : 0
% 0.30/0.29  % Total rewrite steps                  : 7
% 0.30/0.29  % ...of those cached                   : 1
% 0.30/0.29  % Propositional unsat checks           : 0
% 0.30/0.29  %    Propositional check models        : 0
% 0.30/0.29  %    Propositional check unsatisfiable : 0
% 0.30/0.29  %    Propositional clauses             : 0
% 0.30/0.29  %    Propositional clauses after purity: 0
% 0.30/0.29  %    Propositional unsat core size     : 0
% 0.30/0.29  %    Propositional preprocessing time  : 0.000
% 0.30/0.29  %    Propositional encoding time       : 0.000
% 0.30/0.29  %    Propositional solver time         : 0.000
% 0.30/0.29  %    Success case prop preproc time    : 0.000
% 0.30/0.29  %    Success case prop encoding time   : 0.000
% 0.30/0.29  %    Success case prop solver time     : 0.000
% 0.30/0.29  % Current number of processed clauses  : 7
% 0.30/0.29  %    Positive orientable unit clauses  : 5
% 0.30/0.29  %    Positive unorientable unit clauses: 0
% 0.30/0.29  %    Negative unit clauses             : 2
% 0.30/0.29  %    Non-unit-clauses                  : 0
% 0.30/0.29  % Current number of unprocessed clauses: 1
% 0.30/0.29  % ...number of literals in the above   : 1
% 0.30/0.29  % Current number of archived formulas  : 0
% 0.30/0.29  % Current number of archived clauses   : 10
% 0.30/0.29  % Clause-clause subsumption calls (NU) : 0
% 0.30/0.29  % Rec. Clause-clause subsumption calls : 0
% 0.30/0.29  % Non-unit clause-clause subsumptions  : 0
% 0.30/0.29  % Unit Clause-clause subsumption calls : 4
% 0.30/0.29  % Rewrite failures with RHS unbound    : 0
% 0.30/0.29  % BW rewrite match attempts            : 7
% 0.30/0.29  % BW rewrite match successes           : 5
% 0.30/0.29  % Condensation attempts                : 18
% 0.30/0.29  % Condensation successes               : 0
% 0.30/0.29  % Termbank termtop insertions          : 604
% 0.30/0.29  % Search garbage collected termcells   : 152
% 0.30/0.29  
% 0.30/0.29  % -------------------------------------------------
% 0.30/0.29  % User time                : 0.004 s
% 0.30/0.29  % System time              : 0.002 s
% 0.30/0.29  % Total time               : 0.006 s
% 0.30/0.29  % Maximum resident set size: 3840 pages
% 0.30/0.29  
% 0.30/0.29  % -------------------------------------------------
% 0.30/0.29  % User time                : 0.009 s
% 0.30/0.29  % System time              : 0.004 s
% 0.30/0.29  % Total time               : 0.013 s
% 0.30/0.29  % Maximum resident set size: 4864 pages
% 0.30/0.29  % E exiting
%------------------------------------------------------------------------------