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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SWV400+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 : n032.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:47 EDT 2022

% Result   : Theorem 0.09s 0.30s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09  % Problem  : SWV400+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.10  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.09/0.30  % Computer : n032.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit : 300
% 0.09/0.30  % WCLimit  : 600
% 0.09/0.30  % DateTime : Wed Jun 15 10:48:58 EDT 2022
% 0.09/0.30  % CPUTime  : 
% 0.09/0.30  % SZS status Theorem
% 0.09/0.30  % SZS output begin IncompleteProof
% 0.09/0.30  cnf(c0, axiom,
% 0.09/0.30  	pair_in_list(create_slb,sK1,sK2)).
% 0.09/0.30  cnf(c1, plain,
% 0.09/0.30  	pair_in_list(create_slb,sK1,sK2),
% 0.09/0.30  	inference(start, [], [c0])).
% 0.09/0.30  
% 0.09/0.30  cnf(c2, axiom,
% 0.09/0.30  	~pair_in_list(create_slb,X0,X1)).
% 0.09/0.30  cnf(a0, assumption,
% 0.09/0.30  	create_slb = create_slb).
% 0.09/0.30  cnf(a1, assumption,
% 0.09/0.30  	sK1 = X0).
% 0.09/0.30  cnf(a2, assumption,
% 0.09/0.30  	sK2 = X1).
% 0.09/0.30  cnf(c3, plain,
% 0.09/0.30  	$false,
% 0.09/0.30  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.09/0.30  cnf(c4, plain,
% 0.09/0.30  	$false,
% 0.09/0.30  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.09/0.30  
% 0.09/0.30  cnf(c5, plain,
% 0.09/0.30  	$false,
% 0.09/0.30  	inference(constraint_solving, [
% 0.09/0.30  		bind(X0, sK1),
% 0.09/0.30  		bind(X1, sK2)
% 0.09/0.30  	],
% 0.09/0.30  	[a0, a1, a2])).
% 0.09/0.30  
% 0.09/0.30  % SZS output end IncompleteProof
%------------------------------------------------------------------------------