TSTP Solution File: SET929+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET929+1 : TPTP v8.1.0. Released v3.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 : n009.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:49:17 EDT 2022
% Result : Theorem 1.67s 0.58s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET929+1 : TPTP v8.1.0. Released v3.2.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 : n009.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 Jul 9 21:44:22 EDT 2022
% 0.14/0.35 % CPUTime :
% 1.67/0.58 % SZS status Theorem
% 1.67/0.58 % SZS output begin IncompleteProof
% 1.67/0.58 cnf(c0, axiom,
% 1.67/0.58 in(sK2,sK4) | empty_set = set_difference(unordered_pair(sK2,sK3),sK4)).
% 1.67/0.58 cnf(c1, plain,
% 1.67/0.58 in(sK2,sK4) | empty_set = set_difference(unordered_pair(sK2,sK3),sK4),
% 1.67/0.58 inference(start, [], [c0])).
% 1.67/0.58
% 1.67/0.58 cnf(c2, axiom,
% 1.67/0.58 subset(unordered_pair(X0,X1),X2) | ~in(X1,X2) | ~in(X0,X2)).
% 1.67/0.58 cnf(a0, assumption,
% 1.67/0.58 sK2 = X0).
% 1.67/0.58 cnf(a1, assumption,
% 1.67/0.58 sK4 = X2).
% 1.67/0.58 cnf(c3, plain,
% 1.67/0.58 empty_set = set_difference(unordered_pair(sK2,sK3),sK4),
% 1.67/0.58 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 1.67/0.58 cnf(c4, plain,
% 1.67/0.58 subset(unordered_pair(X0,X1),X2) | ~in(X1,X2),
% 1.67/0.58 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 1.67/0.58
% 1.67/0.58 cnf(c5, axiom,
% 1.67/0.58 empty_set = set_difference(X3,X4) | ~subset(X3,X4)).
% 1.67/0.58 cnf(a2, assumption,
% 1.67/0.58 unordered_pair(X0,X1) = X3).
% 1.67/0.58 cnf(a3, assumption,
% 1.67/0.58 X2 = X4).
% 1.67/0.58 cnf(c6, plain,
% 1.67/0.58 ~in(X1,X2),
% 1.67/0.58 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 1.67/0.58 cnf(c7, plain,
% 1.67/0.58 empty_set = set_difference(X3,X4),
% 1.67/0.58 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 1.67/0.58
% 1.67/0.58 cnf(c8, axiom,
% 1.67/0.58 ~in(sK3,sK4) | ~in(sK2,sK4) | empty_set != set_difference(unordered_pair(sK2,sK3),sK4)).
% 1.67/0.58 cnf(a4, assumption,
% 1.67/0.58 set_difference(unordered_pair(sK2,sK3),sK4) = set_difference(X3,X4)).
% 1.67/0.58 cnf(a5, assumption,
% 1.67/0.58 empty_set = X5).
% 1.67/0.58 cnf(c9, plain,
% 1.67/0.58 $false,
% 1.67/0.58 inference(strict_subterm_extension, [assumptions([a4, a5])], [c7, c8])).
% 1.67/0.58 cnf(c10, plain,
% 1.67/0.58 ~in(sK3,sK4) | ~in(sK2,sK4),
% 1.67/0.58 inference(strict_subterm_extension, [assumptions([a4, a5])], [c7, c8])).
% 1.67/0.58 cnf(c11, plain,
% 1.67/0.58 empty_set != X5,
% 1.67/0.58 inference(strict_subterm_extension, [assumptions([a4, a5])], [c7, c8])).
% 1.67/0.58
% 1.67/0.58 cnf(a6, assumption,
% 1.67/0.58 empty_set = X5).
% 1.67/0.58 cnf(c12, plain,
% 1.67/0.58 $false,
% 1.67/0.58 inference(reflexivity, [assumptions([a6])], [c11])).
% 1.67/0.58
% 1.67/0.58 cnf(c13, axiom,
% 1.67/0.58 in(X6,X7) | ~subset(unordered_pair(X8,X6),X7)).
% 1.67/0.58 cnf(a7, assumption,
% 1.67/0.58 sK3 = X6).
% 1.67/0.58 cnf(a8, assumption,
% 1.67/0.58 sK4 = X7).
% 1.67/0.58 cnf(c14, plain,
% 1.67/0.58 ~in(sK2,sK4),
% 1.67/0.58 inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c13])).
% 1.67/0.58 cnf(c15, plain,
% 1.67/0.58 ~subset(unordered_pair(X8,X6),X7),
% 1.67/0.58 inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c13])).
% 1.67/0.58
% 1.67/0.58 cnf(c16, plain,
% 1.67/0.58 subset(unordered_pair(X0,X1),X2)).
% 1.67/0.58 cnf(a9, assumption,
% 1.67/0.58 unordered_pair(X8,X6) = unordered_pair(X0,X1)).
% 1.67/0.58 cnf(a10, assumption,
% 1.67/0.58 X7 = X2).
% 1.67/0.58 cnf(c17, plain,
% 1.67/0.58 $false,
% 1.67/0.58 inference(predicate_reduction, [assumptions([a9, a10])], [c15, c16])).
% 1.67/0.58
% 1.67/0.58 cnf(c18, plain,
% 1.67/0.58 in(sK2,sK4)).
% 1.67/0.58 cnf(a11, assumption,
% 1.67/0.58 sK2 = sK2).
% 1.67/0.58 cnf(a12, assumption,
% 1.67/0.58 sK4 = sK4).
% 1.67/0.58 cnf(c19, plain,
% 1.67/0.58 $false,
% 1.67/0.58 inference(predicate_reduction, [assumptions([a11, a12])], [c14, c18])).
% 1.67/0.58
% 1.67/0.58 cnf(c20, axiom,
% 1.67/0.58 in(sK3,sK4) | empty_set = set_difference(unordered_pair(sK2,sK3),sK4)).
% 1.67/0.58 cnf(a13, assumption,
% 1.67/0.58 X1 = sK3).
% 1.67/0.58 cnf(a14, assumption,
% 1.67/0.58 X2 = sK4).
% 1.67/0.58 cnf(c21, plain,
% 1.67/0.58 $false,
% 1.67/0.58 inference(strict_predicate_extension, [assumptions([a13, a14])], [c6, c20])).
% 1.67/0.58 cnf(c22, plain,
% 1.67/0.58 empty_set = set_difference(unordered_pair(sK2,sK3),sK4),
% 1.67/0.58 inference(strict_predicate_extension, [assumptions([a13, a14])], [c6, c20])).
% 1.67/0.58
% 1.67/0.58 cnf(c23, axiom,
% 1.67/0.58 subset(X9,X10) | empty_set != set_difference(X9,X10)).
% 1.67/0.58 cnf(a15, assumption,
% 1.67/0.58 set_difference(X9,X10) = set_difference(unordered_pair(sK2,sK3),sK4)).
% 1.67/0.58 cnf(a16, assumption,
% 1.67/0.58 empty_set = X11).
% 1.67/0.58 cnf(c24, plain,
% 1.67/0.58 $false,
% 1.67/0.58 inference(strict_subterm_extension, [assumptions([a15, a16])], [c22, c23])).
% 1.67/0.58 cnf(c25, plain,
% 1.67/0.58 subset(X9,X10),
% 1.67/0.58 inference(strict_subterm_extension, [assumptions([a15, a16])], [c22, c23])).
% 1.67/0.58 cnf(c26, plain,
% 1.67/0.58 empty_set != X11,
% 1.67/0.58 inference(strict_subterm_extension, [assumptions([a15, a16])], [c22, c23])).
% 1.67/0.58
% 1.67/0.58 cnf(a17, assumption,
% 1.67/0.58 empty_set = X11).
% 1.67/0.58 cnf(c27, plain,
% 1.67/0.58 $false,
% 1.67/0.58 inference(reflexivity, [assumptions([a17])], [c26])).
% 1.67/0.58
% 1.67/0.58 cnf(c28, plain,
% 1.67/0.58 ~subset(unordered_pair(X0,X1),X2)).
% 1.67/0.58 cnf(a18, assumption,
% 1.67/0.58 X9 = unordered_pair(X0,X1)).
% 1.67/0.58 cnf(a19, assumption,
% 1.67/0.58 X10 = X2).
% 1.67/0.58 cnf(c29, plain,
% 1.67/0.58 $false,
% 1.67/0.58 inference(predicate_reduction, [assumptions([a18, a19])], [c25, c28])).
% 1.67/0.58
% 1.67/0.58 cnf(c30, axiom,
% 1.67/0.58 subset(X12,X13) | empty_set != set_difference(X12,X13)).
% 1.67/0.58 cnf(a20, assumption,
% 1.67/0.58 set_difference(X12,X13) = set_difference(unordered_pair(sK2,sK3),sK4)).
% 1.67/0.58 cnf(a21, assumption,
% 1.67/0.58 empty_set = X14).
% 1.67/0.58 cnf(c31, plain,
% 1.67/0.58 $false,
% 1.67/0.58 inference(strict_subterm_extension, [assumptions([a20, a21])], [c3, c30])).
% 1.67/0.58 cnf(c32, plain,
% 1.67/0.58 subset(X12,X13),
% 1.67/0.58 inference(strict_subterm_extension, [assumptions([a20, a21])], [c3, c30])).
% 1.67/0.58 cnf(c33, plain,
% 1.67/0.58 empty_set != X14,
% 1.67/0.58 inference(strict_subterm_extension, [assumptions([a20, a21])], [c3, c30])).
% 1.67/0.58
% 1.67/0.58 cnf(a22, assumption,
% 1.67/0.58 empty_set = X14).
% 1.67/0.58 cnf(c34, plain,
% 1.67/0.58 $false,
% 1.67/0.58 inference(reflexivity, [assumptions([a22])], [c33])).
% 1.67/0.58
% 1.67/0.58 cnf(c35, axiom,
% 1.67/0.58 in(X15,X16) | ~subset(unordered_pair(X15,X17),X16)).
% 1.67/0.58 cnf(a23, assumption,
% 1.67/0.58 X12 = unordered_pair(X15,X17)).
% 1.67/0.58 cnf(a24, assumption,
% 1.67/0.58 X13 = X16).
% 1.67/0.58 cnf(c36, plain,
% 1.67/0.58 $false,
% 1.67/0.58 inference(strict_predicate_extension, [assumptions([a23, a24])], [c32, c35])).
% 1.67/0.58 cnf(c37, plain,
% 1.67/0.58 in(X15,X16),
% 1.67/0.58 inference(strict_predicate_extension, [assumptions([a23, a24])], [c32, c35])).
% 1.67/0.58
% 1.67/0.58 cnf(c38, plain,
% 1.67/0.58 ~in(sK2,sK4)).
% 1.67/0.58 cnf(a25, assumption,
% 1.67/0.58 X15 = sK2).
% 1.67/0.58 cnf(a26, assumption,
% 1.67/0.58 X16 = sK4).
% 1.67/0.58 cnf(c39, plain,
% 1.67/0.58 $false,
% 1.67/0.58 inference(predicate_reduction, [assumptions([a25, a26])], [c37, c38])).
% 1.67/0.58
% 1.67/0.58 cnf(c40, plain,
% 1.67/0.58 $false,
% 1.67/0.58 inference(constraint_solving, [
% 1.67/0.58 bind(X0, sK2),
% 1.67/0.58 bind(X1, sK3),
% 1.67/0.58 bind(X2, sK4),
% 1.67/0.58 bind(X3, unordered_pair(X0,X1)),
% 1.67/0.58 bind(X4, sK4),
% 1.67/0.58 bind(X5, empty_set),
% 1.67/0.58 bind(X6, sK3),
% 1.67/0.58 bind(X7, sK4),
% 1.67/0.58 bind(X8, sK2),
% 1.67/0.58 bind(X9, unordered_pair(sK2,sK3)),
% 1.67/0.58 bind(X10, sK4),
% 1.67/0.58 bind(X11, empty_set),
% 1.67/0.58 bind(X12, unordered_pair(sK2,sK3)),
% 1.67/0.58 bind(X13, sK4),
% 1.67/0.58 bind(X14, empty_set),
% 1.67/0.58 bind(X15, sK2),
% 1.67/0.58 bind(X16, sK4),
% 1.67/0.58 bind(X17, sK3)
% 1.67/0.58 ],
% 1.67/0.58 [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])).
% 1.67/0.58
% 1.67/0.58 % SZS output end IncompleteProof
%------------------------------------------------------------------------------