TSTP Solution File: SWW409-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWW409-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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 48.26s 48.45s
% Output : Refutation 48.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 11 unt; 4 nHn; 17 RR)
% Number of literals : 26 ( 0 equ; 9 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('SWW409-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('SWW409-1.p',unknown),
[] ).
cnf(6,axiom,
~ heap(sep(lseg(x2__dfg,nil),emp)),
file('SWW409-1.p',unknown),
[] ).
cnf(7,axiom,
equal(sep(u,sep(v,w)),sep(v,sep(u,w))),
file('SWW409-1.p',unknown),
[] ).
cnf(8,axiom,
equal(sep(lseg(u,u),v),v),
file('SWW409-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('SWW409-1.p',unknown),
[] ).
cnf(15,axiom,
( ~ heap(sep(lseg(u,v),sep(lseg(v,nil),w)))
| heap(sep(lseg(u,nil),w)) ),
file('SWW409-1.p',unknown),
[] ).
cnf(18,plain,
~ heap(sep(lseg(x2__dfg,u),sep(lseg(u,nil),emp))),
inference(res,[status(thm),theory(equality)],[15,6]),
[iquote('0:Res:15.1,6.0')] ).
cnf(26,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(37,plain,
~ heap(sep(lseg(u,nil),sep(lseg(x2__dfg,u),emp))),
inference(spl,[status(thm),theory(equality)],[7,18]),
[iquote('0:SpL:7.0,18.0')] ).
cnf(120,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(683,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(836,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)],[26,683]),
[iquote('0:SpL:26.0,683.0')] ).
cnf(22601,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,836]),
[iquote('0:Res:5.0,836.0')] ).
cnf(22602,plain,
heap(sep(lseg(x1__dfg,x3__dfg),sep(lseg(x2__dfg,x1__dfg),sep(lseg(x3__dfg,nil),emp)))),
inference(mrr,[status(thm)],[22601,3]),
[iquote('0:MRR:22601.1,3.0')] ).
cnf(22610,plain,
heap(sep(lseg(x1__dfg,nil),sep(lseg(x2__dfg,x1__dfg),emp))),
inference(res,[status(thm),theory(equality)],[22602,120]),
[iquote('0:Res:22602.0,120.0')] ).
cnf(22612,plain,
$false,
inference(mrr,[status(thm)],[22610,37]),
[iquote('0:MRR:22610.0,37.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWW409-1 : TPTP v8.1.0. Released v5.2.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n021.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 16:25:19 EDT 2022
% 0.13/0.35 % CPUTime :
% 48.26/48.45
% 48.26/48.45 SPASS V 3.9
% 48.26/48.45 SPASS beiseite: Proof found.
% 48.26/48.45 % SZS status Theorem
% 48.26/48.45 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 48.26/48.45 SPASS derived 22333 clauses, backtracked 0 clauses, performed 0 splits and kept 3050 clauses.
% 48.26/48.45 SPASS allocated 79567 KBytes.
% 48.26/48.45 SPASS spent 0:0:47.94 on the problem.
% 48.26/48.45 0:00:00.04 for the input.
% 48.26/48.45 0:00:00.00 for the FLOTTER CNF translation.
% 48.26/48.45 0:00:00.34 for inferences.
% 48.26/48.45 0:00:00.00 for the backtracking.
% 48.26/48.45 0:0:47.52 for the reduction.
% 48.26/48.45
% 48.26/48.45
% 48.26/48.45 Here is a proof with depth 4, length 17 :
% 48.26/48.45 % SZS output start Refutation
% See solution above
% 48.26/48.45 Formulae used in the proof : premise_3 premise_5 conclusion_1 associative_commutative normalization unfolding_2 unfolding_3
% 48.26/48.45
%------------------------------------------------------------------------------