TSTP Solution File: SWV414+1 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SWV414+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n006.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 : Wed Jul 20 19:46:50 EDT 2022

% Result   : Theorem 0.20s 0.35s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWV414+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33  % Computer : n006.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Thu Jun 16 04:19:11 EDT 2022
% 0.20/0.34  % CPUTime  : 
% 0.20/0.35  % SZS status Theorem
% 0.20/0.35  % SZS output begin IncompleteProof
% 0.20/0.35  cnf(c0, axiom,
% 0.20/0.35  	create_pq != i(triple(create_pqp,create_slb,sK5))).
% 0.20/0.35  cnf(c1, plain,
% 0.20/0.35  	create_pq != i(triple(create_pqp,create_slb,sK5)),
% 0.20/0.35  	inference(start, [], [c0])).
% 0.20/0.35  
% 0.20/0.35  cnf(c2, axiom,
% 0.20/0.35  	create_pq = i(triple(X0,create_slb,X1))).
% 0.20/0.35  cnf(a0, assumption,
% 0.20/0.35  	i(triple(create_pqp,create_slb,sK5)) = i(triple(X0,create_slb,X1))).
% 0.20/0.35  cnf(c3, plain,
% 0.20/0.35  	$false,
% 0.20/0.35  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.35  cnf(c4, plain,
% 0.20/0.35  	$false,
% 0.20/0.35  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.35  cnf(c5, plain,
% 0.20/0.35  	X2 != create_pq | create_pq != X2,
% 0.20/0.35  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.35  
% 0.20/0.35  cnf(a1, assumption,
% 0.20/0.35  	X2 = create_pq).
% 0.20/0.35  cnf(c6, plain,
% 0.20/0.35  	create_pq != X2,
% 0.20/0.35  	inference(reflexivity, [assumptions([a1])], [c5])).
% 0.20/0.35  
% 0.20/0.35  cnf(a2, assumption,
% 0.20/0.35  	create_pq = X2).
% 0.20/0.35  cnf(c7, plain,
% 0.20/0.35  	$false,
% 0.20/0.35  	inference(reflexivity, [assumptions([a2])], [c6])).
% 0.20/0.35  
% 0.20/0.35  cnf(c8, plain,
% 0.20/0.35  	$false,
% 0.20/0.35  	inference(constraint_solving, [
% 0.20/0.35  		bind(X0, create_pqp),
% 0.20/0.35  		bind(X1, sK5),
% 0.20/0.35  		bind(X2, create_pq)
% 0.20/0.35  	],
% 0.20/0.35  	[a0, a1, a2])).
% 0.20/0.35  
% 0.20/0.35  % SZS output end IncompleteProof
%------------------------------------------------------------------------------