TSTP Solution File: ITP209^2 by Leo-III-SAT---1.7.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.12
% Problem  : ITP209^2 : TPTP v8.2.0. Released v8.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 : Mon May 20 22:28:20 EDT 2024

% Result   : Theorem 5.71s 2.12s
% Output   : Refutation 5.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   25 (  19 unt;   5 typ;   0 def)
%            Number of atoms       :   21 (  20 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :  148 (   7   ~;   1   |;   0   &; 140   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Number of types       :    1 (   1 usr)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   4 usr;   4 con; 0-2 aty)
%            Number of variables   :   34 (   0   ^  34   !;   0   ?;  34   :)

% Comments : 
%------------------------------------------------------------------------------
thf(a_type,type,
    a: $tType ).

thf(a2_type,type,
    a2: a ).

thf(b_type,type,
    b: a ).

thf(c_type,type,
    c: a ).

thf(f_type,type,
    f: a > a > a ).

thf(4,axiom,
    ! [A: a,B: a] :
      ( ( f @ A @ B )
      = ( f @ B @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_commute) ).

thf(18,plain,
    ! [A: a,B: a] :
      ( ( f @ A @ B )
      = ( f @ B @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(19,plain,
    ! [B: a,A: a] :
      ( ( f @ A @ B )
      = ( f @ B @ A ) ),
    inference(cnf,[status(esa)],[18]) ).

thf(20,plain,
    ! [B: a,A: a] :
      ( ( f @ A @ B )
      = ( f @ B @ A ) ),
    inference(lifteq,[status(thm)],[19]) ).

thf(1,conjecture,
    ( ( f @ ( f @ a2 @ b ) @ c )
    = ( f @ ( f @ a2 @ c ) @ b ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

thf(2,negated_conjecture,
    ( ( f @ ( f @ a2 @ b ) @ c )
   != ( f @ ( f @ a2 @ c ) @ b ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(15,plain,
    ( ( f @ ( f @ a2 @ b ) @ c )
   != ( f @ ( f @ a2 @ c ) @ b ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(16,plain,
    ( ( f @ ( f @ a2 @ c ) @ b )
   != ( f @ ( f @ a2 @ b ) @ c ) ),
    inference(lifteq,[status(thm)],[15]) ).

thf(63,plain,
    ! [B: a,A: a] :
      ( ( ( f @ B @ A )
       != ( f @ ( f @ a2 @ b ) @ c ) )
      | ( ( f @ A @ B )
       != ( f @ ( f @ a2 @ c ) @ b ) ) ),
    inference(paramod_ordered,[status(thm)],[20,16]) ).

thf(64,plain,
    ( ( f @ ( f @ a2 @ b ) @ c )
   != ( f @ b @ ( f @ a2 @ c ) ) ),
    inference(pattern_uni,[status(thm)],[63:[bind(A,$thf( f @ a2 @ c )),bind(B,$thf( b ))]]) ).

thf(6,axiom,
    ! [A: a,B: a,C: a] :
      ( ( f @ ( f @ A @ B ) @ C )
      = ( f @ A @ ( f @ B @ C ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_right__assoc) ).

thf(24,plain,
    ! [A: a,B: a,C: a] :
      ( ( f @ ( f @ A @ B ) @ C )
      = ( f @ A @ ( f @ B @ C ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(25,plain,
    ! [C: a,B: a,A: a] :
      ( ( f @ ( f @ A @ B ) @ C )
      = ( f @ A @ ( f @ B @ C ) ) ),
    inference(cnf,[status(esa)],[24]) ).

thf(26,plain,
    ! [C: a,B: a,A: a] :
      ( ( f @ ( f @ A @ B ) @ C )
      = ( f @ A @ ( f @ B @ C ) ) ),
    inference(lifteq,[status(thm)],[25]) ).

thf(215,plain,
    ( ( f @ b @ ( f @ a2 @ c ) )
   != ( f @ a2 @ ( f @ b @ c ) ) ),
    inference(rewrite,[status(thm)],[64,26]) ).

thf(5,axiom,
    ! [A: a,B: a,C: a] :
      ( ( f @ A @ ( f @ B @ C ) )
      = ( f @ B @ ( f @ A @ C ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2_left__commute) ).

thf(21,plain,
    ! [A: a,B: a,C: a] :
      ( ( f @ A @ ( f @ B @ C ) )
      = ( f @ B @ ( f @ A @ C ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(22,plain,
    ! [C: a,B: a,A: a] :
      ( ( f @ A @ ( f @ B @ C ) )
      = ( f @ B @ ( f @ A @ C ) ) ),
    inference(cnf,[status(esa)],[21]) ).

thf(23,plain,
    ! [C: a,B: a,A: a] :
      ( ( f @ A @ ( f @ B @ C ) )
      = ( f @ B @ ( f @ A @ C ) ) ),
    inference(lifteq,[status(thm)],[22]) ).

thf(348,plain,
    $false,
    inference(simplifyReflect,[status(thm)],[215,23]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10  % Problem  : ITP209^2 : TPTP v8.2.0. Released v8.0.0.
% 0.10/0.13  % Command  : run_Leo-III %s %d
% 0.13/0.33  % Computer : n009.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Sat May 18 18:19:38 EDT 2024
% 0.13/0.33  % CPUTime  : 
% 0.78/0.79  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.22/0.90  % [INFO] 	 Parsing done (114ms). 
% 1.22/0.91  % [INFO] 	 Running in sequential loop mode. 
% 1.61/1.11  % [INFO] 	 nitpick registered as external prover. 
% 1.61/1.11  % [INFO] 	 Scanning for conjecture ... 
% 1.61/1.16  % [INFO] 	 Found a conjecture (or negated_conjecture) and 12 axioms. Running axiom selection ... 
% 1.81/1.19  % [INFO] 	 Axiom selection finished. Selected 12 axioms (removed 0 axioms). 
% 1.91/1.22  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.91/1.22  % [INFO] 	 Type checking passed. 
% 1.99/1.22  % [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 ... 
% 5.71/2.12  % [INFO] 	 Killing All external provers ... 
% 5.71/2.12  % Time passed: 1615ms (effective reasoning time: 1208ms)
% 5.71/2.12  % 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)>
% 5.71/2.12  % Axioms used in derivation (3): fact_1_commute, fact_3_right__assoc, fact_2_left__commute
% 5.71/2.12  % No. of inferences in proof: 20
% 5.71/2.12  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1615 ms resp. 1208 ms w/o parsing
% 5.71/2.16  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.71/2.16  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------