TSTP Solution File: PUZ001+2 by Leo-III---1.7.7

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : PUZ001+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n009.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 11:47:22 EDT 2023

% Result   : Theorem 3.37s 1.82s
% Output   : Refutation 3.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   20 (   4 unt;  14 typ;   0 def)
%            Number of atoms       :   66 (  14 equ;   0 cnn)
%            Maximal formula atoms :   37 (  11 avg)
%            Number of connectives :  224 (  16   ~;   4   |;  40   &; 148   @)
%                                         (   0 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   27 (  12 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   14 (  14   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   17 (  14 usr;  12 con; 0-4 aty)
%            Number of variables   :   59 (   0   ^;  28   !;  31   ?;  59   :)

% Comments : 
%------------------------------------------------------------------------------
thf(predicate2_type,type,
    predicate2: $i > $i > $i > $i > $o ).

thf(kill_type,type,
    kill: $i ).

thf('\'AuntAgatha\'_type',type,
    '\'AuntAgatha\'': $i ).

thf(predicate1_type,type,
    predicate1: $i > $i > $i > $o ).

thf(live_type,type,
    live: $i ).

thf(modifier_pp_type,type,
    modifier_pp: $i > $i > $i > $o ).

thf(in_type,type,
    in: $i ).

thf('\'DreadburyMansion\'_type',type,
    '\'DreadburyMansion\'': $i ).

thf('\'Butler\'_type',type,
    '\'Butler\'': $i ).

thf('\'Charles\'_type',type,
    '\'Charles\'': $i ).

thf(hate_type,type,
    hate: $i ).

thf(property2_type,type,
    property2: $i > $i > $i > $i > $o ).

thf(rich_type,type,
    rich: $i ).

thf(comp_than_type,type,
    comp_than: $i ).

thf(1,conjecture,
    ? [A: $i] : ( predicate2 @ A @ kill @ '\'AuntAgatha\'' @ '\'AuntAgatha\'' ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).

thf(2,negated_conjecture,
    ~ ? [A: $i] : ( predicate2 @ A @ kill @ '\'AuntAgatha\'' @ '\'AuntAgatha\'' ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(4,plain,
    ~ ? [A: $i] : ( predicate2 @ A @ kill @ '\'AuntAgatha\'' @ '\'AuntAgatha\'' ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(3,axiom,
    ? [A: $i,B: $i,C: $i] :
      ( $true
      & ( predicate1 @ B @ live @ A )
      & ( modifier_pp @ B @ in @ '\'DreadburyMansion\'' )
      & ( predicate2 @ C @ kill @ A @ '\'AuntAgatha\'' )
      & ! [D: $i,E: $i] :
          ( ( $true
            & ( predicate1 @ E @ live @ D )
            & ( modifier_pp @ E @ in @ '\'DreadburyMansion\'' ) )
         => ( ( D = '\'AuntAgatha\'' )
            | ( D = '\'Butler\'' )
            | ( D = '\'Charles\'' ) ) )
      & ! [D: $i] :
          ( $true
         => ! [E: $i,F: $i] :
              ( ( $true
                & ( predicate2 @ F @ kill @ D @ E ) )
             => ? [G: $i] : ( predicate2 @ G @ hate @ D @ E ) ) )
      & ! [D: $i] :
          ( $true
         => ~ ? [E: $i,F: $i,G: $i] :
                ( $true
                & ( predicate2 @ F @ kill @ D @ E )
                & ( property2 @ G @ rich @ comp_than @ E )
                & ( D = G ) ) )
      & ! [D: $i,E: $i] :
          ( ( $true
            & ( predicate2 @ E @ hate @ '\'AuntAgatha\'' @ D ) )
         => ~ ? [F: $i] : ( predicate2 @ F @ hate @ '\'Charles\'' @ D ) )
      & ~ ? [D: $i] : ( predicate2 @ D @ hate @ '\'AuntAgatha\'' @ '\'Butler\'' )
      & ! [D: $i] :
          ( ( $true
            & ( D != '\'Butler\'' ) )
         => ? [E: $i] : ( predicate2 @ E @ hate @ '\'AuntAgatha\'' @ D ) )
      & ! [D: $i] :
          ( ( $true
            & ~ ? [E: $i] :
                  ( ( property2 @ E @ rich @ comp_than @ '\'AuntAgatha\'' )
                  & ( D = E ) ) )
         => ? [E: $i] : ( predicate2 @ E @ hate @ '\'Butler\'' @ D ) )
      & ! [D: $i,E: $i] :
          ( ( $true
            & ( predicate2 @ E @ hate @ '\'AuntAgatha\'' @ D ) )
         => ? [F: $i] : ( predicate2 @ F @ hate @ '\'Butler\'' @ D ) )
      & ! [D: $i] :
          ( $true
         => ~ ! [E: $i] :
                ( $true
               => ? [F: $i] : ( predicate2 @ F @ hate @ D @ E ) ) )
      & ( '\'AuntAgatha\'' != '\'Butler\'' ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',background) ).

thf(6,plain,
    ? [A: $i,B: $i,C: $i] :
      ( ( predicate1 @ B @ live @ A )
      & ( modifier_pp @ B @ in @ '\'DreadburyMansion\'' )
      & ( predicate2 @ C @ kill @ A @ '\'AuntAgatha\'' )
      & ! [D: $i,E: $i] :
          ( ( ( predicate1 @ E @ live @ D )
            & ( modifier_pp @ E @ in @ '\'DreadburyMansion\'' ) )
         => ( ( D = '\'AuntAgatha\'' )
            | ( D = '\'Butler\'' )
            | ( D = '\'Charles\'' ) ) )
      & ! [D: $i,E: $i,F: $i] :
          ( ( predicate2 @ F @ kill @ D @ E )
         => ? [G: $i] : ( predicate2 @ G @ hate @ D @ E ) )
      & ! [D: $i] :
          ~ ? [E: $i,F: $i,G: $i] :
              ( ( predicate2 @ F @ kill @ D @ E )
              & ( property2 @ G @ rich @ comp_than @ E )
              & ( D = G ) )
      & ! [D: $i,E: $i] :
          ( ( predicate2 @ E @ hate @ '\'AuntAgatha\'' @ D )
         => ~ ? [F: $i] : ( predicate2 @ F @ hate @ '\'Charles\'' @ D ) )
      & ~ ? [D: $i] : ( predicate2 @ D @ hate @ '\'AuntAgatha\'' @ '\'Butler\'' )
      & ! [D: $i] :
          ( ( D != '\'Butler\'' )
         => ? [E: $i] : ( predicate2 @ E @ hate @ '\'AuntAgatha\'' @ D ) )
      & ! [D: $i] :
          ( ~ ? [E: $i] :
                ( ( property2 @ E @ rich @ comp_than @ '\'AuntAgatha\'' )
                & ( D = E ) )
         => ? [E: $i] : ( predicate2 @ E @ hate @ '\'Butler\'' @ D ) )
      & ! [D: $i,E: $i] :
          ( ( predicate2 @ E @ hate @ '\'AuntAgatha\'' @ D )
         => ? [F: $i] : ( predicate2 @ F @ hate @ '\'Butler\'' @ D ) )
      & ! [D: $i] :
          ~ ! [E: $i] :
            ? [F: $i] : ( predicate2 @ F @ hate @ D @ E )
      & ( '\'AuntAgatha\'' != '\'Butler\'' ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(36,plain,
    $false,
    inference(e,[status(thm)],[4,6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : PUZ001+2 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.36  % Computer : n009.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 : Thu May 18 19:55:19 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 0.96/0.88  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.23/1.02  % [INFO] 	 Parsing done (133ms). 
% 1.23/1.03  % [INFO] 	 Running in sequential loop mode. 
% 1.61/1.22  % [INFO] 	 eprover registered as external prover. 
% 1.76/1.22  % [INFO] 	 cvc4 registered as external prover. 
% 1.76/1.23  % [INFO] 	 Scanning for conjecture ... 
% 1.86/1.28  % [INFO] 	 Found a conjecture and 1 axioms. Running axiom selection ... 
% 1.86/1.30  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms). 
% 2.08/1.34  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.08/1.34  % [INFO] 	 Type checking passed. 
% 2.08/1.34  % [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.37/1.81  % External prover 'e' found a proof!
% 3.37/1.81  % [INFO] 	 Killing All external provers ... 
% 3.37/1.81  % Time passed: 1302ms (effective reasoning time: 784ms)
% 3.37/1.81  % 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.37/1.82  % Axioms used in derivation (1): background
% 3.37/1.82  % No. of inferences in proof: 6
% 3.37/1.82  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1302 ms resp. 784 ms w/o parsing
% 3.46/1.87  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.46/1.87  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------