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

View Problem - Process Solution

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

% Computer : n018.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:56 EDT 2023

% Result   : Theorem 2.52s 1.53s
% Output   : Refutation 2.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   11 (   1 unt;   7 typ;   0 def)
%            Number of atoms       :   49 (   0 equ;   0 cnn)
%            Maximal formula atoms :   16 (  12 avg)
%            Number of connectives :  161 (  44   ~;  45   |;   0   &;  72   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (  13 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    8 (   8   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   7 usr;   1 con; 0-2 aty)
%            Number of variables   :   27 (   0   ^;  24   !;   3   ?;  27   :)

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

thf(p6_type,type,
    p6: $i > $o ).

thf(p2_type,type,
    p2: $i > $o ).

thf(p4_type,type,
    p4: $i > $o ).

thf(p5_type,type,
    p5: $i > $o ).

thf(p3_type,type,
    p3: $i > $o ).

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

thf(1,conjecture,
    ~ ? [A: $i] :
        ~ ( ~ ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p6 @ B ) )
          | ~ ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p2 @ B ) )
          | ~ ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p4 @ B ) )
          | ~ ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p2 @ B ) )
          | ! [B: $i] :
              ( ~ ( r1 @ A @ B )
              | ( p5 @ B ) )
          | ! [B: $i] :
              ( ~ ( r1 @ A @ B )
              | ( p3 @ B ) )
          | ! [B: $i] :
              ( ~ ( r1 @ A @ B )
              | ( p2 @ B ) )
          | ! [B: $i] :
              ( ~ ( r1 @ A @ B )
              | ( p1 @ B ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

thf(2,negated_conjecture,
    ~ ~ ? [A: $i] :
          ~ ( ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ( p6 @ B ) )
            | ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ( p2 @ B ) )
            | ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ( p4 @ B ) )
            | ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ( p2 @ B ) )
            | ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p5 @ B ) )
            | ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p3 @ B ) )
            | ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p2 @ B ) )
            | ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p1 @ B ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ~ ? [A: $i] :
          ~ ( ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ( p6 @ B ) )
            | ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ( p2 @ B ) )
            | ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ( p4 @ B ) )
            | ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ( p2 @ B ) )
            | ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p5 @ B ) )
            | ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p3 @ B ) )
            | ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p2 @ B ) )
            | ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p1 @ B ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL646+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15  % Command  : run_Leo-III %s %d
% 0.16/0.36  % Computer : n018.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit : 300
% 0.16/0.36  % WCLimit  : 300
% 0.16/0.36  % DateTime : Thu May 18 16:13:28 EDT 2023
% 0.16/0.37  % CPUTime  : 
% 0.83/0.86  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.14/0.97  % [INFO] 	 Parsing done (107ms). 
% 1.14/0.98  % [INFO] 	 Running in sequential loop mode. 
% 1.47/1.16  % [INFO] 	 eprover registered as external prover. 
% 1.47/1.16  % [INFO] 	 cvc4 registered as external prover. 
% 1.47/1.17  % [INFO] 	 Scanning for conjecture ... 
% 1.75/1.22  % [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ... 
% 1.87/1.25  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.87/1.25  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.87/1.25  % [INFO] 	 Type checking passed. 
% 1.87/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.52/1.52  % External prover 'e' found a proof!
% 2.52/1.52  % [INFO] 	 Killing All external provers ... 
% 2.52/1.52  % Time passed: 986ms (effective reasoning time: 545ms)
% 2.52/1.52  % 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.52/1.53  % Axioms used in derivation (0): 
% 2.52/1.53  % No. of inferences in proof: 4
% 2.52/1.53  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 986 ms resp. 545 ms w/o parsing
% 2.69/1.55  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.69/1.55  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------