↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ITP123^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 : n006.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.25s 0.32s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   24 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :   45 (   6 equ;   0 cnn)
%            Maximal formula atoms :    7 (   1 avg)
%            Number of connectives :  202 (  19   ~;  12   |;   3   &; 162   @)
%                                         (   1 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   7 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   36 (   0   ^;  36   !;   0   ?;  36   :)

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

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

thf(decl_51,type,
    less: a > a > $o ).

thf(decl_52,type,
    less_eq: a > a > $o ).

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

thf(decl_54,type,
    x: a ).

thf(decl_55,type,
    y: a ).

thf(decl_56,type,
    z: a ).

thf(conj_4,conjecture,
    less_eq @ x @ ( sup @ ( inf @ y @ ( sup @ x @ z ) ) @ z ),
    file('/export/starexec/sandbox2/tmp/tmp.Kxa7TNu1tx/E---3.1_1230853.p',conj_4) ).

thf(fact_129_local_Osup_Ostrict__boundedE,axiom,
    ! [X3: a,X9: a,X4: a] :
      ( ( less @ ( sup @ X3 @ X9 ) @ X4 )
     => ~ ( ( less @ X3 @ X4 )
         => ~ ( less @ X9 @ X4 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.Kxa7TNu1tx/E---3.1_1230853.p',fact_129_local_Osup_Ostrict__boundedE) ).

thf(fact_39_local_Osup_Ocommute,axiom,
    ! [X4: a,X3: a] :
      ( ( sup @ X4 @ X3 )
      = ( sup @ X3 @ X4 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.Kxa7TNu1tx/E---3.1_1230853.p',fact_39_local_Osup_Ocommute) ).

thf(fact_50_local_Odual__order_Oorder__iff__strict,axiom,
    ! [X3: a,X4: a] :
      ( ( less_eq @ X3 @ X4 )
    <=> ( ( less @ X3 @ X4 )
        | ( X4 = X3 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.Kxa7TNu1tx/E---3.1_1230853.p',fact_50_local_Odual__order_Oorder__iff__strict) ).

thf(fact_128_local_Oless__supI2,axiom,
    ! [X1: a,X3: a,X4: a] :
      ( ( less @ X1 @ X3 )
     => ( less @ X1 @ ( sup @ X4 @ X3 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.Kxa7TNu1tx/E---3.1_1230853.p',fact_128_local_Oless__supI2) ).

thf(conj_3,hypothesis,
    less @ ( sup @ x @ ( inf @ y @ z ) ) @ ( inf @ y @ ( sup @ x @ z ) ),
    file('/export/starexec/sandbox2/tmp/tmp.Kxa7TNu1tx/E---3.1_1230853.p',conj_3) ).

thf(c_0_6,negated_conjecture,
    ~ ( less_eq @ x @ ( sup @ ( inf @ y @ ( sup @ x @ z ) ) @ z ) ),
    inference(assume_negation,[status(cth)],[conj_4]) ).

thf(c_0_7,negated_conjecture,
    ~ ( less_eq @ x @ ( sup @ ( inf @ y @ ( sup @ x @ z ) ) @ z ) ),
    inference(fof_simplification,[status(thm)],[c_0_6]) ).

thf(c_0_8,plain,
    ! [X3: a,X9: a,X4: a] :
      ( ( less @ ( sup @ X3 @ X9 ) @ X4 )
     => ~ ( ( less @ X3 @ X4 )
         => ~ ( less @ X9 @ X4 ) ) ),
    inference(fof_simplification,[status(thm)],[fact_129_local_Osup_Ostrict__boundedE]) ).

thf(c_0_9,negated_conjecture,
    ~ ( less_eq @ x @ ( sup @ ( inf @ y @ ( sup @ x @ z ) ) @ z ) ),
    inference(fof_nnf,[status(thm)],[c_0_7]) ).

thf(c_0_10,plain,
    ! [X435: a,X436: a] :
      ( ( sup @ X435 @ X436 )
      = ( sup @ X436 @ X435 ) ),
    inference(variable_rename,[status(thm)],[fact_39_local_Osup_Ocommute]) ).

thf(c_0_11,plain,
    ! [X605: a,X606: a] :
      ( ( ~ ( less_eq @ X605 @ X606 )
        | ( less @ X605 @ X606 )
        | ( X606 = X605 ) )
      & ( ~ ( less @ X605 @ X606 )
        | ( less_eq @ X605 @ X606 ) )
      & ( ( X606 != X605 )
        | ( less_eq @ X605 @ X606 ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_50_local_Odual__order_Oorder__iff__strict])])])]) ).

thf(c_0_12,plain,
    ! [X671: a,X672: a,X673: a] :
      ( ~ ( less @ X671 @ X672 )
      | ( less @ X671 @ ( sup @ X673 @ X672 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_128_local_Oless__supI2])])]) ).

thf(c_0_13,plain,
    ! [X674: a,X675: a,X676: a] :
      ( ( ( less @ X674 @ X676 )
        | ~ ( less @ ( sup @ X674 @ X675 ) @ X676 ) )
      & ( ( less @ X675 @ X676 )
        | ~ ( less @ ( sup @ X674 @ X675 ) @ X676 ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).

thf(c_0_14,negated_conjecture,
    ~ ( less_eq @ x @ ( sup @ ( inf @ y @ ( sup @ x @ z ) ) @ z ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

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

thf(c_0_16,plain,
    ! [X1: a,X2: a] :
      ( ( less_eq @ X1 @ X2 )
      | ~ ( less @ X1 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

thf(c_0_17,plain,
    ! [X1: a,X3: a,X2: a] :
      ( ( less @ X1 @ ( sup @ X3 @ X2 ) )
      | ~ ( less @ X1 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

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

thf(c_0_19,hypothesis,
    less @ ( sup @ x @ ( inf @ y @ z ) ) @ ( inf @ y @ ( sup @ x @ z ) ),
    inference(split_conjunct,[status(thm)],[conj_3]) ).

thf(c_0_20,negated_conjecture,
    ~ ( less_eq @ x @ ( sup @ z @ ( inf @ y @ ( sup @ x @ z ) ) ) ),
    inference(rw,[status(thm)],[c_0_14,c_0_15]) ).

thf(c_0_21,plain,
    ! [X1: a,X2: a,X3: a] :
      ( ( less_eq @ X1 @ ( sup @ X2 @ X3 ) )
      | ~ ( less @ X1 @ X3 ) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

thf(c_0_22,hypothesis,
    less @ x @ ( inf @ y @ ( sup @ x @ z ) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

thf(c_0_23,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : ITP123^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.08/0.19  % Computer : n006.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Tue Sep 29 19:56:39 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.24  Running higher-order theorem proving
% 0.08/0.26  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.Kxa7TNu1tx/E---3.1_1230853.p
% 0.25/0.32  % Version: 3.5.1-ho
% 0.25/0.32  % Preprocessing class: HSLSSMSSSSSNHSA.
% 0.25/0.32  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.32  % Starting full_lambda_9 with 1500s (5) cores
% 0.25/0.32  % Starting new_ho_11 with 300s (1) cores
% 0.25/0.32  % Starting sh2l with 300s (1) cores
% 0.25/0.32  % Starting new_bool_6 with 300s (1) cores
% 0.25/0.32  % new_bool_6 with pid 1230892 completed with status 0
% 0.25/0.32  % Result found by new_bool_6
% 0.25/0.32  % Preprocessing class: HSLSSMSSSSSNHSA.
% 0.25/0.32  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.32  % Starting full_lambda_9 with 1500s (5) cores
% 0.25/0.32  % Starting new_ho_11 with 300s (1) cores
% 0.25/0.32  % Starting sh2l with 300s (1) cores
% 0.25/0.32  % Starting new_bool_6 with 300s (1) cores
% 0.25/0.32  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,1.0,,1,20000,1.0))
% 0.25/0.32  % SinE strategy is GSinE(CountFormulas,hypos,1.0,,1,20000,1.0)
% 0.25/0.32  % Search class: HGHSM-FSLS21-MHSFFFNN
% 0.25/0.32  % partial match(3): HGHSM-FSLM31-MHSFFFBN
% 0.25/0.32  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.32  % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.32  % SubtermCWHack with pid 1230894 completed with status 0
% 0.25/0.32  % Result found by SubtermCWHack
% 0.25/0.32  % Preprocessing class: HSLSSMSSSSSNHSA.
% 0.25/0.32  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.32  % Starting full_lambda_9 with 1500s (5) cores
% 0.25/0.32  % Starting new_ho_11 with 300s (1) cores
% 0.25/0.32  % Starting sh2l with 300s (1) cores
% 0.25/0.32  % Starting new_bool_6 with 300s (1) cores
% 0.25/0.32  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,1.0,,1,20000,1.0))
% 0.25/0.32  % SinE strategy is GSinE(CountFormulas,hypos,1.0,,1,20000,1.0)
% 0.25/0.32  % Search class: HGHSM-FSLS21-MHSFFFNN
% 0.25/0.32  % partial match(3): HGHSM-FSLM31-MHSFFFBN
% 0.25/0.32  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.32  % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.32  % Preprocessing time       : 0.002 s
% 0.25/0.32  
% 0.25/0.32  % Proof found!
% 0.25/0.32  % SZS status Theorem
% 0.25/0.32  % SZS output start CNFRefutation
% See solution above
% 0.25/0.32  % Parsed axioms                        : 290
% 0.25/0.32  % Removed by relevancy pruning/SinE    : 132
% 0.25/0.32  % Initial clauses                      : 211
% 0.25/0.32  % Removed in clause preprocessing      : 5
% 0.25/0.32  % Initial clauses in saturation        : 206
% 0.25/0.32  % Processed clauses                    : 1013
% 0.25/0.32  % ...of these trivial                  : 63
% 0.25/0.32  % ...subsumed                          : 736
% 0.25/0.32  % ...remaining for further processing  : 213
% 0.25/0.32  % Other redundant clauses eliminated   : 26
% 0.25/0.32  % Clauses deleted for lack of memory   : 0
% 0.25/0.32  % Backward-subsumed                    : 1
% 0.25/0.32  % Backward-rewritten                   : 14
% 0.25/0.32  % Generated clauses                    : 3000
% 0.25/0.32  % ...of the previous two non-redundant : 2412
% 0.25/0.32  % ...aggressively subsumed             : 0
% 0.25/0.32  % Contextual simplify-reflections      : 2
% 0.25/0.32  % Paramodulations                      : 2974
% 0.25/0.32  % Factorizations                       : 0
% 0.25/0.32  % NegExts                              : 0
% 0.25/0.32  % Equation resolutions                 : 26
% 0.25/0.32  % Disequality decompositions           : 0
% 0.25/0.32  % Total rewrite steps                  : 810
% 0.25/0.32  % ...of those cached                   : 613
% 0.25/0.32  % Propositional unsat checks           : 0
% 0.25/0.32  %    Propositional check models        : 0
% 0.25/0.32  %    Propositional check unsatisfiable : 0
% 0.25/0.32  %    Propositional clauses             : 0
% 0.25/0.32  %    Propositional clauses after purity: 0
% 0.25/0.32  %    Propositional unsat core size     : 0
% 0.25/0.32  %    Propositional preprocessing time  : 0.000
% 0.25/0.32  %    Propositional encoding time       : 0.000
% 0.25/0.32  %    Propositional solver time         : 0.000
% 0.25/0.32  %    Success case prop preproc time    : 0.000
% 0.25/0.32  %    Success case prop encoding time   : 0.000
% 0.25/0.32  %    Success case prop solver time     : 0.000
% 0.25/0.32  % Current number of processed clauses  : 176
% 0.25/0.32  %    Positive orientable unit clauses  : 46
% 0.25/0.32  %    Positive unorientable unit clauses: 4
% 0.25/0.32  %    Negative unit clauses             : 40
% 0.25/0.32  %    Non-unit-clauses                  : 86
% 0.25/0.32  % Current number of unprocessed clauses: 1593
% 0.25/0.32  % ...number of literals in the above   : 3214
% 0.25/0.32  % Current number of archived formulas  : 0
% 0.25/0.32  % Current number of archived clauses   : 15
% 0.25/0.32  % Clause-clause subsumption calls (NU) : 1359
% 0.25/0.32  % Rec. Clause-clause subsumption calls : 1250
% 0.25/0.32  % Non-unit clause-clause subsumptions  : 324
% 0.25/0.32  % Unit Clause-clause subsumption calls : 55
% 0.25/0.32  % Rewrite failures with RHS unbound    : 0
% 0.25/0.32  % BW rewrite match attempts            : 77
% 0.25/0.32  % BW rewrite match successes           : 42
% 0.25/0.32  % Condensation attempts                : 0
% 0.25/0.32  % Condensation successes               : 0
% 0.25/0.32  % Termbank termtop insertions          : 36692
% 0.25/0.32  % Search garbage collected termcells   : 4334
% 0.25/0.32  
% 0.25/0.32  % -------------------------------------------------
% 0.25/0.32  % User time                : 0.036 s
% 0.25/0.32  % System time              : 0.004 s
% 0.25/0.32  % Total time               : 0.040 s
% 0.25/0.32  % Maximum resident set size: 4412 pages
% 0.25/0.32  
% 0.25/0.32  % -------------------------------------------------
% 0.25/0.32  % User time                : 0.043 s
% 0.25/0.32  % System time              : 0.010 s
% 0.25/0.32  % Total time               : 0.053 s
% 0.25/0.32  % Maximum resident set size: 5120 pages
% 0.25/0.32  % E exiting
%------------------------------------------------------------------------------