TSTP Solution File: SWW469_5 by Leo-III-SAT---1.7.15

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.15
% Problem  : SWW469_5 : TPTP v8.2.0. Released v6.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d SAT

% Computer : n010.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 Jun 24 18:25:13 EDT 2024

% Result   : Theorem 6.94s 2.66s
% Output   : Refutation 6.94s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   30 (  16 equ;   0 cnn)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   34 (  22   ~;   5   |;   2   &;   0   @)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Number of types       :    9 (   8 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   4 usr;   5 con; 0-2 aty)
%            Number of variables   :   21 (   0   ^  11   !;  10   ?;  21   :)

% Comments : 
%------------------------------------------------------------------------------
thf(com_type,type,
    com: $tType ).

thf(state_type,type,
    state: $tType ).

thf(bool_type,type,
    bool: $tType ).

thf(int_type,type,
    int: $tType ).

thf(nat_type,type,
    nat: $tType ).

thf(char_type,type,
    char: $tType ).

thf(literal_type,type,
    literal: $tType ).

thf(nibble_type,type,
    nibble: $tType ).

thf(hoare_531836380gleton_type,type,
    hoare_531836380gleton: $o ).

thf(sk1_type,type,
    sk1: state ).

thf(sk2_type,type,
    sk2: state ).

thf(sk3_type,type,
    sk3: state ).

thf(141,axiom,
    hoare_531836380gleton,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

thf(571,plain,
    hoare_531836380gleton,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[141]) ).

thf(1,conjecture,
    ! [A: state] :
    ? [B: state] : ( B != A ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).

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

thf(142,plain,
    ~ ! [A: state] :
      ? [B: state] : ( B != A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(143,plain,
    ~ ~ ? [A: state] :
        ! [B: state] : ( B = A ),
    inference(miniscope,[status(thm)],[142]) ).

thf(144,plain,
    ! [A: state] : ( A = sk1 ),
    inference(cnf,[status(esa)],[143]) ).

thf(145,plain,
    ! [A: state] : ( A = sk1 ),
    inference(lifteq,[status(thm)],[144]) ).

thf(3,axiom,
    ( hoare_531836380gleton
  <=> ? [A: state,B: state] : ( A != B ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_state__not__singleton__def) ).

thf(146,plain,
    ( ( hoare_531836380gleton
     => ? [A: state,B: state] : ( A != B ) )
    & ( ? [A: state,B: state] : ( A != B )
     => hoare_531836380gleton ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(147,plain,
    ( ( hoare_531836380gleton
     => ~ ! [A: state,B: state] : ( A = B ) )
    & ( ~ ! [A: state,B: state] : ( A = B )
     => hoare_531836380gleton ) ),
    inference(miniscope,[status(thm)],[146]) ).

thf(149,plain,
    ( ~ hoare_531836380gleton
    | ( sk2 != sk3 ) ),
    inference(cnf,[status(esa)],[147]) ).

thf(151,plain,
    ( ( sk3 != sk2 )
    | ~ hoare_531836380gleton ),
    inference(lifteq,[status(thm)],[149]) ).

thf(580,plain,
    ! [A: state] :
      ( ( sk2 != sk1 )
      | ~ hoare_531836380gleton
      | ( A != sk3 ) ),
    inference(paramod_ordered,[status(thm)],[145,151]) ).

thf(581,plain,
    ( ( sk2 != sk1 )
    | ~ hoare_531836380gleton ),
    inference(pattern_uni,[status(thm)],[580:[bind(A,$thf( sk3 ))]]) ).

thf(588,plain,
    ~ hoare_531836380gleton,
    inference(simplifyReflect,[status(thm)],[581,145]) ).

thf(653,plain,
    $false,
    inference(rewrite,[status(thm)],[571,588]) ).

thf(654,plain,
    $false,
    inference(simp,[status(thm)],[653]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11  % Problem  : SWW469_5 : TPTP v8.2.0. Released v6.0.0.
% 0.04/0.11  % Command  : run_Leo-III %s %d SAT
% 0.10/0.32  % Computer : n010.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit : 300
% 0.10/0.32  % WCLimit  : 300
% 0.10/0.32  % DateTime : Wed Jun 19 06:31:25 EDT 2024
% 0.10/0.32  % CPUTime  : 
% 0.96/0.85  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.51/1.04  % [INFO] 	 Parsing done (191ms). 
% 1.51/1.05  % [INFO] 	 Running in sequential loop mode. 
% 2.17/1.27  % [INFO] 	 nitpick registered as external prover. 
% 2.17/1.28  % [INFO] 	 Scanning for conjecture ... 
% 2.45/1.38  % [INFO] 	 Found a conjecture (or negated_conjecture) and 139 axioms. Running axiom selection ... 
% 2.60/1.41  % [INFO] 	 Axiom selection finished. Selected 139 axioms (removed 0 axioms). 
% 3.10/1.55  % [INFO] 	 Problem is typed first-order (TPTP TFF). 
% 3.10/1.57  % [INFO] 	 Type checking passed. 
% 3.10/1.57  % [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 ... 
% 3.31/1.70  % [INFO] 	 [Domain constraints] Detected constraint on state 
% 3.31/1.70  % [INFO] 	 [Domain constraints] dom(state) ⊆ {sk1} 
% 5.09/2.16  % [INFO] 	 [Domain constraints] Detected constraint on bool 
% 5.09/2.16  % [INFO] 	 [Domain constraints] dom(bool) ⊆ {fTrue,fFalse} 
% 5.09/2.16  % [INFO] 	 [Domain constraints] Detected constraint on bool 
% 5.09/2.16  % [INFO] 	 [Domain constraints] dom(bool) ⊆ {fTrue,fFalse} 
% 6.94/2.66  % [INFO] 	 Killing All external provers ... 
% 6.94/2.66  % Time passed: 2151ms (effective reasoning time: 1605ms)
% 6.94/2.66  % 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)>
% 6.94/2.66  % Axioms used in derivation (2): conj_0, fact_0_state__not__singleton__def
% 6.94/2.66  % No. of inferences in proof: 18
% 6.94/2.66  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2151 ms resp. 1605 ms w/o parsing
% 6.94/2.68  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.94/2.68  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------