↑ Up

E---3.5.1.THM-CRf.s

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

% Result   : Theorem 0.22s 0.33s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   22 (  22 unt;   0 typ;   0 def)
%            Number of atoms       :   22 (  21 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :  186 (   4   ~;   0   |;   0   &; 182   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Number of types       :    1 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   6 usr;   4 con; 0-5 aty)
%            Number of variables   :   42 (   0   ^;  42   !;   0   ?;  42   :)

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

thf(decl_35,type,
    modula1144073633_aux_a: ( a > a > a ) > ( a > a > a ) > a > a > a > a ).

thf(decl_56,type,
    a2: a ).

thf(decl_57,type,
    b: a ).

thf(decl_58,type,
    c: a ).

thf(decl_59,type,
    inf: a > a > a ).

thf(decl_61,type,
    sup: a > a > a ).

thf(conj_0,conjecture,
    ( ( modula1144073633_aux_a @ inf @ sup @ b @ c @ a2 )
    = ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ),
    file('/export/starexec/sandbox/tmp/tmp.IIClS5QHa7/E---3.1_568218.p',conj_0) ).

thf(fact_14_e__aux__def,axiom,
    ! [X1: a,X2: a,X3: a] :
      ( ( modula1144073633_aux_a @ inf @ sup @ X1 @ X2 @ X3 )
      = ( inf @ ( inf @ ( sup @ X1 @ X2 ) @ ( sup @ X2 @ X3 ) ) @ ( sup @ X3 @ X1 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.IIClS5QHa7/E---3.1_568218.p',fact_14_e__aux__def) ).

thf(fact_0_local_Oinf_Oassoc,axiom,
    ! [X1: a,X2: a,X3: a] :
      ( ( inf @ ( inf @ X1 @ X2 ) @ X3 )
      = ( inf @ X1 @ ( inf @ X2 @ X3 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.IIClS5QHa7/E---3.1_568218.p',fact_0_local_Oinf_Oassoc) ).

thf(fact_7_local_Osup_Ocommute,axiom,
    ! [X1: a,X2: a] :
      ( ( sup @ X1 @ X2 )
      = ( sup @ X2 @ X1 ) ),
    file('/export/starexec/sandbox/tmp/tmp.IIClS5QHa7/E---3.1_568218.p',fact_7_local_Osup_Ocommute) ).

thf(fact_2_local_Oinf_Oleft__commute,axiom,
    ! [X2: a,X1: a,X3: a] :
      ( ( inf @ X2 @ ( inf @ X1 @ X3 ) )
      = ( inf @ X1 @ ( inf @ X2 @ X3 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.IIClS5QHa7/E---3.1_568218.p',fact_2_local_Oinf_Oleft__commute) ).

thf(fact_1_local_Oinf_Ocommute,axiom,
    ! [X1: a,X2: a] :
      ( ( inf @ X1 @ X2 )
      = ( inf @ X2 @ X1 ) ),
    file('/export/starexec/sandbox/tmp/tmp.IIClS5QHa7/E---3.1_568218.p',fact_1_local_Oinf_Ocommute) ).

thf(c_0_6,negated_conjecture,
    ( ( modula1144073633_aux_a @ inf @ sup @ b @ c @ a2 )
   != ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_7,negated_conjecture,
    ( ( modula1144073633_aux_a @ inf @ sup @ b @ c @ a2 )
   != ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ),
    inference(fof_simplification,[status(thm)],[c_0_6]) ).

thf(c_0_8,plain,
    ! [X845: a,X846: a,X847: a] :
      ( ( modula1144073633_aux_a @ inf @ sup @ X845 @ X846 @ X847 )
      = ( inf @ ( inf @ ( sup @ X845 @ X846 ) @ ( sup @ X846 @ X847 ) ) @ ( sup @ X847 @ X845 ) ) ),
    inference(variable_rename,[status(thm)],[fact_14_e__aux__def]) ).

thf(c_0_9,plain,
    ! [X801: a,X802: a,X803: a] :
      ( ( inf @ ( inf @ X801 @ X802 ) @ X803 )
      = ( inf @ X801 @ ( inf @ X802 @ X803 ) ) ),
    inference(variable_rename,[status(thm)],[fact_0_local_Oinf_Oassoc]) ).

thf(c_0_10,negated_conjecture,
    ( ( modula1144073633_aux_a @ inf @ sup @ b @ c @ a2 )
   != ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ),
    inference(fof_nnf,[status(thm)],[c_0_7]) ).

thf(c_0_11,plain,
    ! [X3: a,X2: a,X1: a] :
      ( ( modula1144073633_aux_a @ inf @ sup @ X1 @ X2 @ X3 )
      = ( inf @ ( inf @ ( sup @ X1 @ X2 ) @ ( sup @ X2 @ X3 ) ) @ ( sup @ X3 @ X1 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_12,plain,
    ! [X1: a,X2: a,X3: a] :
      ( ( inf @ ( inf @ X1 @ X2 ) @ X3 )
      = ( inf @ X1 @ ( inf @ X2 @ X3 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_13,plain,
    ! [X820: a,X821: a] :
      ( ( sup @ X820 @ X821 )
      = ( sup @ X821 @ X820 ) ),
    inference(variable_rename,[status(thm)],[fact_7_local_Osup_Ocommute]) ).

thf(c_0_14,plain,
    ! [X806: a,X807: a,X808: a] :
      ( ( inf @ X806 @ ( inf @ X807 @ X808 ) )
      = ( inf @ X807 @ ( inf @ X806 @ X808 ) ) ),
    inference(variable_rename,[status(thm)],[fact_2_local_Oinf_Oleft__commute]) ).

thf(c_0_15,plain,
    ! [X804: a,X805: a] :
      ( ( inf @ X804 @ X805 )
      = ( inf @ X805 @ X804 ) ),
    inference(variable_rename,[status(thm)],[fact_1_local_Oinf_Ocommute]) ).

thf(c_0_16,negated_conjecture,
    ( ( modula1144073633_aux_a @ inf @ sup @ b @ c @ a2 )
   != ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_17,plain,
    ! [X3: a,X2: a,X1: a] :
      ( ( modula1144073633_aux_a @ inf @ sup @ X1 @ X2 @ X3 )
      = ( inf @ ( sup @ X1 @ X2 ) @ ( inf @ ( sup @ X2 @ X3 ) @ ( sup @ X3 @ X1 ) ) ) ),
    inference(rw,[status(thm)],[c_0_11,c_0_12]) ).

thf(c_0_18,plain,
    ! [X2: a,X1: a] :
      ( ( sup @ X1 @ X2 )
      = ( sup @ X2 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

thf(c_0_19,plain,
    ! [X1: a,X2: a,X3: a] :
      ( ( inf @ X1 @ ( inf @ X2 @ X3 ) )
      = ( inf @ X2 @ ( inf @ X1 @ X3 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

thf(c_0_20,plain,
    ! [X2: a,X1: a] :
      ( ( inf @ X1 @ X2 )
      = ( inf @ X2 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

thf(c_0_21,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]),c_0_17]),c_0_18]),c_0_20])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP124^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.16  % Computer : n018.cluster.edu
% 0.10/0.16  % Model    : x86_64 x86_64
% 0.10/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16  % Memory   : 8046.5625MB
% 0.10/0.16  % OS       : Linux 6.8.0-71-generic
% 0.10/0.17  % CPULimit : 300
% 0.10/0.17  % WCLimit  : 300
% 0.10/0.17  % DateTime : Tue Sep 29 19:59:26 UTC 2026
% 0.10/0.17  % CPUTime  : 
% 0.10/0.17  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.21  Running higher-order theorem proving
% 0.10/0.25  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.IIClS5QHa7/E---3.1_568218.p
% 0.22/0.33  % Version: 3.5.1-ho
% 0.22/0.33  % Preprocessing class: HSLSSMSSSSMNHSA.
% 0.22/0.33  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.33  % Starting sh1 with 1500s (5) cores
% 0.22/0.33  % Starting new_ho_8 with 300s (1) cores
% 0.22/0.33  % Starting new_ho_11 with 300s (1) cores
% 0.22/0.33  % Starting sh5l with 300s (1) cores
% 0.22/0.33  % sh1 with pid 568255 completed with status 0
% 0.22/0.33  % Result found by sh1
% 0.22/0.33  % Preprocessing class: HSLSSMSSSSMNHSA.
% 0.22/0.33  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.33  % Starting sh1 with 1500s (5) cores
% 0.22/0.33  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.33  % No SInE strategy applied
% 0.22/0.33  % Search class: HGHSM-FSLM31-MHSFFSBN
% 0.22/0.33  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.33  % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.33  % Starting sh1 with 151s (1) cores
% 0.22/0.33  % Starting lpo4_lambdas_fix with 136s (1) cores
% 0.22/0.33  % Starting post_as_ho3 with 136s (1) cores
% 0.22/0.33  % Starting full_lambda_10 with 136s (1) cores
% 0.22/0.33  % post_as_ho3 with pid 568267 completed with status 0
% 0.22/0.33  % Result found by post_as_ho3
% 0.22/0.33  % Preprocessing class: HSLSSMSSSSMNHSA.
% 0.22/0.33  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.33  % Starting sh1 with 1500s (5) cores
% 0.22/0.33  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.33  % No SInE strategy applied
% 0.22/0.33  % Search class: HGHSM-FSLM31-MHSFFSBN
% 0.22/0.33  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.33  % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.33  % Starting sh1 with 151s (1) cores
% 0.22/0.33  % Starting lpo4_lambdas_fix with 136s (1) cores
% 0.22/0.33  % Starting post_as_ho3 with 136s (1) cores
% 0.22/0.33  % Preprocessing time       : 0.004 s
% 0.22/0.33  % Presaturation interreduction done
% 0.22/0.33  
% 0.22/0.33  % Proof found!
% 0.22/0.33  % SZS status Theorem
% 0.22/0.33  % SZS output start CNFRefutation
% See solution above
% 0.22/0.33  % Parsed axioms                        : 313
% 0.22/0.33  % Removed by relevancy pruning/SinE    : 0
% 0.22/0.33  % Initial clauses                      : 468
% 0.22/0.33  % Removed in clause preprocessing      : 51
% 0.22/0.33  % Initial clauses in saturation        : 417
% 0.22/0.33  % Processed clauses                    : 367
% 0.22/0.33  % ...of these trivial                  : 12
% 0.22/0.33  % ...subsumed                          : 91
% 0.22/0.33  % ...remaining for further processing  : 264
% 0.22/0.33  % Other redundant clauses eliminated   : 27
% 0.22/0.33  % Clauses deleted for lack of memory   : 0
% 0.22/0.33  % Backward-subsumed                    : 1
% 0.22/0.33  % Backward-rewritten                   : 1
% 0.22/0.33  % Generated clauses                    : 26
% 0.22/0.33  % ...of the previous two non-redundant : 6
% 0.22/0.33  % ...aggressively subsumed             : 0
% 0.22/0.33  % Contextual simplify-reflections      : 0
% 0.22/0.33  % Paramodulations                      : 0
% 0.22/0.33  % Factorizations                       : 0
% 0.22/0.33  % NegExts                              : 0
% 0.22/0.33  % Equation resolutions                 : 27
% 0.22/0.33  % Disequality decompositions           : 0
% 0.22/0.33  % Total rewrite steps                  : 42
% 0.22/0.33  % ...of those cached                   : 15
% 0.22/0.33  % Propositional unsat checks           : 0
% 0.22/0.33  %    Propositional check models        : 0
% 0.22/0.33  %    Propositional check unsatisfiable : 0
% 0.22/0.33  %    Propositional clauses             : 0
% 0.22/0.33  %    Propositional clauses after purity: 0
% 0.22/0.33  %    Propositional unsat core size     : 0
% 0.22/0.33  %    Propositional preprocessing time  : 0.000
% 0.22/0.33  %    Propositional encoding time       : 0.000
% 0.22/0.33  %    Propositional solver time         : 0.000
% 0.22/0.33  %    Success case prop preproc time    : 0.000
% 0.22/0.33  %    Success case prop encoding time   : 0.000
% 0.22/0.33  %    Success case prop solver time     : 0.000
% 0.22/0.33  % Current number of processed clauses  : 236
% 0.22/0.33  %    Positive orientable unit clauses  : 45
% 0.22/0.33  %    Positive unorientable unit clauses: 6
% 0.22/0.33  %    Negative unit clauses             : 5
% 0.22/0.33  %    Non-unit-clauses                  : 180
% 0.22/0.33  % Current number of unprocessed clauses: 56
% 0.22/0.33  % ...number of literals in the above   : 224
% 0.22/0.33  % Current number of archived formulas  : 0
% 0.22/0.33  % Current number of archived clauses   : 2
% 0.22/0.33  % Clause-clause subsumption calls (NU) : 7377
% 0.22/0.33  % Rec. Clause-clause subsumption calls : 6000
% 0.22/0.33  % Non-unit clause-clause subsumptions  : 79
% 0.22/0.33  % Unit Clause-clause subsumption calls : 42
% 0.22/0.33  % Rewrite failures with RHS unbound    : 0
% 0.22/0.33  % BW rewrite match attempts            : 41
% 0.22/0.33  % BW rewrite match successes           : 26
% 0.22/0.33  % Condensation attempts                : 0
% 0.22/0.33  % Condensation successes               : 0
% 0.22/0.33  % Termbank termtop insertions          : 33918
% 0.22/0.33  % Search garbage collected termcells   : 8763
% 0.22/0.33  
% 0.22/0.33  % -------------------------------------------------
% 0.22/0.33  % User time                : 0.041 s
% 0.22/0.33  % System time              : 0.005 s
% 0.22/0.33  % Total time               : 0.046 s
% 0.22/0.33  % Maximum resident set size: 5628 pages
% 0.22/0.33  
% 0.22/0.33  % -------------------------------------------------
% 0.22/0.33  % User time                : 0.089 s
% 0.22/0.33  % System time              : 0.032 s
% 0.22/0.33  % Total time               : 0.120 s
% 0.22/0.33  % Maximum resident set size: 5376 pages
% 0.22/0.33  % E exiting
%------------------------------------------------------------------------------