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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : PUZ001+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 : n023.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 : Mon Jul 18 18:18:50 EDT 2022

% Result   : Theorem 0.19s 0.53s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : PUZ001+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 : n023.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 : Sat May 28 22:42:12 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.53  % SZS status Theorem
% 0.19/0.53  % SZS output begin IncompleteProof
% 0.19/0.53  cnf(c0, axiom,
% 0.19/0.53  	~killed(agatha,agatha)).
% 0.19/0.53  cnf(c1, plain,
% 0.19/0.53  	~killed(agatha,agatha),
% 0.19/0.53  	inference(start, [], [c0])).
% 0.19/0.53  
% 0.19/0.53  cnf(c2, axiom,
% 0.19/0.53  	charles = X0 | butler = X0 | agatha = X0 | ~lives(X0)).
% 0.19/0.53  cnf(a0, assumption,
% 0.19/0.53  	agatha = agatha).
% 0.19/0.53  cnf(c3, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.53  cnf(c4, plain,
% 0.19/0.53  	charles = X0 | butler = X0 | ~lives(X0),
% 0.19/0.53  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.53  cnf(c5, plain,
% 0.19/0.53  	X1 != X0 | ~killed(X1,agatha),
% 0.19/0.53  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.53  
% 0.19/0.53  cnf(a1, assumption,
% 0.19/0.53  	X1 = X0).
% 0.19/0.53  cnf(c6, plain,
% 0.19/0.53  	~killed(X1,agatha),
% 0.19/0.53  	inference(reflexivity, [assumptions([a1])], [c5])).
% 0.19/0.53  
% 0.19/0.53  cnf(c7, axiom,
% 0.19/0.53  	killed(sK0,agatha)).
% 0.19/0.53  cnf(a2, assumption,
% 0.19/0.53  	X1 = sK0).
% 0.19/0.53  cnf(a3, assumption,
% 0.19/0.53  	agatha = agatha).
% 0.19/0.53  cnf(c8, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c6, c7])).
% 0.19/0.53  cnf(c9, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c6, c7])).
% 0.19/0.53  
% 0.19/0.53  cnf(c10, axiom,
% 0.19/0.53  	~hates(charles,X2) | ~hates(agatha,X2)).
% 0.19/0.53  cnf(a4, assumption,
% 0.19/0.53  	charles = charles).
% 0.19/0.53  cnf(c11, plain,
% 0.19/0.53  	butler = X0 | ~lives(X0),
% 0.19/0.53  	inference(strict_subterm_extension, [assumptions([a4])], [c4, c10])).
% 0.19/0.53  cnf(c12, plain,
% 0.19/0.53  	~hates(agatha,X2),
% 0.19/0.53  	inference(strict_subterm_extension, [assumptions([a4])], [c4, c10])).
% 0.19/0.53  cnf(c13, plain,
% 0.19/0.53  	~hates(X0,X2),
% 0.19/0.53  	inference(strict_subterm_extension, [assumptions([a4])], [c4, c10])).
% 0.19/0.53  
% 0.19/0.53  cnf(c14, axiom,
% 0.19/0.53  	hates(X3,X4) | ~killed(X3,X4)).
% 0.19/0.53  cnf(a5, assumption,
% 0.19/0.53  	X0 = X3).
% 0.19/0.53  cnf(a6, assumption,
% 0.19/0.53  	X2 = X4).
% 0.19/0.53  cnf(c15, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c13, c14])).
% 0.19/0.53  cnf(c16, plain,
% 0.19/0.53  	~killed(X3,X4),
% 0.19/0.53  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c13, c14])).
% 0.19/0.53  
% 0.19/0.53  cnf(c17, plain,
% 0.19/0.53  	killed(X1,agatha)).
% 0.19/0.53  cnf(a7, assumption,
% 0.19/0.53  	X3 = X1).
% 0.19/0.53  cnf(a8, assumption,
% 0.19/0.53  	X4 = agatha).
% 0.19/0.53  cnf(c18, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(predicate_reduction, [assumptions([a7, a8])], [c16, c17])).
% 0.19/0.53  
% 0.19/0.53  cnf(c19, axiom,
% 0.19/0.53  	hates(agatha,X5) | butler = X5).
% 0.19/0.53  cnf(a9, assumption,
% 0.19/0.53  	agatha = agatha).
% 0.19/0.53  cnf(a10, assumption,
% 0.19/0.53  	X2 = X5).
% 0.19/0.53  cnf(c20, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c12, c19])).
% 0.19/0.53  cnf(c21, plain,
% 0.19/0.53  	butler = X5,
% 0.19/0.53  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c12, c19])).
% 0.19/0.53  
% 0.19/0.53  cnf(c22, axiom,
% 0.19/0.53  	agatha != butler).
% 0.19/0.53  cnf(a11, assumption,
% 0.19/0.53  	butler = butler).
% 0.19/0.53  cnf(c23, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(strict_subterm_extension, [assumptions([a11])], [c21, c22])).
% 0.19/0.53  cnf(c24, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(strict_subterm_extension, [assumptions([a11])], [c21, c22])).
% 0.19/0.53  cnf(c25, plain,
% 0.19/0.53  	agatha != X5,
% 0.19/0.53  	inference(strict_subterm_extension, [assumptions([a11])], [c21, c22])).
% 0.19/0.53  
% 0.19/0.53  cnf(a12, assumption,
% 0.19/0.53  	agatha = X5).
% 0.19/0.53  cnf(c26, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(reflexivity, [assumptions([a12])], [c25])).
% 0.19/0.53  
% 0.19/0.53  cnf(c27, axiom,
% 0.19/0.53  	hates(butler,X6) | richer(X6,agatha)).
% 0.19/0.53  cnf(a13, assumption,
% 0.19/0.53  	butler = butler).
% 0.19/0.53  cnf(c28, plain,
% 0.19/0.53  	~lives(X0),
% 0.19/0.53  	inference(strict_subterm_extension, [assumptions([a13])], [c11, c27])).
% 0.19/0.53  cnf(c29, plain,
% 0.19/0.53  	richer(X6,agatha),
% 0.19/0.53  	inference(strict_subterm_extension, [assumptions([a13])], [c11, c27])).
% 0.19/0.53  cnf(c30, plain,
% 0.19/0.53  	hates(X0,X6),
% 0.19/0.53  	inference(strict_subterm_extension, [assumptions([a13])], [c11, c27])).
% 0.19/0.53  
% 0.19/0.53  cnf(c31, axiom,
% 0.19/0.53  	~hates(X7,sK1(X7))).
% 0.19/0.53  cnf(a14, assumption,
% 0.19/0.53  	X8 = X0).
% 0.19/0.53  cnf(a15, assumption,
% 0.19/0.53  	X9 = X6).
% 0.19/0.53  cnf(c32, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(lazy_predicate_extension, [assumptions([a14, a15])], [c30, c31])).
% 0.19/0.53  cnf(c33, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(lazy_predicate_extension, [assumptions([a14, a15])], [c30, c31])).
% 0.19/0.53  cnf(c34, plain,
% 0.19/0.53  	X7 != X8 | sK1(X7) != X9,
% 0.19/0.53  	inference(lazy_predicate_extension, [assumptions([a14, a15])], [c30, c31])).
% 0.19/0.53  
% 0.19/0.53  cnf(a16, assumption,
% 0.19/0.53  	X7 = X8).
% 0.19/0.53  cnf(c35, plain,
% 0.19/0.53  	sK1(X7) != X9,
% 0.19/0.53  	inference(reflexivity, [assumptions([a16])], [c34])).
% 0.19/0.53  
% 0.19/0.53  cnf(c36, axiom,
% 0.19/0.53  	hates(agatha,X10) | butler = X10).
% 0.19/0.53  cnf(a17, assumption,
% 0.19/0.53  	sK1(X7) = X10).
% 0.19/0.53  cnf(c37, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(variable_extension, [assumptions([a17])], [c35, c36])).
% 0.19/0.53  cnf(c38, plain,
% 0.19/0.53  	hates(agatha,X10),
% 0.19/0.53  	inference(variable_extension, [assumptions([a17])], [c35, c36])).
% 0.19/0.53  cnf(c39, plain,
% 0.19/0.53  	butler != X11 | X11 != X9,
% 0.19/0.53  	inference(variable_extension, [assumptions([a17])], [c35, c36])).
% 0.19/0.53  
% 0.19/0.53  cnf(c40, plain,
% 0.19/0.53  	butler = X0).
% 0.19/0.53  cnf(a18, assumption,
% 0.19/0.53  	butler = butler).
% 0.19/0.53  cnf(c41, plain,
% 0.19/0.53  	X11 != X9,
% 0.19/0.53  	inference(equality_reduction, [assumptions([a18])], [c39, c40])).
% 0.19/0.53  cnf(c42, plain,
% 0.19/0.53  	X0 != X11,
% 0.19/0.53  	inference(equality_reduction, [assumptions([a18])], [c39, c40])).
% 0.19/0.53  
% 0.19/0.53  cnf(a19, assumption,
% 0.19/0.53  	X0 = X11).
% 0.19/0.53  cnf(c43, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(reflexivity, [assumptions([a19])], [c42])).
% 0.19/0.53  
% 0.19/0.53  cnf(a20, assumption,
% 0.19/0.53  	X11 = X9).
% 0.19/0.53  cnf(c44, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(reflexivity, [assumptions([a20])], [c41])).
% 0.19/0.53  
% 0.19/0.53  cnf(c45, axiom,
% 0.19/0.53  	hates(butler,X12) | ~hates(agatha,X12)).
% 0.19/0.53  cnf(a21, assumption,
% 0.19/0.53  	agatha = agatha).
% 0.19/0.53  cnf(a22, assumption,
% 0.19/0.53  	X10 = X12).
% 0.19/0.53  cnf(c46, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(strict_predicate_extension, [assumptions([a21, a22])], [c38, c45])).
% 0.19/0.53  cnf(c47, plain,
% 0.19/0.53  	hates(butler,X12),
% 0.19/0.53  	inference(strict_predicate_extension, [assumptions([a21, a22])], [c38, c45])).
% 0.19/0.53  
% 0.19/0.53  cnf(c48, plain,
% 0.19/0.53  	butler = X0).
% 0.19/0.53  cnf(a23, assumption,
% 0.19/0.53  	butler = butler).
% 0.19/0.53  cnf(c49, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(equality_reduction, [assumptions([a23])], [c47, c48])).
% 0.19/0.53  cnf(c50, plain,
% 0.19/0.53  	hates(X0,X12),
% 0.19/0.53  	inference(equality_reduction, [assumptions([a23])], [c47, c48])).
% 0.19/0.53  
% 0.19/0.53  cnf(c51, plain,
% 0.19/0.53  	~hates(X7,sK1(X7))).
% 0.19/0.53  cnf(a24, assumption,
% 0.19/0.53  	X0 = X7).
% 0.19/0.53  cnf(a25, assumption,
% 0.19/0.53  	X12 = sK1(X7)).
% 0.19/0.53  cnf(c52, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(predicate_reduction, [assumptions([a24, a25])], [c50, c51])).
% 0.19/0.53  
% 0.19/0.53  cnf(c53, axiom,
% 0.19/0.53  	~richer(X13,X14) | ~killed(X13,X14)).
% 0.19/0.53  cnf(a26, assumption,
% 0.19/0.53  	X6 = X13).
% 0.19/0.53  cnf(a27, assumption,
% 0.19/0.53  	agatha = X14).
% 0.19/0.53  cnf(c54, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(strict_predicate_extension, [assumptions([a26, a27])], [c29, c53])).
% 0.19/0.53  cnf(c55, plain,
% 0.19/0.53  	~killed(X13,X14),
% 0.19/0.53  	inference(strict_predicate_extension, [assumptions([a26, a27])], [c29, c53])).
% 0.19/0.53  
% 0.19/0.53  cnf(c56, plain,
% 0.19/0.53  	killed(X1,agatha)).
% 0.19/0.53  cnf(a28, assumption,
% 0.19/0.53  	X13 = X1).
% 0.19/0.53  cnf(a29, assumption,
% 0.19/0.53  	X14 = agatha).
% 0.19/0.53  cnf(c57, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(predicate_reduction, [assumptions([a28, a29])], [c55, c56])).
% 0.19/0.53  
% 0.19/0.53  cnf(c58, axiom,
% 0.19/0.53  	lives(sK0)).
% 0.19/0.53  cnf(a30, assumption,
% 0.19/0.53  	X0 = sK0).
% 0.19/0.53  cnf(c59, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(strict_predicate_extension, [assumptions([a30])], [c28, c58])).
% 0.19/0.53  cnf(c60, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(strict_predicate_extension, [assumptions([a30])], [c28, c58])).
% 0.19/0.53  
% 0.19/0.53  cnf(c61, plain,
% 0.19/0.53  	$false,
% 0.19/0.53  	inference(constraint_solving, [
% 0.19/0.53  		bind(X0, sK0),
% 0.19/0.53  		bind(X1, sK0),
% 0.19/0.53  		bind(X2, agatha),
% 0.19/0.53  		bind(X3, sK0),
% 0.19/0.53  		bind(X4, agatha),
% 0.19/0.53  		bind(X5, agatha),
% 0.19/0.53  		bind(X6, sK0),
% 0.19/0.53  		bind(X7, sK0),
% 0.19/0.53  		bind(X8, sK0),
% 0.19/0.53  		bind(X9, sK0),
% 0.19/0.53  		bind(X10, sK1(X7)),
% 0.19/0.53  		bind(X11, sK0),
% 0.19/0.53  		bind(X12, sK1(X7)),
% 0.19/0.53  		bind(X13, sK0),
% 0.19/0.53  		bind(X14, agatha)
% 0.19/0.53  	],
% 0.19/0.53  	[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, a26, a27, a28, a29, a30])).
% 0.19/0.53  
% 0.19/0.53  % SZS output end IncompleteProof
%------------------------------------------------------------------------------