TSTP Solution File: SET012-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET012-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n022.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:16 EDT 2022
% Result : Unsatisfiable 4.30s 0.89s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET012-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.13/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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 20:22:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 4.30/0.89 % SZS status Unsatisfiable
% 4.30/0.89 % SZS output begin IncompleteProof
% 4.30/0.89 cnf(c0, axiom,
% 4.30/0.89 ~equal_sets(complement(complement(a)),a)).
% 4.30/0.89 cnf(c1, plain,
% 4.30/0.89 ~equal_sets(complement(complement(a)),a),
% 4.30/0.89 inference(start, [], [c0])).
% 4.30/0.89
% 4.30/0.89 cnf(c2, axiom,
% 4.30/0.89 equal_sets(X0,X1) | ~subset(X0,X1) | ~subset(X1,X0)).
% 4.30/0.89 cnf(a0, assumption,
% 4.30/0.89 complement(complement(a)) = X0).
% 4.30/0.89 cnf(a1, assumption,
% 4.30/0.89 a = X1).
% 4.30/0.89 cnf(c3, plain,
% 4.30/0.89 $false,
% 4.30/0.89 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 4.30/0.89 cnf(c4, plain,
% 4.30/0.89 ~subset(X0,X1) | ~subset(X1,X0),
% 4.30/0.89 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 4.30/0.89
% 4.30/0.89 cnf(c5, axiom,
% 4.30/0.89 subset(X2,X3) | ~member(member_of_1_not_of_2(X2,X3),X3)).
% 4.30/0.89 cnf(a2, assumption,
% 4.30/0.89 X0 = X2).
% 4.30/0.89 cnf(a3, assumption,
% 4.30/0.89 X1 = X3).
% 4.30/0.89 cnf(c6, plain,
% 4.30/0.89 ~subset(X1,X0),
% 4.30/0.89 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 4.30/0.89 cnf(c7, plain,
% 4.30/0.89 ~member(member_of_1_not_of_2(X2,X3),X3),
% 4.30/0.89 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 4.30/0.89
% 4.30/0.89 cnf(c8, axiom,
% 4.30/0.89 member(X4,complement(X5)) | member(X4,X5)).
% 4.30/0.89 cnf(a4, assumption,
% 4.30/0.89 member_of_1_not_of_2(X2,X3) = X4).
% 4.30/0.89 cnf(a5, assumption,
% 4.30/0.89 X3 = X5).
% 4.30/0.89 cnf(c9, plain,
% 4.30/0.89 $false,
% 4.30/0.89 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 4.30/0.89 cnf(c10, plain,
% 4.30/0.89 member(X4,complement(X5)),
% 4.30/0.89 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 4.30/0.89
% 4.30/0.89 cnf(c11, axiom,
% 4.30/0.89 ~member(X6,complement(X7)) | ~member(X6,X7)).
% 4.30/0.89 cnf(a6, assumption,
% 4.30/0.89 X4 = X6).
% 4.30/0.89 cnf(a7, assumption,
% 4.30/0.89 complement(X5) = X7).
% 4.30/0.89 cnf(c12, plain,
% 4.30/0.89 $false,
% 4.30/0.89 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 4.30/0.89 cnf(c13, plain,
% 4.30/0.89 ~member(X6,complement(X7)),
% 4.30/0.89 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 4.30/0.89
% 4.30/0.89 cnf(c14, axiom,
% 4.30/0.89 member(member_of_1_not_of_2(X8,X9),X8) | subset(X8,X9)).
% 4.30/0.89 cnf(a8, assumption,
% 4.30/0.89 X6 = member_of_1_not_of_2(X8,X9)).
% 4.30/0.89 cnf(a9, assumption,
% 4.30/0.89 complement(X7) = X8).
% 4.30/0.89 cnf(c15, plain,
% 4.30/0.89 $false,
% 4.30/0.89 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 4.30/0.89 cnf(c16, plain,
% 4.30/0.89 subset(X8,X9),
% 4.30/0.89 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 4.30/0.89
% 4.30/0.89 cnf(c17, plain,
% 4.30/0.89 ~subset(X0,X1)).
% 4.30/0.89 cnf(a10, assumption,
% 4.30/0.89 X8 = X0).
% 4.30/0.89 cnf(a11, assumption,
% 4.30/0.89 X9 = X1).
% 4.30/0.89 cnf(c18, plain,
% 4.30/0.89 $false,
% 4.30/0.89 inference(predicate_reduction, [assumptions([a10, a11])], [c16, c17])).
% 4.30/0.89
% 4.30/0.89 cnf(c19, axiom,
% 4.30/0.89 subset(X10,X11) | ~member(member_of_1_not_of_2(X10,X11),X11)).
% 4.30/0.89 cnf(a12, assumption,
% 4.30/0.89 X1 = X10).
% 4.30/0.89 cnf(a13, assumption,
% 4.30/0.89 X0 = X11).
% 4.30/0.89 cnf(c20, plain,
% 4.30/0.89 $false,
% 4.30/0.89 inference(strict_predicate_extension, [assumptions([a12, a13])], [c6, c19])).
% 4.30/0.89 cnf(c21, plain,
% 4.30/0.89 ~member(member_of_1_not_of_2(X10,X11),X11),
% 4.30/0.89 inference(strict_predicate_extension, [assumptions([a12, a13])], [c6, c19])).
% 4.30/0.89
% 4.30/0.89 cnf(c22, axiom,
% 4.30/0.89 member(X12,complement(X13)) | member(X12,X13)).
% 4.30/0.89 cnf(a14, assumption,
% 4.30/0.89 member_of_1_not_of_2(X10,X11) = X12).
% 4.30/0.89 cnf(a15, assumption,
% 4.30/0.89 X11 = complement(X13)).
% 4.30/0.89 cnf(c23, plain,
% 4.30/0.89 $false,
% 4.30/0.89 inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c22])).
% 4.30/0.89 cnf(c24, plain,
% 4.30/0.89 member(X12,X13),
% 4.30/0.89 inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c22])).
% 4.30/0.89
% 4.30/0.89 cnf(c25, axiom,
% 4.30/0.89 ~member(X14,complement(X15)) | ~member(X14,X15)).
% 4.30/0.89 cnf(a16, assumption,
% 4.30/0.89 X12 = X14).
% 4.30/0.89 cnf(a17, assumption,
% 4.30/0.89 X13 = complement(X15)).
% 4.30/0.89 cnf(c26, plain,
% 4.30/0.89 $false,
% 4.30/0.89 inference(strict_predicate_extension, [assumptions([a16, a17])], [c24, c25])).
% 4.30/0.89 cnf(c27, plain,
% 4.30/0.89 ~member(X14,X15),
% 4.30/0.89 inference(strict_predicate_extension, [assumptions([a16, a17])], [c24, c25])).
% 4.30/0.89
% 4.30/0.89 cnf(c28, axiom,
% 4.30/0.89 member(member_of_1_not_of_2(X16,X17),X16) | subset(X16,X17)).
% 4.30/0.89 cnf(a18, assumption,
% 4.30/0.89 X14 = member_of_1_not_of_2(X16,X17)).
% 4.30/0.89 cnf(a19, assumption,
% 4.30/0.89 X15 = X16).
% 4.30/0.89 cnf(c29, plain,
% 4.30/0.89 $false,
% 4.30/0.89 inference(strict_predicate_extension, [assumptions([a18, a19])], [c27, c28])).
% 4.30/0.89 cnf(c30, plain,
% 4.30/0.89 subset(X16,X17),
% 4.30/0.89 inference(strict_predicate_extension, [assumptions([a18, a19])], [c27, c28])).
% 4.30/0.89
% 4.30/0.89 cnf(c31, plain,
% 4.30/0.89 ~subset(X1,X0)).
% 4.30/0.89 cnf(a20, assumption,
% 4.30/0.89 X16 = X1).
% 4.30/0.89 cnf(a21, assumption,
% 4.30/0.89 X17 = X0).
% 4.30/0.89 cnf(c32, plain,
% 4.30/0.89 $false,
% 4.30/0.89 inference(predicate_reduction, [assumptions([a20, a21])], [c30, c31])).
% 4.30/0.89
% 4.30/0.89 cnf(c33, plain,
% 4.30/0.89 $false,
% 4.30/0.89 inference(constraint_solving, [
% 4.30/0.89 bind(X0, complement(complement(a))),
% 4.30/0.89 bind(X1, a),
% 4.30/0.89 bind(X2, complement(complement(a))),
% 4.30/0.89 bind(X3, a),
% 4.30/0.89 bind(X4, member_of_1_not_of_2(X2,X3)),
% 4.30/0.89 bind(X5, a),
% 4.30/0.89 bind(X6, member_of_1_not_of_2(X2,X3)),
% 4.30/0.89 bind(X7, complement(X5)),
% 4.30/0.89 bind(X8, complement(complement(a))),
% 4.30/0.89 bind(X9, a),
% 4.30/0.89 bind(X10, a),
% 4.30/0.89 bind(X11, complement(complement(a))),
% 4.30/0.89 bind(X12, member_of_1_not_of_2(X10,X11)),
% 4.30/0.89 bind(X13, complement(a)),
% 4.30/0.89 bind(X14, member_of_1_not_of_2(X10,X11)),
% 4.30/0.89 bind(X15, a),
% 4.30/0.89 bind(X16, a),
% 4.30/0.89 bind(X17, complement(complement(a)))
% 4.30/0.89 ],
% 4.30/0.89 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21])).
% 4.30/0.89
% 4.30/0.89 % SZS output end IncompleteProof
%------------------------------------------------------------------------------