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

View Problem - Process Solution

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

% Computer : n009.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:44 EDT 2024

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

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

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

thf(decl_33,type,
    late_OutputR: name > name > late_freeRes ).

thf(decl_34,type,
    late_TauR: late_freeRes ).

thf(decl_170,type,
    ab: name ).

thf(decl_173,type,
    x: name ).

thf(fact_216_Late__Semantics_OfreeRes_Odistinct_I1_J,axiom,
    ! [X230: name,X231: name] :
      ( ( late_OutputR @ X230 @ X231 )
     != late_TauR ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_216_Late__Semantics_OfreeRes_Odistinct_I1_J) ).

thf(fact_1_cComm1_Ohyps_I9_J,axiom,
    ( ( late_OutputR @ ab @ x )
    = late_TauR ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_cComm1_Ohyps_I9_J) ).

thf(c_0_2,plain,
    ! [X230: name,X231: name] :
      ( ( late_OutputR @ X230 @ X231 )
     != late_TauR ),
    inference(fof_simplification,[status(thm)],[fact_216_Late__Semantics_OfreeRes_Odistinct_I1_J]) ).

thf(c_0_3,plain,
    ! [X2444: name,X2445: name] :
      ( ( late_OutputR @ X2444 @ X2445 )
     != late_TauR ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_2])]) ).

thf(c_0_4,plain,
    ( ( late_OutputR @ ab @ x )
    = late_TauR ),
    inference(split_conjunct,[status(thm)],[fact_1_cComm1_Ohyps_I9_J]) ).

thf(c_0_5,plain,
    ! [X1: name,X3: name] :
      ( ( late_OutputR @ X1 @ X3 )
     != late_TauR ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_6,plain,
    $false,
    inference(sr,[status(thm)],[c_0_4,c_0_5]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : ITP191^1 : TPTP v8.2.0. Released v7.5.0.
% 0.12/0.13  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n009.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sat May 18 18:46:53 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.20/0.52  Running higher-order theorem proving
% 0.20/0.52  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/benchmark/theBenchmark.p
% 0.68/0.66  # Version: 3.1.0-ho
% 0.68/0.66  # Preprocessing class: HSLMSMSMSSSNSFA.
% 0.68/0.66  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.66  # Starting new_ho_10 with 1500s (5) cores
% 0.68/0.66  # Starting ho_unfolding_6 with 300s (1) cores
% 0.68/0.66  # Starting sh4l with 300s (1) cores
% 0.68/0.66  # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.68/0.66  # new_ho_10 with pid 6152 completed with status 0
% 0.68/0.66  # Result found by new_ho_10
% 0.68/0.66  # Preprocessing class: HSLMSMSMSSSNSFA.
% 0.68/0.66  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.66  # Starting new_ho_10 with 1500s (5) cores
% 0.68/0.66  # No SInE strategy applied
% 0.68/0.66  # Search class: HGHSM-FSLM32-MSFFFFBN
% 0.68/0.66  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.68/0.66  # Starting sh6 with 811s (1) cores
% 0.68/0.66  # Starting new_ho_10 with 151s (1) cores
% 0.68/0.66  # Starting sh2lt with 136s (1) cores
% 0.68/0.66  # Starting pre_casc_5 with 136s (1) cores
% 0.68/0.66  # Starting pre_casc_6 with 136s (1) cores
% 0.68/0.66  # new_ho_10 with pid 6160 completed with status 0
% 0.68/0.66  # Result found by new_ho_10
% 0.68/0.66  # Preprocessing class: HSLMSMSMSSSNSFA.
% 0.68/0.66  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.66  # Starting new_ho_10 with 1500s (5) cores
% 0.68/0.66  # No SInE strategy applied
% 0.68/0.66  # Search class: HGHSM-FSLM32-MSFFFFBN
% 0.68/0.66  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.68/0.66  # Starting sh6 with 811s (1) cores
% 0.68/0.66  # Starting new_ho_10 with 151s (1) cores
% 0.68/0.66  # Preprocessing time       : 0.020 s
% 0.68/0.66  # Presaturation interreduction done
% 0.68/0.66  
% 0.68/0.66  # Proof found!
% 0.68/0.66  # SZS status ContradictoryAxioms
% 0.68/0.66  # SZS output start CNFRefutation
% See solution above
% 0.68/0.66  # Parsed axioms                        : 568
% 0.68/0.66  # Removed by relevancy pruning/SinE    : 0
% 0.68/0.66  # Initial clauses                      : 1211
% 0.68/0.66  # Removed in clause preprocessing      : 259
% 0.68/0.66  # Initial clauses in saturation        : 952
% 0.68/0.66  # Processed clauses                    : 20
% 0.68/0.66  # ...of these trivial                  : 0
% 0.68/0.66  # ...subsumed                          : 1
% 0.68/0.66  # ...remaining for further processing  : 18
% 0.68/0.66  # Other redundant clauses eliminated   : 0
% 0.68/0.66  # Clauses deleted for lack of memory   : 0
% 0.68/0.66  # Backward-subsumed                    : 0
% 0.68/0.66  # Backward-rewritten                   : 0
% 0.68/0.66  # Generated clauses                    : 0
% 0.68/0.66  # ...of the previous two non-redundant : 0
% 0.68/0.66  # ...aggressively subsumed             : 0
% 0.68/0.66  # Contextual simplify-reflections      : 0
% 0.68/0.66  # Paramodulations                      : 0
% 0.68/0.66  # Factorizations                       : 0
% 0.68/0.66  # NegExts                              : 0
% 0.68/0.66  # Equation resolutions                 : 0
% 0.68/0.66  # Disequality decompositions           : 0
% 0.68/0.66  # Total rewrite steps                  : 0
% 0.68/0.66  # ...of those cached                   : 0
% 0.68/0.66  # Propositional unsat checks           : 0
% 0.68/0.66  #    Propositional check models        : 0
% 0.68/0.66  #    Propositional check unsatisfiable : 0
% 0.68/0.66  #    Propositional clauses             : 0
% 0.68/0.66  #    Propositional clauses after purity: 0
% 0.68/0.66  #    Propositional unsat core size     : 0
% 0.68/0.66  #    Propositional preprocessing time  : 0.000
% 0.68/0.66  #    Propositional encoding time       : 0.000
% 0.68/0.66  #    Propositional solver time         : 0.000
% 0.68/0.66  #    Success case prop preproc time    : 0.000
% 0.68/0.66  #    Success case prop encoding time   : 0.000
% 0.68/0.66  #    Success case prop solver time     : 0.000
% 0.68/0.66  # Current number of processed clauses  : 18
% 0.68/0.66  #    Positive orientable unit clauses  : 13
% 0.68/0.66  #    Positive unorientable unit clauses: 0
% 0.68/0.66  #    Negative unit clauses             : 5
% 0.68/0.66  #    Non-unit-clauses                  : 0
% 0.68/0.66  # Current number of unprocessed clauses: 932
% 0.68/0.66  # ...number of literals in the above   : 3228
% 0.68/0.66  # Current number of archived formulas  : 0
% 0.68/0.66  # Current number of archived clauses   : 0
% 0.68/0.66  # Clause-clause subsumption calls (NU) : 0
% 0.68/0.66  # Rec. Clause-clause subsumption calls : 0
% 0.68/0.66  # Non-unit clause-clause subsumptions  : 0
% 0.68/0.66  # Unit Clause-clause subsumption calls : 5
% 0.68/0.66  # Rewrite failures with RHS unbound    : 0
% 0.68/0.66  # BW rewrite match attempts            : 0
% 0.68/0.66  # BW rewrite match successes           : 0
% 0.68/0.66  # Condensation attempts                : 20
% 0.68/0.66  # Condensation successes               : 0
% 0.68/0.66  # Termbank termtop insertions          : 72553
% 0.68/0.66  # Search garbage collected termcells   : 17364
% 0.68/0.66  
% 0.68/0.66  # -------------------------------------------------
% 0.68/0.66  # User time                : 0.096 s
% 0.68/0.66  # System time              : 0.013 s
% 0.68/0.66  # Total time               : 0.109 s
% 0.68/0.66  # Maximum resident set size: 6540 pages
% 0.68/0.66  
% 0.68/0.66  # -------------------------------------------------
% 0.68/0.66  # User time                : 0.201 s
% 0.68/0.66  # System time              : 0.035 s
% 0.68/0.66  # Total time               : 0.236 s
% 0.68/0.66  # Maximum resident set size: 2824 pages
% 0.68/0.66  % E---3.1 exiting
% 0.68/0.66  % E exiting
%------------------------------------------------------------------------------