TSTP Solution File: SWW423-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWW423-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:27 EDT 2022
% Result : Unsatisfiable 41.37s 41.62s
% Output : Refutation 41.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 9 ( 6 unt; 3 nHn; 9 RR)
% Number of literals : 14 ( 0 equ; 4 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(2,axiom,
~ equal(x2__dfg,x1__dfg),
file('SWW423-1.p',unknown),
[] ).
cnf(4,axiom,
heap(sep(lseg(x2__dfg,nil),sep(lseg(x3__dfg,nil),sep(next(x1__dfg,x2__dfg),emp)))),
file('SWW423-1.p',unknown),
[] ).
cnf(5,axiom,
~ heap(sep(lseg(x1__dfg,nil),sep(lseg(x3__dfg,nil),emp))),
file('SWW423-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sep(u,sep(v,w)),sep(v,sep(u,w))),
file('SWW423-1.p',unknown),
[] ).
cnf(13,axiom,
( ~ heap(sep(next(u,v),sep(lseg(v,w),x)))
| heap(sep(lseg(u,w),x))
| equal(u,v) ),
file('SWW423-1.p',unknown),
[] ).
cnf(22,plain,
equal(sep(u,sep(v,sep(w,x))),sep(v,sep(w,sep(u,x)))),
inference(spr,[status(thm),theory(equality)],[6]),
[iquote('0:SpR:6.0,6.0')] ).
cnf(686,plain,
( ~ heap(sep(lseg(u,v),sep(w,sep(next(x,u),y))))
| heap(sep(lseg(x,v),sep(w,y)))
| equal(x,u) ),
inference(spl,[status(thm),theory(equality)],[22,13]),
[iquote('0:SpL:22.0,13.0')] ).
cnf(21005,plain,
( heap(sep(lseg(x1__dfg,nil),sep(lseg(x3__dfg,nil),emp)))
| equal(x2__dfg,x1__dfg) ),
inference(res,[status(thm),theory(equality)],[4,686]),
[iquote('0:Res:4.0,686.0')] ).
cnf(21006,plain,
$false,
inference(mrr,[status(thm)],[21005,5,2]),
[iquote('0:MRR:21005.0,21005.1,5.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWW423-1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.14 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jun 5 08:10:36 EDT 2022
% 0.14/0.35 % CPUTime :
% 41.37/41.62
% 41.37/41.62 SPASS V 3.9
% 41.37/41.62 SPASS beiseite: Proof found.
% 41.37/41.62 % SZS status Theorem
% 41.37/41.62 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 41.37/41.62 SPASS derived 20756 clauses, backtracked 0 clauses, performed 0 splits and kept 2717 clauses.
% 41.37/41.62 SPASS allocated 78883 KBytes.
% 41.37/41.62 SPASS spent 0:0:41.12 on the problem.
% 41.37/41.62 0:00:00.03 for the input.
% 41.37/41.62 0:00:00.00 for the FLOTTER CNF translation.
% 41.37/41.62 0:00:00.31 for inferences.
% 41.37/41.62 0:00:00.00 for the backtracking.
% 41.37/41.62 0:0:40.74 for the reduction.
% 41.37/41.62
% 41.37/41.62
% 41.37/41.62 Here is a proof with depth 3, length 9 :
% 41.37/41.62 % SZS output start Refutation
% See solution above
% 41.37/41.62 Formulae used in the proof : premise_2 premise_4 conclusion_1 associative_commutative unfolding_2
% 41.37/41.62
%------------------------------------------------------------------------------