↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : COM146+1 : TPTP v8.1.0. Released v6.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n021.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 : Fri Jul 15 01:27:29 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : COM146+1 : TPTP v8.1.0. Released v6.4.0.
% 0.07/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.35  % Computer : n021.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Thu Jun 16 18:39:30 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.14/0.37  % SZS status Theorem
% 0.14/0.37  % SZS output begin IncompleteProof
% 0.14/0.37  cnf(c0, axiom,
% 0.14/0.37  	vsomeExp(sK97) = vreduce(vvar(sK95))).
% 0.14/0.37  cnf(c1, plain,
% 0.14/0.37  	vsomeExp(sK97) = vreduce(vvar(sK95)),
% 0.14/0.37  	inference(start, [], [c0])).
% 0.14/0.37  
% 0.14/0.37  cnf(c2, axiom,
% 0.14/0.37  	vnoExp = vreduce(vvar(X0))).
% 0.14/0.37  cnf(a0, assumption,
% 0.14/0.37  	vreduce(vvar(X0)) = vreduce(vvar(sK95))).
% 0.14/0.37  cnf(a1, assumption,
% 0.14/0.37  	vsomeExp(sK97) = X1).
% 0.14/0.37  cnf(c3, plain,
% 0.14/0.37  	$false,
% 0.14/0.37  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.37  cnf(c4, plain,
% 0.14/0.37  	$false,
% 0.14/0.37  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.37  cnf(c5, plain,
% 0.14/0.37  	vnoExp = X1,
% 0.14/0.37  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.37  
% 0.14/0.37  cnf(c6, axiom,
% 0.14/0.37  	vnoExp != vsomeExp(X2)).
% 0.14/0.37  cnf(a2, assumption,
% 0.14/0.37  	vsomeExp(X2) = X1).
% 0.14/0.37  cnf(a3, assumption,
% 0.14/0.37  	vnoExp = X3).
% 0.14/0.37  cnf(c7, plain,
% 0.14/0.37  	$false,
% 0.14/0.37  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])).
% 0.14/0.37  cnf(c8, plain,
% 0.14/0.37  	$false,
% 0.14/0.37  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])).
% 0.14/0.37  cnf(c9, plain,
% 0.14/0.37  	vnoExp != X3,
% 0.14/0.37  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])).
% 0.14/0.37  
% 0.14/0.37  cnf(a4, assumption,
% 0.14/0.37  	vnoExp = X3).
% 0.14/0.37  cnf(c10, plain,
% 0.14/0.37  	$false,
% 0.14/0.37  	inference(reflexivity, [assumptions([a4])], [c9])).
% 0.14/0.37  
% 0.14/0.37  cnf(c11, plain,
% 0.14/0.37  	$false,
% 0.14/0.37  	inference(constraint_solving, [
% 0.14/0.37  		bind(X0, sK95),
% 0.14/0.37  		bind(X1, vsomeExp(sK97)),
% 0.14/0.37  		bind(X2, sK97),
% 0.14/0.37  		bind(X3, vnoExp)
% 0.14/0.37  	],
% 0.14/0.37  	[a0, a1, a2, a3, a4])).
% 0.14/0.37  
% 0.14/0.37  % SZS output end IncompleteProof
%------------------------------------------------------------------------------