TSTP Solution File: LCL702^1 by Leo-III---1.7.15

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.15
% Problem  : LCL702^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d THM

% Computer : n027.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 Jun 24 11:15:26 EDT 2024

% Result   : Theorem 3.18s 1.75s
% Output   : Refutation 3.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    6
% Syntax   : Number of formulae    :    9 (   6 unt;   0 typ;   5 def)
%            Number of atoms       :   28 (   5 equ;   0 cnn)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :   69 (   7   ~;   5   |;   2   &;  50   @)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :   19 (  19   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   8 usr;   4 con; 0-3 aty)
%            Number of variables   :   25 (   9   ^  16   !;   0   ?;  25   :)

% Comments : 
%------------------------------------------------------------------------------
thf(mu_type,type,
    mu: $tType ).

thf(mimplies_type,type,
    mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(mimplies_def,definition,
    ( mimplies
    = ( ^ [A: $i > $o] : ( mor @ ( mnot @ A ) ) ) ) ).

thf(mforall_prop_type,type,
    mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).

thf(mforall_prop_def,definition,
    ( mforall_prop
    = ( ^ [A: ( $i > $o ) > $i > $o,B: $i] :
        ! [C: $i > $o] : ( A @ C @ B ) ) ) ).

thf(mbox_type,type,
    mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).

thf(mbox_def,definition,
    ( mbox
    = ( ^ [A: $i > $i > $o,B: $i > $o,C: $i] :
        ! [D: $i] :
          ( ~ ( A @ C @ D )
          | ( B @ D ) ) ) ) ).

thf(mtransitive_type,type,
    mtransitive: ( $i > $i > $o ) > $o ).

thf(mtransitive_def,definition,
    ( mtransitive
    = ( ^ [A: $i > $i > $o] :
        ! [B: $i,C: $i,D: $i] :
          ( ( ( A @ B @ C )
            & ( A @ C @ D ) )
         => ( A @ B @ D ) ) ) ) ).

thf(mvalid_type,type,
    mvalid: ( $i > $o ) > $o ).

thf(mvalid_def,definition,
    ( mvalid
    = ( '!' @ $i ) ) ).

thf(1,conjecture,
    ! [A: $i > $i > $o] :
      ( ( mtransitive @ A )
     => ( mvalid
        @ ( mforall_prop
          @ ^ [B: $i > $o] : ( mimplies @ ( mbox @ A @ B ) @ ( mbox @ A @ ( mbox @ A @ B ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).

thf(2,negated_conjecture,
    ~ ! [A: $i > $i > $o] :
        ( ( mtransitive @ A )
       => ( mvalid
          @ ( mforall_prop
            @ ^ [B: $i > $o] : ( mimplies @ ( mbox @ A @ B ) @ ( mbox @ A @ ( mbox @ A @ B ) ) ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ! [A: $i > $i > $o] :
        ( ! [B: $i,C: $i,D: $i] :
            ( ( ( A @ B @ C )
              & ( A @ C @ D ) )
           => ( A @ B @ D ) )
       => ! [B: $i,C: $i > $o] :
            ( ~ ! [D: $i] :
                  ( ~ ( A @ B @ D )
                  | ( C @ D ) )
            | ! [D: $i] :
                ( ~ ( A @ B @ D )
                | ! [E: $i] :
                    ( ~ ( A @ D @ E )
                    | ( C @ E ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(15,plain,
    $false,
    inference(e,[status(thm)],[3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL702^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% 0.07/0.12  % Command  : run_Leo-III %s %d THM
% 0.13/0.34  % Computer : n027.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Sat Jun 22 14:35:55 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 1.03/0.92  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.31/1.08  % [INFO] 	 Parsing done (157ms). 
% 1.31/1.08  % [INFO] 	 Running in sequential loop mode. 
% 1.90/1.28  % [INFO] 	 eprover registered as external prover. 
% 1.90/1.29  % [INFO] 	 Scanning for conjecture ... 
% 2.31/1.39  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.31/1.40  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.31/1.40  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.31/1.41  % [INFO] 	 Type checking passed. 
% 2.31/1.41  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ... 
% 3.18/1.75  % External prover 'e' found a proof!
% 3.18/1.75  % [INFO] 	 Killing All external provers ... 
% 3.18/1.75  % Time passed: 1211ms (effective reasoning time: 662ms)
% 3.18/1.75  % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 3.18/1.75  % Axioms used in derivation (0): 
% 3.18/1.75  % No. of inferences in proof: 4
% 3.18/1.75  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1211 ms resp. 662 ms w/o parsing
% 3.18/1.78  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.18/1.78  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------