%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWW962+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n019.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:29:24 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(15,axiom,
    ~ equal(constr_CONST_1,constr_CONST_0x30),
    file('SWW962+1.p',unknown),
    [] ).

cnf(104,axiom,
    equal(constr_assoc_pair_2_get_1(tuple_assoc_pair(u,v)),v),
    file('SWW962+1.p',unknown),
    [] ).

cnf(105,axiom,
    equal(constr_assoc_pair_2_get_0x30(tuple_assoc_pair(u,v)),u),
    file('SWW962+1.p',unknown),
    [] ).

cnf(171,axiom,
    equal(tuple_assoc_pair(tuple_assoc_pair(u,v),w),tuple_assoc_pair(u,tuple_assoc_pair(v,w))),
    file('SWW962+1.p',unknown),
    [] ).

cnf(275,plain,
    equal(constr_assoc_pair_2_get_1(tuple_assoc_pair(u,tuple_assoc_pair(v,w))),w),
    inference(spr,[status(thm),theory(equality)],[171,104]),
    [iquote('0:SpR:171.0,104.0')] ).

cnf(283,plain,
    equal(tuple_assoc_pair(u,v),v),
    inference(rew,[status(thm),theory(equality)],[104,275]),
    [iquote('0:Rew:104.0,275.0')] ).

cnf(286,plain,
    equal(constr_assoc_pair_2_get_0x30(u),v),
    inference(rew,[status(thm),theory(equality)],[283,105]),
    [iquote('0:Rew:283.0,105.0')] ).

cnf(294,plain,
    $false,
    inference(aed,[status(thm),theory(equality)],[15,286]),
    [iquote('0:AED:15.0,286.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWW962+1 : TPTP v8.1.0. Released v7.4.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n019.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 : Sun Jun  5 14:51:55 EDT 2022
% 0.13/0.34  % 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 87 clauses, backtracked 0 clauses, performed 0 splits and kept 198 clauses.
% 0.20/0.48  SPASS allocated 97986 KBytes.
% 0.20/0.48  SPASS spent	0:00:00.12 on the problem.
% 0.20/0.48  		0:00:00.04 for the input.
% 0.20/0.48  		0:00:00.04 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.01 for the reduction.
% 0.20/0.48  
% 0.20/0.48  
% 0.20/0.48  Here is a proof with depth 1, length 8 :
% 0.20/0.48  % SZS output start Refutation
% See solution above
% 0.20/0.48  Formulae used in the proof : ax0 ax85 ax86 ax82
% 0.20/0.48  
%------------------------------------------------------------------------------