↑ Up

lazyCoP---0.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SYN100-1.005 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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 : Thu Jul 21 08:08:07 EDT 2022

% Result   : Unsatisfiable 0.20s 0.39s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN100-1.005 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34  % Computer : n029.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jul 11 21:12:17 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.39  % SZS status Unsatisfiable
% 0.20/0.39  % SZS output begin IncompleteProof
% 0.20/0.39  cnf(c0, axiom,
% 0.20/0.39  	~q_0(X0) | ~p_0(X0)).
% 0.20/0.39  cnf(c1, plain,
% 0.20/0.39  	~q_0(X0) | ~p_0(X0),
% 0.20/0.39  	inference(start, [], [c0])).
% 0.20/0.39  
% 0.20/0.39  cnf(c2, axiom,
% 0.20/0.39  	~p_2(X1) | ~q_1(X1) | q_0(X1)).
% 0.20/0.39  cnf(a0, assumption,
% 0.20/0.39  	X0 = X1).
% 0.20/0.39  cnf(c3, plain,
% 0.20/0.39  	~p_0(X0),
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.39  cnf(c4, plain,
% 0.20/0.39  	~p_2(X1) | ~q_1(X1),
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.39  
% 0.20/0.39  cnf(c5, axiom,
% 0.20/0.39  	~q_4(X2) | ~q_3(X2) | p_2(X2)).
% 0.20/0.39  cnf(a1, assumption,
% 0.20/0.39  	X1 = X2).
% 0.20/0.39  cnf(c6, plain,
% 0.20/0.39  	~q_1(X1),
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.20/0.39  cnf(c7, plain,
% 0.20/0.39  	~q_4(X2) | ~q_3(X2),
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.20/0.39  
% 0.20/0.39  cnf(c8, axiom,
% 0.20/0.39  	~q_6(X3) | ~p_5(X3) | q_4(X3)).
% 0.20/0.39  cnf(a2, assumption,
% 0.20/0.39  	X2 = X3).
% 0.20/0.39  cnf(c9, plain,
% 0.20/0.39  	~q_3(X2),
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.20/0.39  cnf(c10, plain,
% 0.20/0.39  	~q_6(X3) | ~p_5(X3),
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.20/0.39  
% 0.20/0.39  cnf(c11, axiom,
% 0.20/0.39  	~q_8(X4) | ~p_7(X4) | q_6(X4)).
% 0.20/0.39  cnf(a3, assumption,
% 0.20/0.39  	X3 = X4).
% 0.20/0.39  cnf(c12, plain,
% 0.20/0.39  	~p_5(X3),
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.20/0.39  cnf(c13, plain,
% 0.20/0.39  	~q_8(X4) | ~p_7(X4),
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.20/0.39  
% 0.20/0.39  cnf(c14, axiom,
% 0.20/0.39  	q_8(a)).
% 0.20/0.39  cnf(a4, assumption,
% 0.20/0.39  	X4 = a).
% 0.20/0.39  cnf(c15, plain,
% 0.20/0.39  	~p_7(X4),
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 0.20/0.39  cnf(c16, plain,
% 0.20/0.39  	$false,
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 0.20/0.39  
% 0.20/0.39  cnf(c17, axiom,
% 0.20/0.39  	~p_9(X5) | ~p_8(X5) | p_7(X5)).
% 0.20/0.39  cnf(a5, assumption,
% 0.20/0.39  	X4 = X5).
% 0.20/0.39  cnf(c18, plain,
% 0.20/0.39  	$false,
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a5])], [c15, c17])).
% 0.20/0.39  cnf(c19, plain,
% 0.20/0.39  	~p_9(X5) | ~p_8(X5),
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a5])], [c15, c17])).
% 0.20/0.39  
% 0.20/0.39  cnf(c20, axiom,
% 0.20/0.39  	p_9(a)).
% 0.20/0.39  cnf(a6, assumption,
% 0.20/0.39  	X5 = a).
% 0.20/0.39  cnf(c21, plain,
% 0.20/0.39  	~p_8(X5),
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 0.20/0.39  cnf(c22, plain,
% 0.20/0.39  	$false,
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 0.20/0.39  
% 0.20/0.39  cnf(c23, axiom,
% 0.20/0.39  	p_8(a)).
% 0.20/0.39  cnf(a7, assumption,
% 0.20/0.39  	X5 = a).
% 0.20/0.39  cnf(c24, plain,
% 0.20/0.39  	$false,
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a7])], [c21, c23])).
% 0.20/0.39  cnf(c25, plain,
% 0.20/0.39  	$false,
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a7])], [c21, c23])).
% 0.20/0.39  
% 0.20/0.39  cnf(c26, axiom,
% 0.20/0.39  	~p_7(X6) | ~p_6(X6) | p_5(X6)).
% 0.20/0.39  cnf(a8, assumption,
% 0.20/0.39  	X3 = X6).
% 0.20/0.39  cnf(c27, plain,
% 0.20/0.39  	$false,
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a8])], [c12, c26])).
% 0.20/0.39  cnf(c28, plain,
% 0.20/0.39  	~p_7(X6) | ~p_6(X6),
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a8])], [c12, c26])).
% 0.20/0.39  
% 0.20/0.39  cnf(c29, plain,
% 0.20/0.39  	p_7(X4)).
% 0.20/0.39  cnf(a9, assumption,
% 0.20/0.39  	X6 = X4).
% 0.20/0.39  cnf(c30, plain,
% 0.20/0.39  	~p_6(X6),
% 0.20/0.39  	inference(predicate_reduction, [assumptions([a9])], [c28, c29])).
% 0.20/0.39  
% 0.20/0.39  cnf(c31, axiom,
% 0.20/0.39  	~p_8(X7) | ~p_7(X7) | p_6(X7)).
% 0.20/0.39  cnf(a10, assumption,
% 0.20/0.39  	X6 = X7).
% 0.20/0.39  cnf(c32, plain,
% 0.20/0.39  	$false,
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a10])], [c30, c31])).
% 0.20/0.39  cnf(c33, plain,
% 0.20/0.39  	~p_8(X7) | ~p_7(X7),
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a10])], [c30, c31])).
% 0.20/0.39  
% 0.20/0.39  cnf(c34, plain,
% 0.20/0.39  	p_8(X5)).
% 0.20/0.39  cnf(a11, assumption,
% 0.20/0.39  	X7 = X5).
% 0.20/0.39  cnf(c35, plain,
% 0.20/0.39  	~p_7(X7),
% 0.20/0.39  	inference(predicate_reduction, [assumptions([a11])], [c33, c34])).
% 0.20/0.39  
% 0.20/0.39  cnf(c36, plain,
% 0.20/0.39  	p_7(X4)).
% 0.20/0.39  cnf(a12, assumption,
% 0.20/0.39  	X7 = X4).
% 0.20/0.39  cnf(c37, plain,
% 0.20/0.39  	$false,
% 0.20/0.39  	inference(predicate_reduction, [assumptions([a12])], [c35, c36])).
% 0.20/0.39  
% 0.20/0.39  cnf(c38, axiom,
% 0.20/0.39  	~p_5(X8) | ~q_4(X8) | q_3(X8)).
% 0.20/0.39  cnf(a13, assumption,
% 0.20/0.39  	X2 = X8).
% 0.20/0.39  cnf(c39, plain,
% 0.20/0.39  	$false,
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a13])], [c9, c38])).
% 0.20/0.39  cnf(c40, plain,
% 0.20/0.39  	~p_5(X8) | ~q_4(X8),
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a13])], [c9, c38])).
% 0.20/0.39  
% 0.20/0.39  cnf(c41, plain,
% 0.20/0.39  	p_5(X3)).
% 0.20/0.39  cnf(a14, assumption,
% 0.20/0.39  	X8 = X3).
% 0.20/0.39  cnf(c42, plain,
% 0.20/0.39  	~q_4(X8),
% 0.20/0.39  	inference(predicate_reduction, [assumptions([a14])], [c40, c41])).
% 0.20/0.39  
% 0.20/0.39  cnf(c43, plain,
% 0.20/0.39  	q_4(X2)).
% 0.20/0.39  cnf(a15, assumption,
% 0.20/0.39  	X8 = X2).
% 0.20/0.39  cnf(c44, plain,
% 0.20/0.39  	$false,
% 0.20/0.39  	inference(predicate_reduction, [assumptions([a15])], [c42, c43])).
% 0.20/0.39  
% 0.20/0.39  cnf(c45, axiom,
% 0.20/0.39  	~q_3(X9) | ~p_2(X9) | q_1(X9)).
% 0.20/0.39  cnf(a16, assumption,
% 0.20/0.39  	X1 = X9).
% 0.20/0.39  cnf(c46, plain,
% 0.20/0.39  	$false,
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a16])], [c6, c45])).
% 0.20/0.39  cnf(c47, plain,
% 0.20/0.39  	~q_3(X9) | ~p_2(X9),
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a16])], [c6, c45])).
% 0.20/0.39  
% 0.20/0.39  cnf(c48, plain,
% 0.20/0.39  	q_3(X2)).
% 0.20/0.39  cnf(a17, assumption,
% 0.20/0.39  	X9 = X2).
% 0.20/0.39  cnf(c49, plain,
% 0.20/0.39  	~p_2(X9),
% 0.20/0.39  	inference(predicate_reduction, [assumptions([a17])], [c47, c48])).
% 0.20/0.39  
% 0.20/0.39  cnf(c50, plain,
% 0.20/0.39  	p_2(X1)).
% 0.20/0.39  cnf(a18, assumption,
% 0.20/0.39  	X9 = X1).
% 0.20/0.39  cnf(c51, plain,
% 0.20/0.39  	$false,
% 0.20/0.39  	inference(predicate_reduction, [assumptions([a18])], [c49, c50])).
% 0.20/0.39  
% 0.20/0.39  cnf(c52, axiom,
% 0.20/0.39  	~q_2(X10) | ~q_1(X10) | p_0(X10)).
% 0.20/0.39  cnf(a19, assumption,
% 0.20/0.39  	X0 = X10).
% 0.20/0.39  cnf(c53, plain,
% 0.20/0.39  	$false,
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a19])], [c3, c52])).
% 0.20/0.39  cnf(c54, plain,
% 0.20/0.39  	~q_2(X10) | ~q_1(X10),
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a19])], [c3, c52])).
% 0.20/0.39  
% 0.20/0.39  cnf(c55, axiom,
% 0.20/0.39  	~p_4(X11) | ~q_3(X11) | q_2(X11)).
% 0.20/0.39  cnf(a20, assumption,
% 0.20/0.39  	X10 = X11).
% 0.20/0.39  cnf(c56, plain,
% 0.20/0.39  	~q_1(X10),
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a20])], [c54, c55])).
% 0.20/0.39  cnf(c57, plain,
% 0.20/0.39  	~p_4(X11) | ~q_3(X11),
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a20])], [c54, c55])).
% 0.20/0.39  
% 0.20/0.39  cnf(c58, axiom,
% 0.20/0.39  	~p_6(X12) | ~p_5(X12) | p_4(X12)).
% 0.20/0.39  cnf(a21, assumption,
% 0.20/0.39  	X11 = X12).
% 0.20/0.39  cnf(c59, plain,
% 0.20/0.39  	~q_3(X11),
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a21])], [c57, c58])).
% 0.20/0.39  cnf(c60, plain,
% 0.20/0.39  	~p_6(X12) | ~p_5(X12),
% 0.20/0.39  	inference(strict_predicate_extension, [assumptions([a21])], [c57, c58])).
% 0.20/0.39  
% 0.20/0.39  cnf(c61, plain,
% 0.20/0.39  	p_6(X6)).
% 0.20/0.39  cnf(a22, assumption,
% 0.20/0.39  	X12 = X6).
% 0.20/0.39  cnf(c62, plain,
% 0.20/0.39  	~p_5(X12),
% 0.20/0.39  	inference(predicate_reduction, [assumptions([a22])], [c60, c61])).
% 0.20/0.39  
% 0.20/0.39  cnf(c63, plain,
% 0.20/0.39  	p_5(X3)).
% 0.20/0.39  cnf(a23, assumption,
% 0.20/0.39  	X12 = X3).
% 0.20/0.39  cnf(c64, plain,
% 0.20/0.39  	$false,
% 0.20/0.39  	inference(predicate_reduction, [assumptions([a23])], [c62, c63])).
% 0.20/0.39  
% 0.20/0.39  cnf(c65, plain,
% 0.20/0.39  	q_3(X2)).
% 0.20/0.39  cnf(a24, assumption,
% 0.20/0.39  	X11 = X2).
% 0.20/0.39  cnf(c66, plain,
% 0.20/0.39  	$false,
% 0.20/0.39  	inference(predicate_reduction, [assumptions([a24])], [c59, c65])).
% 0.20/0.39  
% 0.20/0.39  cnf(c67, plain,
% 0.20/0.39  	q_1(X1)).
% 0.20/0.39  cnf(a25, assumption,
% 0.20/0.39  	X10 = X1).
% 0.20/0.39  cnf(c68, plain,
% 0.20/0.39  	$false,
% 0.20/0.39  	inference(predicate_reduction, [assumptions([a25])], [c56, c67])).
% 0.20/0.39  
% 0.20/0.39  cnf(c69, plain,
% 0.20/0.39  	$false,
% 0.20/0.39  	inference(constraint_solving, [
% 0.20/0.39  		bind(X0, a),
% 0.20/0.39  		bind(X1, a),
% 0.20/0.39  		bind(X2, a),
% 0.20/0.39  		bind(X3, a),
% 0.20/0.39  		bind(X4, a),
% 0.20/0.39  		bind(X5, a),
% 0.20/0.39  		bind(X6, a),
% 0.20/0.39  		bind(X7, a),
% 0.20/0.39  		bind(X8, a),
% 0.20/0.39  		bind(X9, a),
% 0.20/0.39  		bind(X10, a),
% 0.20/0.39  		bind(X11, a),
% 0.20/0.39  		bind(X12, a)
% 0.20/0.39  	],
% 0.20/0.39  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25])).
% 0.20/0.39  
% 0.20/0.39  % SZS output end IncompleteProof
%------------------------------------------------------------------------------