↑ Up

E---3.5.1.THM-CRf.s

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

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

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

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

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

thf(cSYN031_1,conjecture,
    ~ ( ! [X1: $i] :
          ( ( g @ X1 @ a )
          | ( g @ ( f @ X1 ) @ X1 ) )
      & ! [X1: $i] :
          ( ( g @ X1 @ a )
          | ( g @ X1 @ ( f @ X1 ) ) )
      & ! [X1: $i,X2: $i] :
          ( ~ ( g @ X1 @ X2 )
          | ( g @ ( f @ X2 ) @ X2 ) )
      & ! [X1: $i,X2: $i] :
          ( ~ ( g @ X1 @ X2 )
          | ( g @ X2 @ ( f @ X2 ) ) )
      & ! [X1: $i,X2: $i] :
          ( ~ ( g @ X1 @ X2 )
          | ~ ( g @ X2 @ a ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.7reaCNmOgs/E---3.1_337965.p',cSYN031_1) ).

thf(c_0_1,negated_conjecture,
    ~ ~ ( ! [X1: $i] :
            ( ( g @ X1 @ a )
            | ( g @ ( f @ X1 ) @ X1 ) )
        & ! [X1: $i] :
            ( ( g @ X1 @ a )
            | ( g @ X1 @ ( f @ X1 ) ) )
        & ! [X1: $i,X2: $i] :
            ( ~ ( g @ X1 @ X2 )
            | ( g @ ( f @ X2 ) @ X2 ) )
        & ! [X1: $i,X2: $i] :
            ( ~ ( g @ X1 @ X2 )
            | ( g @ X2 @ ( f @ X2 ) ) )
        & ! [X1: $i,X2: $i] :
            ( ~ ( g @ X1 @ X2 )
            | ~ ( g @ X2 @ a ) ) ),
    inference(assume_negation,[status(cth)],[cSYN031_1]) ).

thf(c_0_2,negated_conjecture,
    ~ ~ ( ! [X1: $i] :
            ( ( g @ X1 @ a )
            | ( g @ ( f @ X1 ) @ X1 ) )
        & ! [X1: $i] :
            ( ( g @ X1 @ a )
            | ( g @ X1 @ ( f @ X1 ) ) )
        & ! [X1: $i,X2: $i] :
            ( ~ ( g @ X1 @ X2 )
            | ( g @ ( f @ X2 ) @ X2 ) )
        & ! [X1: $i,X2: $i] :
            ( ~ ( g @ X1 @ X2 )
            | ( g @ X2 @ ( f @ X2 ) ) )
        & ! [X1: $i,X2: $i] :
            ( ~ ( g @ X1 @ X2 )
            | ~ ( g @ X2 @ a ) ) ),
    inference(fof_simplification,[status(thm)],[c_0_1]) ).

thf(c_0_3,negated_conjecture,
    ! [X11: $i,X12: $i,X13: $i,X14: $i,X15: $i,X16: $i,X17: $i,X18: $i] :
      ( ( ( g @ X11 @ a )
        | ( g @ ( f @ X11 ) @ X11 ) )
      & ( ( g @ X12 @ a )
        | ( g @ X12 @ ( f @ X12 ) ) )
      & ( ~ ( g @ X13 @ X14 )
        | ( g @ ( f @ X14 ) @ X14 ) )
      & ( ~ ( g @ X15 @ X16 )
        | ( g @ X16 @ ( f @ X16 ) ) )
      & ( ~ ( g @ X17 @ X18 )
        | ~ ( g @ X18 @ a ) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).

thf(c_0_4,negated_conjecture,
    ! [X1: $i,X2: $i] :
      ( ~ ( g @ X1 @ X2 )
      | ~ ( g @ X2 @ a ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

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

thf(c_0_6,negated_conjecture,
    ! [X1: $i] :
      ( ( g @ a @ a )
      | ~ ( g @ X1 @ ( f @ a ) ) ),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

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

thf(c_0_8,negated_conjecture,
    g @ a @ a,
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

thf(c_0_9,negated_conjecture,
    ! [X1: $i] :
      ~ ( g @ X1 @ a ),
    inference(spm,[status(thm)],[c_0_4,c_0_8]) ).

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

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