↑ Up

lazyCoP---0.1.THM-Ass.s

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

% Computer : n026.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 : Tue Jul 19 11:54:56 EDT 2022

% Result   : Theorem 0.06s 0.29s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07  % Problem  : SEU306+2 : TPTP v8.1.0. Released v3.3.0.
% 0.05/0.07  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.06/0.25  % Computer : n026.cluster.edu
% 0.06/0.25  % Model    : x86_64 x86_64
% 0.06/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25  % Memory   : 8042.1875MB
% 0.06/0.25  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25  % CPULimit : 300
% 0.06/0.25  % WCLimit  : 600
% 0.06/0.25  % DateTime : Sun Jun 19 21:32:25 EDT 2022
% 0.06/0.25  % CPUTime  : 
% 0.06/0.29  % SZS status Theorem
% 0.06/0.29  % SZS output begin IncompleteProof
% 0.06/0.29  cnf(c0, axiom,
% 0.06/0.29  	one_sorted_str(sK554)).
% 0.06/0.29  cnf(c1, plain,
% 0.06/0.29  	one_sorted_str(sK554),
% 0.06/0.29  	inference(start, [], [c0])).
% 0.06/0.29  
% 0.06/0.29  cnf(c2, axiom,
% 0.06/0.29  	the_carrier(X0) = cast_as_carrier_subset(X0) | ~one_sorted_str(X0)).
% 0.06/0.29  cnf(a0, assumption,
% 0.06/0.29  	sK554 = X0).
% 0.06/0.29  cnf(c3, plain,
% 0.06/0.29  	$false,
% 0.06/0.29  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.06/0.29  cnf(c4, plain,
% 0.06/0.29  	the_carrier(X0) = cast_as_carrier_subset(X0),
% 0.06/0.29  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.06/0.29  
% 0.06/0.29  cnf(c5, axiom,
% 0.06/0.29  	the_carrier(sK554) != cast_as_carrier_subset(sK554)).
% 0.06/0.29  cnf(a1, assumption,
% 0.06/0.29  	cast_as_carrier_subset(sK554) = cast_as_carrier_subset(X0)).
% 0.06/0.29  cnf(a2, assumption,
% 0.06/0.29  	the_carrier(X0) = X1).
% 0.06/0.29  cnf(c6, plain,
% 0.06/0.29  	$false,
% 0.06/0.29  	inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.06/0.29  cnf(c7, plain,
% 0.06/0.29  	$false,
% 0.06/0.29  	inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.06/0.29  cnf(c8, plain,
% 0.06/0.29  	the_carrier(sK554) != X1,
% 0.06/0.29  	inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.06/0.29  
% 0.06/0.29  cnf(a3, assumption,
% 0.06/0.29  	the_carrier(sK554) = X1).
% 0.06/0.29  cnf(c9, plain,
% 0.06/0.29  	$false,
% 0.06/0.29  	inference(reflexivity, [assumptions([a3])], [c8])).
% 0.06/0.29  
% 0.06/0.29  cnf(c10, plain,
% 0.06/0.29  	$false,
% 0.06/0.29  	inference(constraint_solving, [
% 0.06/0.29  		bind(X0, sK554),
% 0.06/0.29  		bind(X1, the_carrier(X0))
% 0.06/0.29  	],
% 0.06/0.29  	[a0, a1, a2, a3])).
% 0.06/0.29  
% 0.06/0.29  % SZS output end IncompleteProof
%------------------------------------------------------------------------------