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

View Problem - Process Solution

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

% Computer : n025.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 08:59:35 EDT 2024

% Result   : Theorem 2.50s 1.81s
% Output   : Refutation 2.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (   8 unt;   2 typ;   0 def)
%            Number of atoms       :   48 (  23 equ;   0 cnn)
%            Maximal formula atoms :    2 (   4 avg)
%            Number of connectives :   10 (   7   ~;   3   |;   0   &;   0   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    4 (   2 usr;   3 con; 0-2 aty)
%            Number of variables   :    6 (   0   ^   6   !;   0   ?;   6   :)

% Comments : 
%------------------------------------------------------------------------------
thf(sk1_type,type,
    sk1: $o ).

thf(sk2_type,type,
    sk2: $o ).

thf(1,conjecture,
    ! [A: $o,B: $o] :
      ( ( A = B )
      = ( B = A ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cCT26) ).

thf(2,negated_conjecture,
    ~ ! [A: $o,B: $o] :
        ( ( A = B )
        = ( B = A ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ! [A: $o,B: $o] :
        ( ( A = B )
        = ( B = A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

thf(5,plain,
    ( ( sk1 = sk2 )
   != ( sk2 = sk1 ) ),
    inference(lifteq,[status(thm)],[4]) ).

thf(8,plain,
    ( ( sk1 = sk2 )
    | ( sk2 = sk1 ) ),
    inference(bool_ext,[status(thm)],[5]) ).

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

thf(13,plain,
    sk2 = sk1,
    inference(simp,[status(thm)],[10]) ).

thf(6,plain,
    ( ( sk2 != sk1 )
    | ( sk2 != sk1 ) ),
    inference(simp,[status(thm)],[5]) ).

thf(11,plain,
    sk2 != sk1,
    inference(simp,[status(thm)],[6]) ).

thf(16,plain,
    $false,
    inference(simplifyReflect,[status(thm)],[13,11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : SYO207^5 : TPTP v8.2.0. Released v4.0.0.
% 0.09/0.11  % Command  : run_Leo-III %s %d
% 0.11/0.30  % Computer : n025.cluster.edu
% 0.11/0.30  % Model    : x86_64 x86_64
% 0.11/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30  % Memory   : 8042.1875MB
% 0.11/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30  % CPULimit : 300
% 0.11/0.30  % WCLimit  : 300
% 0.11/0.30  % DateTime : Mon May 20 10:40:24 EDT 2024
% 0.11/0.30  % CPUTime  : 
% 0.94/0.90  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.19/1.05  % [INFO] 	 Parsing done (143ms). 
% 1.19/1.06  % [INFO] 	 Running in sequential loop mode. 
% 1.74/1.40  % [INFO] 	 nitpick registered as external prover. 
% 1.74/1.41  % [INFO] 	 Scanning for conjecture ... 
% 1.90/1.48  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.96/1.51  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.96/1.51  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.96/1.51  % [INFO] 	 Type checking passed. 
% 1.96/1.51  % [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.81  % [INFO] 	 Killing All external provers ... 
% 2.50/1.81  % Time passed: 1365ms (effective reasoning time: 745ms)
% 2.50/1.81  % 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.81  % Axioms used in derivation (0): 
% 2.50/1.81  % No. of inferences in proof: 11
% 2.50/1.81  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1365 ms resp. 745 ms w/o parsing
% 2.54/1.84  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.54/1.84  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------