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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SWV377+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 : n026.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:43 EDT 2022

% Result   : Theorem 0.13s 0.38s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SWV377+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.35  % Computer : n026.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Tue Jun 14 14:58:36 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.38  % SZS status Theorem
% 0.13/0.38  % SZS output begin IncompleteProof
% 0.13/0.38  cnf(c0, axiom,
% 0.13/0.38  	~ok(triple(sK1,sK2,sK3))).
% 0.13/0.38  cnf(c1, plain,
% 0.13/0.38  	~ok(triple(sK1,sK2,sK3)),
% 0.13/0.38  	inference(start, [], [c0])).
% 0.13/0.38  
% 0.13/0.38  cnf(c2, axiom,
% 0.13/0.38  	bad = X0 | ok(triple(X1,X2,X0))).
% 0.13/0.38  cnf(a0, assumption,
% 0.13/0.38  	triple(sK1,sK2,sK3) = triple(X1,X2,X0)).
% 0.13/0.38  cnf(c3, plain,
% 0.13/0.38  	$false,
% 0.13/0.38  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.38  cnf(c4, plain,
% 0.13/0.38  	bad = X0,
% 0.13/0.38  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.38  
% 0.13/0.38  cnf(c5, axiom,
% 0.13/0.38  	ok(insert_cpq(triple(sK1,sK2,sK3),sK4))).
% 0.13/0.38  cnf(a1, assumption,
% 0.13/0.38  	sK3 = X0).
% 0.13/0.38  cnf(a2, assumption,
% 0.13/0.38  	bad = X3).
% 0.13/0.38  cnf(c6, plain,
% 0.13/0.38  	$false,
% 0.13/0.38  	inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.13/0.38  cnf(c7, plain,
% 0.13/0.38  	$false,
% 0.13/0.38  	inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.13/0.38  cnf(c8, plain,
% 0.13/0.38  	ok(insert_cpq(triple(sK1,sK2,X3),sK4)),
% 0.13/0.38  	inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.13/0.38  
% 0.13/0.38  cnf(c9, axiom,
% 0.13/0.38  	~ok(triple(X4,X5,bad))).
% 0.13/0.38  cnf(a3, assumption,
% 0.13/0.38  	X6 = insert_cpq(triple(sK1,sK2,X3),sK4)).
% 0.13/0.38  cnf(c10, plain,
% 0.13/0.38  	$false,
% 0.13/0.38  	inference(lazy_predicate_extension, [assumptions([a3])], [c8, c9])).
% 0.13/0.38  cnf(c11, plain,
% 0.13/0.38  	$false,
% 0.13/0.38  	inference(lazy_predicate_extension, [assumptions([a3])], [c8, c9])).
% 0.13/0.38  cnf(c12, plain,
% 0.13/0.38  	triple(X4,X5,bad) != X6,
% 0.13/0.38  	inference(lazy_predicate_extension, [assumptions([a3])], [c8, c9])).
% 0.13/0.38  
% 0.13/0.38  cnf(c13, axiom,
% 0.13/0.38  	insert_cpq(triple(X7,X8,X9),X10) = triple(insert_pqp(X7,X10),insert_slb(X8,pair(X10,bottom)),X9)).
% 0.13/0.38  cnf(a4, assumption,
% 0.13/0.38  	triple(X4,X5,bad) = triple(insert_pqp(X7,X10),insert_slb(X8,pair(X10,bottom)),X9)).
% 0.13/0.38  cnf(c14, plain,
% 0.13/0.38  	$false,
% 0.13/0.38  	inference(strict_function_extension, [assumptions([a4])], [c12, c13])).
% 0.13/0.38  cnf(c15, plain,
% 0.13/0.38  	$false,
% 0.13/0.38  	inference(strict_function_extension, [assumptions([a4])], [c12, c13])).
% 0.13/0.38  cnf(c16, plain,
% 0.13/0.38  	X11 != insert_cpq(triple(X7,X8,X9),X10) | X11 != X6,
% 0.13/0.38  	inference(strict_function_extension, [assumptions([a4])], [c12, c13])).
% 0.13/0.38  
% 0.13/0.38  cnf(a5, assumption,
% 0.13/0.38  	X11 = insert_cpq(triple(X7,X8,X9),X10)).
% 0.13/0.38  cnf(c17, plain,
% 0.13/0.38  	X11 != X6,
% 0.13/0.38  	inference(reflexivity, [assumptions([a5])], [c16])).
% 0.13/0.38  
% 0.13/0.38  cnf(a6, assumption,
% 0.13/0.38  	X11 = X6).
% 0.13/0.38  cnf(c18, plain,
% 0.13/0.38  	$false,
% 0.13/0.38  	inference(reflexivity, [assumptions([a6])], [c17])).
% 0.13/0.38  
% 0.13/0.38  cnf(c19, plain,
% 0.13/0.38  	$false,
% 0.13/0.38  	inference(constraint_solving, [
% 0.13/0.38  		bind(X0, sK3),
% 0.13/0.38  		bind(X1, sK1),
% 0.13/0.38  		bind(X2, sK2),
% 0.13/0.38  		bind(X3, bad),
% 0.13/0.38  		bind(X4, insert_pqp(X7,X10)),
% 0.13/0.38  		bind(X5, insert_slb(X8,pair(X10,bottom))),
% 0.13/0.38  		bind(X6, insert_cpq(triple(sK1,sK2,X3),sK4)),
% 0.13/0.38  		bind(X7, sK1),
% 0.13/0.38  		bind(X8, sK2),
% 0.13/0.38  		bind(X9, bad),
% 0.13/0.38  		bind(X10, sK4),
% 0.13/0.38  		bind(X11, insert_cpq(triple(X7,X8,X9),X10))
% 0.13/0.38  	],
% 0.13/0.38  	[a0, a1, a2, a3, a4, a5, a6])).
% 0.13/0.38  
% 0.13/0.38  % SZS output end IncompleteProof
%------------------------------------------------------------------------------