↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ITP170^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 : n004.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:34 AM UTC 2026

% Result   : Theorem 0.25s 0.39s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   20 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :   33 (   5 equ;   0 cnn)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  279 (  13   ~;   8   |;   4   &; 253   @)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   8 avg)
%            Number of types       :    6 (   5 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   16 (  14 usr;   6 con; 0-4 aty)
%            Number of variables   :   24 (   0   ^;  24   !;   0   ?;  24   :)

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

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

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

thf(decl_sort4,type,
    view_e774982825t_unit: $tType ).

thf(decl_sort5,type,
    real_int: $tType ).

thf(decl_25,type,
    zero_zero_real: real ).

thf(decl_26,type,
    len: ( cars > traffic > cars > real ) > view_e774982825t_unit > traffic > cars > real_int ).

thf(decl_29,type,
    ord_less_real: real > real > $o ).

thf(decl_39,type,
    left: real_int > real ).

thf(decl_41,type,
    real_length: real_int > real ).

thf(decl_43,type,
    right: real_int > real ).

thf(decl_44,type,
    regular_regular: cars > traffic > cars > real ).

thf(decl_46,type,
    space: ( cars > traffic > cars > real ) > traffic > view_e774982825t_unit > cars > real_int ).

thf(decl_49,type,
    pos: traffic > cars > real ).

thf(decl_50,type,
    ext_Product_unit: view_e774982825t_unit > real_int ).

thf(decl_53,type,
    c: cars ).

thf(decl_55,type,
    d: cars ).

thf(decl_61,type,
    ts: traffic ).

thf(decl_63,type,
    v: view_e774982825t_unit ).

thf(conj_0,conjecture,
    ( ( ord_less_real @ ( left @ ( space @ regular_regular @ ts @ v @ d ) ) @ ( right @ ( ext_Product_unit @ v ) ) )
    & ( ord_less_real @ ( left @ ( ext_Product_unit @ v ) ) @ ( right @ ( space @ regular_regular @ ts @ v @ d ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.c7OTKlD3SA/E---3.1_1778747.p',conj_0) ).

thf(fact_10_hmlsl_Oleft__space,axiom,
    ! [X5: traffic,X7: view_e774982825t_unit,X6: cars] :
      ( ( left @ ( space @ regular_regular @ X5 @ X7 @ X6 ) )
      = ( pos @ X5 @ X6 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.c7OTKlD3SA/E---3.1_1778747.p',fact_10_hmlsl_Oleft__space) ).

thf(fact_3_hmlsl_Olen__non__empty__inside,axiom,
    ! [X7: view_e774982825t_unit,X5: traffic,X6: cars] :
      ( ( ord_less_real @ zero_zero_real @ ( real_length @ ( len @ regular_regular @ X7 @ X5 @ X6 ) ) )
     => ( ( ord_less_real @ ( left @ ( space @ regular_regular @ X5 @ X7 @ X6 ) ) @ ( right @ ( ext_Product_unit @ X7 ) ) )
        & ( ord_less_real @ ( left @ ( ext_Product_unit @ X7 ) ) @ ( right @ ( space @ regular_regular @ X5 @ X7 @ X6 ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.c7OTKlD3SA/E---3.1_1778747.p',fact_3_hmlsl_Olen__non__empty__inside) ).

thf(fact_4_v_H__d,axiom,
    ord_less_real @ zero_zero_real @ ( real_length @ ( len @ regular_regular @ v @ ts @ d ) ),
    file('/export/starexec/sandbox2/tmp/tmp.c7OTKlD3SA/E---3.1_1778747.p',fact_4_v_H__d) ).

thf(fact_11_len__eq,axiom,
    ( ( len @ regular_regular @ v @ ts @ c )
    = ( len @ regular_regular @ v @ ts @ d ) ),
    file('/export/starexec/sandbox2/tmp/tmp.c7OTKlD3SA/E---3.1_1778747.p',fact_11_len__eq) ).

thf(c_0_5,negated_conjecture,
    ~ ( ( ord_less_real @ ( left @ ( space @ regular_regular @ ts @ v @ d ) ) @ ( right @ ( ext_Product_unit @ v ) ) )
      & ( ord_less_real @ ( left @ ( ext_Product_unit @ v ) ) @ ( right @ ( space @ regular_regular @ ts @ v @ d ) ) ) ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_6,negated_conjecture,
    ( ~ ( ord_less_real @ ( left @ ( space @ regular_regular @ ts @ v @ d ) ) @ ( right @ ( ext_Product_unit @ v ) ) )
    | ~ ( ord_less_real @ ( left @ ( ext_Product_unit @ v ) ) @ ( right @ ( space @ regular_regular @ ts @ v @ d ) ) ) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).

thf(c_0_7,plain,
    ! [X957: traffic,X958: view_e774982825t_unit,X959: cars] :
      ( ( left @ ( space @ regular_regular @ X957 @ X958 @ X959 ) )
      = ( pos @ X957 @ X959 ) ),
    inference(variable_rename,[status(thm)],[fact_10_hmlsl_Oleft__space]) ).

thf(c_0_8,negated_conjecture,
    ( ~ ( ord_less_real @ ( left @ ( space @ regular_regular @ ts @ v @ d ) ) @ ( right @ ( ext_Product_unit @ v ) ) )
    | ~ ( ord_less_real @ ( left @ ( ext_Product_unit @ v ) ) @ ( right @ ( space @ regular_regular @ ts @ v @ d ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_9,plain,
    ! [X7: view_e774982825t_unit,X5: traffic,X2: cars] :
      ( ( left @ ( space @ regular_regular @ X5 @ X7 @ X2 ) )
      = ( pos @ X5 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_10,plain,
    ! [X950: view_e774982825t_unit,X951: traffic,X952: cars] :
      ( ( ( ord_less_real @ ( left @ ( space @ regular_regular @ X951 @ X950 @ X952 ) ) @ ( right @ ( ext_Product_unit @ X950 ) ) )
        | ~ ( ord_less_real @ zero_zero_real @ ( real_length @ ( len @ regular_regular @ X950 @ X951 @ X952 ) ) ) )
      & ( ( ord_less_real @ ( left @ ( ext_Product_unit @ X950 ) ) @ ( right @ ( space @ regular_regular @ X951 @ X950 @ X952 ) ) )
        | ~ ( ord_less_real @ zero_zero_real @ ( real_length @ ( len @ regular_regular @ X950 @ X951 @ X952 ) ) ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_3_hmlsl_Olen__non__empty__inside])])])]) ).

thf(c_0_11,plain,
    ord_less_real @ zero_zero_real @ ( real_length @ ( len @ regular_regular @ v @ ts @ d ) ),
    inference(split_conjunct,[status(thm)],[fact_4_v_H__d]) ).

thf(c_0_12,plain,
    ( ( len @ regular_regular @ v @ ts @ c )
    = ( len @ regular_regular @ v @ ts @ d ) ),
    inference(split_conjunct,[status(thm)],[fact_11_len__eq]) ).

thf(c_0_13,negated_conjecture,
    ( ~ ( ord_less_real @ ( left @ ( ext_Product_unit @ v ) ) @ ( right @ ( space @ regular_regular @ ts @ v @ d ) ) )
    | ~ ( ord_less_real @ ( pos @ ts @ d ) @ ( right @ ( ext_Product_unit @ v ) ) ) ),
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

thf(c_0_14,plain,
    ! [X7: view_e774982825t_unit,X5: traffic,X2: cars] :
      ( ( ord_less_real @ ( left @ ( ext_Product_unit @ X7 ) ) @ ( right @ ( space @ regular_regular @ X5 @ X7 @ X2 ) ) )
      | ~ ( ord_less_real @ zero_zero_real @ ( real_length @ ( len @ regular_regular @ X7 @ X5 @ X2 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_15,plain,
    ord_less_real @ zero_zero_real @ ( real_length @ ( len @ regular_regular @ v @ ts @ c ) ),
    inference(rw,[status(thm)],[c_0_11,c_0_12]) ).

thf(c_0_16,plain,
    ! [X7: view_e774982825t_unit,X5: traffic,X2: cars] :
      ( ( ord_less_real @ ( left @ ( space @ regular_regular @ X5 @ X7 @ X2 ) ) @ ( right @ ( ext_Product_unit @ X7 ) ) )
      | ~ ( ord_less_real @ zero_zero_real @ ( real_length @ ( len @ regular_regular @ X7 @ X5 @ X2 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_17,negated_conjecture,
    ~ ( ord_less_real @ ( pos @ ts @ d ) @ ( right @ ( ext_Product_unit @ v ) ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]),c_0_15])]) ).

thf(c_0_18,plain,
    ! [X7: view_e774982825t_unit,X5: traffic,X2: cars] :
      ( ( ord_less_real @ ( pos @ X5 @ X2 ) @ ( right @ ( ext_Product_unit @ X7 ) ) )
      | ~ ( ord_less_real @ zero_zero_real @ ( real_length @ ( len @ regular_regular @ X7 @ X5 @ X2 ) ) ) ),
    inference(rw,[status(thm)],[c_0_16,c_0_9]) ).

thf(c_0_19,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_12]),c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP170^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.17  % Computer : n004.cluster.edu
% 0.09/0.17  % Model    : x86_64 x86_64
% 0.09/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17  % Memory   : 8046.5625MB
% 0.09/0.17  % OS       : Linux 6.8.0-71-generic
% 0.09/0.17  % CPULimit : 300
% 0.09/0.17  % WCLimit  : 300
% 0.09/0.17  % DateTime : Tue Sep 29 20:05:22 UTC 2026
% 0.09/0.17  % CPUTime  : 
% 0.09/0.17  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22  Running higher-order theorem proving
% 0.09/0.28  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.c7OTKlD3SA/E---3.1_1778747.p
% 0.25/0.39  % Version: 3.5.1-ho
% 0.25/0.39  % Preprocessing class: HSLSSMSMSSSNHSA.
% 0.25/0.39  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.39  % Starting new_ho_10 with 1500s (5) cores
% 0.25/0.39  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.25/0.39  % Starting lpo9_lambda_fix with 300s (1) cores
% 0.25/0.39  % Starting new_bool_1 with 300s (1) cores
% 0.25/0.39  % new_ho_10 with pid 1778772 completed with status 0
% 0.25/0.39  % Result found by new_ho_10
% 0.25/0.39  % Preprocessing class: HSLSSMSMSSSNHSA.
% 0.25/0.39  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.39  % Starting new_ho_10 with 1500s (5) cores
% 0.25/0.39  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.39  % No SInE strategy applied
% 0.25/0.39  % Search class: HGHSM-FSLM32-MHSFFSBN
% 0.25/0.39  % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.39  % Starting SubtermCWHack with 151s (1) cores
% 0.25/0.39  % Starting new_ho_10 with 901s (1) cores
% 0.25/0.39  % Starting full_lambda_9 with 151s (1) cores
% 0.25/0.39  % Starting ehoh_best with 151s (1) cores
% 0.25/0.39  % Starting post_as_ho6 with 146s (1) cores
% 0.25/0.39  % new_ho_10 with pid 1778779 completed with status 0
% 0.25/0.39  % Result found by new_ho_10
% 0.25/0.39  % Preprocessing class: HSLSSMSMSSSNHSA.
% 0.25/0.39  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.39  % Starting new_ho_10 with 1500s (5) cores
% 0.25/0.39  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.39  % No SInE strategy applied
% 0.25/0.39  % Search class: HGHSM-FSLM32-MHSFFSBN
% 0.25/0.39  % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.39  % Starting SubtermCWHack with 151s (1) cores
% 0.25/0.39  % Starting new_ho_10 with 901s (1) cores
% 0.25/0.39  % Preprocessing time       : 0.005 s
% 0.25/0.39  % Presaturation interreduction done
% 0.25/0.39  
% 0.25/0.39  % Proof found!
% 0.25/0.39  % SZS status Theorem
% 0.25/0.39  % SZS output start CNFRefutation
% See solution above
% 0.25/0.39  % Parsed axioms                        : 322
% 0.25/0.39  % Removed by relevancy pruning/SinE    : 0
% 0.25/0.39  % Initial clauses                      : 540
% 0.25/0.39  % Removed in clause preprocessing      : 74
% 0.25/0.39  % Initial clauses in saturation        : 466
% 0.25/0.39  % Processed clauses                    : 697
% 0.25/0.39  % ...of these trivial                  : 15
% 0.25/0.39  % ...subsumed                          : 153
% 0.25/0.39  % ...remaining for further processing  : 529
% 0.25/0.39  % Other redundant clauses eliminated   : 41
% 0.25/0.39  % Clauses deleted for lack of memory   : 0
% 0.25/0.39  % Backward-subsumed                    : 12
% 0.25/0.39  % Backward-rewritten                   : 10
% 0.25/0.39  % Generated clauses                    : 876
% 0.25/0.39  % ...of the previous two non-redundant : 633
% 0.25/0.39  % ...aggressively subsumed             : 0
% 0.25/0.39  % Contextual simplify-reflections      : 2
% 0.25/0.39  % Paramodulations                      : 833
% 0.25/0.39  % Factorizations                       : 4
% 0.25/0.39  % NegExts                              : 0
% 0.25/0.39  % Equation resolutions                 : 43
% 0.25/0.39  % Disequality decompositions           : 0
% 0.25/0.39  % Total rewrite steps                  : 329
% 0.25/0.39  % ...of those cached                   : 256
% 0.25/0.39  % Propositional unsat checks           : 0
% 0.25/0.39  %    Propositional check models        : 0
% 0.25/0.39  %    Propositional check unsatisfiable : 0
% 0.25/0.39  %    Propositional clauses             : 0
% 0.25/0.39  %    Propositional clauses after purity: 0
% 0.25/0.39  %    Propositional unsat core size     : 0
% 0.25/0.39  %    Propositional preprocessing time  : 0.000
% 0.25/0.39  %    Propositional encoding time       : 0.000
% 0.25/0.39  %    Propositional solver time         : 0.000
% 0.25/0.39  %    Success case prop preproc time    : 0.000
% 0.25/0.39  %    Success case prop encoding time   : 0.000
% 0.25/0.39  %    Success case prop solver time     : 0.000
% 0.25/0.39  % Current number of processed clauses  : 171
% 0.25/0.39  %    Positive orientable unit clauses  : 63
% 0.25/0.39  %    Positive unorientable unit clauses: 2
% 0.25/0.39  %    Negative unit clauses             : 9
% 0.25/0.39  %    Non-unit-clauses                  : 97
% 0.25/0.39  % Current number of unprocessed clauses: 698
% 0.25/0.39  % ...number of literals in the above   : 1784
% 0.25/0.39  % Current number of archived formulas  : 0
% 0.25/0.39  % Current number of archived clauses   : 321
% 0.25/0.39  % Clause-clause subsumption calls (NU) : 14996
% 0.25/0.39  % Rec. Clause-clause subsumption calls : 7299
% 0.25/0.39  % Non-unit clause-clause subsumptions  : 157
% 0.25/0.39  % Unit Clause-clause subsumption calls : 366
% 0.25/0.39  % Rewrite failures with RHS unbound    : 0
% 0.25/0.39  % BW rewrite match attempts            : 61
% 0.25/0.39  % BW rewrite match successes           : 38
% 0.25/0.39  % Condensation attempts                : 697
% 0.25/0.39  % Condensation successes               : 14
% 0.25/0.39  % Termbank termtop insertions          : 53673
% 0.25/0.39  % Search garbage collected termcells   : 8456
% 0.25/0.39  
% 0.25/0.39  % -------------------------------------------------
% 0.25/0.39  % User time                : 0.057 s
% 0.25/0.39  % System time              : 0.013 s
% 0.25/0.39  % Total time               : 0.070 s
% 0.25/0.39  % Maximum resident set size: 5908 pages
% 0.25/0.39  
% 0.25/0.39  % -------------------------------------------------
% 0.25/0.39  % User time                : 0.175 s
% 0.25/0.39  % System time              : 0.040 s
% 0.25/0.39  % Total time               : 0.216 s
% 0.25/0.39  % Maximum resident set size: 5376 pages
% 0.25/0.39  % E exiting
%------------------------------------------------------------------------------