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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : SYN355+1 : TPTP v8.1.2. Released v2.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 : Fri May 19 12:28:29 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
thf(big_r_type,type,
    big_r: $i > $o ).

thf(big_p_type,type,
    big_p: $i > $o ).

thf(big_q_type,type,
    big_q: $i > $o ).

thf(1,conjecture,
    ( ( ! [A: $i] :
          ( ( big_r @ A )
         => ( big_p @ A ) )
      & ! [A: $i] :
          ( ~ ( big_q @ A )
         => ( big_r @ A ) ) )
   => ! [A: $i] :
        ( ( big_p @ A )
        | ( big_q @ A ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2106) ).

thf(2,negated_conjecture,
    ~ ( ( ! [A: $i] :
            ( ( big_r @ A )
           => ( big_p @ A ) )
        & ! [A: $i] :
            ( ~ ( big_q @ A )
           => ( big_r @ A ) ) )
     => ! [A: $i] :
          ( ( big_p @ A )
          | ( big_q @ A ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ( ( ! [A: $i] :
            ( ( big_r @ A )
           => ( big_p @ A ) )
        & ! [A: $i] :
            ( ~ ( big_q @ A )
           => ( big_r @ A ) ) )
     => ! [A: $i] :
          ( ( big_p @ A )
          | ( big_q @ A ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN355+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.15  % Command  : run_Leo-III %s %d
% 0.16/0.37  % Computer : n002.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 : Thu May 18 20:07:51 EDT 2023
% 0.16/0.37  % CPUTime  : 
% 0.99/0.85  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.26/0.96  % [INFO] 	 Parsing done (108ms). 
% 1.26/0.97  % [INFO] 	 Running in sequential loop mode. 
% 1.64/1.17  % [INFO] 	 eprover registered as external prover. 
% 1.64/1.17  % [INFO] 	 cvc4 registered as external prover. 
% 1.64/1.18  % [INFO] 	 Scanning for conjecture ... 
% 1.76/1.22  % [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ... 
% 1.84/1.24  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.84/1.24  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.84/1.25  % [INFO] 	 Type checking passed. 
% 1.84/1.25  % [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 ... 
% 2.65/1.54  % External prover 'e' found a proof!
% 2.65/1.54  % [INFO] 	 Killing All external provers ... 
% 2.65/1.54  % Time passed: 1018ms (effective reasoning time: 569ms)
% 2.65/1.54  % 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)>
% 2.65/1.54  % Axioms used in derivation (0): 
% 2.65/1.54  % No. of inferences in proof: 4
% 2.65/1.54  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1018 ms resp. 569 ms w/o parsing
% 2.65/1.59  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.65/1.59  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------