↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : AGT005+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 : n018.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.14s 0.39s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : AGT005+2 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.07/0.14  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.35  % Computer : n018.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Sat Jun  4 02:59:32 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.14/0.39  % SZS status Theorem
% 0.14/0.39  % SZS output begin IncompleteProof
% 0.14/0.39  cnf(c0, axiom,
% 0.14/0.39  	~accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n3)).
% 0.14/0.39  cnf(c1, plain,
% 0.14/0.39  	~accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n3),
% 0.14/0.39  	inference(start, [], [c0])).
% 0.14/0.39  
% 0.14/0.39  cnf(c2, axiom,
% 0.14/0.39  	accept_team(X0,X1,X2,X3) | ~accept_number(X0,X3) | ~accept_leader(X0,X1) | ~accept_city(X0,X2)).
% 0.14/0.39  cnf(a0, assumption,
% 0.14/0.39  	christiansufferterrahumanitarianorganization = X0).
% 0.14/0.39  cnf(a1, assumption,
% 0.14/0.39  	countryafirstaidorganization = X1).
% 0.14/0.39  cnf(a2, assumption,
% 0.14/0.39  	towna = X2).
% 0.14/0.39  cnf(a3, assumption,
% 0.14/0.39  	n3 = X3).
% 0.14/0.39  cnf(c3, plain,
% 0.14/0.39  	$false,
% 0.14/0.39  	inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])).
% 0.14/0.39  cnf(c4, plain,
% 0.14/0.39  	~accept_number(X0,X3) | ~accept_leader(X0,X1) | ~accept_city(X0,X2),
% 0.14/0.39  	inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])).
% 0.14/0.39  
% 0.14/0.39  cnf(c5, axiom,
% 0.14/0.39  	accept_number(christiansufferterrahumanitarianorganization,n3)).
% 0.14/0.39  cnf(a4, assumption,
% 0.14/0.39  	X0 = christiansufferterrahumanitarianorganization).
% 0.14/0.39  cnf(a5, assumption,
% 0.14/0.39  	X3 = n3).
% 0.14/0.39  cnf(c6, plain,
% 0.14/0.39  	~accept_leader(X0,X1) | ~accept_city(X0,X2),
% 0.14/0.39  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c4, c5])).
% 0.14/0.39  cnf(c7, plain,
% 0.14/0.39  	$false,
% 0.14/0.39  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c4, c5])).
% 0.14/0.39  
% 0.14/0.39  cnf(c8, axiom,
% 0.14/0.39  	accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization)).
% 0.14/0.39  cnf(a6, assumption,
% 0.14/0.39  	X0 = christiansufferterrahumanitarianorganization).
% 0.14/0.39  cnf(a7, assumption,
% 0.14/0.39  	X1 = countryafirstaidorganization).
% 0.14/0.39  cnf(c9, plain,
% 0.14/0.39  	~accept_city(X0,X2),
% 0.14/0.39  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c8])).
% 0.14/0.39  cnf(c10, plain,
% 0.14/0.39  	$false,
% 0.14/0.39  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c8])).
% 0.14/0.39  
% 0.14/0.39  cnf(c11, axiom,
% 0.14/0.39  	accept_city(X4,X5) | ~accept_team(X4,X6,X5,X7)).
% 0.14/0.39  cnf(a8, assumption,
% 0.14/0.39  	X0 = X4).
% 0.14/0.39  cnf(a9, assumption,
% 0.14/0.39  	X2 = X5).
% 0.14/0.39  cnf(c12, plain,
% 0.14/0.39  	$false,
% 0.14/0.39  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c11])).
% 0.14/0.39  cnf(c13, plain,
% 0.14/0.39  	~accept_team(X4,X6,X5,X7),
% 0.14/0.39  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c11])).
% 0.14/0.39  
% 0.14/0.39  cnf(c14, axiom,
% 0.14/0.39  	accept_team(christiansufferterrahumanitarianorganization,countryacivilorganization,towna,n6)).
% 0.14/0.39  cnf(a10, assumption,
% 0.14/0.39  	X4 = christiansufferterrahumanitarianorganization).
% 0.14/0.39  cnf(a11, assumption,
% 0.14/0.39  	X6 = countryacivilorganization).
% 0.14/0.39  cnf(a12, assumption,
% 0.14/0.39  	X5 = towna).
% 0.14/0.39  cnf(a13, assumption,
% 0.14/0.39  	X7 = n6).
% 0.14/0.39  cnf(c15, plain,
% 0.14/0.39  	$false,
% 0.14/0.39  	inference(strict_predicate_extension, [assumptions([a10, a11, a12, a13])], [c13, c14])).
% 0.14/0.39  cnf(c16, plain,
% 0.14/0.39  	$false,
% 0.14/0.39  	inference(strict_predicate_extension, [assumptions([a10, a11, a12, a13])], [c13, c14])).
% 0.14/0.39  
% 0.14/0.39  cnf(c17, plain,
% 0.14/0.39  	$false,
% 0.14/0.39  	inference(constraint_solving, [
% 0.14/0.39  		bind(X0, christiansufferterrahumanitarianorganization),
% 0.14/0.39  		bind(X1, countryafirstaidorganization),
% 0.14/0.39  		bind(X2, towna),
% 0.14/0.39  		bind(X3, n3),
% 0.14/0.39  		bind(X4, christiansufferterrahumanitarianorganization),
% 0.14/0.39  		bind(X5, towna),
% 0.14/0.39  		bind(X6, countryacivilorganization),
% 0.14/0.39  		bind(X7, n6)
% 0.14/0.39  	],
% 0.14/0.39  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 0.14/0.39  
% 0.14/0.39  % SZS output end IncompleteProof
%------------------------------------------------------------------------------