TSTP Solution File: SWW423-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWW423-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n029.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 00:45:48 EDT 2022
% Result : Unsatisfiable 21.25s 3.05s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWW423-1 : TPTP v8.1.0. Released v5.2.0.
% 0.11/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n029.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 08:17:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 21.25/3.05 % SZS status Unsatisfiable
% 21.25/3.05 % SZS output begin IncompleteProof
% 21.25/3.05 cnf(c0, axiom,
% 21.25/3.05 ~heap(sep(lseg(x1,nil),sep(lseg(x3,nil),emp)))).
% 21.25/3.05 cnf(c1, plain,
% 21.25/3.05 ~heap(sep(lseg(x1,nil),sep(lseg(x3,nil),emp))),
% 21.25/3.05 inference(start, [], [c0])).
% 21.25/3.05
% 21.25/3.05 cnf(c2, axiom,
% 21.25/3.05 heap(sep(lseg(X0,X1),X2)) | X0 = X3 | ~heap(sep(next(X0,X3),sep(lseg(X3,X1),X2)))).
% 21.25/3.05 cnf(a0, assumption,
% 21.25/3.05 sep(lseg(x1,nil),sep(lseg(x3,nil),emp)) = sep(lseg(X0,X1),X2)).
% 21.25/3.05 cnf(c3, plain,
% 21.25/3.05 $false,
% 21.25/3.05 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 21.25/3.05 cnf(c4, plain,
% 21.25/3.05 X0 = X3 | ~heap(sep(next(X0,X3),sep(lseg(X3,X1),X2))),
% 21.25/3.05 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 21.25/3.05
% 21.25/3.05 cnf(c5, axiom,
% 21.25/3.05 x1 != x2).
% 21.25/3.05 cnf(a1, assumption,
% 21.25/3.05 x2 = X3).
% 21.25/3.05 cnf(c6, plain,
% 21.25/3.05 ~heap(sep(next(X0,X3),sep(lseg(X3,X1),X2))),
% 21.25/3.05 inference(strict_subterm_extension, [assumptions([a1])], [c4, c5])).
% 21.25/3.05 cnf(c7, plain,
% 21.25/3.05 $false,
% 21.25/3.05 inference(strict_subterm_extension, [assumptions([a1])], [c4, c5])).
% 21.25/3.05 cnf(c8, plain,
% 21.25/3.05 x1 != X0,
% 21.25/3.05 inference(strict_subterm_extension, [assumptions([a1])], [c4, c5])).
% 21.25/3.05
% 21.25/3.05 cnf(a2, assumption,
% 21.25/3.05 x1 = X0).
% 21.25/3.05 cnf(c9, plain,
% 21.25/3.05 $false,
% 21.25/3.05 inference(reflexivity, [assumptions([a2])], [c8])).
% 21.25/3.05
% 21.25/3.05 cnf(c10, axiom,
% 21.25/3.05 sep(X4,sep(X5,X6)) = sep(X5,sep(X4,X6))).
% 21.25/3.05 cnf(a3, assumption,
% 21.25/3.05 sep(next(X0,X3),sep(lseg(X3,X1),X2)) = sep(X4,sep(X5,X6))).
% 21.25/3.05 cnf(c11, plain,
% 21.25/3.05 $false,
% 21.25/3.05 inference(strict_function_extension, [assumptions([a3])], [c6, c10])).
% 21.25/3.05 cnf(c12, plain,
% 21.25/3.05 $false,
% 21.25/3.05 inference(strict_function_extension, [assumptions([a3])], [c6, c10])).
% 21.25/3.05 cnf(c13, plain,
% 21.25/3.05 X7 != sep(X5,sep(X4,X6)) | ~heap(X7),
% 21.25/3.05 inference(strict_function_extension, [assumptions([a3])], [c6, c10])).
% 21.25/3.05
% 21.25/3.05 cnf(c14, axiom,
% 21.25/3.05 sep(X8,sep(X9,X10)) = sep(X9,sep(X8,X10))).
% 21.25/3.05 cnf(a4, assumption,
% 21.25/3.05 sep(X4,X6) = sep(X8,sep(X9,X10))).
% 21.25/3.05 cnf(c15, plain,
% 21.25/3.05 ~heap(X7),
% 21.25/3.05 inference(strict_function_extension, [assumptions([a4])], [c13, c14])).
% 21.25/3.05 cnf(c16, plain,
% 21.25/3.05 $false,
% 21.25/3.05 inference(strict_function_extension, [assumptions([a4])], [c13, c14])).
% 21.25/3.05 cnf(c17, plain,
% 21.25/3.05 X11 != sep(X9,sep(X8,X10)) | X7 != sep(X5,X11),
% 21.25/3.05 inference(strict_function_extension, [assumptions([a4])], [c13, c14])).
% 21.25/3.05
% 21.25/3.05 cnf(a5, assumption,
% 21.25/3.05 X11 = sep(X9,sep(X8,X10))).
% 21.25/3.05 cnf(c18, plain,
% 21.25/3.05 X7 != sep(X5,X11),
% 21.25/3.05 inference(reflexivity, [assumptions([a5])], [c17])).
% 21.25/3.05
% 21.25/3.05 cnf(a6, assumption,
% 21.25/3.05 X7 = sep(X5,X11)).
% 21.25/3.05 cnf(c19, plain,
% 21.25/3.05 $false,
% 21.25/3.05 inference(reflexivity, [assumptions([a6])], [c18])).
% 21.25/3.05
% 21.25/3.05 cnf(c20, axiom,
% 21.25/3.05 heap(sep(lseg(x2,nil),sep(lseg(x3,nil),sep(next(x1,x2),emp))))).
% 21.25/3.05 cnf(a7, assumption,
% 21.25/3.05 X7 = sep(lseg(x2,nil),sep(lseg(x3,nil),sep(next(x1,x2),emp)))).
% 21.25/3.05 cnf(c21, plain,
% 21.25/3.05 $false,
% 21.25/3.05 inference(strict_predicate_extension, [assumptions([a7])], [c15, c20])).
% 21.25/3.05 cnf(c22, plain,
% 21.25/3.05 $false,
% 21.25/3.05 inference(strict_predicate_extension, [assumptions([a7])], [c15, c20])).
% 21.25/3.05
% 21.25/3.05 cnf(c23, plain,
% 21.25/3.05 $false,
% 21.25/3.05 inference(constraint_solving, [
% 21.25/3.05 bind(X0, x1),
% 21.25/3.05 bind(X1, nil),
% 21.25/3.05 bind(X2, sep(lseg(x3,nil),emp)),
% 21.25/3.05 bind(X3, x2),
% 21.25/3.05 bind(X4, next(X0,X3)),
% 21.25/3.05 bind(X5, lseg(X3,X1)),
% 21.25/3.05 bind(X6, sep(lseg(x3,nil),emp)),
% 21.25/3.05 bind(X7, sep(X5,X11)),
% 21.25/3.05 bind(X8, next(X0,X3)),
% 21.25/3.05 bind(X9, lseg(x3,nil)),
% 21.25/3.05 bind(X10, emp),
% 21.25/3.05 bind(X11, sep(X9,sep(X8,X10)))
% 21.25/3.05 ],
% 21.25/3.05 [a0, a1, a2, a3, a4, a5, a6, a7])).
% 21.25/3.05
% 21.25/3.05 % SZS output end IncompleteProof
%------------------------------------------------------------------------------