↑ Up

lazyCoP---0.1.THM-Ass.s

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

% Computer : n028.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 : Thu Jul 21 08:10:11 EDT 2022

% Result   : Theorem 19.78s 3.00s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN374+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34  % Computer : n028.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jul 11 16:34:44 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 19.78/3.00  % SZS status Theorem
% 19.78/3.00  % SZS output begin IncompleteProof
% 19.78/3.00  cnf(c0, axiom,
% 19.78/3.00  	~sP1 | ~sP0).
% 19.78/3.00  cnf(c1, plain,
% 19.78/3.00  	~sP1 | ~sP0,
% 19.78/3.00  	inference(start, [], [c0])).
% 19.78/3.00  
% 19.78/3.00  cnf(c2, axiom,
% 19.78/3.00  	sP1 | sP0).
% 19.78/3.00  cnf(c3, plain,
% 19.78/3.00  	~sP0,
% 19.78/3.00  	inference(strict_predicate_extension, [], [c1, c2])).
% 19.78/3.00  cnf(c4, plain,
% 19.78/3.00  	sP0,
% 19.78/3.00  	inference(strict_predicate_extension, [], [c1, c2])).
% 19.78/3.00  
% 19.78/3.00  cnf(c5, axiom,
% 19.78/3.00  	big_p(X0) | ~big_p(sK7) | ~sP0).
% 19.78/3.00  cnf(c6, plain,
% 19.78/3.00  	$false,
% 19.78/3.00  	inference(strict_predicate_extension, [], [c4, c5])).
% 19.78/3.00  cnf(c7, plain,
% 19.78/3.00  	big_p(X0) | ~big_p(sK7),
% 19.78/3.00  	inference(strict_predicate_extension, [], [c4, c5])).
% 19.78/3.00  
% 19.78/3.00  cnf(c8, axiom,
% 19.78/3.00  	sP1 | ~big_p(sK2) | ~big_p(X1)).
% 19.78/3.00  cnf(a0, assumption,
% 19.78/3.00  	X0 = sK2).
% 19.78/3.00  cnf(c9, plain,
% 19.78/3.00  	~big_p(sK7),
% 19.78/3.00  	inference(strict_predicate_extension, [assumptions([a0])], [c7, c8])).
% 19.78/3.00  cnf(c10, plain,
% 19.78/3.00  	sP1 | ~big_p(X1),
% 19.78/3.00  	inference(strict_predicate_extension, [assumptions([a0])], [c7, c8])).
% 19.78/3.00  
% 19.78/3.00  cnf(c11, plain,
% 19.78/3.00  	~sP1).
% 19.78/3.00  cnf(c12, plain,
% 19.78/3.00  	~big_p(X1),
% 19.78/3.00  	inference(predicate_reduction, [], [c10, c11])).
% 19.78/3.00  
% 19.78/3.00  cnf(c13, plain,
% 19.78/3.00  	big_p(X0)).
% 19.78/3.00  cnf(a1, assumption,
% 19.78/3.00  	X1 = X0).
% 19.78/3.00  cnf(c14, plain,
% 19.78/3.00  	$false,
% 19.78/3.00  	inference(predicate_reduction, [assumptions([a1])], [c12, c13])).
% 19.78/3.00  
% 19.78/3.00  cnf(c15, axiom,
% 19.78/3.00  	big_p(sK7) | ~big_p(X2) | ~sP0).
% 19.78/3.00  cnf(a2, assumption,
% 19.78/3.00  	sK7 = sK7).
% 19.78/3.00  cnf(c16, plain,
% 19.78/3.00  	$false,
% 19.78/3.00  	inference(strict_predicate_extension, [assumptions([a2])], [c9, c15])).
% 19.78/3.00  cnf(c17, plain,
% 19.78/3.00  	~big_p(X2) | ~sP0,
% 19.78/3.00  	inference(strict_predicate_extension, [assumptions([a2])], [c9, c15])).
% 19.78/3.00  
% 19.78/3.00  cnf(c18, axiom,
% 19.78/3.00  	sP1 | big_p(X3) | big_p(sK3)).
% 19.78/3.00  cnf(a3, assumption,
% 19.78/3.00  	X2 = sK3).
% 19.78/3.00  cnf(c19, plain,
% 19.78/3.00  	~sP0,
% 19.78/3.00  	inference(strict_predicate_extension, [assumptions([a3])], [c17, c18])).
% 19.78/3.00  cnf(c20, plain,
% 19.78/3.00  	sP1 | big_p(X3),
% 19.78/3.00  	inference(strict_predicate_extension, [assumptions([a3])], [c17, c18])).
% 19.78/3.00  
% 19.78/3.00  cnf(c21, plain,
% 19.78/3.00  	~sP1).
% 19.78/3.00  cnf(c22, plain,
% 19.78/3.00  	big_p(X3),
% 19.78/3.00  	inference(predicate_reduction, [], [c20, c21])).
% 19.78/3.00  
% 19.78/3.00  cnf(c23, plain,
% 19.78/3.00  	~big_p(X0)).
% 19.78/3.00  cnf(a4, assumption,
% 19.78/3.00  	X3 = X0).
% 19.78/3.00  cnf(c24, plain,
% 19.78/3.00  	$false,
% 19.78/3.00  	inference(predicate_reduction, [assumptions([a4])], [c22, c23])).
% 19.78/3.00  
% 19.78/3.00  cnf(c25, plain,
% 19.78/3.00  	sP0).
% 19.78/3.00  cnf(c26, plain,
% 19.78/3.00  	$false,
% 19.78/3.00  	inference(predicate_reduction, [], [c19, c25])).
% 19.78/3.00  
% 19.78/3.00  cnf(c27, axiom,
% 19.78/3.00  	sP0 | big_p(sK6(X4)) | big_p(X4)).
% 19.78/3.00  cnf(c28, plain,
% 19.78/3.00  	$false,
% 19.78/3.00  	inference(strict_predicate_extension, [], [c3, c27])).
% 19.78/3.00  cnf(c29, plain,
% 19.78/3.00  	big_p(sK6(X4)) | big_p(X4),
% 19.78/3.00  	inference(strict_predicate_extension, [], [c3, c27])).
% 19.78/3.00  
% 19.78/3.00  cnf(c30, axiom,
% 19.78/3.00  	big_p(X5) | ~big_p(X6) | ~sP1).
% 19.78/3.00  cnf(a5, assumption,
% 19.78/3.00  	sK6(X4) = X6).
% 19.78/3.00  cnf(c31, plain,
% 19.78/3.00  	big_p(X4),
% 19.78/3.00  	inference(strict_predicate_extension, [assumptions([a5])], [c29, c30])).
% 19.78/3.00  cnf(c32, plain,
% 19.78/3.00  	big_p(X5) | ~sP1,
% 19.78/3.00  	inference(strict_predicate_extension, [assumptions([a5])], [c29, c30])).
% 19.78/3.00  
% 19.78/3.00  cnf(c33, axiom,
% 19.78/3.00  	sP0 | ~big_p(sK6(X7)) | ~big_p(X7)).
% 19.78/3.00  cnf(a6, assumption,
% 19.78/3.00  	X5 = sK6(X7)).
% 19.78/3.00  cnf(c34, plain,
% 19.78/3.00  	~sP1,
% 19.78/3.00  	inference(strict_predicate_extension, [assumptions([a6])], [c32, c33])).
% 19.78/3.00  cnf(c35, plain,
% 19.78/3.00  	sP0 | ~big_p(X7),
% 19.78/3.00  	inference(strict_predicate_extension, [assumptions([a6])], [c32, c33])).
% 19.78/3.00  
% 19.78/3.00  cnf(c36, plain,
% 19.78/3.00  	~sP0).
% 19.78/3.00  cnf(c37, plain,
% 19.78/3.00  	~big_p(X7),
% 19.78/3.00  	inference(predicate_reduction, [], [c35, c36])).
% 19.78/3.00  
% 19.78/3.00  cnf(c38, axiom,
% 19.78/3.00  	big_p(X8) | ~big_p(X9) | ~sP1).
% 19.78/3.00  cnf(a7, assumption,
% 19.78/3.00  	X7 = X8).
% 19.78/3.00  cnf(c39, plain,
% 19.78/3.00  	$false,
% 19.78/3.00  	inference(strict_predicate_extension, [assumptions([a7])], [c37, c38])).
% 19.78/3.00  cnf(c40, plain,
% 19.78/3.00  	~big_p(X9) | ~sP1,
% 19.78/3.00  	inference(strict_predicate_extension, [assumptions([a7])], [c37, c38])).
% 19.78/3.00  
% 19.78/3.00  cnf(c41, plain,
% 19.78/3.00  	big_p(X5)).
% 19.78/3.00  cnf(a8, assumption,
% 19.78/3.00  	X9 = X5).
% 19.78/3.00  cnf(c42, plain,
% 19.78/3.00  	~sP1,
% 19.78/3.00  	inference(predicate_reduction, [assumptions([a8])], [c40, c41])).
% 19.78/3.00  
% 19.78/3.00  cnf(c43, plain,
% 19.78/3.00  	sP1).
% 19.78/3.00  cnf(c44, plain,
% 19.78/3.00  	$false,
% 19.78/3.00  	inference(predicate_reduction, [], [c42, c43])).
% 19.78/3.00  
% 19.78/3.00  cnf(c45, plain,
% 19.78/3.00  	sP1).
% 19.78/3.00  cnf(c46, plain,
% 19.78/3.00  	$false,
% 19.78/3.00  	inference(predicate_reduction, [], [c34, c45])).
% 19.78/3.00  
% 19.78/3.00  cnf(c47, plain,
% 19.78/3.00  	~big_p(X5)).
% 19.78/3.00  cnf(a9, assumption,
% 19.78/3.00  	X4 = X5).
% 19.78/3.00  cnf(c48, plain,
% 19.78/3.00  	$false,
% 19.78/3.00  	inference(predicate_reduction, [assumptions([a9])], [c31, c47])).
% 19.78/3.00  
% 19.78/3.00  cnf(c49, plain,
% 19.78/3.00  	$false,
% 19.78/3.00  	inference(constraint_solving, [
% 19.78/3.00  		bind(X0, sK2),
% 19.78/3.00  		bind(X1, sK2),
% 19.78/3.00  		bind(X2, sK3),
% 19.78/3.00  		bind(X3, sK2),
% 19.78/3.00  		bind(X4, sK6(X7)),
% 19.78/3.00  		bind(X5, sK6(X7)),
% 19.78/3.00  		bind(X6, sK6(X4)),
% 19.78/3.00  		bind(X7, X8),
% 19.78/3.00  		bind(X8, X8),
% 19.78/3.00  		bind(X9, sK6(X7))
% 19.78/3.00  	],
% 19.78/3.00  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])).
% 19.78/3.00  
% 19.78/3.00  % SZS output end IncompleteProof
%------------------------------------------------------------------------------