TSTP Solution File: SET200+3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET200+3 : 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 : n011.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:44:40 EDT 2022
% Result : Theorem 17.62s 2.59s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET200+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 22:58:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 17.62/2.59 % SZS status Theorem
% 17.62/2.59 % SZS output begin IncompleteProof
% 17.62/2.59 cnf(c0, axiom,
% 17.62/2.59 ~subset(union(sK3,sK5),union(sK4,sK6))).
% 17.62/2.59 cnf(c1, plain,
% 17.62/2.59 ~subset(union(sK3,sK5),union(sK4,sK6)),
% 17.62/2.59 inference(start, [], [c0])).
% 17.62/2.59
% 17.62/2.59 cnf(c2, axiom,
% 17.62/2.59 subset(X0,X1) | member(sK1(X0,X1),X0)).
% 17.62/2.59 cnf(a0, assumption,
% 17.62/2.59 union(sK3,sK5) = X0).
% 17.62/2.59 cnf(a1, assumption,
% 17.62/2.59 union(sK4,sK6) = X1).
% 17.62/2.59 cnf(c3, plain,
% 17.62/2.59 $false,
% 17.62/2.59 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 17.62/2.59 cnf(c4, plain,
% 17.62/2.59 member(sK1(X0,X1),X0),
% 17.62/2.59 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 17.62/2.59
% 17.62/2.59 cnf(c5, axiom,
% 17.62/2.59 member(X2,X3) | member(X2,X4) | ~member(X2,union(X4,X3))).
% 17.62/2.59 cnf(a2, assumption,
% 17.62/2.59 sK1(X0,X1) = X2).
% 17.62/2.59 cnf(a3, assumption,
% 17.62/2.59 X0 = union(X4,X3)).
% 17.62/2.59 cnf(c6, plain,
% 17.62/2.59 $false,
% 17.62/2.59 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 17.62/2.59 cnf(c7, plain,
% 17.62/2.59 member(X2,X3) | member(X2,X4),
% 17.62/2.59 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 17.62/2.59
% 17.62/2.59 cnf(c8, axiom,
% 17.62/2.59 member(X5,X6) | ~member(X5,X7) | ~subset(X7,X6)).
% 17.62/2.59 cnf(a4, assumption,
% 17.62/2.59 X2 = X5).
% 17.62/2.59 cnf(a5, assumption,
% 17.62/2.59 X3 = X7).
% 17.62/2.59 cnf(c9, plain,
% 17.62/2.59 member(X2,X4),
% 17.62/2.59 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 17.62/2.59 cnf(c10, plain,
% 17.62/2.59 member(X5,X6) | ~subset(X7,X6),
% 17.62/2.59 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 17.62/2.59
% 17.62/2.59 cnf(c11, axiom,
% 17.62/2.59 member(X8,union(X9,X10)) | ~member(X8,X10)).
% 17.62/2.59 cnf(a6, assumption,
% 17.62/2.59 X5 = X8).
% 17.62/2.59 cnf(a7, assumption,
% 17.62/2.59 X6 = X10).
% 17.62/2.59 cnf(c12, plain,
% 17.62/2.59 ~subset(X7,X6),
% 17.62/2.59 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 17.62/2.59 cnf(c13, plain,
% 17.62/2.59 member(X8,union(X9,X10)),
% 17.62/2.59 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 17.62/2.59
% 17.62/2.59 cnf(c14, axiom,
% 17.62/2.59 subset(X11,X12) | ~member(sK1(X11,X12),X12)).
% 17.62/2.59 cnf(a8, assumption,
% 17.62/2.59 X8 = sK1(X11,X12)).
% 17.62/2.59 cnf(a9, assumption,
% 17.62/2.59 union(X9,X10) = X12).
% 17.62/2.59 cnf(c15, plain,
% 17.62/2.59 $false,
% 17.62/2.59 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 17.62/2.59 cnf(c16, plain,
% 17.62/2.59 subset(X11,X12),
% 17.62/2.59 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 17.62/2.59
% 17.62/2.59 cnf(c17, plain,
% 17.62/2.59 ~subset(union(sK3,sK5),union(sK4,sK6))).
% 17.62/2.59 cnf(a10, assumption,
% 17.62/2.59 X11 = union(sK3,sK5)).
% 17.62/2.59 cnf(a11, assumption,
% 17.62/2.59 X12 = union(sK4,sK6)).
% 17.62/2.59 cnf(c18, plain,
% 17.62/2.59 $false,
% 17.62/2.59 inference(predicate_reduction, [assumptions([a10, a11])], [c16, c17])).
% 17.62/2.59
% 17.62/2.59 cnf(c19, axiom,
% 17.62/2.59 subset(sK5,sK6)).
% 17.62/2.59 cnf(a12, assumption,
% 17.62/2.59 X7 = sK5).
% 17.62/2.59 cnf(a13, assumption,
% 17.62/2.59 X6 = sK6).
% 17.62/2.59 cnf(c20, plain,
% 17.62/2.59 $false,
% 17.62/2.59 inference(strict_predicate_extension, [assumptions([a12, a13])], [c12, c19])).
% 17.62/2.59 cnf(c21, plain,
% 17.62/2.59 $false,
% 17.62/2.59 inference(strict_predicate_extension, [assumptions([a12, a13])], [c12, c19])).
% 17.62/2.59
% 17.62/2.59 cnf(c22, axiom,
% 17.62/2.59 member(X13,X14) | ~member(X13,X15) | ~subset(X15,X14)).
% 17.62/2.59 cnf(a14, assumption,
% 17.62/2.59 X2 = X13).
% 17.62/2.59 cnf(a15, assumption,
% 17.62/2.59 X4 = X15).
% 17.62/2.59 cnf(c23, plain,
% 17.62/2.59 $false,
% 17.62/2.59 inference(strict_predicate_extension, [assumptions([a14, a15])], [c9, c22])).
% 17.62/2.59 cnf(c24, plain,
% 17.62/2.59 member(X13,X14) | ~subset(X15,X14),
% 17.62/2.59 inference(strict_predicate_extension, [assumptions([a14, a15])], [c9, c22])).
% 17.62/2.59
% 17.62/2.59 cnf(c25, axiom,
% 17.62/2.59 member(X16,union(X17,X18)) | ~member(X16,X17)).
% 17.62/2.59 cnf(a16, assumption,
% 17.62/2.59 X13 = X16).
% 17.62/2.59 cnf(a17, assumption,
% 17.62/2.59 X14 = X17).
% 17.62/2.59 cnf(c26, plain,
% 17.62/2.59 ~subset(X15,X14),
% 17.62/2.59 inference(strict_predicate_extension, [assumptions([a16, a17])], [c24, c25])).
% 17.62/2.59 cnf(c27, plain,
% 17.62/2.59 member(X16,union(X17,X18)),
% 17.62/2.59 inference(strict_predicate_extension, [assumptions([a16, a17])], [c24, c25])).
% 17.62/2.59
% 17.62/2.59 cnf(c28, plain,
% 17.62/2.59 ~member(X8,union(X9,X10))).
% 17.62/2.59 cnf(a18, assumption,
% 17.62/2.59 X16 = X8).
% 17.62/2.59 cnf(a19, assumption,
% 17.62/2.59 union(X17,X18) = union(X9,X10)).
% 17.62/2.59 cnf(c29, plain,
% 17.62/2.59 $false,
% 17.62/2.59 inference(predicate_reduction, [assumptions([a18, a19])], [c27, c28])).
% 17.62/2.59
% 17.62/2.59 cnf(c30, axiom,
% 17.62/2.59 subset(sK3,sK4)).
% 17.62/2.59 cnf(a20, assumption,
% 17.62/2.59 X15 = sK3).
% 17.62/2.59 cnf(a21, assumption,
% 17.62/2.59 X14 = sK4).
% 17.62/2.59 cnf(c31, plain,
% 17.62/2.59 $false,
% 17.62/2.59 inference(strict_predicate_extension, [assumptions([a20, a21])], [c26, c30])).
% 17.62/2.59 cnf(c32, plain,
% 17.62/2.59 $false,
% 17.62/2.59 inference(strict_predicate_extension, [assumptions([a20, a21])], [c26, c30])).
% 17.62/2.59
% 17.62/2.59 cnf(c33, plain,
% 17.62/2.59 $false,
% 17.62/2.59 inference(constraint_solving, [
% 17.62/2.59 bind(X0, union(sK3,sK5)),
% 17.62/2.59 bind(X1, union(sK4,sK6)),
% 17.62/2.59 bind(X2, sK1(X0,X1)),
% 17.62/2.59 bind(X3, sK5),
% 17.62/2.59 bind(X4, sK3),
% 17.62/2.59 bind(X5, sK1(X0,X1)),
% 17.62/2.59 bind(X6, sK6),
% 17.62/2.59 bind(X7, sK5),
% 17.62/2.59 bind(X8, sK1(X0,X1)),
% 17.62/2.59 bind(X9, sK4),
% 17.62/2.59 bind(X10, sK6),
% 17.62/2.59 bind(X11, union(sK3,sK5)),
% 17.62/2.59 bind(X12, union(sK4,sK6)),
% 17.62/2.59 bind(X13, sK1(X0,X1)),
% 17.62/2.59 bind(X14, sK4),
% 17.62/2.59 bind(X15, sK3),
% 17.62/2.59 bind(X16, sK1(X0,X1)),
% 17.62/2.59 bind(X17, sK4),
% 17.62/2.59 bind(X18, sK6)
% 17.62/2.59 ],
% 17.62/2.59 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21])).
% 17.62/2.59
% 17.62/2.59 % SZS output end IncompleteProof
%------------------------------------------------------------------------------