TSTP Solution File: LCL638+1.001 by Leo-III---1.7.7

View Problem - Process Solution

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

% Computer : n016.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:30:51 EDT 2023

% Result   : Theorem 2.94s 1.66s
% Output   : Refutation 3.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    6 (   1 unt;   2 typ;   0 def)
%            Number of atoms       :   93 (   0 equ;   0 cnn)
%            Maximal formula atoms :   31 (  23 avg)
%            Number of connectives :  376 ( 137   ~;  77   |;  12   &; 150   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   24 (  18 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    3 (   3   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    3 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :   63 (   0   ^;  60   !;   3   ?;  63   :)

% Comments : 
%------------------------------------------------------------------------------
thf(r1_type,type,
    r1: $i > $i > $o ).

thf(p1_type,type,
    p1: $i > $o ).

thf(1,conjecture,
    ~ ? [A: $i] :
        ~ ( ~ ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ~ ( ~ ! [C: $i] :
                          ( ~ ( r1 @ B @ C )
                          | ~ ! [D: $i] :
                                ( ~ ( r1 @ C @ D )
                                | ( p1 @ D ) ) )
                    & ~ ( p1 @ B ) ) )
          | ~ ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ~ ( ~ ! [C: $i] :
                          ( ~ ( r1 @ B @ C )
                          | ~ ! [D: $i] :
                                ( ~ ( r1 @ C @ D )
                                | ~ ( p1 @ D ) ) )
                    & ( p1 @ B ) ) )
          | ~ ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ~ ( ~ ! [C: $i] :
                          ( ~ ( r1 @ B @ C )
                          | ! [D: $i] :
                              ( ~ ( r1 @ C @ D )
                              | ~ ! [E: $i] :
                                    ( ~ ( r1 @ D @ E )
                                    | ~ ( p1 @ E ) ) ) )
                    & ! [C: $i] :
                        ( ~ ( r1 @ B @ C )
                        | ~ ! [D: $i] :
                              ( ~ ( r1 @ C @ D )
                              | ~ ( p1 @ D ) ) ) ) )
          | ~ ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ~ ( ~ ! [C: $i] :
                          ( ~ ( r1 @ B @ C )
                          | ! [D: $i] :
                              ( ~ ( r1 @ C @ D )
                              | ( p1 @ D ) ) )
                    & ! [C: $i] :
                        ( ~ ( r1 @ B @ C )
                        | ( p1 @ C ) ) ) )
          | ~ ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ~ ! [C: $i] :
                      ( ~ ( r1 @ B @ C )
                      | $false ) )
          | ! [B: $i] :
              ( ~ ( r1 @ A @ B )
              | ( p1 @ B )
              | ~ ! [C: $i] :
                    ( ~ ( r1 @ B @ C )
                    | ( p1 @ C ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).

thf(2,negated_conjecture,
    ~ ~ ? [A: $i] :
          ~ ( ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ~ ( ~ ! [C: $i] :
                            ( ~ ( r1 @ B @ C )
                            | ~ ! [D: $i] :
                                  ( ~ ( r1 @ C @ D )
                                  | ( p1 @ D ) ) )
                      & ~ ( p1 @ B ) ) )
            | ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ~ ( ~ ! [C: $i] :
                            ( ~ ( r1 @ B @ C )
                            | ~ ! [D: $i] :
                                  ( ~ ( r1 @ C @ D )
                                  | ~ ( p1 @ D ) ) )
                      & ( p1 @ B ) ) )
            | ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ~ ( ~ ! [C: $i] :
                            ( ~ ( r1 @ B @ C )
                            | ! [D: $i] :
                                ( ~ ( r1 @ C @ D )
                                | ~ ! [E: $i] :
                                      ( ~ ( r1 @ D @ E )
                                      | ~ ( p1 @ E ) ) ) )
                      & ! [C: $i] :
                          ( ~ ( r1 @ B @ C )
                          | ~ ! [D: $i] :
                                ( ~ ( r1 @ C @ D )
                                | ~ ( p1 @ D ) ) ) ) )
            | ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ~ ( ~ ! [C: $i] :
                            ( ~ ( r1 @ B @ C )
                            | ! [D: $i] :
                                ( ~ ( r1 @ C @ D )
                                | ( p1 @ D ) ) )
                      & ! [C: $i] :
                          ( ~ ( r1 @ B @ C )
                          | ( p1 @ C ) ) ) )
            | ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ~ ! [C: $i] :
                        ( ~ ( r1 @ B @ C )
                        | $false ) )
            | ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p1 @ B )
                | ~ ! [C: $i] :
                      ( ~ ( r1 @ B @ C )
                      | ( p1 @ C ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ~ ? [A: $i] :
          ~ ( ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ~ ( ~ ! [C: $i] :
                            ( ~ ( r1 @ B @ C )
                            | ~ ! [D: $i] :
                                  ( ~ ( r1 @ C @ D )
                                  | ( p1 @ D ) ) )
                      & ~ ( p1 @ B ) ) )
            | ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ~ ( ~ ! [C: $i] :
                            ( ~ ( r1 @ B @ C )
                            | ~ ! [D: $i] :
                                  ( ~ ( r1 @ C @ D )
                                  | ~ ( p1 @ D ) ) )
                      & ( p1 @ B ) ) )
            | ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ~ ( ~ ! [C: $i] :
                            ( ~ ( r1 @ B @ C )
                            | ! [D: $i] :
                                ( ~ ( r1 @ C @ D )
                                | ~ ! [E: $i] :
                                      ( ~ ( r1 @ D @ E )
                                      | ~ ( p1 @ E ) ) ) )
                      & ! [C: $i] :
                          ( ~ ( r1 @ B @ C )
                          | ~ ! [D: $i] :
                                ( ~ ( r1 @ C @ D )
                                | ~ ( p1 @ D ) ) ) ) )
            | ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ~ ( ~ ! [C: $i] :
                            ( ~ ( r1 @ B @ C )
                            | ! [D: $i] :
                                ( ~ ( r1 @ C @ D )
                                | ( p1 @ D ) ) )
                      & ! [C: $i] :
                          ( ~ ( r1 @ B @ C )
                          | ( p1 @ C ) ) ) )
            | ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ~ ! [C: $i] :
                        ~ ( r1 @ B @ C ) )
            | ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p1 @ B )
                | ~ ! [C: $i] :
                      ( ~ ( r1 @ B @ C )
                      | ( p1 @ C ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LCL638+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.15  % Command  : run_Leo-III %s %d
% 0.14/0.35  % Computer : n016.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu May 18 16:27:42 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.88/0.83  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.22/0.94  % [INFO] 	 Parsing done (112ms). 
% 1.22/0.95  % [INFO] 	 Running in sequential loop mode. 
% 1.52/1.15  % [INFO] 	 eprover registered as external prover. 
% 1.52/1.15  % [INFO] 	 cvc4 registered as external prover. 
% 1.52/1.16  % [INFO] 	 Scanning for conjecture ... 
% 1.77/1.22  % [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ... 
% 1.91/1.25  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.91/1.25  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.91/1.26  % [INFO] 	 Type checking passed. 
% 1.91/1.26  % [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.94/1.66  % External prover 'e' found a proof!
% 2.94/1.66  % [INFO] 	 Killing All external provers ... 
% 2.94/1.66  % Time passed: 1155ms (effective reasoning time: 710ms)
% 2.94/1.66  % 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.94/1.66  % Axioms used in derivation (0): 
% 2.94/1.66  % No. of inferences in proof: 4
% 2.94/1.66  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1155 ms resp. 710 ms w/o parsing
% 3.29/1.70  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.29/1.70  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------