↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ITP139^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n014.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:04:28 AM UTC 2026

% Result   : Theorem 0.54s 0.40s
% Output   : CNFRefutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   26 (  15 equ;   0 cnn)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   83 (   9   ~;   7   |;   1   &;  63   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :    4 (   4   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   13 (   0   ^;  13   !;   0   ?;  13   :)

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

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

thf(decl_sort3,type,
    set_Pa1764573435lle_tv: $tType ).

thf(decl_26,type,
    inj_on772319074lle_tv: ( paraco1605129243lle_tv > paraco1605129243lle_tv ) > set_Pa1764573435lle_tv > $o ).

thf(decl_78,type,
    top_to1057771083lle_tv: set_Pa1764573435lle_tv ).

thf(decl_83,type,
    paraco1147068288nge_tv: ( nat > nat ) > paraco1605129243lle_tv > paraco1605129243lle_tv ).

thf(decl_141,type,
    f: nat > nat ).

thf(decl_142,type,
    esk1_1: ( paraco1605129243lle_tv > paraco1605129243lle_tv ) > paraco1605129243lle_tv ).

thf(decl_143,type,
    esk2_1: ( paraco1605129243lle_tv > paraco1605129243lle_tv ) > paraco1605129243lle_tv ).

thf(conj_0,conjecture,
    inj_on772319074lle_tv @ ( paraco1147068288nge_tv @ f ) @ top_to1057771083lle_tv,
    file('/export/starexec/sandbox2/tmp/tmp.zstGqmJ7Sk/E---3.1_3137133.p',conj_0) ).

thf(fact_0__092_060open_062_092_060And_062tv2_Atv1_O_Achange__tv_Af_Atv1_A_061_Achange__tv_Af_Atv2_A_092_060Longrightarrow_062_Atv1_A_061_Atv2_092_060close_062,axiom,
    ! [X1: paraco1605129243lle_tv,X2: paraco1605129243lle_tv] :
      ( ( ( paraco1147068288nge_tv @ f @ X1 )
        = ( paraco1147068288nge_tv @ f @ X2 ) )
     => ( X1 = X2 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.zstGqmJ7Sk/E---3.1_3137133.p',fact_0__092_060open_062_092_060And_062tv2_Atv1_O_Achange__tv_Af_Atv1_A_061_Achange__tv_Af_Atv2_A_092_060Longrightarrow_062_Atv1_A_061_Atv2_092_060close_062) ).

thf(fact_25_injI,axiom,
    ! [X48: paraco1605129243lle_tv > paraco1605129243lle_tv] :
      ( ! [X49: paraco1605129243lle_tv,X50: paraco1605129243lle_tv] :
          ( ( ( X48 @ X49 )
            = ( X48 @ X50 ) )
         => ( X49 = X50 ) )
     => ( inj_on772319074lle_tv @ X48 @ top_to1057771083lle_tv ) ),
    file('/export/starexec/sandbox2/tmp/tmp.zstGqmJ7Sk/E---3.1_3137133.p',fact_25_injI) ).

thf(c_0_3,negated_conjecture,
    ~ ( inj_on772319074lle_tv @ ( paraco1147068288nge_tv @ f ) @ top_to1057771083lle_tv ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_4,negated_conjecture,
    ~ ( inj_on772319074lle_tv @ ( paraco1147068288nge_tv @ f ) @ top_to1057771083lle_tv ),
    inference(fof_simplification,[status(thm)],[c_0_3]) ).

thf(c_0_5,plain,
    ! [X1401: paraco1605129243lle_tv,X1402: paraco1605129243lle_tv] :
      ( ( ( paraco1147068288nge_tv @ f @ X1401 )
       != ( paraco1147068288nge_tv @ f @ X1402 ) )
      | ( X1401 = X1402 ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0__092_060open_062_092_060And_062tv2_Atv1_O_Achange__tv_Af_Atv1_A_061_Achange__tv_Af_Atv2_A_092_060Longrightarrow_062_Atv1_A_061_Atv2_092_060close_062])])]) ).

thf(c_0_6,plain,
    ! [X1339: paraco1605129243lle_tv > paraco1605129243lle_tv] :
      ( ( ( ( X1339 @ ( esk1_1 @ X1339 ) )
          = ( X1339 @ ( esk2_1 @ X1339 ) ) )
        | ( inj_on772319074lle_tv @ X1339 @ top_to1057771083lle_tv ) )
      & ( ( ( esk1_1 @ X1339 )
         != ( esk2_1 @ X1339 ) )
        | ( inj_on772319074lle_tv @ X1339 @ top_to1057771083lle_tv ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_25_injI])])])])]) ).

thf(c_0_7,negated_conjecture,
    ~ ( inj_on772319074lle_tv @ ( paraco1147068288nge_tv @ f ) @ top_to1057771083lle_tv ),
    inference(fof_nnf,[status(thm)],[c_0_4]) ).

thf(c_0_8,plain,
    ! [X1: paraco1605129243lle_tv,X2: paraco1605129243lle_tv] :
      ( ( X1 = X2 )
      | ( ( paraco1147068288nge_tv @ f @ X1 )
       != ( paraco1147068288nge_tv @ f @ X2 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_9,plain,
    ! [X28: paraco1605129243lle_tv > paraco1605129243lle_tv] :
      ( ( ( X28 @ ( esk1_1 @ X28 ) )
        = ( X28 @ ( esk2_1 @ X28 ) ) )
      | ( inj_on772319074lle_tv @ X28 @ top_to1057771083lle_tv ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_10,negated_conjecture,
    ~ ( inj_on772319074lle_tv @ ( paraco1147068288nge_tv @ f ) @ top_to1057771083lle_tv ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_11,plain,
    ! [X1: paraco1605129243lle_tv] :
      ( ( ( esk1_1 @ ( paraco1147068288nge_tv @ f ) )
        = X1 )
      | ( ( paraco1147068288nge_tv @ f @ ( esk2_1 @ ( paraco1147068288nge_tv @ f ) ) )
       != ( paraco1147068288nge_tv @ f @ X1 ) ) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).

thf(c_0_12,plain,
    ! [X28: paraco1605129243lle_tv > paraco1605129243lle_tv] :
      ( ( inj_on772319074lle_tv @ X28 @ top_to1057771083lle_tv )
      | ( ( esk1_1 @ X28 )
       != ( esk2_1 @ X28 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_13,plain,
    ( ( esk1_1 @ ( paraco1147068288nge_tv @ f ) )
    = ( esk2_1 @ ( paraco1147068288nge_tv @ f ) ) ),
    inference(er,[status(thm)],[c_0_11]) ).

thf(c_0_14,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : ITP139^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.18  % Computer : n014.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.18  % CPULimit : 300
% 0.09/0.18  % WCLimit  : 300
% 0.09/0.18  % DateTime : Tue Sep 29 19:59:15 UTC 2026
% 0.09/0.18  % CPUTime  : 
% 0.09/0.18  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22  Running higher-order theorem proving
% 0.09/0.25  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.zstGqmJ7Sk/E---3.1_3137133.p
% 0.54/0.40  % Version: 3.5.1-ho
% 0.54/0.40  % Preprocessing class: HSLMSMSSSSMNHSA.
% 0.54/0.40  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.40  % Starting new_ho_10 with 1500s (5) cores
% 0.54/0.40  % Starting sh5l with 300s (1) cores
% 0.54/0.40  % Starting new_bool_1 with 300s (1) cores
% 0.54/0.40  % Starting new_bool_2 with 300s (1) cores
% 0.54/0.40  % new_bool_1 with pid 3137170 completed with status 0
% 0.54/0.40  % Result found by new_bool_1
% 0.54/0.40  % Preprocessing class: HSLMSMSSSSMNHSA.
% 0.54/0.40  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.40  % Starting new_ho_10 with 1500s (5) cores
% 0.54/0.40  % Starting sh5l with 300s (1) cores
% 0.54/0.40  % Starting new_bool_1 with 300s (1) cores
% 0.54/0.40  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.54/0.40  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.54/0.40  % Search class: HGHSM-FSLM32-DHSFFSBN
% 0.54/0.40  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.54/0.40  % Starting SubtermCWHack with 28s (1) cores
% 0.54/0.40  % SubtermCWHack with pid 3137176 completed with status 0
% 0.54/0.40  % Result found by SubtermCWHack
% 0.54/0.40  % Preprocessing class: HSLMSMSSSSMNHSA.
% 0.54/0.40  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.40  % Starting new_ho_10 with 1500s (5) cores
% 0.54/0.40  % Starting sh5l with 300s (1) cores
% 0.54/0.40  % Starting new_bool_1 with 300s (1) cores
% 0.54/0.40  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.54/0.40  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.54/0.40  % Search class: HGHSM-FSLM32-DHSFFSBN
% 0.54/0.40  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.54/0.40  % Starting SubtermCWHack with 28s (1) cores
% 0.54/0.40  % Preprocessing time       : 0.005 s
% 0.54/0.40  
% 0.54/0.40  % Proof found!
% 0.54/0.40  % SZS status Theorem
% 0.54/0.40  % SZS output start CNFRefutation
% See solution above
% 0.54/0.40  % Parsed axioms                        : 489
% 0.54/0.40  % Removed by relevancy pruning/SinE    : 383
% 0.54/0.40  % Initial clauses                      : 192
% 0.54/0.40  % Removed in clause preprocessing      : 9
% 0.54/0.40  % Initial clauses in saturation        : 183
% 0.54/0.40  % Processed clauses                    : 642
% 0.54/0.40  % ...of these trivial                  : 10
% 0.54/0.40  % ...subsumed                          : 300
% 0.54/0.40  % ...remaining for further processing  : 332
% 0.54/0.40  % Other redundant clauses eliminated   : 66
% 0.54/0.40  % Clauses deleted for lack of memory   : 0
% 0.54/0.40  % Backward-subsumed                    : 11
% 0.54/0.40  % Backward-rewritten                   : 8
% 0.54/0.40  % Generated clauses                    : 3082
% 0.54/0.40  % ...of the previous two non-redundant : 2420
% 0.54/0.40  % ...aggressively subsumed             : 0
% 0.54/0.40  % Contextual simplify-reflections      : 1
% 0.54/0.40  % Paramodulations                      : 2990
% 0.54/0.40  % Factorizations                       : 4
% 0.54/0.40  % NegExts                              : 0
% 0.54/0.40  % Equation resolutions                 : 79
% 0.54/0.40  % Disequality decompositions           : 0
% 0.54/0.40  % Total rewrite steps                  : 925
% 0.54/0.40  % ...of those cached                   : 754
% 0.54/0.40  % Propositional unsat checks           : 0
% 0.54/0.40  %    Propositional check models        : 0
% 0.54/0.40  %    Propositional check unsatisfiable : 0
% 0.54/0.40  %    Propositional clauses             : 0
% 0.54/0.40  %    Propositional clauses after purity: 0
% 0.54/0.40  %    Propositional unsat core size     : 0
% 0.54/0.40  %    Propositional preprocessing time  : 0.000
% 0.54/0.40  %    Propositional encoding time       : 0.000
% 0.54/0.40  %    Propositional solver time         : 0.000
% 0.54/0.40  %    Success case prop preproc time    : 0.000
% 0.54/0.40  %    Success case prop encoding time   : 0.000
% 0.54/0.40  %    Success case prop solver time     : 0.000
% 0.54/0.40  % Current number of processed clauses  : 292
% 0.54/0.40  %    Positive orientable unit clauses  : 19
% 0.54/0.40  %    Positive unorientable unit clauses: 0
% 0.54/0.40  %    Negative unit clauses             : 3
% 0.54/0.40  %    Non-unit-clauses                  : 270
% 0.54/0.40  % Current number of unprocessed clauses: 1932
% 0.54/0.40  % ...number of literals in the above   : 6768
% 0.54/0.40  % Current number of archived formulas  : 0
% 0.54/0.40  % Current number of archived clauses   : 21
% 0.54/0.40  % Clause-clause subsumption calls (NU) : 9481
% 0.54/0.40  % Rec. Clause-clause subsumption calls : 8048
% 0.54/0.40  % Non-unit clause-clause subsumptions  : 295
% 0.54/0.40  % Unit Clause-clause subsumption calls : 300
% 0.54/0.40  % Rewrite failures with RHS unbound    : 0
% 0.54/0.40  % BW rewrite match attempts            : 19
% 0.54/0.40  % BW rewrite match successes           : 8
% 0.54/0.40  % Condensation attempts                : 0
% 0.54/0.40  % Condensation successes               : 0
% 0.54/0.40  % Termbank termtop insertions          : 66670
% 0.54/0.40  % Search garbage collected termcells   : 8665
% 0.54/0.40  
% 0.54/0.40  % -------------------------------------------------
% 0.54/0.40  % User time                : 0.095 s
% 0.54/0.40  % System time              : 0.012 s
% 0.54/0.40  % Total time               : 0.107 s
% 0.54/0.40  % Maximum resident set size: 5652 pages
% 0.54/0.40  
% 0.54/0.40  % -------------------------------------------------
% 0.54/0.40  % User time                : 0.112 s
% 0.54/0.40  % System time              : 0.017 s
% 0.54/0.40  % Total time               : 0.129 s
% 0.54/0.40  % Maximum resident set size: 6144 pages
% 0.54/0.40  % E exiting
%------------------------------------------------------------------------------