TSTP Solution File: ITP063^1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP063^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n011.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 22:16:08 EDT 2024

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

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

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

thf(decl_23,type,
    genClo1278781456e_beta: real ).

thf(decl_26,type,
    genClo1015804716orrect: nat > real > $o ).

thf(decl_30,type,
    genClo1163638703lle_te: nat > nat > real ).

thf(decl_31,type,
    abs_abs_real: real > real ).

thf(decl_33,type,
    minus_minus_real: real > real > real ).

thf(decl_34,type,
    one_one_nat: nat ).

thf(decl_36,type,
    plus_plus_nat: nat > nat > nat ).

thf(decl_43,type,
    ord_less_eq_real: real > real > $o ).

thf(decl_44,type,
    i: nat ).

thf(decl_46,type,
    p: nat ).

thf(decl_47,type,
    q: nat ).

thf(fact_119_add_Ocommute,axiom,
    ( plus_plus_nat
    = ( ^ [X98: nat,X99: nat] : ( plus_plus_nat @ X99 @ X98 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_119_add_Ocommute) ).

thf(conj_0,conjecture,
    ord_less_eq_real @ ( abs_abs_real @ ( minus_minus_real @ ( genClo1163638703lle_te @ p @ ( plus_plus_nat @ i @ one_one_nat ) ) @ ( genClo1163638703lle_te @ q @ ( plus_plus_nat @ i @ one_one_nat ) ) ) ) @ genClo1278781456e_beta,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

thf(fact_0_rts2b,axiom,
    ! [X1: nat,X2: nat,X3: nat] :
      ( ( ( genClo1015804716orrect @ X1 @ ( genClo1163638703lle_te @ X1 @ X3 ) )
        & ( genClo1015804716orrect @ X2 @ ( genClo1163638703lle_te @ X2 @ X3 ) ) )
     => ( ord_less_eq_real @ ( abs_abs_real @ ( minus_minus_real @ ( genClo1163638703lle_te @ X1 @ X3 ) @ ( genClo1163638703lle_te @ X2 @ X3 ) ) ) @ genClo1278781456e_beta ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_rts2b) ).

thf(fact_2_corr__q__tq,axiom,
    genClo1015804716orrect @ q @ ( genClo1163638703lle_te @ q @ ( plus_plus_nat @ i @ one_one_nat ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2_corr__q__tq) ).

thf(fact_1_corr__p,axiom,
    genClo1015804716orrect @ p @ ( genClo1163638703lle_te @ p @ ( plus_plus_nat @ i @ one_one_nat ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_corr__p) ).

thf(c_0_5,plain,
    ( plus_plus_nat
    = ( ^ [Z0: nat,Z1: nat] : ( plus_plus_nat @ Z1 @ Z0 ) ) ),
    inference(fof_simplification,[status(thm)],[fact_119_add_Ocommute]) ).

thf(c_0_6,negated_conjecture,
    ~ ( ord_less_eq_real @ ( abs_abs_real @ ( minus_minus_real @ ( genClo1163638703lle_te @ p @ ( plus_plus_nat @ i @ one_one_nat ) ) @ ( genClo1163638703lle_te @ q @ ( plus_plus_nat @ i @ one_one_nat ) ) ) ) @ genClo1278781456e_beta ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).

thf(c_0_7,plain,
    ! [X1161: nat,X1162: nat,X1163: nat] :
      ( ~ ( genClo1015804716orrect @ X1161 @ ( genClo1163638703lle_te @ X1161 @ X1163 ) )
      | ~ ( genClo1015804716orrect @ X1162 @ ( genClo1163638703lle_te @ X1162 @ X1163 ) )
      | ( ord_less_eq_real @ ( abs_abs_real @ ( minus_minus_real @ ( genClo1163638703lle_te @ X1161 @ X1163 ) @ ( genClo1163638703lle_te @ X1162 @ X1163 ) ) ) @ genClo1278781456e_beta ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0_rts2b])])]) ).

thf(c_0_8,plain,
    ( plus_plus_nat
    = ( ^ [Z0: nat,Z1: nat] : ( plus_plus_nat @ Z1 @ Z0 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_9,negated_conjecture,
    ~ ( ord_less_eq_real @ ( abs_abs_real @ ( minus_minus_real @ ( genClo1163638703lle_te @ p @ ( plus_plus_nat @ i @ one_one_nat ) ) @ ( genClo1163638703lle_te @ q @ ( plus_plus_nat @ i @ one_one_nat ) ) ) ) @ genClo1278781456e_beta ),
    inference(fof_nnf,[status(thm)],[c_0_6]) ).

thf(c_0_10,plain,
    ! [X1: nat,X3: nat,X2: nat] :
      ( ( ord_less_eq_real @ ( abs_abs_real @ ( minus_minus_real @ ( genClo1163638703lle_te @ X1 @ X2 ) @ ( genClo1163638703lle_te @ X3 @ X2 ) ) ) @ genClo1278781456e_beta )
      | ~ ( genClo1015804716orrect @ X1 @ ( genClo1163638703lle_te @ X1 @ X2 ) )
      | ~ ( genClo1015804716orrect @ X3 @ ( genClo1163638703lle_te @ X3 @ X2 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_11,plain,
    genClo1015804716orrect @ q @ ( genClo1163638703lle_te @ q @ ( plus_plus_nat @ i @ one_one_nat ) ),
    inference(split_conjunct,[status(thm)],[fact_2_corr__q__tq]) ).

thf(c_0_12,plain,
    ! [X2: nat,X1: nat] :
      ( ( plus_plus_nat @ X1 @ X2 )
      = ( plus_plus_nat @ X2 @ X1 ) ),
    inference(arg_cong,[status(thm)],[c_0_8]) ).

thf(c_0_13,plain,
    genClo1015804716orrect @ p @ ( genClo1163638703lle_te @ p @ ( plus_plus_nat @ i @ one_one_nat ) ),
    inference(split_conjunct,[status(thm)],[fact_1_corr__p]) ).

thf(c_0_14,negated_conjecture,
    ~ ( ord_less_eq_real @ ( abs_abs_real @ ( minus_minus_real @ ( genClo1163638703lle_te @ p @ ( plus_plus_nat @ i @ one_one_nat ) ) @ ( genClo1163638703lle_te @ q @ ( plus_plus_nat @ i @ one_one_nat ) ) ) ) @ genClo1278781456e_beta ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_15,plain,
    ! [X1: nat] :
      ( ( ord_less_eq_real @ ( abs_abs_real @ ( minus_minus_real @ ( genClo1163638703lle_te @ X1 @ ( plus_plus_nat @ one_one_nat @ i ) ) @ ( genClo1163638703lle_te @ q @ ( plus_plus_nat @ one_one_nat @ i ) ) ) ) @ genClo1278781456e_beta )
      | ~ ( genClo1015804716orrect @ X1 @ ( genClo1163638703lle_te @ X1 @ ( plus_plus_nat @ one_one_nat @ i ) ) ) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_12]),c_0_12]) ).

thf(c_0_16,plain,
    genClo1015804716orrect @ p @ ( genClo1163638703lle_te @ p @ ( plus_plus_nat @ one_one_nat @ i ) ),
    inference(spm,[status(thm)],[c_0_13,c_0_12]) ).

thf(c_0_17,negated_conjecture,
    ~ ( ord_less_eq_real @ ( abs_abs_real @ ( minus_minus_real @ ( genClo1163638703lle_te @ p @ ( plus_plus_nat @ one_one_nat @ i ) ) @ ( genClo1163638703lle_te @ q @ ( plus_plus_nat @ one_one_nat @ i ) ) ) ) @ genClo1278781456e_beta ),
    inference(spm,[status(thm)],[c_0_14,c_0_12]) ).

thf(c_0_18,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem    : ITP063^1 : TPTP v8.2.0. Released v7.5.0.
% 0.04/0.15  % Command    : run_E %s %d THM
% 0.15/0.37  % Computer : n011.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit   : 300
% 0.15/0.37  % WCLimit    : 300
% 0.15/0.37  % DateTime   : Sat May 18 16:59:38 EDT 2024
% 0.15/0.37  % CPUTime    : 
% 0.36/0.52  Running higher-order theorem proving
% 0.36/0.52  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/benchmark/theBenchmark.p
% 0.36/0.67  # Version: 3.1.0-ho
% 0.36/0.67  # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.36/0.67  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.67  # Starting new_ho_10 with 1500s (5) cores
% 0.36/0.67  # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.36/0.67  # Starting full_lambda_6 with 300s (1) cores
% 0.36/0.67  # Starting full_lambda_9 with 300s (1) cores
% 0.36/0.67  # full_lambda_6 with pid 27048 completed with status 0
% 0.36/0.67  # Result found by full_lambda_6
% 0.36/0.67  # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.36/0.67  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.67  # Starting new_ho_10 with 1500s (5) cores
% 0.36/0.67  # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.36/0.67  # Starting full_lambda_6 with 300s (1) cores
% 0.36/0.67  # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.36/0.67  # Search class: HGUSM-FSLM21-DHFFFFBN
% 0.36/0.67  # partial match(2): HGUSM-FSLM32-DHFFFFBN
% 0.36/0.67  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.67  # Starting new_ho_10 with 163s (1) cores
% 0.36/0.67  # new_ho_10 with pid 27050 completed with status 0
% 0.36/0.67  # Result found by new_ho_10
% 0.36/0.67  # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.36/0.67  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.67  # Starting new_ho_10 with 1500s (5) cores
% 0.36/0.67  # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.36/0.67  # Starting full_lambda_6 with 300s (1) cores
% 0.36/0.67  # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.36/0.67  # Search class: HGUSM-FSLM21-DHFFFFBN
% 0.36/0.67  # partial match(2): HGUSM-FSLM32-DHFFFFBN
% 0.36/0.67  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.67  # Starting new_ho_10 with 163s (1) cores
% 0.36/0.67  # Preprocessing time       : 0.006 s
% 0.36/0.67  # Presaturation interreduction done
% 0.36/0.67  
% 0.36/0.67  # Proof found!
% 0.36/0.67  # SZS status Theorem
% 0.36/0.67  # SZS output start CNFRefutation
% See solution above
% 0.36/0.67  # Parsed axioms                        : 366
% 0.36/0.67  # Removed by relevancy pruning/SinE    : 31
% 0.36/0.67  # Initial clauses                      : 441
% 0.36/0.67  # Removed in clause preprocessing      : 25
% 0.36/0.67  # Initial clauses in saturation        : 416
% 0.36/0.67  # Processed clauses                    : 879
% 0.36/0.67  # ...of these trivial                  : 71
% 0.36/0.67  # ...subsumed                          : 205
% 0.36/0.67  # ...remaining for further processing  : 603
% 0.36/0.67  # Other redundant clauses eliminated   : 139
% 0.36/0.67  # Clauses deleted for lack of memory   : 0
% 0.36/0.67  # Backward-subsumed                    : 5
% 0.36/0.67  # Backward-rewritten                   : 10
% 0.36/0.67  # Generated clauses                    : 3912
% 0.36/0.67  # ...of the previous two non-redundant : 3021
% 0.36/0.67  # ...aggressively subsumed             : 0
% 0.36/0.67  # Contextual simplify-reflections      : 2
% 0.36/0.67  # Paramodulations                      : 3733
% 0.36/0.67  # Factorizations                       : 2
% 0.36/0.67  # NegExts                              : 0
% 0.36/0.67  # Equation resolutions                 : 150
% 0.36/0.67  # Disequality decompositions           : 0
% 0.36/0.67  # Total rewrite steps                  : 1992
% 0.36/0.67  # ...of those cached                   : 1485
% 0.36/0.67  # Propositional unsat checks           : 0
% 0.36/0.67  #    Propositional check models        : 0
% 0.36/0.67  #    Propositional check unsatisfiable : 0
% 0.36/0.67  #    Propositional clauses             : 0
% 0.36/0.67  #    Propositional clauses after purity: 0
% 0.36/0.67  #    Propositional unsat core size     : 0
% 0.36/0.67  #    Propositional preprocessing time  : 0.000
% 0.36/0.67  #    Propositional encoding time       : 0.000
% 0.36/0.67  #    Propositional solver time         : 0.000
% 0.36/0.67  #    Success case prop preproc time    : 0.000
% 0.36/0.67  #    Success case prop encoding time   : 0.000
% 0.36/0.67  #    Success case prop solver time     : 0.000
% 0.36/0.67  # Current number of processed clauses  : 296
% 0.36/0.67  #    Positive orientable unit clauses  : 113
% 0.36/0.67  #    Positive unorientable unit clauses: 9
% 0.36/0.67  #    Negative unit clauses             : 9
% 0.36/0.67  #    Non-unit-clauses                  : 165
% 0.36/0.67  # Current number of unprocessed clauses: 2770
% 0.36/0.67  # ...number of literals in the above   : 6174
% 0.36/0.67  # Current number of archived formulas  : 0
% 0.36/0.67  # Current number of archived clauses   : 239
% 0.36/0.67  # Clause-clause subsumption calls (NU) : 15126
% 0.36/0.67  # Rec. Clause-clause subsumption calls : 13066
% 0.36/0.67  # Non-unit clause-clause subsumptions  : 189
% 0.36/0.67  # Unit Clause-clause subsumption calls : 307
% 0.36/0.67  # Rewrite failures with RHS unbound    : 0
% 0.36/0.67  # BW rewrite match attempts            : 235
% 0.36/0.67  # BW rewrite match successes           : 113
% 0.36/0.67  # Condensation attempts                : 879
% 0.36/0.67  # Condensation successes               : 0
% 0.36/0.67  # Termbank termtop insertions          : 62868
% 0.36/0.67  # Search garbage collected termcells   : 6554
% 0.36/0.67  
% 0.36/0.67  # -------------------------------------------------
% 0.36/0.67  # User time                : 0.109 s
% 0.36/0.67  # System time              : 0.016 s
% 0.36/0.67  # Total time               : 0.125 s
% 0.36/0.67  # Maximum resident set size: 3684 pages
% 0.36/0.67  
% 0.36/0.67  # -------------------------------------------------
% 0.36/0.67  # User time                : 0.119 s
% 0.36/0.67  # System time              : 0.019 s
% 0.36/0.67  # Total time               : 0.138 s
% 0.36/0.67  # Maximum resident set size: 2228 pages
% 0.36/0.67  % E---3.1 exiting
% 0.36/0.67  % E exiting
%------------------------------------------------------------------------------