↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : NUM304+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 : n003.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:03 EDT 2022

% Result   : Theorem 1.55s 0.61s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : NUM304+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.12/0.33  % Computer : n003.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 Jul  5 07:06:55 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.55/0.61  % SZS status Theorem
% 1.55/0.61  % SZS output begin IncompleteProof
% 1.55/0.61  cnf(c0, axiom,
% 1.55/0.61  	n12 = X0).
% 1.55/0.61  cnf(c1, plain,
% 1.55/0.61  	n12 = X0,
% 1.55/0.61  	inference(start, [], [c0])).
% 1.55/0.61  
% 1.55/0.61  cnf(c2, axiom,
% 1.55/0.61  	rdn_translate(nn47,rdn_neg(rdn(rdnn(n7),rdnn(n4))))).
% 1.55/0.61  cnf(a0, assumption,
% 1.55/0.61  	nn47 = X0).
% 1.55/0.61  cnf(a1, assumption,
% 1.55/0.61  	n12 = X1).
% 1.55/0.61  cnf(c3, plain,
% 1.55/0.61  	$false,
% 1.55/0.61  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 1.55/0.61  cnf(c4, plain,
% 1.55/0.61  	$false,
% 1.55/0.61  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 1.55/0.61  cnf(c5, plain,
% 1.55/0.61  	rdn_translate(X1,rdn_neg(rdn(rdnn(n7),rdnn(n4)))),
% 1.55/0.61  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 1.55/0.61  
% 1.55/0.61  cnf(c6, axiom,
% 1.55/0.61  	less(X2,X3) | ~rdn_translate(X3,rdn_pos(X4)) | ~rdn_translate(X2,rdn_neg(X5))).
% 1.55/0.61  cnf(a2, assumption,
% 1.55/0.61  	X1 = X2).
% 1.55/0.61  cnf(a3, assumption,
% 1.55/0.61  	rdn_neg(rdn(rdnn(n7),rdnn(n4))) = rdn_neg(X5)).
% 1.55/0.61  cnf(c7, plain,
% 1.55/0.61  	$false,
% 1.55/0.61  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])).
% 1.55/0.61  cnf(c8, plain,
% 1.55/0.61  	less(X2,X3) | ~rdn_translate(X3,rdn_pos(X4)),
% 1.55/0.61  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])).
% 1.55/0.61  
% 1.55/0.61  cnf(c9, axiom,
% 1.55/0.61  	~less(X6,X6)).
% 1.55/0.61  cnf(a4, assumption,
% 1.55/0.61  	X2 = X6).
% 1.55/0.61  cnf(a5, assumption,
% 1.55/0.61  	X3 = X6).
% 1.55/0.61  cnf(c10, plain,
% 1.55/0.61  	~rdn_translate(X3,rdn_pos(X4)),
% 1.55/0.61  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c9])).
% 1.55/0.61  cnf(c11, plain,
% 1.55/0.61  	$false,
% 1.55/0.61  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c9])).
% 1.55/0.61  
% 1.55/0.61  cnf(c12, axiom,
% 1.55/0.61  	rdn_translate(n12,rdn_pos(rdn(rdnn(n2),rdnn(n1))))).
% 1.55/0.61  cnf(a6, assumption,
% 1.55/0.61  	X3 = n12).
% 1.55/0.61  cnf(a7, assumption,
% 1.55/0.61  	rdn_pos(X4) = rdn_pos(rdn(rdnn(n2),rdnn(n1)))).
% 1.55/0.61  cnf(c13, plain,
% 1.55/0.61  	$false,
% 1.55/0.61  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c12])).
% 1.55/0.61  cnf(c14, plain,
% 1.55/0.61  	$false,
% 1.55/0.61  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c12])).
% 1.55/0.61  
% 1.55/0.61  cnf(c15, plain,
% 1.55/0.61  	$false,
% 1.55/0.61  	inference(constraint_solving, [
% 1.55/0.61  		bind(X0, nn47),
% 1.55/0.61  		bind(X1, n12),
% 1.55/0.61  		bind(X2, n12),
% 1.55/0.61  		bind(X3, n12),
% 1.55/0.61  		bind(X4, rdn(rdnn(n2),rdnn(n1))),
% 1.55/0.61  		bind(X5, rdn(rdnn(n7),rdnn(n4))),
% 1.55/0.61  		bind(X6, n12)
% 1.55/0.61  	],
% 1.55/0.61  	[a0, a1, a2, a3, a4, a5, a6, a7])).
% 1.55/0.61  
% 1.55/0.61  % SZS output end IncompleteProof
%------------------------------------------------------------------------------