↑ Up

lazyCoP---0.1.UNS-Ass.s

View TPTP
Problem Process solution in
SystemOnTSTP Download .tgz 
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SET787-1 : TPTP v8.1.0. Released v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n012.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 : Tue Jul 19 02:48:07 EDT 2022

% Result   : Unsatisfiable 193.60s 25.00s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : SET787-1 : TPTP v8.1.0. Released v2.7.0.
% 0.08/0.14  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.36  % Computer : n012.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Sun Jul 10 02:34:43 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 193.60/25.00  % SZS status Unsatisfiable
% 193.60/25.00  % SZS output begin IncompleteProof
% 193.60/25.00  cnf(c0, axiom,
% 193.60/25.00  	member(sk2,union(cons(a,cons(b,eptset))))).
% 193.60/25.00  cnf(c1, plain,
% 193.60/25.00  	member(sk2,union(cons(a,cons(b,eptset)))),
% 193.60/25.00  	inference(start, [], [c0])).
% 193.60/25.00  
% 193.60/25.00  cnf(c2, axiom,
% 193.60/25.00  	member(X0,unionE_sk1(X0,X1)) | ~member(X0,union(X1))).
% 193.60/25.00  cnf(a0, assumption,
% 193.60/25.00  	sk2 = X0).
% 193.60/25.00  cnf(a1, assumption,
% 193.60/25.00  	union(cons(a,cons(b,eptset))) = union(X1)).
% 193.60/25.00  cnf(c3, plain,
% 193.60/25.00  	$false,
% 193.60/25.00  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 193.60/25.00  cnf(c4, plain,
% 193.60/25.00  	member(X0,unionE_sk1(X0,X1)),
% 193.60/25.00  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 193.60/25.00  
% 193.60/25.00  cnf(c5, axiom,
% 193.60/25.00  	member(X2,X3) | X2 = X4 | ~member(X2,cons(X4,X3))).
% 193.60/25.00  cnf(a2, assumption,
% 193.60/25.00  	unionE_sk1(X0,X1) = X2).
% 193.60/25.00  cnf(c6, plain,
% 193.60/25.00  	$false,
% 193.60/25.00  	inference(variable_extension, [assumptions([a2])], [c4, c5])).
% 193.60/25.00  cnf(c7, plain,
% 193.60/25.00  	member(X2,X3) | ~member(X2,cons(X4,X3)),
% 193.60/25.00  	inference(variable_extension, [assumptions([a2])], [c4, c5])).
% 193.60/25.00  cnf(c8, plain,
% 193.60/25.00  	X4 != X5 | member(X0,X5),
% 193.60/25.00  	inference(variable_extension, [assumptions([a2])], [c4, c5])).
% 193.60/25.00  
% 193.60/25.00  cnf(a3, assumption,
% 193.60/25.00  	X4 = X5).
% 193.60/25.00  cnf(c9, plain,
% 193.60/25.00  	member(X0,X5),
% 193.60/25.00  	inference(reflexivity, [assumptions([a3])], [c8])).
% 193.60/25.00  
% 193.60/25.00  cnf(c10, axiom,
% 193.60/25.00  	member(X6,un(X7,X8)) | ~member(X6,X8)).
% 193.60/25.00  cnf(a4, assumption,
% 193.60/25.00  	X0 = X6).
% 193.60/25.00  cnf(a5, assumption,
% 193.60/25.00  	X5 = X8).
% 193.60/25.00  cnf(c11, plain,
% 193.60/25.00  	$false,
% 193.60/25.00  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c9, c10])).
% 193.60/25.00  cnf(c12, plain,
% 193.60/25.00  	member(X6,un(X7,X8)),
% 193.60/25.00  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c9, c10])).
% 193.60/25.00  
% 193.60/25.00  cnf(c13, axiom,
% 193.60/25.00  	~member(sk2,un(a,b))).
% 193.60/25.00  cnf(a6, assumption,
% 193.60/25.00  	X6 = sk2).
% 193.60/25.00  cnf(a7, assumption,
% 193.60/25.00  	un(X7,X8) = un(a,b)).
% 193.60/25.00  cnf(c14, plain,
% 193.60/25.00  	$false,
% 193.60/25.00  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c12, c13])).
% 193.60/25.00  cnf(c15, plain,
% 193.60/25.00  	$false,
% 193.60/25.00  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c12, c13])).
% 193.60/25.00  
% 193.60/25.00  cnf(c16, axiom,
% 193.60/25.00  	~member(X9,eptset)).
% 193.60/25.00  cnf(a8, assumption,
% 193.60/25.00  	X2 = X9).
% 193.60/25.00  cnf(a9, assumption,
% 193.60/25.00  	X3 = eptset).
% 193.60/25.00  cnf(c17, plain,
% 193.60/25.00  	~member(X2,cons(X4,X3)),
% 193.60/25.00  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c7, c16])).
% 193.60/25.00  cnf(c18, plain,
% 193.60/25.00  	$false,
% 193.60/25.00  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c7, c16])).
% 193.60/25.00  
% 193.60/25.00  cnf(c19, axiom,
% 193.60/25.00  	member(X10,X11) | X10 = X12 | ~member(X10,cons(X12,X11))).
% 193.60/25.00  cnf(a10, assumption,
% 193.60/25.00  	X2 = X10).
% 193.60/25.00  cnf(a11, assumption,
% 193.60/25.00  	cons(X4,X3) = X11).
% 193.60/25.00  cnf(c20, plain,
% 193.60/25.00  	$false,
% 193.60/25.00  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c17, c19])).
% 193.60/25.00  cnf(c21, plain,
% 193.60/25.00  	X10 = X12 | ~member(X10,cons(X12,X11)),
% 193.60/25.00  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c17, c19])).
% 193.60/25.00  
% 193.60/25.00  cnf(c22, plain,
% 193.60/25.00  	member(X0,unionE_sk1(X0,X1))).
% 193.60/25.00  cnf(a12, assumption,
% 193.60/25.00  	unionE_sk1(X0,X1) = X10).
% 193.60/25.00  cnf(c23, plain,
% 193.60/25.00  	~member(X10,cons(X12,X11)),
% 193.60/25.00  	inference(subterm_reduction, [assumptions([a12])], [c21, c22])).
% 193.60/25.00  cnf(c24, plain,
% 193.60/25.00  	member(X0,X12),
% 193.60/25.00  	inference(subterm_reduction, [assumptions([a12])], [c21, c22])).
% 193.60/25.00  
% 193.60/25.00  cnf(c25, axiom,
% 193.60/25.00  	member(X13,un(X14,X15)) | ~member(X13,X14)).
% 193.60/25.00  cnf(a13, assumption,
% 193.60/25.00  	X0 = X13).
% 193.60/25.00  cnf(a14, assumption,
% 193.60/25.00  	X12 = X14).
% 193.60/25.00  cnf(c26, plain,
% 193.60/25.00  	$false,
% 193.60/25.00  	inference(strict_predicate_extension, [assumptions([a13, a14])], [c24, c25])).
% 193.60/25.00  cnf(c27, plain,
% 193.60/25.00  	member(X13,un(X14,X15)),
% 193.60/25.00  	inference(strict_predicate_extension, [assumptions([a13, a14])], [c24, c25])).
% 193.60/25.00  
% 193.60/25.00  cnf(c28, plain,
% 193.60/25.00  	~member(X6,un(X7,X8))).
% 193.60/25.00  cnf(a15, assumption,
% 193.60/25.00  	X13 = X6).
% 193.60/25.00  cnf(a16, assumption,
% 193.60/25.00  	un(X14,X15) = un(X7,X8)).
% 193.60/25.00  cnf(c29, plain,
% 193.60/25.00  	$false,
% 193.60/25.00  	inference(predicate_reduction, [assumptions([a15, a16])], [c27, c28])).
% 193.60/25.00  
% 193.60/25.00  cnf(c30, axiom,
% 193.60/25.00  	member(unionE_sk1(X16,X17),X17) | ~member(X16,union(X17))).
% 193.60/25.00  cnf(a17, assumption,
% 193.60/25.00  	X10 = unionE_sk1(X16,X17)).
% 193.60/25.00  cnf(a18, assumption,
% 193.60/25.00  	cons(X12,X11) = X17).
% 193.60/25.00  cnf(c31, plain,
% 193.60/25.00  	$false,
% 193.60/25.00  	inference(strict_predicate_extension, [assumptions([a17, a18])], [c23, c30])).
% 193.60/25.00  cnf(c32, plain,
% 193.60/25.00  	~member(X16,union(X17)),
% 193.60/25.00  	inference(strict_predicate_extension, [assumptions([a17, a18])], [c23, c30])).
% 193.60/25.00  
% 193.60/25.00  cnf(c33, plain,
% 193.60/25.00  	member(sk2,union(cons(a,cons(b,eptset))))).
% 193.60/25.00  cnf(a19, assumption,
% 193.60/25.00  	X16 = sk2).
% 193.60/25.00  cnf(a20, assumption,
% 193.60/25.00  	union(X17) = union(cons(a,cons(b,eptset)))).
% 193.60/25.00  cnf(c34, plain,
% 193.60/25.00  	$false,
% 193.60/25.00  	inference(predicate_reduction, [assumptions([a19, a20])], [c32, c33])).
% 193.60/25.00  
% 193.60/25.00  cnf(c35, plain,
% 193.60/25.00  	$false,
% 193.60/25.00  	inference(constraint_solving, [
% 193.60/25.00  		bind(X0, sk2),
% 193.60/25.00  		bind(X1, cons(a,cons(b,eptset))),
% 193.60/25.00  		bind(X2, unionE_sk1(X0,X1)),
% 193.60/25.00  		bind(X3, eptset),
% 193.60/25.00  		bind(X4, b),
% 193.60/25.00  		bind(X5, b),
% 193.60/25.00  		bind(X6, sk2),
% 193.60/25.00  		bind(X7, a),
% 193.60/25.00  		bind(X8, b),
% 193.60/25.00  		bind(X9, unionE_sk1(X0,X1)),
% 193.60/25.00  		bind(X10, unionE_sk1(X0,X1)),
% 193.60/25.00  		bind(X11, cons(X4,X3)),
% 193.60/25.00  		bind(X12, a),
% 193.60/25.00  		bind(X13, sk2),
% 193.60/25.00  		bind(X14, a),
% 193.60/25.00  		bind(X15, b),
% 193.60/25.00  		bind(X16, sk2),
% 193.60/25.00  		bind(X17, cons(a,cons(b,eptset)))
% 193.60/25.00  	],
% 193.60/25.00  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20])).
% 193.60/25.00  
% 193.60/25.00  % SZS output end IncompleteProof
%------------------------------------------------------------------------------