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

View Problem - Process Solution

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

% Computer : n020.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:31:04 EDT 2023

% Result   : Theorem 2.61s 1.51s
% Output   : Refutation 2.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   13 (   3 unt;   7 typ;   0 def)
%            Number of atoms       :   51 (   0 equ;   0 cnn)
%            Maximal formula atoms :   16 (   8 avg)
%            Number of connectives :  165 (  44   ~;  45   |;   0   &;  76   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (  10 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   :   29 (   0   ^;  26   !;   3   ?;  29   :)

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

thf(p16_type,type,
    p16: $i > $o ).

thf(p12_type,type,
    p12: $i > $o ).

thf(p14_type,type,
    p14: $i > $o ).

thf(p15_type,type,
    p15: $i > $o ).

thf(p13_type,type,
    p13: $i > $o ).

thf(p11_type,type,
    p11: $i > $o ).

thf(1,conjecture,
    ~ ? [A: $i] :
        ~ ( ~ ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p16 @ B ) )
          | ~ ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p12 @ B ) )
          | ~ ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p14 @ B ) )
          | ~ ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p12 @ B ) )
          | ! [B: $i] :
              ( ~ ( r1 @ A @ B )
              | ( p15 @ B ) )
          | ! [B: $i] :
              ( ~ ( r1 @ A @ B )
              | ( p13 @ B ) )
          | ! [B: $i] :
              ( ~ ( r1 @ A @ B )
              | ( p12 @ B ) )
          | ! [B: $i] :
              ( ~ ( r1 @ A @ B )
              | ( p11 @ B ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

thf(2,negated_conjecture,
    ~ ~ ? [A: $i] :
          ~ ( ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ( p16 @ B ) )
            | ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ( p12 @ B ) )
            | ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ( p14 @ B ) )
            | ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ( p12 @ B ) )
            | ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p15 @ B ) )
            | ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p13 @ B ) )
            | ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p12 @ B ) )
            | ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p11 @ B ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(4,plain,
    ~ ~ ? [A: $i] :
          ~ ( ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ( p16 @ B ) )
            | ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ( p12 @ B ) )
            | ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ( p14 @ B ) )
            | ~ ! [B: $i] :
                  ( ~ ( r1 @ A @ B )
                  | ( p12 @ B ) )
            | ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p15 @ B ) )
            | ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p13 @ B ) )
            | ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p12 @ B ) )
            | ! [B: $i] :
                ( ~ ( r1 @ A @ B )
                | ( p11 @ B ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(3,axiom,
    ! [A: $i] : ( r1 @ A @ A ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).

thf(22,plain,
    ! [A: $i] : ( r1 @ A @ A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(24,plain,
    $false,
    inference(e,[status(thm)],[4,22]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : LCL664+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.14  % Command  : run_Leo-III %s %d
% 0.15/0.35  % Computer : n020.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Thu May 18 16:17:18 EDT 2023
% 0.15/0.35  % CPUTime  : 
% 0.86/0.83  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.21/0.94  % [INFO] 	 Parsing done (106ms). 
% 1.21/0.94  % [INFO] 	 Running in sequential loop mode. 
% 1.50/1.13  % [INFO] 	 eprover registered as external prover. 
% 1.50/1.14  % [INFO] 	 cvc4 registered as external prover. 
% 1.50/1.14  % [INFO] 	 Scanning for conjecture ... 
% 1.76/1.20  % [INFO] 	 Found a conjecture and 1 axioms. Running axiom selection ... 
% 1.82/1.22  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms). 
% 1.82/1.22  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.82/1.23  % [INFO] 	 Type checking passed. 
% 1.82/1.23  % [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.61/1.51  % External prover 'e' found a proof!
% 2.61/1.51  % [INFO] 	 Killing All external provers ... 
% 2.61/1.51  % Time passed: 1001ms (effective reasoning time: 561ms)
% 2.61/1.51  % 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.61/1.51  % Axioms used in derivation (1): reflexivity
% 2.61/1.51  % No. of inferences in proof: 6
% 2.61/1.51  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1001 ms resp. 561 ms w/o parsing
% 2.76/1.54  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.76/1.54  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------