TSTP Solution File: SWW421-1 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SWW421-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 : n017.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 0.20s 0.37s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWW421-1 : TPTP v8.1.0. Released v5.2.0.
% 0.00/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33  % Computer : n017.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jun  5 20:59:31 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.20/0.37  % SZS status Unsatisfiable
% 0.20/0.37  % SZS output begin IncompleteProof
% 0.20/0.37  cnf(c0, axiom,
% 0.20/0.37  	~heap(sep(lseg(x1,x3),emp))).
% 0.20/0.37  cnf(c1, plain,
% 0.20/0.37  	~heap(sep(lseg(x1,x3),emp)),
% 0.20/0.37  	inference(start, [], [c0])).
% 0.20/0.37  
% 0.20/0.37  cnf(c2, axiom,
% 0.20/0.37  	heap(sep(lseg(X0,X1),X2)) | X0 = X3 | ~heap(sep(next(X0,X3),sep(lseg(X3,X1),X2)))).
% 0.20/0.37  cnf(a0, assumption,
% 0.20/0.37  	sep(lseg(x1,x3),emp) = sep(lseg(X0,X1),X2)).
% 0.20/0.37  cnf(c3, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.37  cnf(c4, plain,
% 0.20/0.37  	X0 = X3 | ~heap(sep(next(X0,X3),sep(lseg(X3,X1),X2))),
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.37  
% 0.20/0.37  cnf(c5, axiom,
% 0.20/0.37  	x1 != x2).
% 0.20/0.37  cnf(a1, assumption,
% 0.20/0.37  	x2 = X3).
% 0.20/0.37  cnf(c6, plain,
% 0.20/0.37  	~heap(sep(next(X0,X3),sep(lseg(X3,X1),X2))),
% 0.20/0.37  	inference(strict_subterm_extension, [assumptions([a1])], [c4, c5])).
% 0.20/0.37  cnf(c7, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(strict_subterm_extension, [assumptions([a1])], [c4, c5])).
% 0.20/0.37  cnf(c8, plain,
% 0.20/0.37  	x1 != X0,
% 0.20/0.37  	inference(strict_subterm_extension, [assumptions([a1])], [c4, c5])).
% 0.20/0.37  
% 0.20/0.37  cnf(a2, assumption,
% 0.20/0.37  	x1 = X0).
% 0.20/0.37  cnf(c9, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(reflexivity, [assumptions([a2])], [c8])).
% 0.20/0.37  
% 0.20/0.37  cnf(c10, axiom,
% 0.20/0.37  	sep(X4,sep(X5,X6)) = sep(X5,sep(X4,X6))).
% 0.20/0.37  cnf(a3, assumption,
% 0.20/0.37  	sep(next(X0,X3),sep(lseg(X3,X1),X2)) = sep(X4,sep(X5,X6))).
% 0.20/0.37  cnf(c11, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(strict_function_extension, [assumptions([a3])], [c6, c10])).
% 0.20/0.37  cnf(c12, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(strict_function_extension, [assumptions([a3])], [c6, c10])).
% 0.20/0.37  cnf(c13, plain,
% 0.20/0.37  	X7 != sep(X5,sep(X4,X6)) | ~heap(X7),
% 0.20/0.37  	inference(strict_function_extension, [assumptions([a3])], [c6, c10])).
% 0.20/0.37  
% 0.20/0.37  cnf(a4, assumption,
% 0.20/0.37  	X7 = sep(X5,sep(X4,X6))).
% 0.20/0.37  cnf(c14, plain,
% 0.20/0.37  	~heap(X7),
% 0.20/0.37  	inference(reflexivity, [assumptions([a4])], [c13])).
% 0.20/0.37  
% 0.20/0.37  cnf(c15, axiom,
% 0.20/0.37  	heap(sep(lseg(x2,x3),sep(next(x1,x2),emp)))).
% 0.20/0.37  cnf(a5, assumption,
% 0.20/0.37  	X7 = sep(lseg(x2,x3),sep(next(x1,x2),emp))).
% 0.20/0.37  cnf(c16, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a5])], [c14, c15])).
% 0.20/0.37  cnf(c17, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a5])], [c14, c15])).
% 0.20/0.37  
% 0.20/0.37  cnf(c18, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(constraint_solving, [
% 0.20/0.37  		bind(X0, x1),
% 0.20/0.37  		bind(X1, x3),
% 0.20/0.37  		bind(X2, emp),
% 0.20/0.37  		bind(X3, x2),
% 0.20/0.37  		bind(X4, next(X0,X3)),
% 0.20/0.37  		bind(X5, lseg(X3,X1)),
% 0.20/0.37  		bind(X6, emp),
% 0.20/0.37  		bind(X7, sep(X5,sep(X4,X6)))
% 0.20/0.37  	],
% 0.20/0.37  	[a0, a1, a2, a3, a4, a5])).
% 0.20/0.37  
% 0.20/0.37  % SZS output end IncompleteProof
%------------------------------------------------------------------------------