↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ITP019_5 : TPTP v9.3.1. Bugfixed v7.5.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 : Thu Sep 24 12:53:48 PM UTC 2026

% Result   : Theorem 4.65s 3.27s
% Output   : CNFRefutation 4.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   10 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :   19 (  18 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   22 (  13   ~;   3   |;   2   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :    6 (   0 sgn   6   !;   0   ?;   6   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_sort1,type,
    tp__ty_2Enum_2Enum: $tType ).

tff(decl_sort2,type,
    tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal: $tType ).

tff(decl_27,type,
    ap: ( $i * $i ) > $i ).

tff(decl_189,type,
    inj__ty_2Enum_2Enum: tp__ty_2Enum_2Enum > $i ).

tff(decl_192,type,
    fo__c_2Enum_2E0: tp__ty_2Enum_2Enum ).

tff(decl_5233,type,
    inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal > $i ).

tff(decl_5234,type,
    surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal: $i > tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal ).

tff(decl_5775,type,
    c_2Ecomplex_2Ecomplex__inv: $i ).

tff(decl_5778,type,
    c_2Ecomplex_2Ecomplex__of__num: $i ).

tff(decl_5804,type,
    esk1_0: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal ).

tff(conj_thm_2Ecomplex_2ECOMPLEX__INV__NZ,conjecture,
    ! [X30600: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal] :
      ( ( X30600 != surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__of__num,inj__ty_2Enum_2Enum(fo__c_2Enum_2E0))) )
     => ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__inv,inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(X30600))) != surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__of__num,inj__ty_2Enum_2Enum(fo__c_2Enum_2E0))) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Ecomplex_2ECOMPLEX__INV__NZ) ).

tff(conj_thm_2Ecomplex_2ECOMPLEX__INV__EQ__0,axiom,
    ! [X30599: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal] :
      ( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__inv,inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(X30599))) = surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__of__num,inj__ty_2Enum_2Enum(fo__c_2Enum_2E0))) )
    <=> ( X30599 = surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__of__num,inj__ty_2Enum_2Enum(fo__c_2Enum_2E0))) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Ecomplex_2ECOMPLEX__INV__EQ__0) ).

tff(c_0_2,negated_conjecture,
    ~ ! [X30600: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal] :
        ( ( X30600 != surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__of__num,inj__ty_2Enum_2Enum(fo__c_2Enum_2E0))) )
       => ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__inv,inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(X30600))) != surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__of__num,inj__ty_2Enum_2Enum(fo__c_2Enum_2E0))) ) ),
    inference(assume_negation,[status(cth)],[conj_thm_2Ecomplex_2ECOMPLEX__INV__NZ]) ).

tff(c_0_3,negated_conjecture,
    ~ ! [X30600: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal] :
        ( ( X30600 != surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__of__num,inj__ty_2Enum_2Enum(fo__c_2Enum_2E0))) )
       => ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__inv,inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(X30600))) != surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__of__num,inj__ty_2Enum_2Enum(fo__c_2Enum_2E0))) ) ),
    inference(fof_simplification,[status(thm)],[c_0_2]) ).

tff(c_0_4,plain,
    ! [X30645: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal] :
      ( ( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__inv,inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(X30645))) = surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__of__num,inj__ty_2Enum_2Enum(fo__c_2Enum_2E0))) )
        | ( X30645 != surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__of__num,inj__ty_2Enum_2Enum(fo__c_2Enum_2E0))) ) )
      & ( ( X30645 = surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__of__num,inj__ty_2Enum_2Enum(fo__c_2Enum_2E0))) )
        | ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__inv,inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(X30645))) != surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__of__num,inj__ty_2Enum_2Enum(fo__c_2Enum_2E0))) ) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_thm_2Ecomplex_2ECOMPLEX__INV__EQ__0])])]) ).

tff(c_0_5,negated_conjecture,
    ( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__inv,inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(esk1_0))) = surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__of__num,inj__ty_2Enum_2Enum(fo__c_2Enum_2E0))) )
    & ( esk1_0 != surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__of__num,inj__ty_2Enum_2Enum(fo__c_2Enum_2E0))) ) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).

tcf(c_0_6,plain,
    ! [X27305: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal] :
      ( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__inv,inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(X27305))) != surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__of__num,inj__ty_2Enum_2Enum(fo__c_2Enum_2E0))) )
      | ( X27305 = surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__of__num,inj__ty_2Enum_2Enum(fo__c_2Enum_2E0))) ) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

tcf(c_0_7,negated_conjecture,
    surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__inv,inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(esk1_0))) = surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__of__num,inj__ty_2Enum_2Enum(fo__c_2Enum_2E0))),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

tcf(c_0_8,negated_conjecture,
    esk1_0 != surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal(ap(c_2Ecomplex_2Ecomplex__of__num,inj__ty_2Enum_2Enum(fo__c_2Enum_2E0))),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : ITP019_5 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.02  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.30  % Computer : n012.cluster.edu
% 0.04/0.30  % Model    : x86_64 x86_64
% 0.04/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30  % Memory   : 8046.5625MB
% 0.04/0.30  % OS       : Linux 6.8.0-71-generic
% 0.04/0.30  % CPULimit : 300
% 0.04/0.30  % WCLimit  : 300
% 0.04/0.30  % DateTime : Sun Sep 20 21:51:57 UTC 2026
% 0.04/0.30  % CPUTime  : 
% 0.04/0.30  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.33  Running first-order theorem proving
% 0.07/0.33  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.65/3.27  % Version: 3.5.1
% 4.65/3.27  % Preprocessing class: FMLLSMLLSSSNFFN.
% 4.65/3.27  % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 4.65/3.27  % Starting new_bool_3 with 894s (3) cores
% 4.65/3.27  % Starting new_bool_1 with 894s (3) cores
% 4.65/3.27  % Starting sh5l with 298s (1) cores
% 4.65/3.27  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 298s (1) cores
% 4.65/3.27  % new_bool_1 with pid 909411 completed with status 0
% 4.65/3.27  % Result found by new_bool_1
% 4.65/3.27  % Preprocessing class: FMLLSMLLSSSNFFN.
% 4.65/3.27  % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 4.65/3.27  % Starting new_bool_3 with 894s (3) cores
% 4.65/3.27  % Starting new_bool_1 with 894s (3) cores
% 4.65/3.27  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.65/3.27  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.65/3.27  % Search class: FGHSM-SMLM33-DFFFFFNN
% 4.65/3.27  % Scheduled 7 strats onto 3 cores with 894 seconds (894 total)
% 4.65/3.27  % Starting SubtermCWHack with 81s (1) cores
% 4.65/3.27  % Starting new_bool_1 with 90s (1) cores
% 4.65/3.27  % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 81s (1) cores
% 4.65/3.27  % SubtermCWHack with pid 909414 completed with status 0
% 4.65/3.27  % Result found by SubtermCWHack
% 4.65/3.27  % Preprocessing class: FMLLSMLLSSSNFFN.
% 4.65/3.27  % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 4.65/3.27  % Starting new_bool_3 with 894s (3) cores
% 4.65/3.27  % Starting new_bool_1 with 894s (3) cores
% 4.65/3.27  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.65/3.27  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.65/3.27  % Search class: FGHSM-SMLM33-DFFFFFNN
% 4.65/3.27  % Scheduled 7 strats onto 3 cores with 894 seconds (894 total)
% 4.65/3.27  % Starting SubtermCWHack with 81s (1) cores
% 4.65/3.27  % Preprocessing time       : 0.086 s
% 4.65/3.27  
% 4.65/3.27  % Proof found!
% 4.65/3.27  % SZS status Theorem
% 4.65/3.27  % SZS output start CNFRefutation
% See solution above
% 4.65/3.27  % Parsed axioms                        : 23420
% 4.65/3.27  % Removed by relevancy pruning/SinE    : 22437
% 4.65/3.27  % Initial clauses                      : 2908
% 4.65/3.27  % Removed in clause preprocessing      : 201
% 4.65/3.27  % Initial clauses in saturation        : 2707
% 4.65/3.27  % Processed clauses                    : 539
% 4.65/3.27  % ...of these trivial                  : 22
% 4.65/3.27  % ...subsumed                          : 113
% 4.65/3.27  % ...remaining for further processing  : 404
% 4.65/3.27  % Other redundant clauses eliminated   : 65
% 4.65/3.27  % Clauses deleted for lack of memory   : 0
% 4.65/3.27  % Backward-subsumed                    : 0
% 4.65/3.27  % Backward-rewritten                   : 6
% 4.65/3.27  % Generated clauses                    : 1230
% 4.65/3.27  % ...of the previous two non-redundant : 1077
% 4.65/3.27  % ...aggressively subsumed             : 0
% 4.65/3.27  % Contextual simplify-reflections      : 0
% 4.65/3.27  % Paramodulations                      : 1163
% 4.65/3.27  % Factorizations                       : 0
% 4.65/3.27  % NegExts                              : 0
% 4.65/3.27  % Equation resolutions                 : 72
% 4.65/3.27  % Disequality decompositions           : 0
% 4.65/3.27  % Total rewrite steps                  : 220
% 4.65/3.27  % ...of those cached                   : 149
% 4.65/3.27  % Propositional unsat checks           : 0
% 4.65/3.27  %    Propositional check models        : 0
% 4.65/3.27  %    Propositional check unsatisfiable : 0
% 4.65/3.27  %    Propositional clauses             : 0
% 4.65/3.27  %    Propositional clauses after purity: 0
% 4.65/3.27  %    Propositional unsat core size     : 0
% 4.65/3.27  %    Propositional preprocessing time  : 0.000
% 4.65/3.27  %    Propositional encoding time       : 0.000
% 4.65/3.27  %    Propositional solver time         : 0.000
% 4.65/3.27  %    Success case prop preproc time    : 0.000
% 4.65/3.27  %    Success case prop encoding time   : 0.000
% 4.65/3.27  %    Success case prop solver time     : 0.000
% 4.65/3.27  % Current number of processed clauses  : 352
% 4.65/3.27  %    Positive orientable unit clauses  : 127
% 4.65/3.27  %    Positive unorientable unit clauses: 0
% 4.65/3.27  %    Negative unit clauses             : 17
% 4.65/3.27  %    Non-unit-clauses                  : 208
% 4.65/3.27  % Current number of unprocessed clauses: 3242
% 4.65/3.27  % ...number of literals in the above   : 13747
% 4.65/3.27  % Current number of archived formulas  : 0
% 4.65/3.27  % Current number of archived clauses   : 6
% 4.65/3.27  % Clause-clause subsumption calls (NU) : 4719
% 4.65/3.27  % Rec. Clause-clause subsumption calls : 4284
% 4.65/3.27  % Non-unit clause-clause subsumptions  : 87
% 4.65/3.27  % Unit Clause-clause subsumption calls : 80
% 4.65/3.27  % Rewrite failures with RHS unbound    : 0
% 4.65/3.27  % BW rewrite match attempts            : 357
% 4.65/3.27  % BW rewrite match successes           : 5
% 4.65/3.27  % Condensation attempts                : 0
% 4.65/3.27  % Condensation successes               : 0
% 4.65/3.27  % Termbank termtop insertions          : 1111723
% 4.65/3.27  % Search garbage collected termcells   : 409476
% 4.65/3.27  
% 4.65/3.27  % -------------------------------------------------
% 4.65/3.27  % User time                : 0.572 s
% 4.65/3.27  % System time              : 0.124 s
% 4.65/3.27  % Total time               : 0.696 s
% 4.65/3.27  % Maximum resident set size: 84048 pages
% 4.65/3.27  
% 4.65/3.27  % -------------------------------------------------
% 4.65/3.27  % User time                : 2.931 s
% 4.65/3.27  % System time              : 0.305 s
% 4.65/3.27  % Total time               : 3.236 s
% 4.65/3.27  % Maximum resident set size: 70400 pages
% 4.65/3.27  % E exiting
%------------------------------------------------------------------------------