TSTP Solution File: SYO179^5 by Leo-III---1.7.15

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.15
% Problem  : SYO179^5 : TPTP v8.2.0. Released v4.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 20:50:29 EDT 2024

% Result   : Theorem 3.35s 2.08s
% Output   : Refutation 3.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    4 (   1 unt;   0 typ;   0 def)
%            Number of atoms       :  109 (   0 equ;   0 cnn)
%            Maximal formula atoms :   36 (  27 avg)
%            Number of connectives :  323 (   2   ~;  48   |;  54   &; 216   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (  15 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :   18 (   0   ^   0   !;  18   ?;  18   :)

% Comments : 
%------------------------------------------------------------------------------
thf(cG_type,type,
    cG: $i > $i > $o ).

thf(cR_type,type,
    cR: $i > $i > $o ).

thf(cF_type,type,
    cF: $i ).

thf(cE_type,type,
    cE: $i ).

thf(cD_type,type,
    cD: $i ).

thf(cC_type,type,
    cC: $i ).

thf(cB_type,type,
    cB: $i ).

thf(cA_type,type,
    cA: $i ).

thf(1,conjecture,
    ( ( ( ( cR @ cA @ cB )
        | ( cG @ cA @ cB ) )
      & ( ( cR @ cA @ cC )
        | ( cG @ cA @ cC ) )
      & ( ( cR @ cA @ cD )
        | ( cG @ cA @ cD ) )
      & ( ( cR @ cA @ cE )
        | ( cG @ cA @ cE ) )
      & ( ( cR @ cA @ cF )
        | ( cG @ cA @ cF ) )
      & ( ( cR @ cB @ cC )
        | ( cG @ cB @ cC ) )
      & ( ( cR @ cB @ cD )
        | ( cG @ cB @ cD ) )
      & ( ( cR @ cB @ cE )
        | ( cG @ cB @ cE ) )
      & ( ( cR @ cB @ cF )
        | ( cG @ cB @ cF ) )
      & ( ( cR @ cC @ cD )
        | ( cG @ cC @ cD ) )
      & ( ( cR @ cC @ cE )
        | ( cG @ cC @ cE ) )
      & ( ( cR @ cC @ cF )
        | ( cG @ cC @ cF ) )
      & ( ( cR @ cD @ cE )
        | ( cG @ cD @ cE ) )
      & ( ( cR @ cD @ cF )
        | ( cG @ cD @ cF ) )
      & ( ( cR @ cE @ cF )
        | ( cG @ cE @ cF ) ) )
   => ( ? [A: $i,B: $i,C: $i] :
          ( ( cR @ A @ B )
          & ( cR @ A @ C )
          & ( cR @ B @ C ) )
      | ? [A: $i,B: $i,C: $i] :
          ( ( cG @ A @ B )
          & ( cG @ A @ C )
          & ( cG @ B @ C ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cSIX_THEOREM_B) ).

thf(2,negated_conjecture,
    ~ ( ( ( ( cR @ cA @ cB )
          | ( cG @ cA @ cB ) )
        & ( ( cR @ cA @ cC )
          | ( cG @ cA @ cC ) )
        & ( ( cR @ cA @ cD )
          | ( cG @ cA @ cD ) )
        & ( ( cR @ cA @ cE )
          | ( cG @ cA @ cE ) )
        & ( ( cR @ cA @ cF )
          | ( cG @ cA @ cF ) )
        & ( ( cR @ cB @ cC )
          | ( cG @ cB @ cC ) )
        & ( ( cR @ cB @ cD )
          | ( cG @ cB @ cD ) )
        & ( ( cR @ cB @ cE )
          | ( cG @ cB @ cE ) )
        & ( ( cR @ cB @ cF )
          | ( cG @ cB @ cF ) )
        & ( ( cR @ cC @ cD )
          | ( cG @ cC @ cD ) )
        & ( ( cR @ cC @ cE )
          | ( cG @ cC @ cE ) )
        & ( ( cR @ cC @ cF )
          | ( cG @ cC @ cF ) )
        & ( ( cR @ cD @ cE )
          | ( cG @ cD @ cE ) )
        & ( ( cR @ cD @ cF )
          | ( cG @ cD @ cF ) )
        & ( ( cR @ cE @ cF )
          | ( cG @ cE @ cF ) ) )
     => ( ? [A: $i,B: $i,C: $i] :
            ( ( cR @ A @ B )
            & ( cR @ A @ C )
            & ( cR @ B @ C ) )
        | ? [A: $i,B: $i,C: $i] :
            ( ( cG @ A @ B )
            & ( cG @ A @ C )
            & ( cG @ B @ C ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ( ( ( ( cR @ cA @ cB )
          | ( cG @ cA @ cB ) )
        & ( ( cR @ cA @ cC )
          | ( cG @ cA @ cC ) )
        & ( ( cR @ cA @ cD )
          | ( cG @ cA @ cD ) )
        & ( ( cR @ cA @ cE )
          | ( cG @ cA @ cE ) )
        & ( ( cR @ cA @ cF )
          | ( cG @ cA @ cF ) )
        & ( ( cR @ cB @ cC )
          | ( cG @ cB @ cC ) )
        & ( ( cR @ cB @ cD )
          | ( cG @ cB @ cD ) )
        & ( ( cR @ cB @ cE )
          | ( cG @ cB @ cE ) )
        & ( ( cR @ cB @ cF )
          | ( cG @ cB @ cF ) )
        & ( ( cR @ cC @ cD )
          | ( cG @ cC @ cD ) )
        & ( ( cR @ cC @ cE )
          | ( cG @ cC @ cE ) )
        & ( ( cR @ cC @ cF )
          | ( cG @ cC @ cF ) )
        & ( ( cR @ cD @ cE )
          | ( cG @ cD @ cE ) )
        & ( ( cR @ cD @ cF )
          | ( cG @ cD @ cF ) )
        & ( ( cR @ cE @ cF )
          | ( cG @ cE @ cF ) ) )
     => ( ? [A: $i,B: $i,C: $i] :
            ( ( cR @ A @ B )
            & ( cR @ A @ C )
            & ( cR @ B @ C ) )
        | ? [A: $i,B: $i,C: $i] :
            ( ( cG @ A @ B )
            & ( cG @ A @ C )
            & ( cG @ B @ C ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11  % Problem  : SYO179^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.11  % Command  : run_Leo-III %s %d THM
% 0.11/0.32  % Computer : n027.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Sun Jun 23 09:20:24 EDT 2024
% 0.11/0.32  % CPUTime  : 
% 0.89/0.87  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 0.99/1.02  % [INFO] 	 Parsing done (144ms). 
% 1.21/1.03  % [INFO] 	 Running in sequential loop mode. 
% 1.64/1.32  % [INFO] 	 eprover registered as external prover. 
% 1.64/1.33  % [INFO] 	 Scanning for conjecture ... 
% 1.76/1.43  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.96/1.46  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.96/1.46  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.96/1.46  % [INFO] 	 Type checking passed. 
% 1.96/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.35/2.07  % External prover 'e' found a proof!
% 3.35/2.07  % [INFO] 	 Killing All external provers ... 
% 3.35/2.07  % Time passed: 1583ms (effective reasoning time: 1044ms)
% 3.35/2.07  % 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.35/2.08  % Axioms used in derivation (0): 
% 3.35/2.08  % No. of inferences in proof: 4
% 3.35/2.08  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1583 ms resp. 1044 ms w/o parsing
% 3.43/2.12  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.43/2.12  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------