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

% Computer : n025.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:27 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    ~ equal(x2__dfg,x1__dfg),
    file('SWW417-1.p',unknown),
    [] ).

cnf(3,axiom,
    heap(sep(lseg(x2__dfg,nil),sep(next(x1__dfg,x2__dfg),emp))),
    file('SWW417-1.p',unknown),
    [] ).

cnf(4,axiom,
    ~ heap(sep(lseg(x1__dfg,nil),emp)),
    file('SWW417-1.p',unknown),
    [] ).

cnf(5,axiom,
    equal(sep(u,sep(v,w)),sep(v,sep(u,w))),
    file('SWW417-1.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ heap(sep(next(u,v),sep(lseg(v,w),x)))
    | heap(sep(lseg(u,w),x))
    | equal(u,v) ),
    file('SWW417-1.p',unknown),
    [] ).

cnf(17,plain,
    ( ~ heap(sep(next(x1__dfg,u),sep(lseg(u,nil),emp)))
    | equal(x1__dfg,u) ),
    inference(res,[status(thm),theory(equality)],[12,4]),
    [iquote('0:Res:12.2,4.0')] ).

cnf(18,plain,
    ( ~ heap(sep(lseg(u,nil),sep(next(x1__dfg,u),emp)))
    | equal(x1__dfg,u) ),
    inference(rew,[status(thm),theory(equality)],[5,17]),
    [iquote('0:Rew:5.0,17.0')] ).

cnf(101,plain,
    equal(x2__dfg,x1__dfg),
    inference(res,[status(thm),theory(equality)],[3,18]),
    [iquote('0:Res:3.0,18.0')] ).

cnf(102,plain,
    $false,
    inference(mrr,[status(thm)],[101,2]),
    [iquote('0:MRR:101.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SWW417-1 : TPTP v8.1.0. Released v5.2.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.13/0.35  % Computer : n025.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:55:46 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.43  
% 0.20/0.43  SPASS V 3.9 
% 0.20/0.43  SPASS beiseite: Proof found.
% 0.20/0.43  % SZS status Theorem
% 0.20/0.43  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.43  SPASS derived 83 clauses, backtracked 0 clauses, performed 0 splits and kept 33 clauses.
% 0.20/0.43  SPASS allocated 63238 KBytes.
% 0.20/0.43  SPASS spent	0:00:00.07 on the problem.
% 0.20/0.43  		0:00:00.04 for the input.
% 0.20/0.43  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.43  		0:00:00.00 for inferences.
% 0.20/0.43  		0:00:00.00 for the backtracking.
% 0.20/0.43  		0:00:00.00 for the reduction.
% 0.20/0.43  
% 0.20/0.43  
% 0.20/0.43  Here is a proof with depth 2, length 9 :
% 0.20/0.43  % SZS output start Refutation
% See solution above
% 0.20/0.43  Formulae used in the proof : premise_2 premise_3 conclusion_1 associative_commutative unfolding_2
% 0.20/0.43  
%------------------------------------------------------------------------------