TSTP Solution File: LCL623^1 by Leo-III---1.7.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.12
% Problem  : LCL623^1 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n018.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 : Tue May 21 00:06:35 EDT 2024

% Result   : Theorem 3.13s 1.68s
% Output   : Refutation 3.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   14 (   4 unt;   5 typ;   3 def)
%            Number of atoms       :   43 (   3 equ;   0 cnn)
%            Maximal formula atoms :    9 (   4 avg)
%            Number of connectives :   74 (   6   ~;   4   |;   0   &;  57   @)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   7 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :   24 (  24   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   4 con; 0-3 aty)
%            Number of variables   :   18 (   4   ^  14   !;   0   ?;  18   :)

% Comments : 
%------------------------------------------------------------------------------
thf(mimpl_type,type,
    mimpl: ( $i > $o ) > ( $i > $o ) > $i > $o ).

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

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(individuals_type,type,
    individuals: $tType ).

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

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

thf(r_type,type,
    r: $i > $i > $o ).

thf(1,conjecture,
    ! [A: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ r @ ( mimpl @ ( mbox @ r @ A ) @ A ) ) @ ( mbox @ r @ A ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',loeb) ).

thf(2,negated_conjecture,
    ~ ! [A: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ r @ ( mimpl @ ( mbox @ r @ A ) @ A ) ) @ ( mbox @ r @ A ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

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

thf(3,axiom,
    ! [A: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ r @ ( mimpl @ ( mbox @ r @ A ) @ A ) ) @ ( mbox @ r @ A ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',gl) ).

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

thf(17,plain,
    $false,
    inference(e,[status(thm)],[4,9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : LCL623^1 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.07/0.16  % Command  : run_Leo-III %s %d
% 0.16/0.37  % Computer : n018.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 300
% 0.16/0.37  % DateTime : Mon May 20 02:52:39 EDT 2024
% 0.16/0.37  % CPUTime  : 
% 0.97/0.88  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.13/1.00  % [INFO] 	 Parsing done (119ms). 
% 1.13/1.01  % [INFO] 	 Running in sequential loop mode. 
% 1.80/1.21  % [INFO] 	 eprover registered as external prover. 
% 1.80/1.21  % [INFO] 	 cvc4 registered as external prover. 
% 1.80/1.21  % [INFO] 	 Scanning for conjecture ... 
% 1.89/1.28  % [INFO] 	 Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ... 
% 1.89/1.30  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms). 
% 1.89/1.30  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.89/1.30  % [INFO] 	 Type checking passed. 
% 1.89/1.31  % [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.13/1.67  % External prover 'e' found a proof!
% 3.13/1.68  % [INFO] 	 Killing All external provers ... 
% 3.13/1.68  % Time passed: 1134ms (effective reasoning time: 665ms)
% 3.13/1.68  % 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.13/1.68  % Axioms used in derivation (1): gl
% 3.13/1.68  % No. of inferences in proof: 6
% 3.13/1.68  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1134 ms resp. 665 ms w/o parsing
% 3.25/1.70  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.25/1.70  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------