↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : CSR115+62 : TPTP v8.1.0. Released v4.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 : Fri Jul 15 20:37:41 EDT 2022

% Result   : Theorem 0.44s 0.54s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : CSR115+62 : TPTP v8.1.0. Released v4.0.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 : 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 : Fri Jun 10 20:53:07 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.44/0.54  % SZS status Theorem
% 0.44/0.54  % SZS output begin IncompleteProof
% 0.44/0.54  cnf(c0, axiom,
% 0.44/0.54  	~val(X0,X1) | ~val(X2,bmw_0) | ~val(X3,bmw_0) | ~temp(X4,X5) | ~subs(X4,n374bernehmen_1_1) | ~sub(X0,jahr__1_1) | ~sub(X2,name_1_1) | ~sub(X6,firma_1_1) | ~sub(X3,name_1_1) | ~has_card_leq(X1,int1994) | ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7)).
% 0.44/0.54  cnf(c1, plain,
% 0.44/0.54  	~val(X0,X1) | ~val(X2,bmw_0) | ~val(X3,bmw_0) | ~temp(X4,X5) | ~subs(X4,n374bernehmen_1_1) | ~sub(X0,jahr__1_1) | ~sub(X2,name_1_1) | ~sub(X6,firma_1_1) | ~sub(X3,name_1_1) | ~has_card_leq(X1,int1994) | ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7),
% 0.44/0.54  	inference(start, [], [c0])).
% 0.44/0.54  
% 0.44/0.54  cnf(c2, axiom,
% 0.44/0.54  	val(c8,c4)).
% 0.44/0.54  cnf(a0, assumption,
% 0.44/0.54  	X0 = c8).
% 0.44/0.54  cnf(a1, assumption,
% 0.44/0.54  	X1 = c4).
% 0.44/0.54  cnf(c3, plain,
% 0.44/0.54  	~val(X2,bmw_0) | ~val(X3,bmw_0) | ~temp(X4,X5) | ~subs(X4,n374bernehmen_1_1) | ~sub(X0,jahr__1_1) | ~sub(X2,name_1_1) | ~sub(X6,firma_1_1) | ~sub(X3,name_1_1) | ~has_card_leq(X1,int1994) | ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7),
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.44/0.54  cnf(c4, plain,
% 0.44/0.54  	$false,
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.44/0.54  
% 0.44/0.54  cnf(c5, axiom,
% 0.44/0.54  	val(c129,bmw_0)).
% 0.44/0.54  cnf(a2, assumption,
% 0.44/0.54  	X2 = c129).
% 0.44/0.54  cnf(a3, assumption,
% 0.44/0.54  	bmw_0 = bmw_0).
% 0.44/0.54  cnf(c6, plain,
% 0.44/0.54  	~val(X3,bmw_0) | ~temp(X4,X5) | ~subs(X4,n374bernehmen_1_1) | ~sub(X0,jahr__1_1) | ~sub(X2,name_1_1) | ~sub(X6,firma_1_1) | ~sub(X3,name_1_1) | ~has_card_leq(X1,int1994) | ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7),
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 0.44/0.54  cnf(c7, plain,
% 0.44/0.54  	$false,
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 0.44/0.54  
% 0.44/0.54  cnf(c8, plain,
% 0.44/0.54  	val(X2,bmw_0)).
% 0.44/0.54  cnf(a4, assumption,
% 0.44/0.54  	X3 = X2).
% 0.44/0.54  cnf(a5, assumption,
% 0.44/0.54  	bmw_0 = bmw_0).
% 0.44/0.54  cnf(c9, plain,
% 0.44/0.54  	~temp(X4,X5) | ~subs(X4,n374bernehmen_1_1) | ~sub(X0,jahr__1_1) | ~sub(X2,name_1_1) | ~sub(X6,firma_1_1) | ~sub(X3,name_1_1) | ~has_card_leq(X1,int1994) | ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7),
% 0.44/0.54  	inference(predicate_reduction, [assumptions([a4, a5])], [c6, c8])).
% 0.44/0.54  
% 0.44/0.54  cnf(c10, axiom,
% 0.44/0.54  	temp(c126,c7)).
% 0.44/0.54  cnf(a6, assumption,
% 0.44/0.54  	X4 = c126).
% 0.44/0.54  cnf(a7, assumption,
% 0.44/0.54  	X5 = c7).
% 0.44/0.54  cnf(c11, plain,
% 0.44/0.54  	~subs(X4,n374bernehmen_1_1) | ~sub(X0,jahr__1_1) | ~sub(X2,name_1_1) | ~sub(X6,firma_1_1) | ~sub(X3,name_1_1) | ~has_card_leq(X1,int1994) | ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7),
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c10])).
% 0.44/0.54  cnf(c12, plain,
% 0.44/0.54  	$false,
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c10])).
% 0.44/0.54  
% 0.44/0.54  cnf(c13, axiom,
% 0.44/0.54  	subs(c126,n374bernehmen_1_1)).
% 0.44/0.54  cnf(a8, assumption,
% 0.44/0.54  	X4 = c126).
% 0.44/0.54  cnf(a9, assumption,
% 0.44/0.54  	n374bernehmen_1_1 = n374bernehmen_1_1).
% 0.44/0.54  cnf(c14, plain,
% 0.44/0.54  	~sub(X0,jahr__1_1) | ~sub(X2,name_1_1) | ~sub(X6,firma_1_1) | ~sub(X3,name_1_1) | ~has_card_leq(X1,int1994) | ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7),
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c11, c13])).
% 0.44/0.54  cnf(c15, plain,
% 0.44/0.54  	$false,
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c11, c13])).
% 0.44/0.54  
% 0.44/0.54  cnf(c16, axiom,
% 0.44/0.54  	sub(c8,jahr__1_1)).
% 0.44/0.54  cnf(a10, assumption,
% 0.44/0.54  	X0 = c8).
% 0.44/0.54  cnf(a11, assumption,
% 0.44/0.54  	jahr__1_1 = jahr__1_1).
% 0.44/0.54  cnf(c17, plain,
% 0.44/0.54  	~sub(X2,name_1_1) | ~sub(X6,firma_1_1) | ~sub(X3,name_1_1) | ~has_card_leq(X1,int1994) | ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7),
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c14, c16])).
% 0.44/0.54  cnf(c18, plain,
% 0.44/0.54  	$false,
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c14, c16])).
% 0.44/0.54  
% 0.44/0.54  cnf(c19, axiom,
% 0.44/0.54  	sub(c129,name_1_1)).
% 0.44/0.54  cnf(a12, assumption,
% 0.44/0.54  	X2 = c129).
% 0.44/0.54  cnf(a13, assumption,
% 0.44/0.54  	name_1_1 = name_1_1).
% 0.44/0.54  cnf(c20, plain,
% 0.44/0.54  	~sub(X6,firma_1_1) | ~sub(X3,name_1_1) | ~has_card_leq(X1,int1994) | ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7),
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c19])).
% 0.44/0.54  cnf(c21, plain,
% 0.44/0.54  	$false,
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c19])).
% 0.44/0.54  
% 0.44/0.54  cnf(c22, axiom,
% 0.44/0.54  	sub(c128,firma_1_1)).
% 0.44/0.54  cnf(a14, assumption,
% 0.44/0.54  	X6 = c128).
% 0.44/0.54  cnf(a15, assumption,
% 0.44/0.54  	firma_1_1 = firma_1_1).
% 0.44/0.54  cnf(c23, plain,
% 0.44/0.54  	~sub(X3,name_1_1) | ~has_card_leq(X1,int1994) | ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7),
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c20, c22])).
% 0.44/0.54  cnf(c24, plain,
% 0.44/0.54  	$false,
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c20, c22])).
% 0.44/0.54  
% 0.44/0.54  cnf(c25, plain,
% 0.44/0.54  	sub(X2,name_1_1)).
% 0.44/0.54  cnf(a16, assumption,
% 0.44/0.54  	X3 = X2).
% 0.44/0.54  cnf(a17, assumption,
% 0.44/0.54  	name_1_1 = name_1_1).
% 0.44/0.54  cnf(c26, plain,
% 0.44/0.54  	~has_card_leq(X1,int1994) | ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7),
% 0.44/0.54  	inference(predicate_reduction, [assumptions([a16, a17])], [c23, c25])).
% 0.44/0.54  
% 0.44/0.54  cnf(c27, axiom,
% 0.44/0.54  	has_card_leq(X8,X9) | ~card(X8,X9)).
% 0.44/0.54  cnf(a18, assumption,
% 0.44/0.54  	X1 = X8).
% 0.44/0.54  cnf(a19, assumption,
% 0.44/0.54  	int1994 = X9).
% 0.44/0.54  cnf(c28, plain,
% 0.44/0.54  	~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7),
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a18, a19])], [c26, c27])).
% 0.44/0.54  cnf(c29, plain,
% 0.44/0.54  	~card(X8,X9),
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a18, a19])], [c26, c27])).
% 0.44/0.54  
% 0.44/0.54  cnf(c30, axiom,
% 0.44/0.54  	card(c4,int1994)).
% 0.44/0.54  cnf(a20, assumption,
% 0.44/0.54  	X8 = c4).
% 0.44/0.54  cnf(a21, assumption,
% 0.44/0.54  	X9 = int1994).
% 0.44/0.54  cnf(c31, plain,
% 0.44/0.54  	$false,
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a20, a21])], [c29, c30])).
% 0.44/0.54  cnf(c32, plain,
% 0.44/0.54  	$false,
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a20, a21])], [c29, c30])).
% 0.44/0.54  
% 0.44/0.54  cnf(c33, axiom,
% 0.44/0.54  	attr(c7,c8)).
% 0.44/0.54  cnf(a22, assumption,
% 0.44/0.54  	X5 = c7).
% 0.44/0.54  cnf(a23, assumption,
% 0.44/0.54  	X0 = c8).
% 0.44/0.54  cnf(c34, plain,
% 0.44/0.54  	~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7),
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a22, a23])], [c28, c33])).
% 0.44/0.54  cnf(c35, plain,
% 0.44/0.54  	$false,
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a22, a23])], [c28, c33])).
% 0.44/0.54  
% 0.44/0.54  cnf(c36, axiom,
% 0.44/0.54  	attr(c128,c129)).
% 0.44/0.54  cnf(a24, assumption,
% 0.44/0.54  	X7 = c128).
% 0.44/0.54  cnf(a25, assumption,
% 0.44/0.54  	X2 = c129).
% 0.44/0.54  cnf(c37, plain,
% 0.44/0.54  	~attr(X6,X3) | ~agt(X4,X7),
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a24, a25])], [c34, c36])).
% 0.44/0.54  cnf(c38, plain,
% 0.44/0.54  	$false,
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a24, a25])], [c34, c36])).
% 0.44/0.54  
% 0.44/0.54  cnf(c39, plain,
% 0.44/0.54  	attr(X7,X2)).
% 0.44/0.54  cnf(a26, assumption,
% 0.44/0.54  	X6 = X7).
% 0.44/0.54  cnf(a27, assumption,
% 0.44/0.54  	X3 = X2).
% 0.44/0.54  cnf(c40, plain,
% 0.44/0.54  	~agt(X4,X7),
% 0.44/0.54  	inference(predicate_reduction, [assumptions([a26, a27])], [c37, c39])).
% 0.44/0.54  
% 0.44/0.54  cnf(c41, axiom,
% 0.44/0.54  	agt(c126,c128)).
% 0.44/0.54  cnf(a28, assumption,
% 0.44/0.54  	X4 = c126).
% 0.44/0.54  cnf(a29, assumption,
% 0.44/0.54  	X7 = c128).
% 0.44/0.54  cnf(c42, plain,
% 0.44/0.54  	$false,
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a28, a29])], [c40, c41])).
% 0.44/0.54  cnf(c43, plain,
% 0.44/0.54  	$false,
% 0.44/0.54  	inference(strict_predicate_extension, [assumptions([a28, a29])], [c40, c41])).
% 0.44/0.54  
% 0.44/0.54  cnf(c44, plain,
% 0.44/0.54  	$false,
% 0.44/0.54  	inference(constraint_solving, [
% 0.44/0.54  		bind(X0, c8),
% 0.44/0.54  		bind(X1, c4),
% 0.44/0.54  		bind(X2, c129),
% 0.44/0.54  		bind(X3, c129),
% 0.44/0.54  		bind(X4, c126),
% 0.44/0.54  		bind(X5, c7),
% 0.44/0.54  		bind(X6, c128),
% 0.44/0.54  		bind(X7, c128),
% 0.44/0.54  		bind(X8, c4),
% 0.44/0.54  		bind(X9, int1994)
% 0.44/0.54  	],
% 0.44/0.54  	[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])).
% 0.44/0.54  
% 0.44/0.54  % SZS output end IncompleteProof
%------------------------------------------------------------------------------