TSTP Solution File: NUM388+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM388+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 : n024.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 : Mon Jul 18 11:32:34 EDT 2022
% Result : Theorem 0.20s 0.48s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM388+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33 % Computer : n024.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.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jul 7 10:34:29 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.48 % SZS status Theorem
% 0.20/0.48 % SZS output begin IncompleteProof
% 0.20/0.48 cnf(c0, axiom,
% 0.20/0.48 in(sK16,sK14)).
% 0.20/0.48 cnf(c1, plain,
% 0.20/0.48 in(sK16,sK14),
% 0.20/0.48 inference(start, [], [c0])).
% 0.20/0.48
% 0.20/0.48 cnf(c2, axiom,
% 0.20/0.48 element(X0,X1) | ~element(X2,powerset(X1)) | ~in(X0,X2)).
% 0.20/0.48 cnf(a0, assumption,
% 0.20/0.48 sK16 = X0).
% 0.20/0.48 cnf(a1, assumption,
% 0.20/0.48 sK14 = X2).
% 0.20/0.48 cnf(c3, plain,
% 0.20/0.48 $false,
% 0.20/0.48 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.48 cnf(c4, plain,
% 0.20/0.48 element(X0,X1) | ~element(X2,powerset(X1)),
% 0.20/0.48 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.48
% 0.20/0.48 cnf(c5, axiom,
% 0.20/0.48 in(X3,X4) | empty(X4) | ~element(X3,X4)).
% 0.20/0.48 cnf(a2, assumption,
% 0.20/0.48 X0 = X3).
% 0.20/0.48 cnf(a3, assumption,
% 0.20/0.48 X1 = X4).
% 0.20/0.48 cnf(c6, plain,
% 0.20/0.48 ~element(X2,powerset(X1)),
% 0.20/0.48 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.20/0.48 cnf(c7, plain,
% 0.20/0.48 in(X3,X4) | empty(X4),
% 0.20/0.48 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.20/0.48
% 0.20/0.48 cnf(c8, axiom,
% 0.20/0.48 ~in(sK16,sK15)).
% 0.20/0.48 cnf(a4, assumption,
% 0.20/0.48 X3 = sK16).
% 0.20/0.48 cnf(a5, assumption,
% 0.20/0.48 X4 = sK15).
% 0.20/0.48 cnf(c9, plain,
% 0.20/0.48 empty(X4),
% 0.20/0.48 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.20/0.48 cnf(c10, plain,
% 0.20/0.48 $false,
% 0.20/0.48 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.20/0.48
% 0.20/0.48 cnf(c11, axiom,
% 0.20/0.48 ~empty(X5) | ~in(X6,X5)).
% 0.20/0.48 cnf(a6, assumption,
% 0.20/0.48 X4 = X5).
% 0.20/0.48 cnf(c12, plain,
% 0.20/0.48 $false,
% 0.20/0.48 inference(strict_predicate_extension, [assumptions([a6])], [c9, c11])).
% 0.20/0.48 cnf(c13, plain,
% 0.20/0.48 ~in(X6,X5),
% 0.20/0.48 inference(strict_predicate_extension, [assumptions([a6])], [c9, c11])).
% 0.20/0.48
% 0.20/0.48 cnf(c14, axiom,
% 0.20/0.48 in(sK14,sK15)).
% 0.20/0.48 cnf(a7, assumption,
% 0.20/0.48 X6 = sK14).
% 0.20/0.48 cnf(a8, assumption,
% 0.20/0.48 X5 = sK15).
% 0.20/0.48 cnf(c15, plain,
% 0.20/0.48 $false,
% 0.20/0.48 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])).
% 0.20/0.48 cnf(c16, plain,
% 0.20/0.48 $false,
% 0.20/0.48 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])).
% 0.20/0.48
% 0.20/0.48 cnf(c17, axiom,
% 0.20/0.48 element(X7,powerset(X8)) | ~subset(X7,X8)).
% 0.20/0.48 cnf(a9, assumption,
% 0.20/0.48 X2 = X7).
% 0.20/0.48 cnf(a10, assumption,
% 0.20/0.48 powerset(X1) = powerset(X8)).
% 0.20/0.48 cnf(c18, plain,
% 0.20/0.48 $false,
% 0.20/0.48 inference(strict_predicate_extension, [assumptions([a9, a10])], [c6, c17])).
% 0.20/0.48 cnf(c19, plain,
% 0.20/0.48 ~subset(X7,X8),
% 0.20/0.48 inference(strict_predicate_extension, [assumptions([a9, a10])], [c6, c17])).
% 0.20/0.48
% 0.20/0.48 cnf(c20, axiom,
% 0.20/0.48 subset(X9,X10) | ~in(X9,X10) | ~epsilon_transitive(X10)).
% 0.20/0.48 cnf(a11, assumption,
% 0.20/0.48 X7 = X9).
% 0.20/0.48 cnf(a12, assumption,
% 0.20/0.48 X8 = X10).
% 0.20/0.48 cnf(c21, plain,
% 0.20/0.48 $false,
% 0.20/0.48 inference(strict_predicate_extension, [assumptions([a11, a12])], [c19, c20])).
% 0.20/0.48 cnf(c22, plain,
% 0.20/0.48 ~in(X9,X10) | ~epsilon_transitive(X10),
% 0.20/0.48 inference(strict_predicate_extension, [assumptions([a11, a12])], [c19, c20])).
% 0.20/0.48
% 0.20/0.48 cnf(c23, plain,
% 0.20/0.48 in(X6,X5)).
% 0.20/0.48 cnf(a13, assumption,
% 0.20/0.48 X9 = X6).
% 0.20/0.48 cnf(a14, assumption,
% 0.20/0.48 X10 = X5).
% 0.20/0.48 cnf(c24, plain,
% 0.20/0.48 ~epsilon_transitive(X10),
% 0.20/0.48 inference(predicate_reduction, [assumptions([a13, a14])], [c22, c23])).
% 0.20/0.48
% 0.20/0.48 cnf(c25, axiom,
% 0.20/0.48 epsilon_transitive(X11) | ~ordinal(X11)).
% 0.20/0.48 cnf(a15, assumption,
% 0.20/0.48 X10 = X11).
% 0.20/0.48 cnf(c26, plain,
% 0.20/0.48 $false,
% 0.20/0.48 inference(strict_predicate_extension, [assumptions([a15])], [c24, c25])).
% 0.20/0.48 cnf(c27, plain,
% 0.20/0.48 ~ordinal(X11),
% 0.20/0.48 inference(strict_predicate_extension, [assumptions([a15])], [c24, c25])).
% 0.20/0.48
% 0.20/0.48 cnf(c28, axiom,
% 0.20/0.48 ordinal(sK15)).
% 0.20/0.48 cnf(a16, assumption,
% 0.20/0.48 X11 = sK15).
% 0.20/0.48 cnf(c29, plain,
% 0.20/0.48 $false,
% 0.20/0.48 inference(strict_predicate_extension, [assumptions([a16])], [c27, c28])).
% 0.20/0.48 cnf(c30, plain,
% 0.20/0.48 $false,
% 0.20/0.48 inference(strict_predicate_extension, [assumptions([a16])], [c27, c28])).
% 0.20/0.48
% 0.20/0.48 cnf(c31, plain,
% 0.20/0.48 $false,
% 0.20/0.48 inference(constraint_solving, [
% 0.20/0.48 bind(X0, sK16),
% 0.20/0.48 bind(X1, sK15),
% 0.20/0.48 bind(X2, sK14),
% 0.20/0.48 bind(X3, sK16),
% 0.20/0.48 bind(X4, sK15),
% 0.20/0.48 bind(X5, sK15),
% 0.20/0.48 bind(X6, sK14),
% 0.20/0.48 bind(X7, sK14),
% 0.20/0.48 bind(X8, sK15),
% 0.20/0.48 bind(X9, sK14),
% 0.20/0.48 bind(X10, sK15),
% 0.20/0.48 bind(X11, sK15)
% 0.20/0.48 ],
% 0.20/0.48 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])).
% 0.20/0.48
% 0.20/0.48 % SZS output end IncompleteProof
%------------------------------------------------------------------------------