↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : NUM328+1 : TPTP v8.1.0. Released v3.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 : n017.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:32:11 EDT 2022

% Result   : Theorem 2.00s 0.69s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM328+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.11/0.33  % Computer : n017.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Wed Jul  6 02:06:14 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 2.00/0.69  % SZS status Theorem
% 2.00/0.69  % SZS output begin IncompleteProof
% 2.00/0.69  cnf(c0, axiom,
% 2.00/0.69  	~sum(X0,X1,X0)).
% 2.00/0.69  cnf(c1, plain,
% 2.00/0.69  	~sum(X0,X1,X0),
% 2.00/0.69  	inference(start, [], [c0])).
% 2.00/0.69  
% 2.00/0.69  cnf(c2, axiom,
% 2.00/0.69  	sum(X2,X3,X4) | ~rdn_translate(X4,rdn_pos(X5)) | ~rdn_add_with_carry(rdnn(n0),X6,X7,X5) | ~rdn_translate(X3,rdn_pos(X7)) | ~rdn_translate(X2,rdn_pos(X6))).
% 2.00/0.69  cnf(a0, assumption,
% 2.00/0.69  	X0 = X2).
% 2.00/0.69  cnf(a1, assumption,
% 2.00/0.69  	X1 = X3).
% 2.00/0.69  cnf(a2, assumption,
% 2.00/0.69  	X0 = X4).
% 2.00/0.69  cnf(c3, plain,
% 2.00/0.69  	$false,
% 2.00/0.69  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 2.00/0.69  cnf(c4, plain,
% 2.00/0.69  	~rdn_translate(X4,rdn_pos(X5)) | ~rdn_add_with_carry(rdnn(n0),X6,X7,X5) | ~rdn_translate(X3,rdn_pos(X7)) | ~rdn_translate(X2,rdn_pos(X6)),
% 2.00/0.69  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 2.00/0.69  
% 2.00/0.69  cnf(c5, axiom,
% 2.00/0.69  	rdn_translate(n0,rdn_pos(rdnn(n0)))).
% 2.00/0.69  cnf(a3, assumption,
% 2.00/0.69  	X4 = n0).
% 2.00/0.69  cnf(a4, assumption,
% 2.00/0.69  	rdn_pos(X5) = rdn_pos(rdnn(n0))).
% 2.00/0.69  cnf(c6, plain,
% 2.00/0.69  	~rdn_add_with_carry(rdnn(n0),X6,X7,X5) | ~rdn_translate(X3,rdn_pos(X7)) | ~rdn_translate(X2,rdn_pos(X6)),
% 2.00/0.69  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])).
% 2.00/0.69  cnf(c7, plain,
% 2.00/0.69  	$false,
% 2.00/0.69  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])).
% 2.00/0.69  
% 2.00/0.69  cnf(c8, axiom,
% 2.00/0.69  	rdn_add_with_carry(rdnn(X8),rdnn(X9),rdnn(X10),rdnn(X11)) | ~rdn_digit_add(rdnn(X12),rdnn(X8),rdnn(X11),rdnn(n0)) | ~rdn_digit_add(rdnn(X9),rdnn(X10),rdnn(X12),rdnn(n0))).
% 2.00/0.69  cnf(a5, assumption,
% 2.00/0.69  	rdnn(n0) = rdnn(X8)).
% 2.00/0.69  cnf(a6, assumption,
% 2.00/0.69  	X6 = rdnn(X9)).
% 2.00/0.69  cnf(a7, assumption,
% 2.00/0.69  	X7 = rdnn(X10)).
% 2.00/0.69  cnf(a8, assumption,
% 2.00/0.69  	X5 = rdnn(X11)).
% 2.00/0.69  cnf(c9, plain,
% 2.00/0.69  	~rdn_translate(X3,rdn_pos(X7)) | ~rdn_translate(X2,rdn_pos(X6)),
% 2.00/0.69  	inference(strict_predicate_extension, [assumptions([a5, a6, a7, a8])], [c6, c8])).
% 2.00/0.69  cnf(c10, plain,
% 2.00/0.69  	~rdn_digit_add(rdnn(X12),rdnn(X8),rdnn(X11),rdnn(n0)) | ~rdn_digit_add(rdnn(X9),rdnn(X10),rdnn(X12),rdnn(n0)),
% 2.00/0.69  	inference(strict_predicate_extension, [assumptions([a5, a6, a7, a8])], [c6, c8])).
% 2.00/0.69  
% 2.00/0.69  cnf(c11, axiom,
% 2.00/0.69  	rdn_digit_add(rdnn(n0),rdnn(n0),rdnn(n0),rdnn(n0))).
% 2.00/0.69  cnf(a9, assumption,
% 2.00/0.69  	rdnn(X12) = rdnn(n0)).
% 2.00/0.69  cnf(a10, assumption,
% 2.00/0.69  	rdnn(X8) = rdnn(n0)).
% 2.00/0.69  cnf(a11, assumption,
% 2.00/0.69  	rdnn(X11) = rdnn(n0)).
% 2.00/0.69  cnf(a12, assumption,
% 2.00/0.69  	rdnn(n0) = rdnn(n0)).
% 2.00/0.69  cnf(c12, plain,
% 2.00/0.69  	~rdn_digit_add(rdnn(X9),rdnn(X10),rdnn(X12),rdnn(n0)),
% 2.00/0.69  	inference(strict_predicate_extension, [assumptions([a9, a10, a11, a12])], [c10, c11])).
% 2.00/0.69  cnf(c13, plain,
% 2.00/0.69  	$false,
% 2.00/0.69  	inference(strict_predicate_extension, [assumptions([a9, a10, a11, a12])], [c10, c11])).
% 2.00/0.69  
% 2.00/0.69  cnf(c14, plain,
% 2.00/0.69  	rdn_digit_add(rdnn(X12),rdnn(X8),rdnn(X11),rdnn(n0))).
% 2.00/0.69  cnf(a13, assumption,
% 2.00/0.69  	rdnn(X9) = rdnn(X12)).
% 2.00/0.69  cnf(a14, assumption,
% 2.00/0.69  	rdnn(X10) = rdnn(X8)).
% 2.00/0.69  cnf(a15, assumption,
% 2.00/0.69  	rdnn(X12) = rdnn(X11)).
% 2.00/0.69  cnf(a16, assumption,
% 2.00/0.69  	rdnn(n0) = rdnn(n0)).
% 2.00/0.69  cnf(c15, plain,
% 2.00/0.69  	$false,
% 2.00/0.69  	inference(predicate_reduction, [assumptions([a13, a14, a15, a16])], [c12, c14])).
% 2.00/0.69  
% 2.00/0.69  cnf(c16, plain,
% 2.00/0.69  	rdn_translate(X4,rdn_pos(X5))).
% 2.00/0.69  cnf(a17, assumption,
% 2.00/0.69  	X3 = X4).
% 2.00/0.69  cnf(a18, assumption,
% 2.00/0.69  	rdn_pos(X7) = rdn_pos(X5)).
% 2.00/0.69  cnf(c17, plain,
% 2.00/0.69  	~rdn_translate(X2,rdn_pos(X6)),
% 2.00/0.69  	inference(predicate_reduction, [assumptions([a17, a18])], [c9, c16])).
% 2.00/0.69  
% 2.00/0.69  cnf(c18, plain,
% 2.00/0.69  	rdn_translate(X4,rdn_pos(X5))).
% 2.00/0.69  cnf(a19, assumption,
% 2.00/0.69  	X2 = X4).
% 2.00/0.69  cnf(a20, assumption,
% 2.00/0.69  	rdn_pos(X6) = rdn_pos(X5)).
% 2.00/0.69  cnf(c19, plain,
% 2.00/0.69  	$false,
% 2.00/0.69  	inference(predicate_reduction, [assumptions([a19, a20])], [c17, c18])).
% 2.00/0.69  
% 2.00/0.69  cnf(c20, plain,
% 2.00/0.69  	$false,
% 2.00/0.69  	inference(constraint_solving, [
% 2.00/0.69  		bind(X0, n0),
% 2.00/0.69  		bind(X1, n0),
% 2.00/0.69  		bind(X2, n0),
% 2.00/0.69  		bind(X3, n0),
% 2.00/0.69  		bind(X4, n0),
% 2.00/0.69  		bind(X5, rdnn(n0)),
% 2.00/0.69  		bind(X6, rdnn(X9)),
% 2.00/0.69  		bind(X7, rdnn(X10)),
% 2.00/0.69  		bind(X8, n0),
% 2.00/0.69  		bind(X9, n0),
% 2.00/0.69  		bind(X10, n0),
% 2.00/0.69  		bind(X11, n0),
% 2.00/0.69  		bind(X12, n0)
% 2.00/0.69  	],
% 2.00/0.69  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20])).
% 2.00/0.69  
% 2.00/0.69  % SZS output end IncompleteProof
%------------------------------------------------------------------------------