TSTP Solution File: GRP046-2 by lazyCoP---0.1

View Problem - Process Solution

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

% Computer : n015.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:08:45 EDT 2022

% Result   : Unsatisfiable 0.20s 0.34s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : GRP046-2 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33  % Computer : n015.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue Jun 14 11:59:54 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.20/0.34  % SZS status Unsatisfiable
% 0.20/0.34  % SZS output begin IncompleteProof
% 0.20/0.34  cnf(c0, axiom,
% 0.20/0.34  	~equalish(multiply(a,c),multiply(b,c))).
% 0.20/0.34  cnf(c1, plain,
% 0.20/0.34  	~equalish(multiply(a,c),multiply(b,c)),
% 0.20/0.34  	inference(start, [], [c0])).
% 0.20/0.34  
% 0.20/0.34  cnf(c2, axiom,
% 0.20/0.34  	equalish(X0,X1) | ~product(X2,X3,X1) | ~product(X2,X3,X0)).
% 0.20/0.34  cnf(a0, assumption,
% 0.20/0.34  	multiply(a,c) = X0).
% 0.20/0.34  cnf(a1, assumption,
% 0.20/0.34  	multiply(b,c) = X1).
% 0.20/0.34  cnf(c3, plain,
% 0.20/0.34  	$false,
% 0.20/0.34  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.34  cnf(c4, plain,
% 0.20/0.34  	~product(X2,X3,X1) | ~product(X2,X3,X0),
% 0.20/0.34  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.34  
% 0.20/0.34  cnf(c5, axiom,
% 0.20/0.34  	product(X4,X5,X6) | ~product(X7,X8,X6) | ~product(X9,X8,X5) | ~product(X4,X9,X7)).
% 0.20/0.34  cnf(a2, assumption,
% 0.20/0.34  	X2 = X4).
% 0.20/0.34  cnf(a3, assumption,
% 0.20/0.34  	X3 = X5).
% 0.20/0.34  cnf(a4, assumption,
% 0.20/0.34  	X1 = X6).
% 0.20/0.34  cnf(c6, plain,
% 0.20/0.34  	~product(X2,X3,X0),
% 0.20/0.34  	inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])).
% 0.20/0.34  cnf(c7, plain,
% 0.20/0.34  	~product(X7,X8,X6) | ~product(X9,X8,X5) | ~product(X4,X9,X7),
% 0.20/0.34  	inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])).
% 0.20/0.34  
% 0.20/0.34  cnf(c8, axiom,
% 0.20/0.34  	product(X10,X11,multiply(X10,X11))).
% 0.20/0.34  cnf(a5, assumption,
% 0.20/0.34  	X7 = X10).
% 0.20/0.34  cnf(a6, assumption,
% 0.20/0.34  	X8 = X11).
% 0.20/0.34  cnf(a7, assumption,
% 0.20/0.34  	X6 = multiply(X10,X11)).
% 0.20/0.34  cnf(c9, plain,
% 0.20/0.34  	~product(X9,X8,X5) | ~product(X4,X9,X7),
% 0.20/0.34  	inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c7, c8])).
% 0.20/0.34  cnf(c10, plain,
% 0.20/0.34  	$false,
% 0.20/0.34  	inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c7, c8])).
% 0.20/0.34  
% 0.20/0.34  cnf(c11, axiom,
% 0.20/0.34  	product(X12,X13,multiply(X12,X13))).
% 0.20/0.34  cnf(a8, assumption,
% 0.20/0.34  	X9 = X12).
% 0.20/0.34  cnf(a9, assumption,
% 0.20/0.34  	X8 = X13).
% 0.20/0.34  cnf(a10, assumption,
% 0.20/0.34  	X5 = multiply(X12,X13)).
% 0.20/0.34  cnf(c12, plain,
% 0.20/0.34  	~product(X4,X9,X7),
% 0.20/0.34  	inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c9, c11])).
% 0.20/0.34  cnf(c13, plain,
% 0.20/0.34  	$false,
% 0.20/0.34  	inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c9, c11])).
% 0.20/0.34  
% 0.20/0.34  cnf(c14, axiom,
% 0.20/0.34  	product(X14,X15,X16) | ~product(X14,X15,X17) | ~equalish(X17,X16)).
% 0.20/0.34  cnf(a11, assumption,
% 0.20/0.34  	X4 = X14).
% 0.20/0.34  cnf(a12, assumption,
% 0.20/0.34  	X9 = X15).
% 0.20/0.34  cnf(a13, assumption,
% 0.20/0.34  	X7 = X16).
% 0.20/0.34  cnf(c15, plain,
% 0.20/0.34  	$false,
% 0.20/0.34  	inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c12, c14])).
% 0.20/0.34  cnf(c16, plain,
% 0.20/0.34  	~product(X14,X15,X17) | ~equalish(X17,X16),
% 0.20/0.34  	inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c12, c14])).
% 0.20/0.34  
% 0.20/0.34  cnf(c17, axiom,
% 0.20/0.34  	product(identity,X18,X18)).
% 0.20/0.34  cnf(a14, assumption,
% 0.20/0.34  	X14 = identity).
% 0.20/0.34  cnf(a15, assumption,
% 0.20/0.34  	X15 = X18).
% 0.20/0.34  cnf(a16, assumption,
% 0.20/0.34  	X17 = X18).
% 0.20/0.34  cnf(c18, plain,
% 0.20/0.34  	~equalish(X17,X16),
% 0.20/0.34  	inference(strict_predicate_extension, [assumptions([a14, a15, a16])], [c16, c17])).
% 0.20/0.34  cnf(c19, plain,
% 0.20/0.34  	$false,
% 0.20/0.34  	inference(strict_predicate_extension, [assumptions([a14, a15, a16])], [c16, c17])).
% 0.20/0.34  
% 0.20/0.34  cnf(c20, axiom,
% 0.20/0.34  	equalish(a,b)).
% 0.20/0.34  cnf(a17, assumption,
% 0.20/0.34  	X17 = a).
% 0.20/0.34  cnf(a18, assumption,
% 0.20/0.34  	X16 = b).
% 0.20/0.34  cnf(c21, plain,
% 0.20/0.34  	$false,
% 0.20/0.34  	inference(strict_predicate_extension, [assumptions([a17, a18])], [c18, c20])).
% 0.20/0.34  cnf(c22, plain,
% 0.20/0.34  	$false,
% 0.20/0.34  	inference(strict_predicate_extension, [assumptions([a17, a18])], [c18, c20])).
% 0.20/0.34  
% 0.20/0.34  cnf(c23, axiom,
% 0.20/0.34  	product(identity,X19,X19)).
% 0.20/0.34  cnf(a19, assumption,
% 0.20/0.34  	X2 = identity).
% 0.20/0.34  cnf(a20, assumption,
% 0.20/0.34  	X3 = X19).
% 0.20/0.34  cnf(a21, assumption,
% 0.20/0.34  	X0 = X19).
% 0.20/0.34  cnf(c24, plain,
% 0.20/0.34  	$false,
% 0.20/0.34  	inference(strict_predicate_extension, [assumptions([a19, a20, a21])], [c6, c23])).
% 0.20/0.34  cnf(c25, plain,
% 0.20/0.34  	$false,
% 0.20/0.34  	inference(strict_predicate_extension, [assumptions([a19, a20, a21])], [c6, c23])).
% 0.20/0.34  
% 0.20/0.34  cnf(c26, plain,
% 0.20/0.34  	$false,
% 0.20/0.34  	inference(constraint_solving, [
% 0.20/0.34  		bind(X0, multiply(a,c)),
% 0.20/0.34  		bind(X1, multiply(b,c)),
% 0.20/0.34  		bind(X2, identity),
% 0.20/0.34  		bind(X3, multiply(X12,X13)),
% 0.20/0.34  		bind(X4, identity),
% 0.20/0.34  		bind(X5, multiply(X12,X13)),
% 0.20/0.34  		bind(X6, multiply(b,c)),
% 0.20/0.34  		bind(X7, b),
% 0.20/0.34  		bind(X8, c),
% 0.20/0.34  		bind(X9, a),
% 0.20/0.34  		bind(X10, b),
% 0.20/0.34  		bind(X11, c),
% 0.20/0.34  		bind(X12, a),
% 0.20/0.34  		bind(X13, c),
% 0.20/0.34  		bind(X14, identity),
% 0.20/0.34  		bind(X15, a),
% 0.20/0.34  		bind(X16, b),
% 0.20/0.34  		bind(X17, a),
% 0.20/0.34  		bind(X18, a),
% 0.20/0.34  		bind(X19, multiply(X12,X13))
% 0.20/0.34  	],
% 0.20/0.34  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21])).
% 0.20/0.34  
% 0.20/0.34  % SZS output end IncompleteProof
%------------------------------------------------------------------------------