↑ Up

E---3.5.1.THM-CRf.s

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

% Result   : Theorem 0.08s 0.26s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   13 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :   43 (   0 equ;   0 cnn)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :  252 (  24   ~;  14   |;  16   &; 198   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (  10 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   55 (   0   ^;  52   !;   3   ?;  55   :)

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

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

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

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

thf(cTHM147,conjecture,
    ~ ( ! [X1: $i,X2: $i] :
          ( ~ ( cT @ ( imp @ X1 @ X2 ) )
          | ~ ( cT @ X1 )
          | ( cT @ X2 ) )
      & ! [X1: $i,X2: $i] : ( cT @ ( imp @ X1 @ ( imp @ X2 @ X1 ) ) )
      & ! [X1: $i,X2: $i,X3: $i] : ( cT @ ( imp @ ( imp @ X1 @ ( imp @ X2 @ X3 ) ) @ ( imp @ ( imp @ X1 @ X2 ) @ ( imp @ X1 @ X3 ) ) ) )
      & ! [X1: $i,X2: $i] : ( cT @ ( imp @ ( imp @ ( nt @ X1 ) @ ( nt @ X2 ) ) @ ( imp @ X2 @ X1 ) ) )
      & ? [X4: $i] :
          ~ ( cT @ ( imp @ X4 @ X4 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.nwyKjCVCkv/E---3.1_23160.p',cTHM147) ).

thf(c_0_1,negated_conjecture,
    ~ ~ ( ! [X1: $i,X2: $i] :
            ( ~ ( cT @ ( imp @ X1 @ X2 ) )
            | ~ ( cT @ X1 )
            | ( cT @ X2 ) )
        & ! [X1: $i,X2: $i] : ( cT @ ( imp @ X1 @ ( imp @ X2 @ X1 ) ) )
        & ! [X1: $i,X2: $i,X3: $i] : ( cT @ ( imp @ ( imp @ X1 @ ( imp @ X2 @ X3 ) ) @ ( imp @ ( imp @ X1 @ X2 ) @ ( imp @ X1 @ X3 ) ) ) )
        & ! [X1: $i,X2: $i] : ( cT @ ( imp @ ( imp @ ( nt @ X1 ) @ ( nt @ X2 ) ) @ ( imp @ X2 @ X1 ) ) )
        & ? [X4: $i] :
            ~ ( cT @ ( imp @ X4 @ X4 ) ) ),
    inference(assume_negation,[status(cth)],[cTHM147]) ).

thf(c_0_2,negated_conjecture,
    ~ ~ ( ! [X1: $i,X2: $i] :
            ( ~ ( cT @ ( imp @ X1 @ X2 ) )
            | ~ ( cT @ X1 )
            | ( cT @ X2 ) )
        & ! [X1: $i,X2: $i] : ( cT @ ( imp @ X1 @ ( imp @ X2 @ X1 ) ) )
        & ! [X1: $i,X2: $i,X3: $i] : ( cT @ ( imp @ ( imp @ X1 @ ( imp @ X2 @ X3 ) ) @ ( imp @ ( imp @ X1 @ X2 ) @ ( imp @ X1 @ X3 ) ) ) )
        & ! [X1: $i,X2: $i] : ( cT @ ( imp @ ( imp @ ( nt @ X1 ) @ ( nt @ X2 ) ) @ ( imp @ X2 @ X1 ) ) )
        & ? [X4: $i] :
            ~ ( cT @ ( imp @ X4 @ X4 ) ) ),
    inference(fof_simplification,[status(thm)],[c_0_1]) ).

thf(c_0_3,negated_conjecture,
    ! [X15: $i,X16: $i,X17: $i,X18: $i,X19: $i,X20: $i,X21: $i,X22: $i,X23: $i] :
      ( ( ~ ( cT @ ( imp @ X15 @ X16 ) )
        | ~ ( cT @ X15 )
        | ( cT @ X16 ) )
      & ( cT @ ( imp @ X17 @ ( imp @ X18 @ X17 ) ) )
      & ( cT @ ( imp @ ( imp @ X19 @ ( imp @ X20 @ X21 ) ) @ ( imp @ ( imp @ X19 @ X20 ) @ ( imp @ X19 @ X21 ) ) ) )
      & ( cT @ ( imp @ ( imp @ ( nt @ X22 ) @ ( nt @ X23 ) ) @ ( imp @ X23 @ X22 ) ) )
      & ~ ( cT @ ( imp @ esk1_0 @ esk1_0 ) ) ),
    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: $i,X1: $i] :
      ( ( cT @ X2 )
      | ~ ( cT @ ( imp @ X1 @ X2 ) )
      | ~ ( cT @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_5,negated_conjecture,
    ! [X1: $i,X2: $i,X3: $i] : ( cT @ ( imp @ ( imp @ X1 @ ( imp @ X2 @ X3 ) ) @ ( imp @ ( imp @ X1 @ X2 ) @ ( imp @ X1 @ X3 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_6,negated_conjecture,
    ! [X1: $i,X2: $i,X3: $i] :
      ( ( cT @ ( imp @ ( imp @ X1 @ X2 ) @ ( imp @ X1 @ X3 ) ) )
      | ~ ( cT @ ( imp @ X1 @ ( imp @ X2 @ X3 ) ) ) ),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

thf(c_0_7,negated_conjecture,
    ! [X1: $i,X2: $i,X3: $i] :
      ( ( cT @ ( imp @ X1 @ X2 ) )
      | ~ ( cT @ ( imp @ X1 @ ( imp @ X3 @ X2 ) ) )
      | ~ ( cT @ ( imp @ X1 @ X3 ) ) ),
    inference(spm,[status(thm)],[c_0_4,c_0_6]) ).

thf(c_0_8,negated_conjecture,
    ! [X2: $i,X1: $i] : ( cT @ ( imp @ X1 @ ( imp @ X2 @ X1 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_9,negated_conjecture,
    ! [X1: $i,X2: $i] :
      ( ( cT @ ( imp @ X1 @ X1 ) )
      | ~ ( cT @ ( imp @ X1 @ X2 ) ) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

thf(c_0_10,negated_conjecture,
    ~ ( cT @ ( imp @ esk1_0 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_11,negated_conjecture,
    ! [X1: $i] : ( cT @ ( imp @ X1 @ X1 ) ),
    inference(spm,[status(thm)],[c_0_9,c_0_8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO103^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.08/0.18  % Computer : n009.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Tue Sep 29 16:34:05 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22  Running higher-order theorem proving
% 0.08/0.24  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.nwyKjCVCkv/E---3.1_23160.p
% 0.08/0.26  % Version: 3.5.1-ho
% 0.08/0.26  % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.08/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26  % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.26  % Starting ho_unfolding_6 with 300s (1) cores
% 0.08/0.26  % Starting sh4l with 300s (1) cores
% 0.08/0.26  % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.08/0.26  % ho_unfolding_6 with pid 23190 completed with status 0
% 0.08/0.26  % Result found by ho_unfolding_6
% 0.08/0.26  % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.08/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26  % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.26  % Starting ho_unfolding_6 with 300s (1) cores
% 0.08/0.26  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.26  % No SInE strategy applied
% 0.08/0.26  % Search class: HHUNS-FFSF21-MFFFFFNN
% 0.08/0.26  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.26  % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.26  % SubtermCWHack with pid 23196 completed with status 0
% 0.08/0.26  % Result found by SubtermCWHack
% 0.08/0.26  % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.08/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26  % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.26  % Starting ho_unfolding_6 with 300s (1) cores
% 0.08/0.26  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.26  % No SInE strategy applied
% 0.08/0.26  % Search class: HHUNS-FFSF21-MFFFFFNN
% 0.08/0.26  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.26  % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.26  % Preprocessing time       : 0.001 s
% 0.08/0.26  
% 0.08/0.26  % Proof found!
% 0.08/0.26  % SZS status Theorem
% 0.08/0.26  % SZS output start CNFRefutation
% See solution above
% 0.08/0.26  % Parsed axioms                        : 4
% 0.08/0.26  % Removed by relevancy pruning/SinE    : 0
% 0.08/0.26  % Initial clauses                      : 8
% 0.08/0.26  % Removed in clause preprocessing      : 3
% 0.08/0.26  % Initial clauses in saturation        : 5
% 0.08/0.26  % Processed clauses                    : 13
% 0.08/0.26  % ...of these trivial                  : 0
% 0.08/0.26  % ...subsumed                          : 0
% 0.08/0.26  % ...remaining for further processing  : 13
% 0.08/0.26  % Other redundant clauses eliminated   : 0
% 0.08/0.26  % Clauses deleted for lack of memory   : 0
% 0.08/0.26  % Backward-subsumed                    : 0
% 0.08/0.26  % Backward-rewritten                   : 2
% 0.08/0.26  % Generated clauses                    : 20
% 0.08/0.26  % ...of the previous two non-redundant : 16
% 0.08/0.26  % ...aggressively subsumed             : 0
% 0.08/0.26  % Contextual simplify-reflections      : 0
% 0.08/0.26  % Paramodulations                      : 20
% 0.08/0.26  % Factorizations                       : 0
% 0.08/0.26  % NegExts                              : 0
% 0.08/0.26  % Equation resolutions                 : 0
% 0.08/0.26  % Disequality decompositions           : 0
% 0.08/0.26  % Total rewrite steps                  : 2
% 0.08/0.26  % ...of those cached                   : 0
% 0.08/0.26  % Propositional unsat checks           : 0
% 0.08/0.26  %    Propositional check models        : 0
% 0.08/0.26  %    Propositional check unsatisfiable : 0
% 0.08/0.26  %    Propositional clauses             : 0
% 0.08/0.26  %    Propositional clauses after purity: 0
% 0.08/0.26  %    Propositional unsat core size     : 0
% 0.08/0.26  %    Propositional preprocessing time  : 0.000
% 0.08/0.26  %    Propositional encoding time       : 0.000
% 0.08/0.26  %    Propositional solver time         : 0.000
% 0.08/0.26  %    Success case prop preproc time    : 0.000
% 0.08/0.26  %    Success case prop encoding time   : 0.000
% 0.08/0.26  %    Success case prop solver time     : 0.000
% 0.08/0.26  % Current number of processed clauses  : 11
% 0.08/0.26  %    Positive orientable unit clauses  : 4
% 0.08/0.26  %    Positive unorientable unit clauses: 0
% 0.08/0.26  %    Negative unit clauses             : 1
% 0.08/0.26  %    Non-unit-clauses                  : 6
% 0.08/0.26  % Current number of unprocessed clauses: 8
% 0.08/0.26  % ...number of literals in the above   : 16
% 0.08/0.26  % Current number of archived formulas  : 0
% 0.08/0.26  % Current number of archived clauses   : 2
% 0.08/0.26  % Clause-clause subsumption calls (NU) : 23
% 0.08/0.26  % Rec. Clause-clause subsumption calls : 21
% 0.08/0.26  % Non-unit clause-clause subsumptions  : 0
% 0.08/0.26  % Unit Clause-clause subsumption calls : 6
% 0.08/0.26  % Rewrite failures with RHS unbound    : 0
% 0.08/0.26  % BW rewrite match attempts            : 13
% 0.08/0.26  % BW rewrite match successes           : 2
% 0.08/0.26  % Condensation attempts                : 0
% 0.08/0.26  % Condensation successes               : 0
% 0.08/0.26  % Termbank termtop insertions          : 788
% 0.08/0.26  % Search garbage collected termcells   : 92
% 0.08/0.26  
% 0.08/0.26  % -------------------------------------------------
% 0.08/0.26  % User time                : 0.004 s
% 0.08/0.26  % System time              : 0.001 s
% 0.08/0.26  % Total time               : 0.005 s
% 0.08/0.26  % Maximum resident set size: 3632 pages
% 0.08/0.26  
% 0.08/0.26  % -------------------------------------------------
% 0.08/0.26  % User time                : 0.007 s
% 0.08/0.26  % System time              : 0.004 s
% 0.08/0.26  % Total time               : 0.010 s
% 0.08/0.26  % Maximum resident set size: 4864 pages
% 0.08/0.26  % E exiting
%------------------------------------------------------------------------------