↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYO351^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 : n019.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.20s 0.26s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   10 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   43 (   4 equ;   0 cnn)
%            Maximal formula atoms :   20 (   4 avg)
%            Number of connectives :   80 (  26   ~;  21   |;   5   &;  23   @)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    5 (   5   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   3 usr;   4 con; 0-2 aty)
%            Number of variables   :   18 (   6   ^;  12   !;   0   ?;  18   :)

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

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

thf(decl_24,type,
    esk1_0: a ).

thf(decl_25,type,
    esk2_0: a ).

thf(cE6EXT_pme,conjecture,
    ( ( ^ [X1: a > $o] :
        ! [X2: a] :
          ( ( X1 @ X2 )
         => ~ $true ) )
    = ( ^ [X3: a > $o] :
          ( ( ^ [X2: a] : ~ $true )
          = X3 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.Vo2WgCyyix/E---3.1_1044296.p',cE6EXT_pme) ).

thf(c_0_1,negated_conjecture,
    ( ( ^ [X1: a > $o] :
        ! [X2: a] :
          ( ( X1 @ X2 )
         => ~ $true ) )
   != ( ^ [X3: a > $o] :
          ( ( ^ [X2: a] : ~ $true )
          = X3 ) ) ),
    inference(assume_negation,[status(cth)],[cE6EXT_pme]) ).

thf(c_0_2,negated_conjecture,
    ~ ! [X4: a > $o] :
        ( ! [X2: a] :
            ( ( X4 @ X2 )
           => ~ $true )
      <=> ! [X5: a] :
            ( ~ $true
          <=> ( X4 @ X5 ) ) ),
    inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])]) ).

thf(c_0_3,negated_conjecture,
    ! [X9: a,X10: a] :
      ( ( $true
        | ~ ( epred1_0 @ esk2_0 )
        | ( epred1_0 @ esk1_0 ) )
      & ( ~ $true
        | ( epred1_0 @ esk2_0 )
        | ( epred1_0 @ esk1_0 ) )
      & ( $true
        | ~ ( epred1_0 @ esk2_0 )
        | $true )
      & ( ~ $true
        | ( epred1_0 @ esk2_0 )
        | $true )
      & ( $true
        | ( epred1_0 @ X10 )
        | ~ ( epred1_0 @ X9 )
        | ~ $true )
      & ( ~ ( epred1_0 @ X10 )
        | ~ $true
        | ~ ( epred1_0 @ X9 )
        | ~ $true ) ),
    inference(distribute,[status(thm)],[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_2])])])])])]) ).

thf(c_0_4,negated_conjecture,
    ! [X2: a,X5: a] :
      ( ~ ( epred1_0 @ X2 )
      | ~ $true
      | ~ ( epred1_0 @ X5 )
      | ~ $true ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_5,negated_conjecture,
    ( ( epred1_0 @ esk2_0 )
    | ( epred1_0 @ esk1_0 )
    | ~ $true ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_6,negated_conjecture,
    ! [X5: a,X2: a] :
      ( ~ ( epred1_0 @ X5 )
      | ~ ( epred1_0 @ X2 ) ),
    inference(cn,[status(thm)],[c_0_4]) ).

thf(c_0_7,negated_conjecture,
    ( ( epred1_0 @ esk1_0 )
    | ( epred1_0 @ esk2_0 ) ),
    inference(cn,[status(thm)],[c_0_5]) ).

thf(c_0_8,negated_conjecture,
    ! [X2: a] :
      ~ ( epred1_0 @ X2 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_6]) ).

thf(c_0_9,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_7,c_0_8]),c_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO351^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.19  % Computer : n019.cluster.edu
% 0.07/0.19  % Model    : x86_64 x86_64
% 0.07/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19  % Memory   : 8046.5625MB
% 0.07/0.19  % OS       : Linux 6.8.0-71-generic
% 0.07/0.19  % CPULimit : 300
% 0.07/0.19  % WCLimit  : 300
% 0.07/0.19  % DateTime : Tue Sep 29 16:48:17 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.19  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.24  Running higher-order theorem proving
% 0.07/0.25  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.Vo2WgCyyix/E---3.1_1044296.p
% 0.20/0.26  % Version: 3.5.1-ho
% 0.20/0.26  % Preprocessing class: HSSSSMSSSSSNHHN.
% 0.20/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.26  % Starting post_as_ho2 with 1500s (5) cores
% 0.20/0.26  % Starting new_ho_13 with 300s (1) cores
% 0.20/0.26  % Starting new_ho_8 with 300s (1) cores
% 0.20/0.26  % Starting new_ho_4 with 300s (1) cores
% 0.20/0.26  % new_ho_8 with pid 1044311 completed with status 0
% 0.20/0.26  % Result found by new_ho_8
% 0.20/0.26  % Preprocessing class: HSSSSMSSSSSNHHN.
% 0.20/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.26  % Starting post_as_ho2 with 1500s (5) cores
% 0.20/0.26  % Starting new_ho_13 with 300s (1) cores
% 0.20/0.26  % Starting new_ho_8 with 300s (1) cores
% 0.20/0.26  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountTerms,hypos,10,,2,20000,1.0,true))
% 0.20/0.26  % SinE strategy is GSinE(CountTerms,hypos,10,,2,20000,1.0,true)
% 0.20/0.26  % Search class: HGHNF-FFSF00-SHHFFFNN
% 0.20/0.26  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.26  % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.26  % SubtermCWHack with pid 1044316 completed with status 0
% 0.20/0.26  % Result found by SubtermCWHack
% 0.20/0.26  % Preprocessing class: HSSSSMSSSSSNHHN.
% 0.20/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.26  % Starting post_as_ho2 with 1500s (5) cores
% 0.20/0.26  % Starting new_ho_13 with 300s (1) cores
% 0.20/0.26  % Starting new_ho_8 with 300s (1) cores
% 0.20/0.26  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountTerms,hypos,10,,2,20000,1.0,true))
% 0.20/0.26  % SinE strategy is GSinE(CountTerms,hypos,10,,2,20000,1.0,true)
% 0.20/0.26  % Search class: HGHNF-FFSF00-SHHFFFNN
% 0.20/0.26  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.26  % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.26  % Preprocessing time       : 0.001 s
% 0.20/0.26  
% 0.20/0.26  % Proof found!
% 0.20/0.26  % SZS status Theorem
% 0.20/0.26  % SZS output start CNFRefutation
% See solution above
% 0.20/0.26  % Parsed axioms                        : 2
% 0.20/0.26  % Removed by relevancy pruning/SinE    : 1
% 0.20/0.26  % Initial clauses                      : 6
% 0.20/0.26  % Removed in clause preprocessing      : 4
% 0.20/0.26  % Initial clauses in saturation        : 2
% 0.20/0.26  % Processed clauses                    : 3
% 0.20/0.26  % ...of these trivial                  : 0
% 0.20/0.26  % ...subsumed                          : 0
% 0.20/0.26  % ...remaining for further processing  : 3
% 0.20/0.26  % Other redundant clauses eliminated   : 0
% 0.20/0.26  % Clauses deleted for lack of memory   : 0
% 0.20/0.26  % Backward-subsumed                    : 1
% 0.20/0.26  % Backward-rewritten                   : 0
% 0.20/0.26  % Generated clauses                    : 2
% 0.20/0.26  % ...of the previous two non-redundant : 1
% 0.20/0.26  % ...aggressively subsumed             : 0
% 0.20/0.26  % Contextual simplify-reflections      : 1
% 0.20/0.26  % Paramodulations                      : 1
% 0.20/0.26  % Factorizations                       : 0
% 0.20/0.26  % NegExts                              : 0
% 0.20/0.26  % Equation resolutions                 : 0
% 0.20/0.26  % Disequality decompositions           : 0
% 0.20/0.26  % Total rewrite steps                  : 0
% 0.20/0.26  % ...of those cached                   : 0
% 0.20/0.26  % Propositional unsat checks           : 0
% 0.20/0.26  %    Propositional check models        : 0
% 0.20/0.26  %    Propositional check unsatisfiable : 0
% 0.20/0.26  %    Propositional clauses             : 0
% 0.20/0.26  %    Propositional clauses after purity: 0
% 0.20/0.26  %    Propositional unsat core size     : 0
% 0.20/0.26  %    Propositional preprocessing time  : 0.000
% 0.20/0.26  %    Propositional encoding time       : 0.000
% 0.20/0.26  %    Propositional solver time         : 0.000
% 0.20/0.26  %    Success case prop preproc time    : 0.000
% 0.20/0.26  %    Success case prop encoding time   : 0.000
% 0.20/0.26  %    Success case prop solver time     : 0.000
% 0.20/0.26  % Current number of processed clauses  : 1
% 0.20/0.26  %    Positive orientable unit clauses  : 0
% 0.20/0.26  %    Positive unorientable unit clauses: 0
% 0.20/0.26  %    Negative unit clauses             : 1
% 0.20/0.26  %    Non-unit-clauses                  : 0
% 0.20/0.26  % Current number of unprocessed clauses: 0
% 0.20/0.26  % ...number of literals in the above   : 0
% 0.20/0.26  % Current number of archived formulas  : 0
% 0.20/0.26  % Current number of archived clauses   : 2
% 0.20/0.26  % Clause-clause subsumption calls (NU) : 1
% 0.20/0.26  % Rec. Clause-clause subsumption calls : 1
% 0.20/0.26  % Non-unit clause-clause subsumptions  : 1
% 0.20/0.26  % Unit Clause-clause subsumption calls : 1
% 0.20/0.26  % Rewrite failures with RHS unbound    : 0
% 0.20/0.26  % BW rewrite match attempts            : 0
% 0.20/0.26  % BW rewrite match successes           : 0
% 0.20/0.26  % Condensation attempts                : 0
% 0.20/0.26  % Condensation successes               : 0
% 0.20/0.26  % Termbank termtop insertions          : 516
% 0.20/0.26  % Search garbage collected termcells   : 180
% 0.20/0.26  
% 0.20/0.26  % -------------------------------------------------
% 0.20/0.26  % User time                : 0.003 s
% 0.20/0.26  % System time              : 0.000 s
% 0.20/0.26  % Total time               : 0.003 s
% 0.20/0.26  % Maximum resident set size: 3628 pages
% 0.20/0.26  
% 0.20/0.26  % -------------------------------------------------
% 0.20/0.26  % User time                : 0.005 s
% 0.20/0.26  % System time              : 0.003 s
% 0.20/0.26  % Total time               : 0.009 s
% 0.20/0.26  % Maximum resident set size: 4864 pages
% 0.20/0.26  % E exiting
%------------------------------------------------------------------------------