%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : AGT002+2 : TPTP v8.1.0. Bugfixed v3.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 : 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 14 12:00:47 EDT 2022

% Result   : Theorem 0.15s 0.40s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : AGT002+2 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.08/0.14  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.15/0.36  % Computer : n029.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Sat Jun  4 03:13:02 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 0.15/0.40  % SZS status Theorem
% 0.15/0.40  % SZS output begin IncompleteProof
% 0.15/0.40  cnf(c0, axiom,
% 0.15/0.40  	accept_team(christiansufferterrahumanitarianorganization,sufferterragovernment,towna,n6)).
% 0.15/0.40  cnf(c1, plain,
% 0.15/0.40  	accept_team(christiansufferterrahumanitarianorganization,sufferterragovernment,towna,n6),
% 0.15/0.40  	inference(start, [], [c0])).
% 0.15/0.40  
% 0.15/0.40  cnf(c2, axiom,
% 0.15/0.40  	accept_leader(X0,X1) | ~accept_team(X0,X1,X2,X3)).
% 0.15/0.40  cnf(a0, assumption,
% 0.15/0.40  	christiansufferterrahumanitarianorganization = X0).
% 0.15/0.40  cnf(a1, assumption,
% 0.15/0.40  	sufferterragovernment = X1).
% 0.15/0.40  cnf(a2, assumption,
% 0.15/0.40  	towna = X2).
% 0.15/0.40  cnf(a3, assumption,
% 0.15/0.40  	n6 = X3).
% 0.15/0.40  cnf(c3, plain,
% 0.15/0.40  	$false,
% 0.15/0.40  	inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])).
% 0.15/0.40  cnf(c4, plain,
% 0.15/0.40  	accept_leader(X0,X1),
% 0.15/0.40  	inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])).
% 0.15/0.40  
% 0.15/0.40  cnf(c5, axiom,
% 0.15/0.40  	~accept_leader(christiansufferterrahumanitarianorganization,sufferterragovernment)).
% 0.15/0.40  cnf(a4, assumption,
% 0.15/0.40  	X0 = christiansufferterrahumanitarianorganization).
% 0.15/0.40  cnf(a5, assumption,
% 0.15/0.40  	X1 = sufferterragovernment).
% 0.15/0.40  cnf(c6, plain,
% 0.15/0.40  	$false,
% 0.15/0.40  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c4, c5])).
% 0.15/0.40  cnf(c7, plain,
% 0.15/0.40  	$false,
% 0.15/0.40  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c4, c5])).
% 0.15/0.40  
% 0.15/0.40  cnf(c8, plain,
% 0.15/0.40  	$false,
% 0.15/0.40  	inference(constraint_solving, [
% 0.15/0.40  		bind(X0, christiansufferterrahumanitarianorganization),
% 0.15/0.40  		bind(X1, sufferterragovernment),
% 0.15/0.40  		bind(X2, towna),
% 0.15/0.40  		bind(X3, n6)
% 0.15/0.40  	],
% 0.15/0.40  	[a0, a1, a2, a3, a4, a5])).
% 0.15/0.40  
% 0.15/0.40  % SZS output end IncompleteProof
%------------------------------------------------------------------------------