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

% Computer : n020.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.21s 0.44s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   11 (   9 unt;   0 nHn;  11 RR)
%            Number of literals    :   13 (   0 equ;   5 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   2 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    hoare_165779456gleton,
    file('SWW469+1.p',unknown),
    [] ).

cnf(5,axiom,
    is_state(skc5),
    file('SWW469+1.p',unknown),
    [] ).

cnf(8,axiom,
    ~ equal(skc5,skc4),
    file('SWW469+1.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ hoare_165779456gleton
    | is_state(skc4) ),
    file('SWW469+1.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ is_state(u)
    | equal(u,skc3) ),
    file('SWW469+1.p',unknown),
    [] ).

cnf(12,plain,
    is_state(skc4),
    inference(mrr,[status(thm)],[9,3]),
    [iquote('0:MRR:9.0,3.0')] ).

cnf(14,plain,
    equal(skc5,skc3),
    inference(res,[status(thm),theory(equality)],[5,10]),
    [iquote('0:Res:5.0,10.0')] ).

cnf(17,plain,
    equal(skc4,skc3),
    inference(res,[status(thm),theory(equality)],[12,10]),
    [iquote('0:Res:12.0,10.0')] ).

cnf(19,plain,
    ~ equal(skc4,skc3),
    inference(rew,[status(thm),theory(equality)],[14,8]),
    [iquote('0:Rew:14.0,8.0')] ).

cnf(22,plain,
    ~ equal(skc3,skc3),
    inference(rew,[status(thm),theory(equality)],[17,19]),
    [iquote('0:Rew:17.0,19.0')] ).

cnf(23,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[22]),
    [iquote('0:Obv:22.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SWW469+1 : TPTP v8.1.0. Released v5.3.0.
% 0.03/0.14  % Command  : run_spass %d %s
% 0.13/0.35  % Computer : n020.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sat Jun  4 12:15:22 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.21/0.44  
% 0.21/0.44  SPASS V 3.9 
% 0.21/0.44  SPASS beiseite: Proof found.
% 0.21/0.44  % SZS status Theorem
% 0.21/0.44  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.21/0.44  SPASS derived 9 clauses, backtracked 0 clauses, performed 0 splits and kept 13 clauses.
% 0.21/0.44  SPASS allocated 103867 KBytes.
% 0.21/0.44  SPASS spent	0:00:00.08 on the problem.
% 0.21/0.44  		0:00:00.04 for the input.
% 0.21/0.44  		0:00:00.03 for the FLOTTER CNF translation.
% 0.21/0.44  		0:00:00.00 for inferences.
% 0.21/0.44  		0:00:00.00 for the backtracking.
% 0.21/0.44  		0:00:00.00 for the reduction.
% 0.21/0.44  
% 0.21/0.44  
% 0.21/0.44  Here is a proof with depth 1, length 11 :
% 0.21/0.44  % SZS output start Refutation
% See solution above
% 0.21/0.44  Formulae used in the proof : conj_0 fact_0_state__not__singleton__def conj_1
% 0.21/0.44  
%------------------------------------------------------------------------------