↑ Up

lazyCoP---0.1.THM-Ass.s

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

% Computer : n020.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 14 17:20:23 EDT 2022

% Result   : Theorem 192.45s 24.85s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : ALG018+1 : TPTP v8.1.0. Released v2.7.0.
% 0.12/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33  % Computer : n020.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Thu Jun  9 02:06:21 EDT 2022
% 0.20/0.34  % CPUTime  : 
% 192.45/24.85  % SZS status Theorem
% 192.45/24.85  % SZS output begin IncompleteProof
% 192.45/24.85  cnf(c0, axiom,
% 192.45/24.85  	h(j(X0)) = X0 | ~sorti2(X0)).
% 192.45/24.85  cnf(c1, plain,
% 192.45/24.85  	h(j(X0)) = X0 | ~sorti2(X0),
% 192.45/24.85  	inference(start, [], [c0])).
% 192.45/24.85  
% 192.45/24.85  cnf(c2, axiom,
% 192.45/24.85  	j(op2(X1,X2)) = op1(j(X1),j(X2)) | ~sorti2(X2) | ~sorti2(X1)).
% 192.45/24.85  cnf(a0, assumption,
% 192.45/24.85  	j(X0) = j(op2(X1,X2))).
% 192.45/24.85  cnf(c3, plain,
% 192.45/24.85  	~sorti2(X0),
% 192.45/24.85  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 192.45/24.85  cnf(c4, plain,
% 192.45/24.85  	~sorti2(X2) | ~sorti2(X1),
% 192.45/24.85  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 192.45/24.85  cnf(c5, plain,
% 192.45/24.85  	X3 != op1(j(X1),j(X2)) | h(X3) = X0,
% 192.45/24.85  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 192.45/24.85  
% 192.45/24.85  cnf(c6, axiom,
% 192.45/24.85  	op1(X4,X4) = sK0 | ~sorti1(X4)).
% 192.45/24.85  cnf(a1, assumption,
% 192.45/24.85  	op1(j(X1),j(X2)) = op1(X4,X4)).
% 192.45/24.85  cnf(c7, plain,
% 192.45/24.85  	h(X3) = X0,
% 192.45/24.85  	inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 192.45/24.85  cnf(c8, plain,
% 192.45/24.85  	~sorti1(X4),
% 192.45/24.85  	inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 192.45/24.85  cnf(c9, plain,
% 192.45/24.85  	X5 != sK0 | X3 != X5,
% 192.45/24.85  	inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 192.45/24.85  
% 192.45/24.85  cnf(a2, assumption,
% 192.45/24.85  	X5 = sK0).
% 192.45/24.85  cnf(c10, plain,
% 192.45/24.85  	X3 != X5,
% 192.45/24.85  	inference(reflexivity, [assumptions([a2])], [c9])).
% 192.45/24.85  
% 192.45/24.85  cnf(a3, assumption,
% 192.45/24.85  	X3 = X5).
% 192.45/24.85  cnf(c11, plain,
% 192.45/24.85  	$false,
% 192.45/24.85  	inference(reflexivity, [assumptions([a3])], [c10])).
% 192.45/24.85  
% 192.45/24.85  cnf(c12, axiom,
% 192.45/24.85  	sorti1(j(X6)) | ~sorti2(X6)).
% 192.45/24.85  cnf(a4, assumption,
% 192.45/24.85  	X4 = j(X6)).
% 192.45/24.85  cnf(c13, plain,
% 192.45/24.85  	$false,
% 192.45/24.85  	inference(strict_predicate_extension, [assumptions([a4])], [c8, c12])).
% 192.45/24.85  cnf(c14, plain,
% 192.45/24.85  	~sorti2(X6),
% 192.45/24.85  	inference(strict_predicate_extension, [assumptions([a4])], [c8, c12])).
% 192.45/24.85  
% 192.45/24.85  cnf(c15, axiom,
% 192.45/24.85  	sorti2(sK1(X7)) | ~sorti2(X7)).
% 192.45/24.85  cnf(a5, assumption,
% 192.45/24.85  	X6 = sK1(X7)).
% 192.45/24.85  cnf(c16, plain,
% 192.45/24.85  	$false,
% 192.45/24.85  	inference(strict_predicate_extension, [assumptions([a5])], [c14, c15])).
% 192.45/24.85  cnf(c17, plain,
% 192.45/24.85  	~sorti2(X7),
% 192.45/24.85  	inference(strict_predicate_extension, [assumptions([a5])], [c14, c15])).
% 192.45/24.85  
% 192.45/24.85  cnf(c18, axiom,
% 192.45/24.85  	sorti2(h(X8)) | ~sorti1(X8)).
% 192.45/24.85  cnf(a6, assumption,
% 192.45/24.85  	X7 = h(X8)).
% 192.45/24.85  cnf(c19, plain,
% 192.45/24.85  	$false,
% 192.45/24.85  	inference(strict_predicate_extension, [assumptions([a6])], [c17, c18])).
% 192.45/24.85  cnf(c20, plain,
% 192.45/24.85  	~sorti1(X8),
% 192.45/24.85  	inference(strict_predicate_extension, [assumptions([a6])], [c17, c18])).
% 192.45/24.85  
% 192.45/24.85  cnf(c21, axiom,
% 192.45/24.85  	sorti1(sK0)).
% 192.45/24.85  cnf(a7, assumption,
% 192.45/24.85  	X8 = sK0).
% 192.45/24.85  cnf(c22, plain,
% 192.45/24.85  	$false,
% 192.45/24.85  	inference(strict_predicate_extension, [assumptions([a7])], [c20, c21])).
% 192.45/24.85  cnf(c23, plain,
% 192.45/24.85  	$false,
% 192.45/24.85  	inference(strict_predicate_extension, [assumptions([a7])], [c20, c21])).
% 192.45/24.85  
% 192.45/24.85  cnf(c24, axiom,
% 192.45/24.85  	op2(sK1(X9),sK1(X9)) != X9 | ~sorti2(X9)).
% 192.45/24.85  cnf(a8, assumption,
% 192.45/24.85  	op2(sK1(X9),sK1(X9)) = X0).
% 192.45/24.85  cnf(a9, assumption,
% 192.45/24.85  	h(X3) = X10).
% 192.45/24.85  cnf(c25, plain,
% 192.45/24.85  	$false,
% 192.45/24.85  	inference(strict_subterm_extension, [assumptions([a8, a9])], [c7, c24])).
% 192.45/24.85  cnf(c26, plain,
% 192.45/24.85  	~sorti2(X9),
% 192.45/24.85  	inference(strict_subterm_extension, [assumptions([a8, a9])], [c7, c24])).
% 192.45/24.85  cnf(c27, plain,
% 192.45/24.85  	X10 != X9,
% 192.45/24.85  	inference(strict_subterm_extension, [assumptions([a8, a9])], [c7, c24])).
% 192.45/24.85  
% 192.45/24.85  cnf(a10, assumption,
% 192.45/24.85  	X10 = X9).
% 192.45/24.85  cnf(c28, plain,
% 192.45/24.85  	$false,
% 192.45/24.85  	inference(reflexivity, [assumptions([a10])], [c27])).
% 192.45/24.85  
% 192.45/24.85  cnf(c29, plain,
% 192.45/24.85  	sorti2(X7)).
% 192.45/24.85  cnf(a11, assumption,
% 192.45/24.85  	X9 = X7).
% 192.45/24.85  cnf(c30, plain,
% 192.45/24.85  	$false,
% 192.45/24.85  	inference(predicate_reduction, [assumptions([a11])], [c26, c29])).
% 192.45/24.85  
% 192.45/24.85  cnf(c31, plain,
% 192.45/24.85  	sorti2(X6)).
% 192.45/24.85  cnf(a12, assumption,
% 192.45/24.85  	X2 = X6).
% 192.45/24.85  cnf(c32, plain,
% 192.45/24.85  	~sorti2(X1),
% 192.45/24.85  	inference(predicate_reduction, [assumptions([a12])], [c4, c31])).
% 192.45/24.85  
% 192.45/24.85  cnf(c33, plain,
% 192.45/24.85  	sorti2(X6)).
% 192.45/24.85  cnf(a13, assumption,
% 192.45/24.85  	X1 = X6).
% 192.45/24.85  cnf(c34, plain,
% 192.45/24.85  	$false,
% 192.45/24.85  	inference(predicate_reduction, [assumptions([a13])], [c32, c33])).
% 192.45/24.85  
% 192.45/24.85  cnf(c35, axiom,
% 192.45/24.85  	sorti2(op2(X11,X12)) | ~sorti2(X12) | ~sorti2(X11)).
% 192.45/24.85  cnf(a14, assumption,
% 192.45/24.85  	X0 = op2(X11,X12)).
% 192.45/24.85  cnf(c36, plain,
% 192.45/24.85  	$false,
% 192.45/24.85  	inference(strict_predicate_extension, [assumptions([a14])], [c3, c35])).
% 192.45/24.85  cnf(c37, plain,
% 192.45/24.85  	~sorti2(X12) | ~sorti2(X11),
% 192.45/24.85  	inference(strict_predicate_extension, [assumptions([a14])], [c3, c35])).
% 192.45/24.85  
% 192.45/24.85  cnf(c38, plain,
% 192.45/24.85  	sorti2(X6)).
% 192.45/24.85  cnf(a15, assumption,
% 192.45/24.85  	X12 = X6).
% 192.45/24.85  cnf(c39, plain,
% 192.45/24.85  	~sorti2(X11),
% 192.45/24.85  	inference(predicate_reduction, [assumptions([a15])], [c37, c38])).
% 192.45/24.85  
% 192.45/24.85  cnf(c40, plain,
% 192.45/24.85  	sorti2(X6)).
% 192.45/24.85  cnf(a16, assumption,
% 192.45/24.85  	X11 = X6).
% 192.45/24.85  cnf(c41, plain,
% 192.45/24.85  	$false,
% 192.45/24.85  	inference(predicate_reduction, [assumptions([a16])], [c39, c40])).
% 192.45/24.85  
% 192.45/24.85  cnf(c42, plain,
% 192.45/24.85  	$false,
% 192.45/24.85  	inference(constraint_solving, [
% 192.45/24.85  		bind(X0, op2(X1,X2)),
% 192.45/24.85  		bind(X1, sK1(X7)),
% 192.45/24.85  		bind(X2, sK1(X7)),
% 192.45/24.85  		bind(X3, sK0),
% 192.45/24.85  		bind(X4, j(X1)),
% 192.45/24.85  		bind(X5, sK0),
% 192.45/24.85  		bind(X6, sK1(X7)),
% 192.45/24.85  		bind(X7, h(X8)),
% 192.45/24.85  		bind(X8, sK0),
% 192.45/24.85  		bind(X9, h(X8)),
% 192.45/24.85  		bind(X10, h(X3)),
% 192.45/24.85  		bind(X11, sK1(X7)),
% 192.45/24.85  		bind(X12, sK1(X7))
% 192.45/24.85  	],
% 192.45/24.85  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])).
% 192.45/24.85  
% 192.45/24.85  % SZS output end IncompleteProof
%------------------------------------------------------------------------------