%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWW469+5 : TPTP v8.1.0. Released v5.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n018.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  : 600s
% DateTime : Thu Jul 21 01:28:32 EDT 2022

% Result   : Theorem 0.19s 0.51s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    6 (   4 unt;   0 nHn;   6 RR)
%            Number of literals    :    8 (   0 equ;   5 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(7,axiom,
    hBOOL(hoare_1883395792gleton),
    file('SWW469+5.p',unknown),
    [] ).

cnf(14,axiom,
    equal(ti(state,u),ti(state,skc3)),
    file('SWW469+5.p',unknown),
    [] ).

cnf(27,axiom,
    ( ~ hBOOL(hoare_1883395792gleton)
    | ~ equal(ti(state,skc5),ti(state,skc4)) ),
    file('SWW469+5.p',unknown),
    [] ).

cnf(78,plain,
    ( ~ hBOOL(hoare_1883395792gleton)
    | ~ equal(ti(state,skc3),ti(state,skc3)) ),
    inference(rew,[status(thm),theory(equality)],[14,27]),
    [iquote('0:Rew:14.0,27.1,14.0,27.1')] ).

cnf(79,plain,
    ~ hBOOL(hoare_1883395792gleton),
    inference(obv,[status(thm),theory(equality)],[78]),
    [iquote('0:Obv:78.1')] ).

cnf(80,plain,
    $false,
    inference(mrr,[status(thm)],[79,7]),
    [iquote('0:MRR:79.0,7.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SWW469+5 : TPTP v8.1.0. Released v5.3.0.
% 0.10/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n018.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jun  4 21:06:18 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.51  
% 0.19/0.51  SPASS V 3.9 
% 0.19/0.51  SPASS beiseite: Proof found.
% 0.19/0.51  % SZS status Theorem
% 0.19/0.51  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.51  SPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 22 clauses.
% 0.19/0.51  SPASS allocated 99048 KBytes.
% 0.19/0.51  SPASS spent	0:00:00.16 on the problem.
% 0.19/0.51  		0:00:00.04 for the input.
% 0.19/0.51  		0:00:00.09 for the FLOTTER CNF translation.
% 0.19/0.51  		0:00:00.00 for inferences.
% 0.19/0.51  		0:00:00.00 for the backtracking.
% 0.19/0.51  		0:00:00.00 for the reduction.
% 0.19/0.51  
% 0.19/0.51  
% 0.19/0.51  Here is a proof with depth 0, length 6 :
% 0.19/0.51  % SZS output start Refutation
% See solution above
% 0.19/0.51  Formulae used in the proof : conj_0 conj_1 fact_0_state__not__singleton__def
% 0.19/0.51  
%------------------------------------------------------------------------------