%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWV220+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n008.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 : Wed Jul 20 21:41:40 EDT 2022

% Result   : Theorem 0.20s 0.48s
% Output   : Refutation 0.20s
% 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;   4 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(6,axiom,
    equal(n3,n1),
    file('SWV220+1.p',unknown),
    [] ).

cnf(7,axiom,
    equal(n3,n5),
    file('SWV220+1.p',unknown),
    [] ).

cnf(92,axiom,
    ( ~ equal(n1,n5)
    | ~ equal(n3,n5) ),
    file('SWV220+1.p',unknown),
    [] ).

cnf(163,plain,
    equal(n1,n5),
    inference(rew,[status(thm),theory(equality)],[7,6]),
    [iquote('0:Rew:7.0,6.0')] ).

cnf(181,plain,
    ( ~ equal(n5,n5)
    | ~ equal(n5,n5) ),
    inference(rew,[status(thm),theory(equality)],[7,92,163]),
    [iquote('0:Rew:7.0,92.1,163.0,92.0')] ).

cnf(182,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[181]),
    [iquote('0:Obv:181.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SWV220+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n008.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue Jun 14 23:57:37 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.20/0.48  
% 0.20/0.48  SPASS V 3.9 
% 0.20/0.48  SPASS beiseite: Proof found.
% 0.20/0.48  % SZS status Theorem
% 0.20/0.48  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.48  SPASS derived 5 clauses, backtracked 0 clauses, performed 0 splits and kept 26 clauses.
% 0.20/0.48  SPASS allocated 85782 KBytes.
% 0.20/0.48  SPASS spent	0:00:00.14 on the problem.
% 0.20/0.48  		0:00:00.04 for the input.
% 0.20/0.48  		0:00:00.08 for the FLOTTER CNF translation.
% 0.20/0.48  		0:00:00.00 for inferences.
% 0.20/0.48  		0:00:00.00 for the backtracking.
% 0.20/0.48  		0:00:00.00 for the reduction.
% 0.20/0.48  
% 0.20/0.48  
% 0.20/0.48  Here is a proof with depth 0, length 6 :
% 0.20/0.48  % SZS output start Refutation
% See solution above
% 0.20/0.48  Formulae used in the proof : quaternion_ds1_symm_0361
% 0.20/0.48  
%------------------------------------------------------------------------------