TSTP Solution File: SYO418^1 by Leo-III-SAT---1.7.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.12
% Problem  : SYO418^1 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n002.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 09:00:11 EDT 2024

% Result   : Theorem 3.31s 1.82s
% Output   : Refutation 3.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   31 (  11 unt;  11 typ;   5 def)
%            Number of atoms       :   60 (   7 equ;   0 cnn)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   92 (  19   ~;  10   |;   0   &;  63   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :   26 (  26   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   16 (  13 usr;   6 con; 0-3 aty)
%            Number of variables   :   21 (   5   ^  14   !;   2   ?;  21   :)

% 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(mserial_type,type,
    mserial: ( $i > $i > $o ) > $o ).

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

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

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

thf(rel_d_type,type,
    rel_d: $i > $i > $o ).

thf(mbox_d_type,type,
    mbox_d: ( $i > $o ) > $i > $o ).

thf(mbox_d_def,definition,
    ( mbox_d
    = ( ^ [A: $i > $o,B: $i] :
        ! [C: $i] :
          ( ~ ( rel_d @ B @ C )
          | ( A @ C ) ) ) ) ).

thf(mdia_d_type,type,
    mdia_d: ( $i > $o ) > $i > $o ).

thf(mdia_d_def,definition,
    ( mdia_d
    = ( ^ [A: $i > $o] : ( mnot @ ( mbox_d @ ( mnot @ A ) ) ) ) ) ).

thf(p_type,type,
    p: $i > $o ).

thf(q_type,type,
    q: $i > $o ).

thf(sk1_type,type,
    sk1: $i ).

thf(sk2_type,type,
    sk2: $i > $i ).

thf(3,axiom,
    mserial @ rel_d,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a1) ).

thf(10,plain,
    ! [A: $i] :
    ? [B: $i] : ( rel_d @ A @ B ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(11,plain,
    ! [A: $i] : ( rel_d @ A @ ( sk2 @ A ) ),
    inference(cnf,[status(esa)],[10]) ).

thf(1,conjecture,
    mvalid @ ( mimplies @ ( mbox_d @ p ) @ ( mdia_d @ ( mimplies @ q @ p ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove) ).

thf(2,negated_conjecture,
    ~ ( mvalid @ ( mimplies @ ( mbox_d @ p ) @ ( mdia_d @ ( mimplies @ q @ p ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(4,plain,
    ~ ! [A: $i] :
        ( ~ ! [B: $i] :
              ( ~ ( rel_d @ A @ B )
              | ( p @ B ) )
        | ~ ! [B: $i] :
              ( ~ ( rel_d @ A @ B )
              | ~ ( ~ ( q @ B )
                  | ( p @ B ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(6,plain,
    ! [A: $i] :
      ( ~ ( rel_d @ sk1 @ A )
      | ~ ( p @ A ) ),
    inference(cnf,[status(esa)],[4]) ).

thf(9,plain,
    ! [A: $i] :
      ( ~ ( rel_d @ sk1 @ A )
      | ~ ( p @ A ) ),
    inference(simp,[status(thm)],[6]) ).

thf(18,plain,
    ! [B: $i,A: $i] :
      ( ~ ( p @ B )
      | ( ( rel_d @ A @ ( sk2 @ A ) )
       != ( rel_d @ sk1 @ B ) ) ),
    inference(paramod_ordered,[status(thm)],[11,9]) ).

thf(19,plain,
    ~ ( p @ ( sk2 @ sk1 ) ),
    inference(pattern_uni,[status(thm)],[18:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 @ sk1 ))]]) ).

thf(7,plain,
    ! [A: $i] :
      ( ~ ( rel_d @ sk1 @ A )
      | ( p @ A ) ),
    inference(cnf,[status(esa)],[4]) ).

thf(12,plain,
    ! [B: $i,A: $i] :
      ( ( p @ B )
      | ( ( rel_d @ A @ ( sk2 @ A ) )
       != ( rel_d @ sk1 @ B ) ) ),
    inference(paramod_ordered,[status(thm)],[11,7]) ).

thf(13,plain,
    p @ ( sk2 @ sk1 ),
    inference(pattern_uni,[status(thm)],[12:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 @ sk1 ))]]) ).

thf(20,plain,
    ~ $true,
    inference(rewrite,[status(thm)],[19,13]) ).

thf(21,plain,
    $false,
    inference(simp,[status(thm)],[20]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYO418^1 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.15  % Command  : run_Leo-III %s %d
% 0.16/0.36  % Computer : n002.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % 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 11:02:24 EDT 2024
% 0.16/0.37  % CPUTime  : 
% 1.04/0.94  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.45/1.11  % [INFO] 	 Parsing done (165ms). 
% 1.45/1.12  % [INFO] 	 Running in sequential loop mode. 
% 1.94/1.33  % [INFO] 	 nitpick registered as external prover. 
% 2.10/1.34  % [INFO] 	 Scanning for conjecture ... 
% 2.39/1.44  % [INFO] 	 Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ... 
% 2.39/1.46  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms). 
% 2.49/1.46  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.49/1.46  % [INFO] 	 Type checking passed. 
% 2.49/1.47  % [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.31/1.82  % [INFO] 	 Killing All external provers ... 
% 3.31/1.82  % Time passed: 1265ms (effective reasoning time: 699ms)
% 3.31/1.82  % 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.31/1.82  % Axioms used in derivation (1): a1
% 3.31/1.82  % No. of inferences in proof: 15
% 3.31/1.82  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1265 ms resp. 699 ms w/o parsing
% 3.38/1.86  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.38/1.86  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------