TSTP Solution File: SWW410-1 by SPASS---3.9

View Problem - Process Solution

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

% Computer : n022.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:26 EDT 2022

% Result   : Unsatisfiable 45.45s 45.63s
% Output   : Refutation 45.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   24 (  14 unt;   5 nHn;  24 RR)
%            Number of literals    :   38 (   0 equ;  14 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;  10 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    ~ equal(x3__dfg,x1__dfg),
    file('SWW410-1.p',unknown),
    [] ).

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

cnf(6,axiom,
    ~ heap(sep(lseg(x3__dfg,nil),sep(lseg(x2__dfg,x3__dfg),emp))),
    file('SWW410-1.p',unknown),
    [] ).

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

cnf(8,axiom,
    equal(sep(lseg(u,u),v),v),
    file('SWW410-1.p',unknown),
    [] ).

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

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

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

cnf(18,plain,
    ~ heap(sep(lseg(x2__dfg,x3__dfg),sep(lseg(x3__dfg,nil),emp))),
    inference(rew,[status(thm),theory(equality)],[7,6]),
    [iquote('0:Rew:7.0,6.0')] ).

cnf(20,plain,
    ( ~ heap(sep(lseg(x2__dfg,u),sep(lseg(u,x3__dfg),sep(lseg(x3__dfg,nil),emp))))
    | equal(x3__dfg,nil) ),
    inference(res,[status(thm),theory(equality)],[17,18]),
    [iquote('0:Res:17.2,18.0')] ).

cnf(24,plain,
    equal(sep(u,sep(v,sep(w,x))),sep(v,sep(w,sep(u,x)))),
    inference(spr,[status(thm),theory(equality)],[7]),
    [iquote('0:SpR:7.0,7.0')] ).

cnf(105,plain,
    ( ~ heap(sep(lseg(u,v),sep(w,sep(lseg(v,nil),x))))
    | heap(sep(lseg(u,nil),sep(w,x))) ),
    inference(spl,[status(thm),theory(equality)],[7,15]),
    [iquote('0:SpL:7.0,15.0')] ).

cnf(107,plain,
    ( ~ heap(sep(lseg(u,nil),sep(lseg(v,u),w)))
    | heap(sep(lseg(v,nil),w)) ),
    inference(spl,[status(thm),theory(equality)],[7,15]),
    [iquote('0:SpL:7.0,15.0')] ).

cnf(637,plain,
    ( ~ heap(sep(next(u,v),w))
    | heap(sep(lseg(u,v),w))
    | equal(u,v) ),
    inference(spl,[status(thm),theory(equality)],[8,14]),
    [iquote('0:SpL:8.0,14.0')] ).

cnf(826,plain,
    ( ~ heap(sep(u,sep(v,sep(next(w,x),y))))
    | heap(sep(lseg(w,x),sep(u,sep(v,y))))
    | equal(w,x) ),
    inference(spl,[status(thm),theory(equality)],[24,637]),
    [iquote('0:SpL:24.0,637.0')] ).

cnf(1102,plain,
    ( ~ heap(sep(lseg(u,x3__dfg),sep(lseg(x2__dfg,u),sep(lseg(x3__dfg,nil),emp))))
    | equal(x3__dfg,nil) ),
    inference(spl,[status(thm),theory(equality)],[7,20]),
    [iquote('0:SpL:7.0,20.0')] ).

cnf(22337,plain,
    ( heap(sep(lseg(x1__dfg,x3__dfg),sep(lseg(x2__dfg,x1__dfg),sep(lseg(x3__dfg,nil),emp))))
    | equal(x3__dfg,x1__dfg) ),
    inference(res,[status(thm),theory(equality)],[5,826]),
    [iquote('0:Res:5.0,826.0')] ).

cnf(22338,plain,
    heap(sep(lseg(x1__dfg,x3__dfg),sep(lseg(x2__dfg,x1__dfg),sep(lseg(x3__dfg,nil),emp)))),
    inference(mrr,[status(thm)],[22337,3]),
    [iquote('0:MRR:22337.1,3.0')] ).

cnf(22346,plain,
    heap(sep(lseg(x1__dfg,nil),sep(lseg(x2__dfg,x1__dfg),emp))),
    inference(res,[status(thm),theory(equality)],[22338,105]),
    [iquote('0:Res:22338.0,105.0')] ).

cnf(22347,plain,
    equal(x3__dfg,nil),
    inference(res,[status(thm),theory(equality)],[22338,1102]),
    [iquote('0:Res:22338.0,1102.0')] ).

cnf(22351,plain,
    ~ heap(sep(lseg(x2__dfg,nil),sep(lseg(nil,nil),emp))),
    inference(rew,[status(thm),theory(equality)],[22347,18]),
    [iquote('0:Rew:22347.0,18.0')] ).

cnf(22354,plain,
    ~ heap(sep(lseg(x2__dfg,nil),emp)),
    inference(rew,[status(thm),theory(equality)],[8,22351]),
    [iquote('0:Rew:8.0,22351.0')] ).

cnf(22374,plain,
    heap(sep(lseg(x2__dfg,nil),emp)),
    inference(res,[status(thm),theory(equality)],[22346,107]),
    [iquote('0:Res:22346.0,107.0')] ).

cnf(22375,plain,
    $false,
    inference(mrr,[status(thm)],[22374,22354]),
    [iquote('0:MRR:22374.0,22354.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWW410-1 : TPTP v8.1.0. Released v5.2.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n022.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jun  5 13:10:50 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 45.45/45.63  
% 45.45/45.63  SPASS V 3.9 
% 45.45/45.63  SPASS beiseite: Proof found.
% 45.45/45.63  % SZS status Theorem
% 45.45/45.63  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 45.45/45.63  SPASS derived 22072 clauses, backtracked 0 clauses, performed 0 splits and kept 3017 clauses.
% 45.45/45.63  SPASS allocated 79381 KBytes.
% 45.45/45.63  SPASS spent	0:0:45.13 on the problem.
% 45.45/45.63  		0:00:00.04 for the input.
% 45.45/45.63  		0:00:00.00 for the FLOTTER CNF translation.
% 45.45/45.63  		0:00:00.33 for inferences.
% 45.45/45.63  		0:00:00.00 for the backtracking.
% 45.45/45.63  		0:0:44.74 for the reduction.
% 45.45/45.63  
% 45.45/45.63  
% 45.45/45.63  Here is a proof with depth 5, length 24 :
% 45.45/45.63  % SZS output start Refutation
% See solution above
% 45.45/45.63  Formulae used in the proof : premise_3 premise_5 conclusion_1 associative_commutative normalization unfolding_2 unfolding_3 unfolding_5
% 45.45/45.63  
%------------------------------------------------------------------------------