↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : NUM836+2 : TPTP v8.1.0. Released v4.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 : Mon Jul 18 11:36:58 EDT 2022

% Result   : Theorem 0.14s 0.36s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : NUM836+2 : TPTP v8.1.0. Released v4.1.0.
% 0.10/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.34  % Computer : n008.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Thu Jul  7 12:34:53 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.14/0.36  % SZS status Theorem
% 0.14/0.36  % SZS output begin IncompleteProof
% 0.14/0.36  cnf(c0, axiom,
% 0.14/0.36  	less(vd203,vd204)).
% 0.14/0.36  cnf(c1, plain,
% 0.14/0.36  	less(vd203,vd204),
% 0.14/0.36  	inference(start, [], [c0])).
% 0.14/0.36  
% 0.14/0.36  cnf(c2, axiom,
% 0.14/0.36  	vplus(X0,sK0(X1,X0)) = X1 | ~less(X0,X1)).
% 0.14/0.36  cnf(a0, assumption,
% 0.14/0.36  	vd203 = X0).
% 0.14/0.36  cnf(a1, assumption,
% 0.14/0.36  	vd204 = X1).
% 0.14/0.36  cnf(c3, plain,
% 0.14/0.36  	$false,
% 0.14/0.36  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.36  cnf(c4, plain,
% 0.14/0.36  	vplus(X0,sK0(X1,X0)) = X1,
% 0.14/0.36  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.36  
% 0.14/0.36  cnf(c5, axiom,
% 0.14/0.36  	vplus(vplus(X2,X3),X4) != X2).
% 0.14/0.36  cnf(a2, assumption,
% 0.14/0.36  	vplus(X2,X3) = vplus(X0,sK0(X1,X0))).
% 0.14/0.36  cnf(c6, plain,
% 0.14/0.36  	$false,
% 0.14/0.36  	inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])).
% 0.14/0.36  cnf(c7, plain,
% 0.14/0.36  	$false,
% 0.14/0.36  	inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])).
% 0.14/0.36  cnf(c8, plain,
% 0.14/0.36  	vplus(X1,X4) != X2,
% 0.14/0.36  	inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])).
% 0.14/0.36  
% 0.14/0.36  cnf(c9, axiom,
% 0.14/0.36  	vplus(X5,sK1(X5,X6)) = X6 | ~greater(X6,X5)).
% 0.14/0.36  cnf(a3, assumption,
% 0.14/0.36  	vplus(X1,X4) = vplus(X5,sK1(X5,X6))).
% 0.14/0.36  cnf(c10, plain,
% 0.14/0.36  	$false,
% 0.14/0.36  	inference(strict_function_extension, [assumptions([a3])], [c8, c9])).
% 0.14/0.36  cnf(c11, plain,
% 0.14/0.36  	~greater(X6,X5),
% 0.14/0.36  	inference(strict_function_extension, [assumptions([a3])], [c8, c9])).
% 0.14/0.36  cnf(c12, plain,
% 0.14/0.36  	X7 != X6 | X7 != X2,
% 0.14/0.36  	inference(strict_function_extension, [assumptions([a3])], [c8, c9])).
% 0.14/0.36  
% 0.14/0.36  cnf(a4, assumption,
% 0.14/0.36  	X7 = X6).
% 0.14/0.36  cnf(c13, plain,
% 0.14/0.36  	X7 != X2,
% 0.14/0.36  	inference(reflexivity, [assumptions([a4])], [c12])).
% 0.14/0.36  
% 0.14/0.36  cnf(a5, assumption,
% 0.14/0.36  	X7 = X2).
% 0.14/0.36  cnf(c14, plain,
% 0.14/0.36  	$false,
% 0.14/0.36  	inference(reflexivity, [assumptions([a5])], [c13])).
% 0.14/0.36  
% 0.14/0.36  cnf(c15, axiom,
% 0.14/0.36  	greater(vd203,vd204)).
% 0.14/0.36  cnf(a6, assumption,
% 0.14/0.36  	X6 = vd203).
% 0.14/0.36  cnf(a7, assumption,
% 0.14/0.36  	X5 = vd204).
% 0.14/0.36  cnf(c16, plain,
% 0.14/0.36  	$false,
% 0.14/0.36  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c11, c15])).
% 0.14/0.36  cnf(c17, plain,
% 0.14/0.36  	$false,
% 0.14/0.36  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c11, c15])).
% 0.14/0.36  
% 0.14/0.36  cnf(c18, plain,
% 0.14/0.36  	$false,
% 0.14/0.36  	inference(constraint_solving, [
% 0.14/0.36  		bind(X0, vd203),
% 0.14/0.36  		bind(X1, vd204),
% 0.14/0.36  		bind(X2, vd203),
% 0.14/0.36  		bind(X3, sK0(X1,X0)),
% 0.14/0.36  		bind(X4, sK1(X5,X6)),
% 0.14/0.36  		bind(X5, vd204),
% 0.14/0.36  		bind(X6, vd203),
% 0.14/0.36  		bind(X7, vd203)
% 0.14/0.36  	],
% 0.14/0.36  	[a0, a1, a2, a3, a4, a5, a6, a7])).
% 0.14/0.36  
% 0.14/0.36  % SZS output end IncompleteProof
%------------------------------------------------------------------------------