↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SYN377+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 : n009.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:12 EDT 2022

% Result   : Theorem 2.23s 0.68s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN377+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33  % Computer : n009.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 : Tue Jul 12 06:00:37 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 2.23/0.68  % SZS status Theorem
% 2.23/0.68  % SZS output begin IncompleteProof
% 2.23/0.68  cnf(c0, axiom,
% 2.23/0.68  	sP1 | sP0).
% 2.23/0.68  cnf(c1, plain,
% 2.23/0.68  	sP1 | sP0,
% 2.23/0.68  	inference(start, [], [c0])).
% 2.23/0.68  
% 2.23/0.68  cnf(c2, axiom,
% 2.23/0.68  	~sP1 | ~sP0).
% 2.23/0.68  cnf(c3, plain,
% 2.23/0.68  	sP0,
% 2.23/0.68  	inference(strict_predicate_extension, [], [c1, c2])).
% 2.23/0.68  cnf(c4, plain,
% 2.23/0.68  	~sP0,
% 2.23/0.68  	inference(strict_predicate_extension, [], [c1, c2])).
% 2.23/0.68  
% 2.23/0.68  cnf(c5, axiom,
% 2.23/0.68  	sP0 | ~big_p(sK7) | ~big_p(sK6)).
% 2.23/0.68  cnf(c6, plain,
% 2.23/0.68  	$false,
% 2.23/0.68  	inference(strict_predicate_extension, [], [c4, c5])).
% 2.23/0.68  cnf(c7, plain,
% 2.23/0.68  	~big_p(sK7) | ~big_p(sK6),
% 2.23/0.68  	inference(strict_predicate_extension, [], [c4, c5])).
% 2.23/0.68  
% 2.23/0.68  cnf(c8, axiom,
% 2.23/0.68  	big_p(X0) | ~big_p(X1) | ~sP1).
% 2.23/0.68  cnf(a0, assumption,
% 2.23/0.68  	sK7 = X0).
% 2.23/0.68  cnf(c9, plain,
% 2.23/0.68  	~big_p(sK6),
% 2.23/0.68  	inference(strict_predicate_extension, [assumptions([a0])], [c7, c8])).
% 2.23/0.68  cnf(c10, plain,
% 2.23/0.68  	~big_p(X1) | ~sP1,
% 2.23/0.68  	inference(strict_predicate_extension, [assumptions([a0])], [c7, c8])).
% 2.23/0.68  
% 2.23/0.68  cnf(c11, axiom,
% 2.23/0.68  	sP0 | big_p(X2) | big_p(sK6)).
% 2.23/0.68  cnf(a1, assumption,
% 2.23/0.68  	X1 = X2).
% 2.23/0.68  cnf(c12, plain,
% 2.23/0.68  	~sP1,
% 2.23/0.68  	inference(strict_predicate_extension, [assumptions([a1])], [c10, c11])).
% 2.23/0.68  cnf(c13, plain,
% 2.23/0.68  	sP0 | big_p(sK6),
% 2.23/0.68  	inference(strict_predicate_extension, [assumptions([a1])], [c10, c11])).
% 2.23/0.68  
% 2.23/0.68  cnf(c14, plain,
% 2.23/0.68  	~sP0).
% 2.23/0.68  cnf(c15, plain,
% 2.23/0.68  	big_p(sK6),
% 2.23/0.68  	inference(predicate_reduction, [], [c13, c14])).
% 2.23/0.68  
% 2.23/0.68  cnf(c16, plain,
% 2.23/0.68  	~big_p(X1)).
% 2.23/0.68  cnf(a2, assumption,
% 2.23/0.68  	sK6 = X1).
% 2.23/0.68  cnf(c17, plain,
% 2.23/0.68  	$false,
% 2.23/0.68  	inference(predicate_reduction, [assumptions([a2])], [c15, c16])).
% 2.23/0.68  
% 2.23/0.68  cnf(c18, plain,
% 2.23/0.68  	sP1).
% 2.23/0.68  cnf(c19, plain,
% 2.23/0.68  	$false,
% 2.23/0.68  	inference(predicate_reduction, [], [c12, c18])).
% 2.23/0.68  
% 2.23/0.68  cnf(c20, plain,
% 2.23/0.68  	big_p(X1)).
% 2.23/0.68  cnf(a3, assumption,
% 2.23/0.68  	sK6 = X1).
% 2.23/0.68  cnf(c21, plain,
% 2.23/0.68  	$false,
% 2.23/0.68  	inference(predicate_reduction, [assumptions([a3])], [c9, c20])).
% 2.23/0.68  
% 2.23/0.68  cnf(c22, axiom,
% 2.23/0.68  	big_p(X3) | ~big_p(X4) | ~sP0).
% 2.23/0.68  cnf(c23, plain,
% 2.23/0.68  	$false,
% 2.23/0.68  	inference(strict_predicate_extension, [], [c3, c22])).
% 2.23/0.68  cnf(c24, plain,
% 2.23/0.68  	big_p(X3) | ~big_p(X4),
% 2.23/0.68  	inference(strict_predicate_extension, [], [c3, c22])).
% 2.23/0.68  
% 2.23/0.68  cnf(c25, axiom,
% 2.23/0.68  	sP1 | ~big_p(sK2) | ~big_p(X5)).
% 2.23/0.68  cnf(a4, assumption,
% 2.23/0.68  	X3 = sK2).
% 2.23/0.68  cnf(c26, plain,
% 2.23/0.68  	~big_p(X4),
% 2.23/0.68  	inference(strict_predicate_extension, [assumptions([a4])], [c24, c25])).
% 2.23/0.68  cnf(c27, plain,
% 2.23/0.68  	sP1 | ~big_p(X5),
% 2.23/0.68  	inference(strict_predicate_extension, [assumptions([a4])], [c24, c25])).
% 2.23/0.68  
% 2.23/0.68  cnf(c28, plain,
% 2.23/0.68  	~sP1).
% 2.23/0.68  cnf(c29, plain,
% 2.23/0.68  	~big_p(X5),
% 2.23/0.68  	inference(predicate_reduction, [], [c27, c28])).
% 2.23/0.68  
% 2.23/0.68  cnf(c30, axiom,
% 2.23/0.68  	sP1 | big_p(X6) | big_p(sK3)).
% 2.23/0.68  cnf(a5, assumption,
% 2.23/0.68  	X5 = X6).
% 2.23/0.68  cnf(c31, plain,
% 2.23/0.68  	$false,
% 2.23/0.68  	inference(strict_predicate_extension, [assumptions([a5])], [c29, c30])).
% 2.23/0.68  cnf(c32, plain,
% 2.23/0.68  	sP1 | big_p(sK3),
% 2.23/0.68  	inference(strict_predicate_extension, [assumptions([a5])], [c29, c30])).
% 2.23/0.68  
% 2.23/0.68  cnf(c33, plain,
% 2.23/0.68  	~sP1).
% 2.23/0.68  cnf(c34, plain,
% 2.23/0.68  	big_p(sK3),
% 2.23/0.68  	inference(predicate_reduction, [], [c32, c33])).
% 2.23/0.68  
% 2.23/0.68  cnf(c35, plain,
% 2.23/0.68  	~big_p(X5)).
% 2.23/0.68  cnf(a6, assumption,
% 2.23/0.68  	sK3 = X5).
% 2.23/0.68  cnf(c36, plain,
% 2.23/0.68  	$false,
% 2.23/0.68  	inference(predicate_reduction, [assumptions([a6])], [c34, c35])).
% 2.23/0.68  
% 2.23/0.68  cnf(c37, plain,
% 2.23/0.68  	big_p(X5)).
% 2.23/0.68  cnf(a7, assumption,
% 2.23/0.68  	X4 = X5).
% 2.23/0.68  cnf(c38, plain,
% 2.23/0.68  	$false,
% 2.23/0.68  	inference(predicate_reduction, [assumptions([a7])], [c26, c37])).
% 2.23/0.68  
% 2.23/0.68  cnf(c39, plain,
% 2.23/0.68  	$false,
% 2.23/0.68  	inference(constraint_solving, [
% 2.23/0.68  		bind(X0, sK7),
% 2.23/0.68  		bind(X1, sK6),
% 2.23/0.68  		bind(X2, sK6),
% 2.23/0.68  		bind(X3, sK2),
% 2.23/0.68  		bind(X4, sK3),
% 2.23/0.68  		bind(X5, sK3),
% 2.23/0.68  		bind(X6, sK3)
% 2.23/0.68  	],
% 2.23/0.68  	[a0, a1, a2, a3, a4, a5, a6, a7])).
% 2.23/0.68  
% 2.23/0.68  % SZS output end IncompleteProof
%------------------------------------------------------------------------------