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

% Computer : n027.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:25 EDT 2022

% Result   : Unsatisfiable 0.19s 0.53s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   13 (   9 unt;   2 nHn;  13 RR)
%            Number of literals    :   19 (   0 equ;   8 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,nil),
    file('SWW400-1.p',unknown),
    [] ).

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

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

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

cnf(6,axiom,
    equal(sep(lseg(u,u),v),v),
    file('SWW400-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('SWW400-1.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ heap(sep(lseg(u,v),sep(lseg(v,nil),w)))
    | heap(sep(lseg(u,nil),w)) ),
    file('SWW400-1.p',unknown),
    [] ).

cnf(16,plain,
    ~ heap(sep(lseg(x1__dfg,u),sep(lseg(u,nil),emp))),
    inference(res,[status(thm),theory(equality)],[13,4]),
    [iquote('0:Res:13.1,4.0')] ).

cnf(36,plain,
    ~ heap(sep(lseg(u,nil),sep(lseg(x1__dfg,u),emp))),
    inference(spl,[status(thm),theory(equality)],[5,16]),
    [iquote('0:SpL:5.0,16.0')] ).

cnf(308,plain,
    ( ~ heap(sep(next(u,v),w))
    | heap(sep(lseg(u,v),w))
    | equal(u,v) ),
    inference(spl,[status(thm),theory(equality)],[6,12]),
    [iquote('0:SpL:6.0,12.0')] ).

cnf(837,plain,
    ( ~ heap(sep(next(u,nil),sep(lseg(x1__dfg,u),emp)))
    | equal(u,nil) ),
    inference(res,[status(thm),theory(equality)],[308,36]),
    [iquote('0:Res:308.1,36.0')] ).

cnf(890,plain,
    equal(x2__dfg,nil),
    inference(res,[status(thm),theory(equality)],[3,837]),
    [iquote('0:Res:3.0,837.0')] ).

cnf(891,plain,
    $false,
    inference(mrr,[status(thm)],[890,2]),
    [iquote('0:MRR:890.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWW400-1 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n027.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 10:39:53 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.19/0.53  
% 0.19/0.53  SPASS V 3.9 
% 0.19/0.53  SPASS beiseite: Proof found.
% 0.19/0.53  % SZS status Theorem
% 0.19/0.53  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.53  SPASS derived 851 clauses, backtracked 0 clauses, performed 0 splits and kept 140 clauses.
% 0.19/0.53  SPASS allocated 64074 KBytes.
% 0.19/0.53  SPASS spent	0:00:00.17 on the problem.
% 0.19/0.53  		0:00:00.04 for the input.
% 0.19/0.53  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.53  		0:00:00.02 for inferences.
% 0.19/0.53  		0:00:00.00 for the backtracking.
% 0.19/0.53  		0:00:00.09 for the reduction.
% 0.19/0.53  
% 0.19/0.53  
% 0.19/0.53  Here is a proof with depth 4, length 13 :
% 0.19/0.53  % SZS output start Refutation
% See solution above
% 0.19/0.53  Formulae used in the proof : premise_2 premise_3 conclusion_1 associative_commutative normalization unfolding_2 unfolding_3
% 0.19/0.53  
%------------------------------------------------------------------------------