TSTP Solution File: GRP665-12 by lazyCoP---0.1

View Problem - Process Solution

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

% Computer : n008.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 : Sat Jul 16 10:11:17 EDT 2022

% Result   : Unsatisfiable 124.64s 16.21s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GRP665-12 : TPTP v8.1.0. Released v8.1.0.
% 0.06/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34  % Computer : n008.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jun 13 19:52:22 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 124.64/16.21  % SZS status Unsatisfiable
% 124.64/16.21  % SZS output begin IncompleteProof
% 124.64/16.21  cnf(c0, axiom,
% 124.64/16.21  	mult(mult(x0,x1),op_c) != mult(x0,mult(x1,op_c))).
% 124.64/16.21  cnf(c1, plain,
% 124.64/16.21  	mult(mult(x0,x1),op_c) != mult(x0,mult(x1,op_c)),
% 124.64/16.21  	inference(start, [], [c0])).
% 124.64/16.21  
% 124.64/16.21  cnf(c2, axiom,
% 124.64/16.21  	mult(op_c,X0) = mult(X0,op_c)).
% 124.64/16.21  cnf(a0, assumption,
% 124.64/16.21  	mult(mult(x0,x1),op_c) = mult(X0,op_c)).
% 124.64/16.21  cnf(c3, plain,
% 124.64/16.21  	$false,
% 124.64/16.21  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 124.64/16.21  cnf(c4, plain,
% 124.64/16.21  	$false,
% 124.64/16.21  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 124.64/16.21  cnf(c5, plain,
% 124.64/16.21  	X1 != mult(op_c,X0) | X1 != mult(x0,mult(x1,op_c)),
% 124.64/16.21  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 124.64/16.21  
% 124.64/16.21  cnf(a1, assumption,
% 124.64/16.21  	X1 = mult(op_c,X0)).
% 124.64/16.21  cnf(c6, plain,
% 124.64/16.21  	X1 != mult(x0,mult(x1,op_c)),
% 124.64/16.21  	inference(reflexivity, [assumptions([a1])], [c5])).
% 124.64/16.21  
% 124.64/16.21  cnf(c7, axiom,
% 124.64/16.21  	mult(op_c,X2) = mult(X2,op_c)).
% 124.64/16.21  cnf(a2, assumption,
% 124.64/16.21  	mult(x1,op_c) = mult(X2,op_c)).
% 124.64/16.21  cnf(c8, plain,
% 124.64/16.21  	$false,
% 124.64/16.21  	inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 124.64/16.21  cnf(c9, plain,
% 124.64/16.21  	$false,
% 124.64/16.21  	inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 124.64/16.21  cnf(c10, plain,
% 124.64/16.21  	X3 != mult(op_c,X2) | X1 != mult(x0,X3),
% 124.64/16.21  	inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 124.64/16.21  
% 124.64/16.21  cnf(a3, assumption,
% 124.64/16.21  	X3 = mult(op_c,X2)).
% 124.64/16.21  cnf(c11, plain,
% 124.64/16.21  	X1 != mult(x0,X3),
% 124.64/16.21  	inference(reflexivity, [assumptions([a3])], [c10])).
% 124.64/16.21  
% 124.64/16.21  cnf(c12, axiom,
% 124.64/16.21  	mult(X4,mult(X5,X6)) = mult(rd(mult(X4,X5),X4),mult(X4,X6))).
% 124.64/16.21  cnf(a4, assumption,
% 124.64/16.21  	mult(x0,X3) = mult(X4,mult(X5,X6))).
% 124.64/16.21  cnf(c13, plain,
% 124.64/16.21  	$false,
% 124.64/16.21  	inference(strict_function_extension, [assumptions([a4])], [c11, c12])).
% 124.64/16.21  cnf(c14, plain,
% 124.64/16.21  	$false,
% 124.64/16.21  	inference(strict_function_extension, [assumptions([a4])], [c11, c12])).
% 124.64/16.21  cnf(c15, plain,
% 124.64/16.21  	X7 != mult(rd(mult(X4,X5),X4),mult(X4,X6)) | X1 != X7,
% 124.64/16.21  	inference(strict_function_extension, [assumptions([a4])], [c11, c12])).
% 124.64/16.21  
% 124.64/16.21  cnf(c16, axiom,
% 124.64/16.21  	mult(op_c,X8) = mult(X8,op_c)).
% 124.64/16.21  cnf(a5, assumption,
% 124.64/16.21  	mult(X4,X5) = mult(X8,op_c)).
% 124.64/16.21  cnf(c17, plain,
% 124.64/16.21  	X1 != X7,
% 124.64/16.21  	inference(strict_function_extension, [assumptions([a5])], [c15, c16])).
% 124.64/16.21  cnf(c18, plain,
% 124.64/16.21  	$false,
% 124.64/16.21  	inference(strict_function_extension, [assumptions([a5])], [c15, c16])).
% 124.64/16.21  cnf(c19, plain,
% 124.64/16.21  	X9 != mult(op_c,X8) | X7 != mult(rd(X9,X4),mult(X4,X6)),
% 124.64/16.21  	inference(strict_function_extension, [assumptions([a5])], [c15, c16])).
% 124.64/16.21  
% 124.64/16.21  cnf(a6, assumption,
% 124.64/16.21  	X9 = mult(op_c,X8)).
% 124.64/16.21  cnf(c20, plain,
% 124.64/16.21  	X7 != mult(rd(X9,X4),mult(X4,X6)),
% 124.64/16.21  	inference(reflexivity, [assumptions([a6])], [c19])).
% 124.64/16.21  
% 124.64/16.21  cnf(c21, axiom,
% 124.64/16.21  	rd(mult(X10,X11),X11) = X10).
% 124.64/16.21  cnf(a7, assumption,
% 124.64/16.21  	rd(X9,X4) = rd(mult(X10,X11),X11)).
% 124.64/16.21  cnf(c22, plain,
% 124.64/16.21  	$false,
% 124.64/16.21  	inference(strict_function_extension, [assumptions([a7])], [c20, c21])).
% 124.64/16.21  cnf(c23, plain,
% 124.64/16.21  	$false,
% 124.64/16.21  	inference(strict_function_extension, [assumptions([a7])], [c20, c21])).
% 124.64/16.21  cnf(c24, plain,
% 124.64/16.21  	X12 != X10 | X7 != mult(X12,mult(X4,X6)),
% 124.64/16.21  	inference(strict_function_extension, [assumptions([a7])], [c20, c21])).
% 124.64/16.21  
% 124.64/16.21  cnf(a8, assumption,
% 124.64/16.21  	X12 = X10).
% 124.64/16.21  cnf(c25, plain,
% 124.64/16.21  	X7 != mult(X12,mult(X4,X6)),
% 124.64/16.21  	inference(reflexivity, [assumptions([a8])], [c24])).
% 124.64/16.21  
% 124.64/16.21  cnf(a9, assumption,
% 124.64/16.21  	X7 = mult(X12,mult(X4,X6))).
% 124.64/16.21  cnf(c26, plain,
% 124.64/16.21  	$false,
% 124.64/16.21  	inference(reflexivity, [assumptions([a9])], [c25])).
% 124.64/16.21  
% 124.64/16.21  cnf(a10, assumption,
% 124.64/16.21  	X1 = X7).
% 124.64/16.21  cnf(c27, plain,
% 124.64/16.21  	$false,
% 124.64/16.21  	inference(reflexivity, [assumptions([a10])], [c17])).
% 124.64/16.21  
% 124.64/16.21  cnf(c28, plain,
% 124.64/16.21  	$false,
% 124.64/16.21  	inference(constraint_solving, [
% 124.64/16.21  		bind(X0, mult(x0,x1)),
% 124.64/16.21  		bind(X1, mult(op_c,X0)),
% 124.64/16.21  		bind(X2, x1),
% 124.64/16.21  		bind(X3, mult(op_c,X2)),
% 124.64/16.21  		bind(X4, x0),
% 124.64/16.21  		bind(X5, op_c),
% 124.64/16.21  		bind(X6, x1),
% 124.64/16.21  		bind(X7, mult(X12,mult(X4,X6))),
% 124.64/16.21  		bind(X8, x0),
% 124.64/16.21  		bind(X9, mult(op_c,X8)),
% 124.64/16.21  		bind(X10, op_c),
% 124.64/16.21  		bind(X11, x0),
% 124.64/16.21  		bind(X12, op_c)
% 124.64/16.21  	],
% 124.64/16.21  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 124.64/16.21  
% 124.64/16.21  % SZS output end IncompleteProof
%------------------------------------------------------------------------------