↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEU896^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 : n007.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:25:54 AM UTC 2026

% Result   : Theorem 0.06s 0.25s
% Output   : CNFRefutation 0.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   12 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :   42 (  41 equ;   0 cnn)
%            Maximal formula atoms :    5 (   3 avg)
%            Number of connectives :   47 (   6   ~;  13   |;   6   &;  21   @)
%                                         (   0 <=>;   0  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Number of types       :    2 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   5 usr;   5 con; 0-2 aty)
%            Number of variables   :   16 (  10   ^;   0   !;   6   ?;  16   :)

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

thf(decl_sort2,type,
    b: $tType ).

thf(decl_23,type,
    y: b ).

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

thf(decl_25,type,
    x: b ).

thf(decl_26,type,
    esk1_0: a ).

thf(decl_27,type,
    esk2_0: b ).

thf(cTHM500_pme,conjecture,
    ( ( ^ [X1: a] :
        ? [X2: b] :
          ( ( ( X2 = x )
            | ( X2 = y ) )
          & ( X1
            = ( g @ X2 ) ) ) )
    = ( ^ [X3: a] :
          ( ( X3
            = ( g @ x ) )
          | ( X3
            = ( g @ y ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.GvIaJzuo8Y/E---3.1_3457199.p',cTHM500_pme) ).

thf(c_0_1,negated_conjecture,
    ( ( ^ [X1: a] :
        ? [X2: b] :
          ( ( ( X2 = x )
            | ( X2 = y ) )
          & ( X1
            = ( g @ X2 ) ) ) )
   != ( ^ [X3: a] :
          ( ( X3
            = ( g @ x ) )
          | ( X3
            = ( g @ y ) ) ) ) ),
    inference(assume_negation,[status(cth)],[cTHM500_pme]) ).

thf(c_0_2,negated_conjecture,
    ( ( ^ [Z0: a] :
        ? [X2: b] :
          ( ( ( X2 = x )
            | ( X2 = y ) )
          & ( Z0
            = ( g @ X2 ) ) ) )
   != ( ^ [Z0: a] :
          ( ( Z0
            = ( g @ x ) )
          | ( Z0
            = ( g @ y ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])]) ).

thf(c_0_3,negated_conjecture,
    ( ( ^ [Z0: a] :
        ? [X2: b] :
          ( ( ( X2 = x )
            | ( X2 = y ) )
          & ( Z0
            = ( g @ X2 ) ) ) )
   != ( ^ [Z0: a] :
          ( ( Z0
            = ( g @ x ) )
          | ( Z0
            = ( g @ y ) ) ) ) ),
    inference(fof_nnf,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ( ( ^ [Z0: a] :
        ? [X7: b] :
          ( ( ( X7 = x )
            | ( X7 = y ) )
          & ( Z0
            = ( g @ X7 ) ) ) )
   != ( ^ [Z0: a] :
          ( ( Z0
            = ( g @ x ) )
          | ( Z0
            = ( g @ y ) ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_5,negated_conjecture,
    ( ? [X8: b] :
        ( ( ( X8 = x )
          | ( X8 = y ) )
        & ( esk1_0
          = ( g @ X8 ) ) )
  <~> ( ( esk1_0
        = ( g @ x ) )
      | ( esk1_0
        = ( g @ y ) ) ) ),
    inference(neg_ext,[status(thm)],[c_0_4]) ).

thf(c_0_6,negated_conjecture,
    ( ( g @ x )
   != esk1_0 ),
    inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_5])]) ).

thf(c_0_7,negated_conjecture,
    ( ( g @ y )
   != esk1_0 ),
    inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_5])]) ).

thf(c_0_8,negated_conjecture,
    ( ( y = esk2_0 )
    | ( x = esk2_0 ) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_5]),c_0_6]),c_0_7]) ).

thf(c_0_9,negated_conjecture,
    ( ( g @ esk2_0 )
    = esk1_0 ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_5]),c_0_6]),c_0_7]) ).

thf(c_0_10,negated_conjecture,
    y = esk2_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_8]),c_0_9])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU896^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.18  % Computer : n007.cluster.edu
% 0.06/0.18  % Model    : x86_64 x86_64
% 0.06/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.18  % Memory   : 8046.5625MB
% 0.06/0.18  % OS       : Linux 6.8.0-71-generic
% 0.06/0.18  % CPULimit : 300
% 0.06/0.18  % WCLimit  : 300
% 0.06/0.18  % DateTime : Tue Sep 29 14:42:40 UTC 2026
% 0.06/0.18  % CPUTime  : 
% 0.06/0.18  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.22  Running higher-order theorem proving
% 0.06/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.GvIaJzuo8Y/E---3.1_3457199.p
% 0.06/0.25  % Version: 3.5.1-ho
% 0.06/0.25  % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.06/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.25  % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.06/0.25  % Starting post_as_ho10 with 300s (1) cores
% 0.06/0.25  % Starting new_bool_9 with 300s (1) cores
% 0.06/0.25  % Starting sh5l with 300s (1) cores
% 0.06/0.25  % ehoh_best_nonlift_nonlambdatoforall with pid 3457212 completed with status 0
% 0.06/0.25  % Result found by ehoh_best_nonlift_nonlambdatoforall
% 0.06/0.25  % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.06/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.25  % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.06/0.25  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.06/0.25  % No SInE strategy applied
% 0.06/0.25  % Search class: HUUPF-FFSF11-DSSFFFNN
% 0.06/0.25  % partial match(1): HUUPF-FFSF11-MSSFFFNN
% 0.06/0.25  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.06/0.25  % Starting SubtermCWHack with 136s (1) cores
% 0.06/0.25  % Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.06/0.25  % Starting sh5l with 136s (1) cores
% 0.06/0.25  % Starting new_bool_1 with 136s (1) cores
% 0.06/0.25  % Starting new_bool_2 with 136s (1) cores
% 0.06/0.25  % SubtermCWHack with pid 3457216 completed with status 10
% 0.06/0.25  % Starting new_bool_9 with 136s (1) cores
% 0.06/0.25  % sh5l with pid 3457218 completed with status 0
% 0.06/0.25  % Result found by sh5l
% 0.06/0.25  % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.06/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.25  % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.06/0.25  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.06/0.25  % No SInE strategy applied
% 0.06/0.25  % Search class: HUUPF-FFSF11-DSSFFFNN
% 0.06/0.25  % partial match(1): HUUPF-FFSF11-MSSFFFNN
% 0.06/0.25  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.06/0.25  % Starting SubtermCWHack with 136s (1) cores
% 0.06/0.25  % Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.06/0.25  % Starting sh5l with 136s (1) cores
% 0.06/0.25  % Preprocessing time       : 0.001 s
% 0.06/0.25  % Presaturation interreduction done
% 0.06/0.25  
% 0.06/0.25  % Proof found!
% 0.06/0.25  % SZS status Theorem
% 0.06/0.25  % SZS output start CNFRefutation
% See solution above
% 0.06/0.25  % Parsed axioms                        : 6
% 0.06/0.25  % Removed by relevancy pruning/SinE    : 0
% 0.06/0.25  % Initial clauses                      : 6
% 0.06/0.25  % Removed in clause preprocessing      : 5
% 0.06/0.25  % Initial clauses in saturation        : 1
% 0.06/0.25  % Processed clauses                    : 11
% 0.06/0.25  % ...of these trivial                  : 0
% 0.06/0.25  % ...subsumed                          : 3
% 0.06/0.25  % ...remaining for further processing  : 8
% 0.06/0.25  % Other redundant clauses eliminated   : 4
% 0.06/0.25  % Clauses deleted for lack of memory   : 0
% 0.06/0.25  % Backward-subsumed                    : 0
% 0.06/0.25  % Backward-rewritten                   : 2
% 0.06/0.25  % Generated clauses                    : 13
% 0.06/0.25  % ...of the previous two non-redundant : 9
% 0.06/0.25  % ...aggressively subsumed             : 0
% 0.06/0.25  % Contextual simplify-reflections      : 0
% 0.06/0.25  % Paramodulations                      : 1
% 0.06/0.25  % Factorizations                       : 0
% 0.06/0.25  % NegExts                              : 1
% 0.06/0.25  % Equation resolutions                 : 4
% 0.06/0.25  % Disequality decompositions           : 0
% 0.06/0.25  % Total rewrite steps                  : 3
% 0.06/0.25  % ...of those cached                   : 1
% 0.06/0.25  % Propositional unsat checks           : 0
% 0.06/0.25  %    Propositional check models        : 0
% 0.06/0.25  %    Propositional check unsatisfiable : 0
% 0.06/0.25  %    Propositional clauses             : 0
% 0.06/0.25  %    Propositional clauses after purity: 0
% 0.06/0.25  %    Propositional unsat core size     : 0
% 0.06/0.25  %    Propositional preprocessing time  : 0.000
% 0.06/0.25  %    Propositional encoding time       : 0.000
% 0.06/0.25  %    Propositional solver time         : 0.000
% 0.06/0.25  %    Success case prop preproc time    : 0.000
% 0.06/0.25  %    Success case prop encoding time   : 0.000
% 0.06/0.25  %    Success case prop solver time     : 0.000
% 0.06/0.25  % Current number of processed clauses  : 4
% 0.06/0.25  %    Positive orientable unit clauses  : 2
% 0.06/0.25  %    Positive unorientable unit clauses: 0
% 0.06/0.25  %    Negative unit clauses             : 2
% 0.06/0.25  %    Non-unit-clauses                  : 0
% 0.06/0.25  % Current number of unprocessed clauses: 0
% 0.06/0.25  % ...number of literals in the above   : 0
% 0.06/0.25  % Current number of archived formulas  : 0
% 0.06/0.25  % Current number of archived clauses   : 4
% 0.06/0.25  % Clause-clause subsumption calls (NU) : 0
% 0.06/0.25  % Rec. Clause-clause subsumption calls : 0
% 0.06/0.25  % Non-unit clause-clause subsumptions  : 0
% 0.06/0.25  % Unit Clause-clause subsumption calls : 2
% 0.06/0.25  % Rewrite failures with RHS unbound    : 0
% 0.06/0.25  % BW rewrite match attempts            : 1
% 0.06/0.25  % BW rewrite match successes           : 1
% 0.06/0.25  % Condensation attempts                : 11
% 0.06/0.25  % Condensation successes               : 0
% 0.06/0.25  % Termbank termtop insertions          : 581
% 0.06/0.25  % Search garbage collected termcells   : 7
% 0.06/0.25  
% 0.06/0.25  % -------------------------------------------------
% 0.06/0.25  % User time                : 0.003 s
% 0.06/0.25  % System time              : 0.004 s
% 0.06/0.25  % Total time               : 0.007 s
% 0.06/0.25  % Maximum resident set size: 3632 pages
% 0.06/0.25  
% 0.06/0.25  % -------------------------------------------------
% 0.06/0.25  % User time                : 0.009 s
% 0.06/0.25  % System time              : 0.011 s
% 0.06/0.25  % Total time               : 0.021 s
% 0.06/0.25  % Maximum resident set size: 4864 pages
% 0.06/0.25  % E exiting
%------------------------------------------------------------------------------