TSTP Solution File: SYN375+1 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SYN375+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 : n022.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 2.14s 0.63s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

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