↑ Up

lazyCoP---0.1.THM-Ass.s

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

% Computer : n029.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 16:47:10 EDT 2022

% Result   : Theorem 0.19s 0.40s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : PHI010+1 : TPTP v8.1.0. Released v7.2.0.
% 0.03/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33  % Computer : n029.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 : Thu Jun  2 01:08:31 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.40  % SZS status Theorem
% 0.19/0.40  % SZS output begin IncompleteProof
% 0.19/0.40  cnf(c0, axiom,
% 0.19/0.40  	sK5 = sK7).
% 0.19/0.40  cnf(c1, plain,
% 0.19/0.40  	sK5 = sK7,
% 0.19/0.40  	inference(start, [], [c0])).
% 0.19/0.40  
% 0.19/0.40  cnf(c2, axiom,
% 0.19/0.40  	is_the(sK5,sK6)).
% 0.19/0.40  cnf(a0, assumption,
% 0.19/0.40  	sK5 = sK5).
% 0.19/0.40  cnf(a1, assumption,
% 0.19/0.40  	sK7 = X0).
% 0.19/0.40  cnf(c3, plain,
% 0.19/0.40  	$false,
% 0.19/0.40  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.40  cnf(c4, plain,
% 0.19/0.40  	$false,
% 0.19/0.40  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.40  cnf(c5, plain,
% 0.19/0.40  	is_the(X0,sK6),
% 0.19/0.40  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.40  
% 0.19/0.40  cnf(c6, axiom,
% 0.19/0.40  	sP1(X1,X1,X2) | ~is_the(X1,X2)).
% 0.19/0.40  cnf(a2, assumption,
% 0.19/0.40  	X0 = X1).
% 0.19/0.40  cnf(a3, assumption,
% 0.19/0.40  	sK6 = X2).
% 0.19/0.40  cnf(c7, plain,
% 0.19/0.40  	$false,
% 0.19/0.40  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])).
% 0.19/0.40  cnf(c8, plain,
% 0.19/0.40  	sP1(X1,X1,X2),
% 0.19/0.40  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])).
% 0.19/0.40  
% 0.19/0.40  cnf(c9, axiom,
% 0.19/0.40  	sP2(X3,X4) | ~sP1(X3,X5,X4) | ~object(X3) | ~object(X5) | ~property(X4)).
% 0.19/0.40  cnf(a4, assumption,
% 0.19/0.40  	X1 = X3).
% 0.19/0.40  cnf(a5, assumption,
% 0.19/0.40  	X1 = X5).
% 0.19/0.40  cnf(a6, assumption,
% 0.19/0.40  	X2 = X4).
% 0.19/0.40  cnf(c10, plain,
% 0.19/0.40  	$false,
% 0.19/0.40  	inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c8, c9])).
% 0.19/0.40  cnf(c11, plain,
% 0.19/0.40  	sP2(X3,X4) | ~object(X3) | ~object(X5) | ~property(X4),
% 0.19/0.40  	inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c8, c9])).
% 0.19/0.40  
% 0.19/0.40  cnf(c12, axiom,
% 0.19/0.40  	sK3(X6,X7) = X6 | ~sP2(X6,X7)).
% 0.19/0.40  cnf(a7, assumption,
% 0.19/0.40  	X3 = X6).
% 0.19/0.40  cnf(a8, assumption,
% 0.19/0.40  	X4 = X7).
% 0.19/0.40  cnf(c13, plain,
% 0.19/0.40  	~object(X3) | ~object(X5) | ~property(X4),
% 0.19/0.40  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c12])).
% 0.19/0.40  cnf(c14, plain,
% 0.19/0.40  	sK3(X6,X7) = X6,
% 0.19/0.40  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c12])).
% 0.19/0.40  
% 0.19/0.40  cnf(c15, axiom,
% 0.19/0.40  	exemplifies_property(X8,sK3(X9,X8)) | ~sP2(X9,X8)).
% 0.19/0.40  cnf(a9, assumption,
% 0.19/0.40  	sK3(X9,X8) = sK3(X6,X7)).
% 0.19/0.40  cnf(c16, plain,
% 0.19/0.40  	$false,
% 0.19/0.40  	inference(strict_subterm_extension, [assumptions([a9])], [c14, c15])).
% 0.19/0.40  cnf(c17, plain,
% 0.19/0.40  	~sP2(X9,X8),
% 0.19/0.40  	inference(strict_subterm_extension, [assumptions([a9])], [c14, c15])).
% 0.19/0.40  cnf(c18, plain,
% 0.19/0.40  	exemplifies_property(X8,X6),
% 0.19/0.40  	inference(strict_subterm_extension, [assumptions([a9])], [c14, c15])).
% 0.19/0.40  
% 0.19/0.40  cnf(c19, axiom,
% 0.19/0.40  	~exemplifies_property(sK6,sK7)).
% 0.19/0.40  cnf(a10, assumption,
% 0.19/0.40  	X8 = sK6).
% 0.19/0.40  cnf(a11, assumption,
% 0.19/0.40  	X6 = sK7).
% 0.19/0.40  cnf(c20, plain,
% 0.19/0.40  	$false,
% 0.19/0.40  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c18, c19])).
% 0.19/0.40  cnf(c21, plain,
% 0.19/0.40  	$false,
% 0.19/0.40  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c18, c19])).
% 0.19/0.40  
% 0.19/0.40  cnf(c22, plain,
% 0.19/0.40  	sP2(X3,X4)).
% 0.19/0.40  cnf(a12, assumption,
% 0.19/0.40  	X9 = X3).
% 0.19/0.40  cnf(a13, assumption,
% 0.19/0.40  	X8 = X4).
% 0.19/0.40  cnf(c23, plain,
% 0.19/0.40  	$false,
% 0.19/0.40  	inference(predicate_reduction, [assumptions([a12, a13])], [c17, c22])).
% 0.19/0.40  
% 0.19/0.40  cnf(c24, axiom,
% 0.19/0.40  	object(sK7)).
% 0.19/0.40  cnf(a14, assumption,
% 0.19/0.40  	X3 = sK7).
% 0.19/0.40  cnf(c25, plain,
% 0.19/0.40  	~object(X5) | ~property(X4),
% 0.19/0.40  	inference(strict_predicate_extension, [assumptions([a14])], [c13, c24])).
% 0.19/0.40  cnf(c26, plain,
% 0.19/0.40  	$false,
% 0.19/0.40  	inference(strict_predicate_extension, [assumptions([a14])], [c13, c24])).
% 0.19/0.40  
% 0.19/0.40  cnf(c27, plain,
% 0.19/0.40  	object(X3)).
% 0.19/0.40  cnf(a15, assumption,
% 0.19/0.40  	X5 = X3).
% 0.19/0.40  cnf(c28, plain,
% 0.19/0.40  	~property(X4),
% 0.19/0.40  	inference(predicate_reduction, [assumptions([a15])], [c25, c27])).
% 0.19/0.40  
% 0.19/0.40  cnf(c29, axiom,
% 0.19/0.40  	property(sK6)).
% 0.19/0.40  cnf(a16, assumption,
% 0.19/0.40  	X4 = sK6).
% 0.19/0.40  cnf(c30, plain,
% 0.19/0.40  	$false,
% 0.19/0.40  	inference(strict_predicate_extension, [assumptions([a16])], [c28, c29])).
% 0.19/0.40  cnf(c31, plain,
% 0.19/0.40  	$false,
% 0.19/0.40  	inference(strict_predicate_extension, [assumptions([a16])], [c28, c29])).
% 0.19/0.40  
% 0.19/0.40  cnf(c32, plain,
% 0.19/0.40  	$false,
% 0.19/0.40  	inference(constraint_solving, [
% 0.19/0.40  		bind(X0, sK7),
% 0.19/0.40  		bind(X1, sK7),
% 0.19/0.40  		bind(X2, sK6),
% 0.19/0.40  		bind(X3, sK7),
% 0.19/0.40  		bind(X4, sK6),
% 0.19/0.40  		bind(X5, sK7),
% 0.19/0.40  		bind(X6, sK7),
% 0.19/0.40  		bind(X7, sK6),
% 0.19/0.40  		bind(X8, sK6),
% 0.19/0.40  		bind(X9, sK7)
% 0.19/0.40  	],
% 0.19/0.40  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])).
% 0.19/0.40  
% 0.19/0.40  % SZS output end IncompleteProof
%------------------------------------------------------------------------------