TSTP Solution File: SYO023^1 by Leo-III-SAT---1.7.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.12
% Problem  : SYO023^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n017.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:58:59 EDT 2024

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

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

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

thf(1,conjecture,
    ( (&)
    = ( ^ [A: $o,B: $o] :
          ~ ( ~ A
            | ~ B ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).

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

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

thf(4,plain,
    ( (&)
   != ( ^ [A: $o,B: $o] :
          ~ ( ~ A
            | ~ B ) ) ),
    inference(lifteq,[status(thm)],[3]) ).

thf(5,plain,
    ( ( sk1
      & sk2 )
   != ( ~ ( ~ sk1
          | ~ sk2 ) ) ),
    inference(func_ext,[status(esa)],[4]) ).

thf(7,plain,
    ( ( sk1
      & sk2 )
    | ~ ( ~ sk1
        | ~ sk2 ) ),
    inference(bool_ext,[status(thm)],[5]) ).

thf(11,plain,
    ( sk2
    | sk2 ),
    inference(cnf,[status(esa)],[7]) ).

thf(13,plain,
    sk2,
    inference(simp,[status(thm)],[11]) ).

thf(15,plain,
    ( ( sk1
      & $true )
   != ( ~ ( ~ sk1
          | ~ $true ) ) ),
    inference(rewrite,[status(thm)],[5,13]) ).

thf(16,plain,
    $false,
    inference(simp,[status(thm)],[15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYO023^1 : TPTP v8.2.0. Released v3.7.0.
% 0.13/0.15  % Command  : run_Leo-III %s %d
% 0.16/0.37  % Computer : n017.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 300
% 0.16/0.37  % DateTime : Mon May 20 08:44:39 EDT 2024
% 0.16/0.37  % CPUTime  : 
% 0.94/0.86  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.17/0.95  % [INFO] 	 Parsing done (89ms). 
% 1.17/0.96  % [INFO] 	 Running in sequential loop mode. 
% 1.61/1.15  % [INFO] 	 nitpick registered as external prover. 
% 1.61/1.16  % [INFO] 	 Scanning for conjecture ... 
% 1.71/1.20  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.71/1.22  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.71/1.22  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.71/1.22  % [INFO] 	 Type checking passed. 
% 1.71/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 ... 
% 2.10/1.42  % [INFO] 	 Killing All external provers ... 
% 2.10/1.43  % Time passed: 897ms (effective reasoning time: 467ms)
% 2.10/1.43  % 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.10/1.43  % Axioms used in derivation (0): 
% 2.10/1.43  % No. of inferences in proof: 10
% 2.10/1.43  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 897 ms resp. 467 ms w/o parsing
% 2.10/1.45  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.10/1.45  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------