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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : PUZ063-1 : TPTP v8.1.0. Released v3.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 : n027.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 : Mon Jul 18 18:18:57 EDT 2022

% Result   : Unsatisfiable 1.19s 0.61s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : PUZ063-1 : TPTP v8.1.0. Released v3.2.0.
% 0.14/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.34  % Computer : n027.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sun May 29 00:54:29 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 1.19/0.61  % SZS status Unsatisfiable
% 1.19/0.61  % SZS output begin IncompleteProof
% 1.19/0.61  cnf(c0, axiom,
% 1.19/0.61  	~c_in(c_union(c_emptyset,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a))).
% 1.19/0.61  cnf(c1, plain,
% 1.19/0.61  	~c_in(c_union(c_emptyset,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
% 1.19/0.61  	inference(start, [], [c0])).
% 1.19/0.61  
% 1.19/0.61  cnf(c2, axiom,
% 1.19/0.61  	c_union(c_emptyset,X0,X1) = X0).
% 1.19/0.61  cnf(a0, assumption,
% 1.19/0.61  	c_union(c_emptyset,v_u,t_a) = c_union(c_emptyset,X0,X1)).
% 1.19/0.61  cnf(c3, plain,
% 1.19/0.61  	$false,
% 1.19/0.61  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 1.19/0.61  cnf(c4, plain,
% 1.19/0.61  	$false,
% 1.19/0.61  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 1.19/0.61  cnf(c5, plain,
% 1.19/0.61  	X2 != X0 | ~c_in(X2,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
% 1.19/0.61  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 1.19/0.61  
% 1.19/0.61  cnf(a1, assumption,
% 1.19/0.61  	X2 = X0).
% 1.19/0.61  cnf(c6, plain,
% 1.19/0.61  	~c_in(X2,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
% 1.19/0.61  	inference(reflexivity, [assumptions([a1])], [c5])).
% 1.19/0.61  
% 1.19/0.61  cnf(c7, axiom,
% 1.19/0.61  	c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a))).
% 1.19/0.61  cnf(a2, assumption,
% 1.19/0.61  	X2 = v_u).
% 1.19/0.61  cnf(a3, assumption,
% 1.19/0.61  	c_Mutil_Otiling(v_A,t_a) = c_Mutil_Otiling(v_A,t_a)).
% 1.19/0.61  cnf(a4, assumption,
% 1.19/0.61  	tc_set(t_a) = tc_set(t_a)).
% 1.19/0.61  cnf(c8, plain,
% 1.19/0.61  	$false,
% 1.19/0.61  	inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c6, c7])).
% 1.19/0.61  cnf(c9, plain,
% 1.19/0.61  	$false,
% 1.19/0.61  	inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c6, c7])).
% 1.19/0.61  
% 1.19/0.61  cnf(c10, plain,
% 1.19/0.61  	$false,
% 1.19/0.61  	inference(constraint_solving, [
% 1.19/0.61  		bind(X0, v_u),
% 1.19/0.61  		bind(X1, t_a),
% 1.19/0.61  		bind(X2, v_u)
% 1.19/0.61  	],
% 1.19/0.61  	[a0, a1, a2, a3, a4])).
% 1.19/0.61  
% 1.19/0.61  % SZS output end IncompleteProof
%------------------------------------------------------------------------------