TSTP Solution File: SET002+4 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET002+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 : 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:42:09 EDT 2022
% Result : Theorem 20.92s 3.15s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET002+4 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n012.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 : Mon Jul 11 02:32:28 EDT 2022
% 0.12/0.33 % CPUTime :
% 20.92/3.15 % SZS status Theorem
% 20.92/3.15 % SZS output begin IncompleteProof
% 20.92/3.15 cnf(c0, axiom,
% 20.92/3.15 ~equal_set(union(sK3,sK3),sK3)).
% 20.92/3.15 cnf(c1, plain,
% 20.92/3.15 ~equal_set(union(sK3,sK3),sK3),
% 20.92/3.15 inference(start, [], [c0])).
% 20.92/3.15
% 20.92/3.15 cnf(c2, axiom,
% 20.92/3.15 equal_set(X0,X1) | ~subset(X1,X0) | ~subset(X0,X1)).
% 20.92/3.15 cnf(a0, assumption,
% 20.92/3.15 union(sK3,sK3) = X0).
% 20.92/3.15 cnf(a1, assumption,
% 20.92/3.15 sK3 = X1).
% 20.92/3.15 cnf(c3, plain,
% 20.92/3.15 $false,
% 20.92/3.15 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 20.92/3.15 cnf(c4, plain,
% 20.92/3.15 ~subset(X1,X0) | ~subset(X0,X1),
% 20.92/3.15 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 20.92/3.15
% 20.92/3.15 cnf(c5, axiom,
% 20.92/3.15 subset(X2,X3) | ~member(sK0(X2,X3),X3)).
% 20.92/3.15 cnf(a2, assumption,
% 20.92/3.15 X1 = X2).
% 20.92/3.15 cnf(a3, assumption,
% 20.92/3.15 X0 = X3).
% 20.92/3.15 cnf(c6, plain,
% 20.92/3.15 ~subset(X0,X1),
% 20.92/3.15 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 20.92/3.15 cnf(c7, plain,
% 20.92/3.15 ~member(sK0(X2,X3),X3),
% 20.92/3.15 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 20.92/3.15
% 20.92/3.15 cnf(c8, axiom,
% 20.92/3.15 member(X4,union(X5,X6)) | ~member(X4,X5)).
% 20.92/3.15 cnf(a4, assumption,
% 20.92/3.15 sK0(X2,X3) = X4).
% 20.92/3.15 cnf(a5, assumption,
% 20.92/3.15 X3 = union(X5,X6)).
% 20.92/3.15 cnf(c9, plain,
% 20.92/3.15 $false,
% 20.92/3.15 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 20.92/3.15 cnf(c10, plain,
% 20.92/3.15 ~member(X4,X5),
% 20.92/3.15 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 20.92/3.15
% 20.92/3.15 cnf(c11, axiom,
% 20.92/3.15 subset(X7,X8) | member(sK0(X7,X8),X7)).
% 20.92/3.15 cnf(a6, assumption,
% 20.92/3.15 X4 = sK0(X7,X8)).
% 20.92/3.15 cnf(a7, assumption,
% 20.92/3.15 X5 = X7).
% 20.92/3.15 cnf(c12, plain,
% 20.92/3.15 $false,
% 20.92/3.15 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 20.92/3.15 cnf(c13, plain,
% 20.92/3.15 subset(X7,X8),
% 20.92/3.15 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 20.92/3.15
% 20.92/3.15 cnf(c14, plain,
% 20.92/3.15 ~subset(X1,X0)).
% 20.92/3.15 cnf(a8, assumption,
% 20.92/3.15 X7 = X1).
% 20.92/3.15 cnf(a9, assumption,
% 20.92/3.15 X8 = X0).
% 20.92/3.15 cnf(c15, plain,
% 20.92/3.15 $false,
% 20.92/3.15 inference(predicate_reduction, [assumptions([a8, a9])], [c13, c14])).
% 20.92/3.15
% 20.92/3.15 cnf(c16, axiom,
% 20.92/3.15 subset(X9,X10) | ~member(sK0(X9,X10),X10)).
% 20.92/3.15 cnf(a10, assumption,
% 20.92/3.15 X0 = X9).
% 20.92/3.15 cnf(a11, assumption,
% 20.92/3.15 X1 = X10).
% 20.92/3.15 cnf(c17, plain,
% 20.92/3.15 $false,
% 20.92/3.15 inference(strict_predicate_extension, [assumptions([a10, a11])], [c6, c16])).
% 20.92/3.15 cnf(c18, plain,
% 20.92/3.15 ~member(sK0(X9,X10),X10),
% 20.92/3.15 inference(strict_predicate_extension, [assumptions([a10, a11])], [c6, c16])).
% 20.92/3.15
% 20.92/3.15 cnf(c19, axiom,
% 20.92/3.15 member(X11,X12) | member(X11,X13) | ~member(X11,union(X13,X12))).
% 20.92/3.15 cnf(a12, assumption,
% 20.92/3.15 sK0(X9,X10) = X11).
% 20.92/3.15 cnf(a13, assumption,
% 20.92/3.15 X10 = X12).
% 20.92/3.15 cnf(c20, plain,
% 20.92/3.15 $false,
% 20.92/3.15 inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c19])).
% 20.92/3.15 cnf(c21, plain,
% 20.92/3.15 member(X11,X13) | ~member(X11,union(X13,X12)),
% 20.92/3.15 inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c19])).
% 20.92/3.15
% 20.92/3.15 cnf(c22, plain,
% 20.92/3.15 ~member(sK0(X9,X10),X10)).
% 20.92/3.15 cnf(a14, assumption,
% 20.92/3.15 X11 = sK0(X9,X10)).
% 20.92/3.15 cnf(a15, assumption,
% 20.92/3.15 X13 = X10).
% 20.92/3.15 cnf(c23, plain,
% 20.92/3.15 ~member(X11,union(X13,X12)),
% 20.92/3.15 inference(predicate_reduction, [assumptions([a14, a15])], [c21, c22])).
% 20.92/3.15
% 20.92/3.15 cnf(c24, axiom,
% 20.92/3.15 subset(X14,X15) | member(sK0(X14,X15),X14)).
% 20.92/3.15 cnf(a16, assumption,
% 20.92/3.15 X11 = sK0(X14,X15)).
% 20.92/3.15 cnf(a17, assumption,
% 20.92/3.15 union(X13,X12) = X14).
% 20.92/3.15 cnf(c25, plain,
% 20.92/3.15 $false,
% 20.92/3.15 inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c24])).
% 20.92/3.15 cnf(c26, plain,
% 20.92/3.15 subset(X14,X15),
% 20.92/3.15 inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c24])).
% 20.92/3.15
% 20.92/3.15 cnf(c27, plain,
% 20.92/3.15 ~subset(X0,X1)).
% 20.92/3.15 cnf(a18, assumption,
% 20.92/3.15 X14 = X0).
% 20.92/3.15 cnf(a19, assumption,
% 20.92/3.15 X15 = X1).
% 20.92/3.15 cnf(c28, plain,
% 20.92/3.15 $false,
% 20.92/3.15 inference(predicate_reduction, [assumptions([a18, a19])], [c26, c27])).
% 20.92/3.15
% 20.92/3.15 cnf(c29, plain,
% 20.92/3.15 $false,
% 20.92/3.15 inference(constraint_solving, [
% 20.92/3.15 bind(X0, union(sK3,sK3)),
% 20.92/3.15 bind(X1, sK3),
% 20.92/3.15 bind(X2, sK3),
% 20.92/3.15 bind(X3, union(sK3,sK3)),
% 20.92/3.15 bind(X4, sK0(X2,X3)),
% 20.92/3.15 bind(X5, sK3),
% 20.92/3.15 bind(X6, sK3),
% 20.92/3.15 bind(X7, sK3),
% 20.92/3.15 bind(X8, union(sK3,sK3)),
% 20.92/3.15 bind(X9, union(sK3,sK3)),
% 20.92/3.15 bind(X10, sK3),
% 20.92/3.15 bind(X11, sK0(X9,X10)),
% 20.92/3.15 bind(X12, sK3),
% 20.92/3.15 bind(X13, sK3),
% 20.92/3.15 bind(X14, union(sK3,sK3)),
% 20.92/3.15 bind(X15, sK3)
% 20.92/3.15 ],
% 20.92/3.15 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])).
% 20.92/3.15
% 20.92/3.15 % SZS output end IncompleteProof
%------------------------------------------------------------------------------