TSTP Solution File: NUM024-1 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : NUM024-1 : TPTP v8.1.0. Bugfixed v4.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 : n028.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 : Mon Jul 18 11:30:31 EDT 2022

% Result   : Unsatisfiable 0.12s 0.40s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : NUM024-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.10/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33  % Computer : n028.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 : Wed Jul  6 08:25:52 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.40  % SZS status Unsatisfiable
% 0.12/0.40  % SZS output begin IncompleteProof
% 0.12/0.40  cnf(c0, axiom,
% 0.12/0.40  	~equalish(successor(X0),n0)).
% 0.12/0.40  cnf(c1, plain,
% 0.12/0.40  	~equalish(successor(X0),n0),
% 0.12/0.40  	inference(start, [], [c0])).
% 0.12/0.40  
% 0.12/0.40  cnf(c2, axiom,
% 0.12/0.40  	equalish(X1,X2) | ~equalish(add(X1,X3),add(X2,X3))).
% 0.12/0.40  cnf(a0, assumption,
% 0.12/0.40  	successor(X0) = X1).
% 0.12/0.40  cnf(a1, assumption,
% 0.12/0.40  	n0 = X2).
% 0.12/0.40  cnf(c3, plain,
% 0.12/0.40  	$false,
% 0.12/0.40  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.40  cnf(c4, plain,
% 0.12/0.40  	~equalish(add(X1,X3),add(X2,X3)),
% 0.12/0.40  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.40  
% 0.12/0.40  cnf(c5, axiom,
% 0.12/0.40  	equalish(X4,X5) | ~equalish(X6,X5) | ~equalish(X4,X6)).
% 0.12/0.40  cnf(a2, assumption,
% 0.12/0.40  	add(X1,X3) = X4).
% 0.12/0.40  cnf(a3, assumption,
% 0.12/0.40  	add(X2,X3) = X5).
% 0.12/0.40  cnf(c6, plain,
% 0.12/0.40  	$false,
% 0.12/0.40  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.12/0.40  cnf(c7, plain,
% 0.12/0.40  	~equalish(X6,X5) | ~equalish(X4,X6),
% 0.12/0.40  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.12/0.40  
% 0.12/0.40  cnf(c8, axiom,
% 0.12/0.40  	equalish(X7,X8) | ~equalish(X8,X7)).
% 0.12/0.40  cnf(a4, assumption,
% 0.12/0.40  	X6 = X7).
% 0.12/0.40  cnf(a5, assumption,
% 0.12/0.40  	X5 = X8).
% 0.12/0.40  cnf(c9, plain,
% 0.12/0.40  	~equalish(X4,X6),
% 0.12/0.40  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.12/0.40  cnf(c10, plain,
% 0.12/0.40  	~equalish(X8,X7),
% 0.12/0.40  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.12/0.40  
% 0.12/0.40  cnf(c11, axiom,
% 0.12/0.40  	equalish(X9,X10) | ~equalish(X11,X10) | ~equalish(X9,X11)).
% 0.12/0.40  cnf(a6, assumption,
% 0.12/0.40  	X8 = X9).
% 0.12/0.40  cnf(a7, assumption,
% 0.12/0.40  	X7 = X10).
% 0.12/0.40  cnf(c12, plain,
% 0.12/0.40  	$false,
% 0.12/0.40  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.12/0.40  cnf(c13, plain,
% 0.12/0.40  	~equalish(X11,X10) | ~equalish(X9,X11),
% 0.12/0.40  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.12/0.40  
% 0.12/0.40  cnf(c14, axiom,
% 0.12/0.40  	equalish(add(X12,n0),X12)).
% 0.12/0.40  cnf(a8, assumption,
% 0.12/0.40  	X11 = add(X12,n0)).
% 0.12/0.40  cnf(a9, assumption,
% 0.12/0.40  	X10 = X12).
% 0.12/0.40  cnf(c15, plain,
% 0.12/0.40  	~equalish(X9,X11),
% 0.12/0.40  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 0.12/0.40  cnf(c16, plain,
% 0.12/0.40  	$false,
% 0.12/0.40  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 0.12/0.40  
% 0.12/0.40  cnf(c17, axiom,
% 0.12/0.40  	equalish(add(X13,X14),add(X14,X13))).
% 0.12/0.40  cnf(a10, assumption,
% 0.12/0.40  	X9 = add(X13,X14)).
% 0.12/0.40  cnf(a11, assumption,
% 0.12/0.40  	X11 = add(X14,X13)).
% 0.12/0.40  cnf(c18, plain,
% 0.12/0.40  	$false,
% 0.12/0.40  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])).
% 0.12/0.40  cnf(c19, plain,
% 0.12/0.40  	$false,
% 0.12/0.40  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])).
% 0.12/0.40  
% 0.12/0.40  cnf(c20, axiom,
% 0.12/0.40  	equalish(add(successor(predecessor_of_1st_minus_2nd(X15,X16)),X16),X15) | ~less(X16,X15)).
% 0.12/0.40  cnf(a12, assumption,
% 0.12/0.40  	X4 = add(successor(predecessor_of_1st_minus_2nd(X15,X16)),X16)).
% 0.12/0.40  cnf(a13, assumption,
% 0.12/0.40  	X6 = X15).
% 0.12/0.40  cnf(c21, plain,
% 0.12/0.40  	$false,
% 0.12/0.40  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c9, c20])).
% 0.12/0.40  cnf(c22, plain,
% 0.12/0.40  	~less(X16,X15),
% 0.12/0.40  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c9, c20])).
% 0.12/0.40  
% 0.12/0.40  cnf(c23, axiom,
% 0.12/0.40  	less(a,a)).
% 0.12/0.40  cnf(a14, assumption,
% 0.12/0.40  	X16 = a).
% 0.12/0.40  cnf(a15, assumption,
% 0.12/0.40  	X15 = a).
% 0.12/0.40  cnf(c24, plain,
% 0.12/0.40  	$false,
% 0.12/0.40  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c22, c23])).
% 0.12/0.40  cnf(c25, plain,
% 0.12/0.40  	$false,
% 0.12/0.40  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c22, c23])).
% 0.12/0.40  
% 0.12/0.40  cnf(c26, plain,
% 0.12/0.40  	$false,
% 0.12/0.40  	inference(constraint_solving, [
% 0.12/0.40  		bind(X0, predecessor_of_1st_minus_2nd(X15,X16)),
% 0.12/0.40  		bind(X1, successor(X0)),
% 0.12/0.40  		bind(X2, n0),
% 0.12/0.40  		bind(X3, a),
% 0.12/0.40  		bind(X4, add(X1,X3)),
% 0.12/0.40  		bind(X5, add(X2,X3)),
% 0.12/0.40  		bind(X6, a),
% 0.12/0.40  		bind(X7, a),
% 0.12/0.40  		bind(X8, add(X2,X3)),
% 0.12/0.40  		bind(X9, add(X2,X3)),
% 0.12/0.40  		bind(X10, a),
% 0.12/0.40  		bind(X11, add(X12,n0)),
% 0.12/0.40  		bind(X12, a),
% 0.12/0.40  		bind(X13, n0),
% 0.12/0.40  		bind(X14, a),
% 0.12/0.40  		bind(X15, a),
% 0.12/0.40  		bind(X16, a)
% 0.12/0.40  	],
% 0.12/0.40  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])).
% 0.12/0.40  
% 0.12/0.40  % SZS output end IncompleteProof
%------------------------------------------------------------------------------