↑ Up

E---3.5.1.CAX-CRf.s

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

% Computer : n003.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:38 AM UTC 2026

% Result   : ContradictoryAxioms 0.40s 0.39s
% Output   : CNFRefutation 0.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    7 (   7 unt;   0 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  :    0 (   0   >;   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_34,type,
    late_OutputR: name > name > late_freeRes ).

thf(decl_35,type,
    late_TauR: late_freeRes ).

thf(decl_171,type,
    ab: name ).

thf(decl_174,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/tmp/tmp.3UeVgcEVpP/E---3.1_2993410.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/tmp/tmp.3UeVgcEVpP/E---3.1_2993410.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,
    ! [X2438: name,X2439: name] :
      ( ( late_OutputR @ X2438 @ X2439 )
     != 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.03  % Problem  : ITP191^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.18  % Computer : n003.cluster.edu
% 0.10/0.18  % Model    : x86_64 x86_64
% 0.10/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18  % Memory   : 8046.5625MB
% 0.10/0.18  % OS       : Linux 6.8.0-71-generic
% 0.10/0.18  % CPULimit : 300
% 0.10/0.18  % WCLimit  : 300
% 0.10/0.18  % DateTime : Tue Sep 29 20:11:28 UTC 2026
% 0.10/0.18  % CPUTime  : 
% 0.10/0.18  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.22  Running higher-order theorem proving
% 0.23/0.30  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/tmp/tmp.3UeVgcEVpP/E---3.1_2993410.p
% 0.40/0.39  % Version: 3.5.1-ho
% 0.40/0.39  % Preprocessing class: HSLMSMSMSSSNSFA.
% 0.40/0.39  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.39  % Starting new_ho_10 with 1500s (5) cores
% 0.40/0.39  % Starting ho_unfolding_6 with 300s (1) cores
% 0.40/0.39  % Starting sh4l with 300s (1) cores
% 0.40/0.39  % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.40/0.39  % sh4l with pid 2993425 completed with status 0
% 0.40/0.39  % Result found by sh4l
% 0.40/0.39  % Preprocessing class: HSLMSMSMSSSNSFA.
% 0.40/0.39  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.39  % Starting new_ho_10 with 1500s (5) cores
% 0.40/0.39  % Starting ho_unfolding_6 with 300s (1) cores
% 0.40/0.39  % Starting sh4l with 300s (1) cores
% 0.40/0.39  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.40/0.39  % No SInE strategy applied
% 0.40/0.39  % Search class: HGHSM-FSLM32-DSFFFFBN
% 0.40/0.39  % partial match(1): HGHSM-FSLM32-SSFFFFBN
% 0.40/0.39  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.39  % Starting SubtermCWHack with 28s (1) cores
% 0.40/0.39  % SubtermCWHack with pid 2993427 completed with status 0
% 0.40/0.39  % Result found by SubtermCWHack
% 0.40/0.39  % Preprocessing class: HSLMSMSMSSSNSFA.
% 0.40/0.39  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.39  % Starting new_ho_10 with 1500s (5) cores
% 0.40/0.39  % Starting ho_unfolding_6 with 300s (1) cores
% 0.40/0.39  % Starting sh4l with 300s (1) cores
% 0.40/0.39  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.40/0.39  % No SInE strategy applied
% 0.40/0.39  % Search class: HGHSM-FSLM32-DSFFFFBN
% 0.40/0.39  % partial match(1): HGHSM-FSLM32-SSFFFFBN
% 0.40/0.39  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.39  % Starting SubtermCWHack with 28s (1) cores
% 0.40/0.39  % Preprocessing time       : 0.015 s
% 0.40/0.39  
% 0.40/0.39  % Proof found!
% 0.40/0.39  % SZS status ContradictoryAxioms
% 0.40/0.39  % SZS output start CNFRefutation
% See solution above
% 0.40/0.39  % Parsed axioms                        : 568
% 0.40/0.39  % Removed by relevancy pruning/SinE    : 0
% 0.40/0.39  % Initial clauses                      : 1197
% 0.40/0.39  % Removed in clause preprocessing      : 259
% 0.40/0.39  % Initial clauses in saturation        : 938
% 0.40/0.39  % Processed clauses                    : 43
% 0.40/0.39  % ...of these trivial                  : 4
% 0.40/0.39  % ...subsumed                          : 1
% 0.40/0.39  % ...remaining for further processing  : 38
% 0.40/0.39  % Other redundant clauses eliminated   : 0
% 0.40/0.39  % Clauses deleted for lack of memory   : 0
% 0.40/0.39  % Backward-subsumed                    : 2
% 0.40/0.39  % Backward-rewritten                   : 3
% 0.40/0.39  % Generated clauses                    : 15
% 0.40/0.39  % ...of the previous two non-redundant : 10
% 0.40/0.39  % ...aggressively subsumed             : 0
% 0.40/0.39  % Contextual simplify-reflections      : 0
% 0.40/0.39  % Paramodulations                      : 12
% 0.40/0.39  % Factorizations                       : 0
% 0.40/0.39  % NegExts                              : 0
% 0.40/0.39  % Equation resolutions                 : 0
% 0.40/0.39  % Disequality decompositions           : 0
% 0.40/0.39  % Total rewrite steps                  : 11
% 0.40/0.39  % ...of those cached                   : 2
% 0.40/0.39  % Propositional unsat checks           : 0
% 0.40/0.39  %    Propositional check models        : 0
% 0.40/0.39  %    Propositional check unsatisfiable : 0
% 0.40/0.39  %    Propositional clauses             : 0
% 0.40/0.39  %    Propositional clauses after purity: 0
% 0.40/0.39  %    Propositional unsat core size     : 0
% 0.40/0.39  %    Propositional preprocessing time  : 0.000
% 0.40/0.39  %    Propositional encoding time       : 0.000
% 0.40/0.39  %    Propositional solver time         : 0.000
% 0.40/0.39  %    Success case prop preproc time    : 0.000
% 0.40/0.39  %    Success case prop encoding time   : 0.000
% 0.40/0.39  %    Success case prop solver time     : 0.000
% 0.40/0.39  % Current number of processed clauses  : 32
% 0.40/0.39  %    Positive orientable unit clauses  : 24
% 0.40/0.39  %    Positive unorientable unit clauses: 1
% 0.40/0.39  %    Negative unit clauses             : 6
% 0.40/0.39  %    Non-unit-clauses                  : 1
% 0.40/0.39  % Current number of unprocessed clauses: 900
% 0.40/0.39  % ...number of literals in the above   : 3160
% 0.40/0.39  % Current number of archived formulas  : 0
% 0.40/0.39  % Current number of archived clauses   : 6
% 0.40/0.39  % Clause-clause subsumption calls (NU) : 2
% 0.40/0.39  % Rec. Clause-clause subsumption calls : 1
% 0.40/0.39  % Non-unit clause-clause subsumptions  : 1
% 0.40/0.39  % Unit Clause-clause subsumption calls : 26
% 0.40/0.39  % Rewrite failures with RHS unbound    : 11
% 0.40/0.39  % BW rewrite match attempts            : 70
% 0.40/0.39  % BW rewrite match successes           : 7
% 0.40/0.39  % Condensation attempts                : 0
% 0.40/0.39  % Condensation successes               : 0
% 0.40/0.39  % Termbank termtop insertions          : 75067
% 0.40/0.39  % Search garbage collected termcells   : 16975
% 0.40/0.39  
% 0.40/0.39  % -------------------------------------------------
% 0.40/0.39  % User time                : 0.049 s
% 0.40/0.39  % System time              : 0.011 s
% 0.40/0.39  % Total time               : 0.060 s
% 0.40/0.39  % Maximum resident set size: 8284 pages
% 0.40/0.39  
% 0.40/0.39  % -------------------------------------------------
% 0.40/0.39  % User time                : 0.068 s
% 0.40/0.39  % System time              : 0.016 s
% 0.40/0.39  % Total time               : 0.083 s
% 0.40/0.39  % Maximum resident set size: 5888 pages
% 0.40/0.39  % E exiting
%------------------------------------------------------------------------------