TSTP Solution File: SWV128+1 by Leo-III---1.7.7

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : SWV128+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n017.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 : Fri May 19 12:13:58 EDT 2023

% Result   : Theorem 6.12s 2.41s
% Output   : Refutation 6.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   27 (   5 unt;  19 typ;   0 def)
%            Number of atoms       :   77 (  21 equ;   0 cnn)
%            Maximal formula atoms :   24 (   9 avg)
%            Number of connectives :  249 (   3   ~;   0   |;  51   &; 177   @)
%                                         (   0 <=>;  18  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   7 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    9 (   9   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   21 (  19 usr;  16 con; 0-3 aty)
%            Number of variables   :   24 (   0   ^;  24   !;   0   ?;  24   :)

% Comments : 
%------------------------------------------------------------------------------
thf(t_defuse_type,type,
    t_defuse: $i ).

thf(use_type,type,
    use: $i ).

thf(tvar_defuse_type,type,
    tvar_defuse: $i ).

thf(leq_type,type,
    leq: $i > $i > $o ).

thf(n0_type,type,
    n0: $i ).

thf(minus_type,type,
    minus: $i > $i > $i ).

thf(m_measvars_type,type,
    m_measvars: $i ).

thf(n1_type,type,
    n1: $i ).

thf(n_steps_type,type,
    n_steps: $i ).

thf(a_select3_type,type,
    a_select3: $i > $i > $i > $i ).

thf(rho_defuse_type,type,
    rho_defuse: $i ).

thf(n7_type,type,
    n7: $i ).

thf(tr_defuse_type,type,
    tr_defuse: $i ).

thf(n_statevars_type,type,
    n_statevars: $i ).

thf(a_select2_type,type,
    a_select2: $i > $i > $i ).

thf(xinit_defuse_type,type,
    xinit_defuse: $i ).

thf(xinit_mean_defuse_type,type,
    xinit_mean_defuse: $i ).

thf(z_defuse_type,type,
    z_defuse: $i ).

thf(true_type,type,
    true: $o ).

thf(48,axiom,
    true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ttrue) ).

thf(332,plain,
    true,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[48]) ).

thf(1,conjecture,
    ( ( ( t_defuse = use )
      & ( tvar_defuse = use )
      & ! [A: $i,B: $i] :
          ( ( ( leq @ n0 @ A )
            & ( leq @ n0 @ B )
            & ( leq @ A @ ( minus @ m_measvars @ n1 ) )
            & ( leq @ B @ ( minus @ n_steps @ n1 ) ) )
         => ( ( a_select3 @ rho_defuse @ A @ B )
            = use ) )
      & ! [A: $i,B: $i] :
          ( ( ( leq @ n0 @ A )
            & ( leq @ n0 @ B )
            & ( leq @ A @ n7 )
            & ( leq @ B @ ( minus @ n_steps @ n1 ) ) )
         => ( ( a_select3 @ tr_defuse @ A @ B )
            = use ) )
      & ! [A: $i] :
          ( ( ( leq @ n0 @ A )
            & ( leq @ A @ ( minus @ n_statevars @ n1 ) ) )
         => ( ( a_select2 @ xinit_defuse @ A )
            = use ) )
      & ! [A: $i] :
          ( ( ( leq @ n0 @ A )
            & ( leq @ A @ ( minus @ n_statevars @ n1 ) ) )
         => ( ( a_select2 @ xinit_mean_defuse @ A )
            = use ) )
      & ! [A: $i,B: $i] :
          ( ( ( leq @ n0 @ A )
            & ( leq @ n0 @ B )
            & ( leq @ A @ ( minus @ m_measvars @ n1 ) )
            & ( leq @ B @ ( minus @ n_steps @ n1 ) ) )
         => ( ( a_select3 @ z_defuse @ A @ B )
            = use ) ) )
   => true ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thruster_inuse_0001) ).

thf(2,negated_conjecture,
    ~ ( ( ( t_defuse = use )
        & ( tvar_defuse = use )
        & ! [A: $i,B: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ n0 @ B )
              & ( leq @ A @ ( minus @ m_measvars @ n1 ) )
              & ( leq @ B @ ( minus @ n_steps @ n1 ) ) )
           => ( ( a_select3 @ rho_defuse @ A @ B )
              = use ) )
        & ! [A: $i,B: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ n0 @ B )
              & ( leq @ A @ n7 )
              & ( leq @ B @ ( minus @ n_steps @ n1 ) ) )
           => ( ( a_select3 @ tr_defuse @ A @ B )
              = use ) )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ ( minus @ n_statevars @ n1 ) ) )
           => ( ( a_select2 @ xinit_defuse @ A )
              = use ) )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ ( minus @ n_statevars @ n1 ) ) )
           => ( ( a_select2 @ xinit_mean_defuse @ A )
              = use ) )
        & ! [A: $i,B: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ n0 @ B )
              & ( leq @ A @ ( minus @ m_measvars @ n1 ) )
              & ( leq @ B @ ( minus @ n_steps @ n1 ) ) )
           => ( ( a_select3 @ z_defuse @ A @ B )
              = use ) ) )
     => true ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(94,plain,
    ~ ( ( ( t_defuse = use )
        & ( tvar_defuse = use )
        & ! [A: $i,B: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ n0 @ B )
              & ( leq @ A @ ( minus @ m_measvars @ n1 ) )
              & ( leq @ B @ ( minus @ n_steps @ n1 ) ) )
           => ( ( a_select3 @ rho_defuse @ A @ B )
              = use ) )
        & ! [A: $i,B: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ n0 @ B )
              & ( leq @ A @ n7 )
              & ( leq @ B @ ( minus @ n_steps @ n1 ) ) )
           => ( ( a_select3 @ tr_defuse @ A @ B )
              = use ) )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ ( minus @ n_statevars @ n1 ) ) )
           => ( ( a_select2 @ xinit_defuse @ A )
              = use ) )
        & ! [A: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ A @ ( minus @ n_statevars @ n1 ) ) )
           => ( ( a_select2 @ xinit_mean_defuse @ A )
              = use ) )
        & ! [A: $i,B: $i] :
            ( ( ( leq @ n0 @ A )
              & ( leq @ n0 @ B )
              & ( leq @ A @ ( minus @ m_measvars @ n1 ) )
              & ( leq @ B @ ( minus @ n_steps @ n1 ) ) )
           => ( ( a_select3 @ z_defuse @ A @ B )
              = use ) ) )
     => true ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(98,plain,
    ~ true,
    inference(cnf,[status(esa)],[94]) ).

thf(565,plain,
    $false,
    inference(rewrite,[status(thm)],[332,98]) ).

thf(566,plain,
    $false,
    inference(simp,[status(thm)],[565]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV128+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.36  % Computer : n017.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Fri May 19 01:41:17 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 0.90/0.83  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.21/0.99  % [INFO] 	 Parsing done (153ms). 
% 1.46/0.99  % [INFO] 	 Running in sequential loop mode. 
% 1.79/1.20  % [INFO] 	 eprover registered as external prover. 
% 1.79/1.20  % [INFO] 	 cvc4 registered as external prover. 
% 1.79/1.20  % [INFO] 	 Scanning for conjecture ... 
% 2.12/1.29  % [INFO] 	 Found a conjecture and 91 axioms. Running axiom selection ... 
% 2.42/1.37  % [INFO] 	 Axiom selection finished. Selected 91 axioms (removed 0 axioms). 
% 2.61/1.44  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.72/1.46  % [INFO] 	 Type checking passed. 
% 2.72/1.46  % [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 ... 
% 6.12/2.41  % [INFO] 	 Killing All external provers ... 
% 6.12/2.41  % Time passed: 1895ms (effective reasoning time: 1409ms)
% 6.12/2.41  % 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)>
% 6.12/2.41  % Axioms used in derivation (1): ttrue
% 6.12/2.41  % No. of inferences in proof: 8
% 6.12/2.41  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1895 ms resp. 1409 ms w/o parsing
% 6.12/2.43  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.12/2.43  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------