TSTP Solution File: SET696+4 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET696+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n008.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:47:41 EDT 2022
% Result : Theorem 9.06s 1.59s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SET696+4 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jul 9 21:10:53 EDT 2022
% 0.13/0.35 % CPUTime :
% 9.06/1.59 % SZS status Theorem
% 9.06/1.59 % SZS output begin IncompleteProof
% 9.06/1.59 cnf(c0, axiom,
% 9.06/1.59 ~equal_set(intersection(difference(sK4,sK3),sK3),empty_set)).
% 9.06/1.59 cnf(c1, plain,
% 9.06/1.59 ~equal_set(intersection(difference(sK4,sK3),sK3),empty_set),
% 9.06/1.59 inference(start, [], [c0])).
% 9.06/1.59
% 9.06/1.59 cnf(c2, axiom,
% 9.06/1.59 equal_set(X0,X1) | ~subset(X1,X0) | ~subset(X0,X1)).
% 9.06/1.59 cnf(a0, assumption,
% 9.06/1.59 intersection(difference(sK4,sK3),sK3) = X0).
% 9.06/1.59 cnf(a1, assumption,
% 9.06/1.59 empty_set = X1).
% 9.06/1.59 cnf(c3, plain,
% 9.06/1.59 $false,
% 9.06/1.59 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 9.06/1.59 cnf(c4, plain,
% 9.06/1.59 ~subset(X1,X0) | ~subset(X0,X1),
% 9.06/1.59 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 9.06/1.59
% 9.06/1.59 cnf(c5, axiom,
% 9.06/1.59 subset(X2,X3) | member(sK0(X2,X3),X2)).
% 9.06/1.59 cnf(a2, assumption,
% 9.06/1.59 X1 = X2).
% 9.06/1.59 cnf(a3, assumption,
% 9.06/1.59 X0 = X3).
% 9.06/1.59 cnf(c6, plain,
% 9.06/1.59 ~subset(X0,X1),
% 9.06/1.59 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 9.06/1.59 cnf(c7, plain,
% 9.06/1.59 member(sK0(X2,X3),X2),
% 9.06/1.59 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 9.06/1.59
% 9.06/1.59 cnf(c8, axiom,
% 9.06/1.59 ~member(X4,empty_set)).
% 9.06/1.59 cnf(a4, assumption,
% 9.06/1.59 sK0(X2,X3) = X4).
% 9.06/1.59 cnf(a5, assumption,
% 9.06/1.59 X2 = empty_set).
% 9.06/1.59 cnf(c9, plain,
% 9.06/1.59 $false,
% 9.06/1.59 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 9.06/1.59 cnf(c10, plain,
% 9.06/1.59 $false,
% 9.06/1.59 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 9.06/1.59
% 9.06/1.59 cnf(c11, axiom,
% 9.06/1.59 subset(X5,X6) | member(sK0(X5,X6),X5)).
% 9.06/1.59 cnf(a6, assumption,
% 9.06/1.59 X0 = X5).
% 9.06/1.59 cnf(a7, assumption,
% 9.06/1.59 X1 = X6).
% 9.06/1.59 cnf(c12, plain,
% 9.06/1.59 $false,
% 9.06/1.59 inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c11])).
% 9.06/1.59 cnf(c13, plain,
% 9.06/1.59 member(sK0(X5,X6),X5),
% 9.06/1.59 inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c11])).
% 9.06/1.59
% 9.06/1.59 cnf(c14, axiom,
% 9.06/1.59 member(X7,X8) | ~member(X7,intersection(X8,X9))).
% 9.06/1.59 cnf(a8, assumption,
% 9.06/1.59 sK0(X5,X6) = X7).
% 9.06/1.59 cnf(a9, assumption,
% 9.06/1.59 X5 = intersection(X8,X9)).
% 9.06/1.59 cnf(c15, plain,
% 9.06/1.59 $false,
% 9.06/1.59 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 9.06/1.59 cnf(c16, plain,
% 9.06/1.59 member(X7,X8),
% 9.06/1.59 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 9.06/1.59
% 9.06/1.59 cnf(c17, axiom,
% 9.06/1.59 ~member(X10,X11) | ~member(X10,difference(X12,X11))).
% 9.06/1.59 cnf(a10, assumption,
% 9.06/1.59 X7 = X10).
% 9.06/1.59 cnf(a11, assumption,
% 9.06/1.59 X8 = difference(X12,X11)).
% 9.06/1.59 cnf(c18, plain,
% 9.06/1.59 $false,
% 9.06/1.59 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])).
% 9.06/1.59 cnf(c19, plain,
% 9.06/1.59 ~member(X10,X11),
% 9.06/1.59 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])).
% 9.06/1.59
% 9.06/1.59 cnf(c20, axiom,
% 9.06/1.59 member(X13,X14) | ~member(X13,intersection(X15,X14))).
% 9.06/1.59 cnf(a12, assumption,
% 9.06/1.59 X10 = X13).
% 9.06/1.59 cnf(a13, assumption,
% 9.06/1.59 X11 = X14).
% 9.06/1.59 cnf(c21, plain,
% 9.06/1.59 $false,
% 9.06/1.59 inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])).
% 9.06/1.59 cnf(c22, plain,
% 9.06/1.59 ~member(X13,intersection(X15,X14)),
% 9.06/1.59 inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])).
% 9.06/1.59
% 9.06/1.59 cnf(c23, plain,
% 9.06/1.59 member(sK0(X5,X6),X5)).
% 9.06/1.59 cnf(a14, assumption,
% 9.06/1.59 X13 = sK0(X5,X6)).
% 9.06/1.59 cnf(a15, assumption,
% 9.06/1.59 intersection(X15,X14) = X5).
% 9.06/1.59 cnf(c24, plain,
% 9.06/1.59 $false,
% 9.06/1.59 inference(predicate_reduction, [assumptions([a14, a15])], [c22, c23])).
% 9.06/1.59
% 9.06/1.59 cnf(c25, plain,
% 9.06/1.59 $false,
% 9.06/1.59 inference(constraint_solving, [
% 9.06/1.59 bind(X0, intersection(difference(sK4,sK3),sK3)),
% 9.06/1.59 bind(X1, empty_set),
% 9.06/1.59 bind(X2, empty_set),
% 9.06/1.59 bind(X3, intersection(difference(sK4,sK3),sK3)),
% 9.06/1.59 bind(X4, sK0(X2,X3)),
% 9.06/1.59 bind(X5, intersection(difference(sK4,sK3),sK3)),
% 9.06/1.59 bind(X6, empty_set),
% 9.06/1.59 bind(X7, sK0(X5,X6)),
% 9.06/1.59 bind(X8, difference(sK4,sK3)),
% 9.06/1.59 bind(X9, sK3),
% 9.06/1.59 bind(X10, sK0(X5,X6)),
% 9.06/1.59 bind(X11, sK3),
% 9.06/1.59 bind(X12, sK4),
% 9.06/1.59 bind(X13, sK0(X5,X6)),
% 9.06/1.59 bind(X14, sK3),
% 9.06/1.59 bind(X15, difference(sK4,sK3))
% 9.06/1.59 ],
% 9.06/1.59 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])).
% 9.06/1.59
% 9.06/1.59 % SZS output end IncompleteProof
%------------------------------------------------------------------------------