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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : PUZ131+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n027.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:19:01 EDT 2022

% Result   : Theorem 0.12s 0.34s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : PUZ131+1 : TPTP v8.1.0. Released v4.1.0.
% 0.06/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33  % Computer : n027.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 : Sun May 29 02:00:29 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.34  % SZS status Theorem
% 0.12/0.34  % SZS output begin IncompleteProof
% 0.12/0.34  cnf(c0, axiom,
% 0.12/0.34  	~taughtby(michael,victor)).
% 0.12/0.34  cnf(c1, plain,
% 0.12/0.34  	~taughtby(michael,victor),
% 0.12/0.34  	inference(start, [], [c0])).
% 0.12/0.34  
% 0.12/0.34  cnf(c2, axiom,
% 0.12/0.34  	taughtby(X0,X1) | ~teaches(X1,X2) | ~professor(X1) | ~enrolled(X0,X2) | ~course(X2) | ~student(X0)).
% 0.12/0.34  cnf(a0, assumption,
% 0.12/0.34  	michael = X0).
% 0.12/0.34  cnf(a1, assumption,
% 0.12/0.34  	victor = X1).
% 0.12/0.34  cnf(c3, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.34  cnf(c4, plain,
% 0.12/0.34  	~teaches(X1,X2) | ~professor(X1) | ~enrolled(X0,X2) | ~course(X2) | ~student(X0),
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.34  
% 0.12/0.34  cnf(c5, axiom,
% 0.12/0.34  	teaches(coordinatorof(X3),X3) | ~course(X3)).
% 0.12/0.34  cnf(a2, assumption,
% 0.12/0.34  	X4 = X1).
% 0.12/0.34  cnf(a3, assumption,
% 0.12/0.34  	X5 = X2).
% 0.12/0.34  cnf(c6, plain,
% 0.12/0.34  	~professor(X1) | ~enrolled(X0,X2) | ~course(X2) | ~student(X0),
% 0.12/0.34  	inference(lazy_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.12/0.34  cnf(c7, plain,
% 0.12/0.34  	~course(X3),
% 0.12/0.34  	inference(lazy_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.12/0.34  cnf(c8, plain,
% 0.12/0.34  	coordinatorof(X3) != X4 | X3 != X5,
% 0.12/0.34  	inference(lazy_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.12/0.34  
% 0.12/0.34  cnf(c9, axiom,
% 0.12/0.34  	victor = coordinatorof(csc410)).
% 0.12/0.34  cnf(a4, assumption,
% 0.12/0.34  	coordinatorof(X3) = coordinatorof(csc410)).
% 0.12/0.34  cnf(c10, plain,
% 0.12/0.34  	X3 != X5,
% 0.12/0.34  	inference(strict_function_extension, [assumptions([a4])], [c8, c9])).
% 0.12/0.34  cnf(c11, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_function_extension, [assumptions([a4])], [c8, c9])).
% 0.12/0.34  cnf(c12, plain,
% 0.12/0.34  	X6 != victor | X6 != X4,
% 0.12/0.34  	inference(strict_function_extension, [assumptions([a4])], [c8, c9])).
% 0.12/0.34  
% 0.12/0.34  cnf(a5, assumption,
% 0.12/0.34  	X6 = victor).
% 0.12/0.34  cnf(c13, plain,
% 0.12/0.34  	X6 != X4,
% 0.12/0.34  	inference(reflexivity, [assumptions([a5])], [c12])).
% 0.12/0.34  
% 0.12/0.34  cnf(a6, assumption,
% 0.12/0.34  	X6 = X4).
% 0.12/0.34  cnf(c14, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(reflexivity, [assumptions([a6])], [c13])).
% 0.12/0.34  
% 0.12/0.34  cnf(a7, assumption,
% 0.12/0.34  	X3 = X5).
% 0.12/0.34  cnf(c15, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(reflexivity, [assumptions([a7])], [c10])).
% 0.12/0.34  
% 0.12/0.34  cnf(c16, axiom,
% 0.12/0.34  	course(csc410)).
% 0.12/0.34  cnf(a8, assumption,
% 0.12/0.34  	X3 = csc410).
% 0.12/0.34  cnf(c17, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a8])], [c7, c16])).
% 0.12/0.34  cnf(c18, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a8])], [c7, c16])).
% 0.12/0.34  
% 0.12/0.34  cnf(c19, axiom,
% 0.12/0.34  	professor(victor)).
% 0.12/0.34  cnf(a9, assumption,
% 0.12/0.34  	X1 = victor).
% 0.12/0.34  cnf(c20, plain,
% 0.12/0.34  	~enrolled(X0,X2) | ~course(X2) | ~student(X0),
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a9])], [c6, c19])).
% 0.12/0.34  cnf(c21, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a9])], [c6, c19])).
% 0.12/0.34  
% 0.12/0.34  cnf(c22, axiom,
% 0.12/0.34  	enrolled(michael,csc410)).
% 0.12/0.34  cnf(a10, assumption,
% 0.12/0.34  	X0 = michael).
% 0.12/0.34  cnf(a11, assumption,
% 0.12/0.34  	X2 = csc410).
% 0.12/0.34  cnf(c23, plain,
% 0.12/0.34  	~course(X2) | ~student(X0),
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c20, c22])).
% 0.12/0.34  cnf(c24, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c20, c22])).
% 0.12/0.34  
% 0.12/0.34  cnf(c25, plain,
% 0.12/0.34  	course(X3)).
% 0.12/0.34  cnf(a12, assumption,
% 0.12/0.34  	X2 = X3).
% 0.12/0.34  cnf(c26, plain,
% 0.12/0.34  	~student(X0),
% 0.12/0.34  	inference(predicate_reduction, [assumptions([a12])], [c23, c25])).
% 0.12/0.34  
% 0.12/0.34  cnf(c27, axiom,
% 0.12/0.34  	student(michael)).
% 0.12/0.34  cnf(a13, assumption,
% 0.12/0.34  	X0 = michael).
% 0.12/0.34  cnf(c28, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a13])], [c26, c27])).
% 0.12/0.34  cnf(c29, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a13])], [c26, c27])).
% 0.12/0.34  
% 0.12/0.34  cnf(c30, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(constraint_solving, [
% 0.12/0.34  		bind(X0, michael),
% 0.12/0.34  		bind(X1, victor),
% 0.12/0.34  		bind(X2, csc410),
% 0.12/0.34  		bind(X3, csc410),
% 0.12/0.34  		bind(X4, victor),
% 0.12/0.34  		bind(X5, csc410),
% 0.12/0.34  		bind(X6, victor)
% 0.12/0.34  	],
% 0.12/0.34  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 0.12/0.34  
% 0.12/0.34  % SZS output end IncompleteProof
%------------------------------------------------------------------------------