TSTP Solution File: SEV013^5 by Leo-III-SAT---1.7.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.12
% Problem  : SEV013^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n029.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 : Tue May 21 04:10:44 EDT 2024

% Result   : Theorem 2.50s 1.57s
% Output   : Refutation 2.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   31 (   4 unt;   6 typ;   0 def)
%            Number of atoms       :   59 (  58 equ;   0 cnn)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   58 (  24   ~;  20   |;   8   &;   0   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Number of types       :    1 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   5 usr;   6 con; 0-2 aty)
%            Number of variables   :   17 (   0   ^  17   !;   0   ?;  17   :)

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

thf(sk1_type,type,
    sk1: a ).

thf(sk2_type,type,
    sk2: a ).

thf(sk3_type,type,
    sk3: a ).

thf(sk4_type,type,
    sk4: a ).

thf(sk5_type,type,
    sk5: a ).

thf(1,conjecture,
    ( ! [A: a] : ( A = A )
    & ! [A: a,B: a] :
        ( ( A = B )
       => ( B = A ) )
    & ! [A: a,B: a,C: a] :
        ( ( ( A = B )
          & ( B = C ) )
       => ( A = C ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM511_pme) ).

thf(2,negated_conjecture,
    ~ ( ! [A: a] : ( A = A )
      & ! [A: a,B: a] :
          ( ( A = B )
         => ( B = A ) )
      & ! [A: a,B: a,C: a] :
          ( ( ( A = B )
            & ( B = C ) )
         => ( A = C ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ( ! [A: a,B: a] :
          ( ( A = B )
         => ( B = A ) )
      & ! [A: a,B: a,C: a] :
          ( ( ( A = B )
            & ( B = C ) )
         => ( A = C ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(9,plain,
    ( ( sk1 = sk2 )
    | ( sk4 = sk5 ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(12,plain,
    ( ( sk2 = sk1 )
    | ( sk5 = sk4 ) ),
    inference(lifteq,[status(thm)],[9]) ).

thf(7,plain,
    ( ( sk1 = sk2 )
    | ( sk3 != sk5 ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(13,plain,
    ( ( sk2 = sk1 )
    | ( sk5 != sk3 ) ),
    inference(lifteq,[status(thm)],[7]) ).

thf(22,plain,
    ( ( sk2 = sk1 )
    | ( sk4 != sk3 )
    | ( sk5 != sk5 ) ),
    inference(paramod_ordered,[status(thm)],[12,13]) ).

thf(23,plain,
    ( ( sk2 = sk1 )
    | ( sk4 != sk3 ) ),
    inference(pattern_uni,[status(thm)],[22:[]]) ).

thf(5,plain,
    ( ( sk1 = sk2 )
    | ( sk3 = sk4 ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(10,plain,
    ( ( sk2 = sk1 )
    | ( sk4 = sk3 ) ),
    inference(lifteq,[status(thm)],[5]) ).

thf(4,plain,
    ( ( sk2 != sk1 )
    | ( sk3 = sk4 ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(15,plain,
    ( ( sk2 != sk1 )
    | ( sk4 = sk3 ) ),
    inference(lifteq,[status(thm)],[4]) ).

thf(6,plain,
    ( ( sk2 != sk1 )
    | ( sk4 = sk5 ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(11,plain,
    ( ( sk2 != sk1 )
    | ( sk5 = sk4 ) ),
    inference(lifteq,[status(thm)],[6]) ).

thf(8,plain,
    ( ( sk2 != sk1 )
    | ( sk3 != sk5 ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(14,plain,
    ( ( sk2 != sk1 )
    | ( sk5 != sk3 ) ),
    inference(lifteq,[status(thm)],[8]) ).

thf(26,plain,
    ( ( sk2 != sk1 )
    | ( sk4 != sk3 )
    | ( sk5 != sk5 ) ),
    inference(paramod_ordered,[status(thm)],[11,14]) ).

thf(27,plain,
    ( ( sk2 != sk1 )
    | ( sk4 != sk3 ) ),
    inference(pattern_uni,[status(thm)],[26:[]]) ).

thf(34,plain,
    ( ( sk2 != sk1 )
    | ( sk4 != sk4 ) ),
    inference(paramod_ordered,[status(thm)],[15,27]) ).

thf(35,plain,
    sk2 != sk1,
    inference(pattern_uni,[status(thm)],[34:[]]) ).

thf(36,plain,
    sk4 = sk3,
    inference(simplifyReflect,[status(thm)],[10,35]) ).

thf(39,plain,
    ( ( sk2 = sk1 )
    | ( sk3 != sk3 ) ),
    inference(rewrite,[status(thm)],[23,36]) ).

thf(40,plain,
    sk2 = sk1,
    inference(simp,[status(thm)],[39]) ).

thf(41,plain,
    $false,
    inference(simplifyReflect,[status(thm)],[40,35]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SEV013^5 : TPTP v8.2.0. Released v4.0.0.
% 0.15/0.15  % Command  : run_Leo-III %s %d
% 0.16/0.36  % Computer : n029.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 : Sun May 19 19:09:54 EDT 2024
% 0.16/0.36  % CPUTime  : 
% 0.93/0.86  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.15/0.96  % [INFO] 	 Parsing done (102ms). 
% 1.24/0.97  % [INFO] 	 Running in sequential loop mode. 
% 1.62/1.19  % [INFO] 	 nitpick registered as external prover. 
% 1.62/1.20  % [INFO] 	 Scanning for conjecture ... 
% 1.77/1.25  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.81/1.27  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.81/1.27  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.81/1.27  % [INFO] 	 Type checking passed. 
% 1.81/1.27  % [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.50/1.57  % [INFO] 	 Killing All external provers ... 
% 2.50/1.57  % Time passed: 1048ms (effective reasoning time: 591ms)
% 2.50/1.57  % 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.50/1.57  % Axioms used in derivation (0): 
% 2.50/1.57  % No. of inferences in proof: 25
% 2.50/1.57  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1048 ms resp. 591 ms w/o parsing
% 2.50/1.59  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.50/1.59  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------