TSTP Solution File: SEU126+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SEU126+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n021.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 11:53:17 EDT 2022
% Result : Theorem 13.74s 2.11s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU126+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 22:53:18 EDT 2022
% 0.12/0.35 % CPUTime :
% 13.74/2.11 % SZS status Theorem
% 13.74/2.11 % SZS output begin IncompleteProof
% 13.74/2.11 cnf(c0, axiom,
% 13.74/2.11 subset(sK6,sK7)).
% 13.74/2.11 cnf(c1, plain,
% 13.74/2.11 subset(sK6,sK7),
% 13.74/2.11 inference(start, [], [c0])).
% 13.74/2.11
% 13.74/2.11 cnf(c2, axiom,
% 13.74/2.11 in(X0,X1) | ~in(X0,X2) | ~subset(X2,X1)).
% 13.74/2.11 cnf(a0, assumption,
% 13.74/2.11 sK6 = X2).
% 13.74/2.11 cnf(a1, assumption,
% 13.74/2.11 sK7 = X1).
% 13.74/2.11 cnf(c3, plain,
% 13.74/2.11 $false,
% 13.74/2.11 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 13.74/2.11 cnf(c4, plain,
% 13.74/2.11 in(X0,X1) | ~in(X0,X2),
% 13.74/2.11 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 13.74/2.11
% 13.74/2.11 cnf(c5, axiom,
% 13.74/2.11 sP1(X3,X4,X5) | ~sP0(X4,sK2(X3,X4,X5),X3) | ~in(sK2(X3,X4,X5),X5)).
% 13.74/2.11 cnf(a2, assumption,
% 13.74/2.11 X0 = sK2(X3,X4,X5)).
% 13.74/2.11 cnf(a3, assumption,
% 13.74/2.11 X1 = X5).
% 13.74/2.11 cnf(c6, plain,
% 13.74/2.11 ~in(X0,X2),
% 13.74/2.11 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 13.74/2.11 cnf(c7, plain,
% 13.74/2.11 sP1(X3,X4,X5) | ~sP0(X4,sK2(X3,X4,X5),X3),
% 13.74/2.11 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 13.74/2.11
% 13.74/2.11 cnf(c8, axiom,
% 13.74/2.11 set_union2(X6,X7) = X8 | ~sP1(X6,X7,X8)).
% 13.74/2.11 cnf(a4, assumption,
% 13.74/2.11 X3 = X6).
% 13.74/2.11 cnf(a5, assumption,
% 13.74/2.11 X4 = X7).
% 13.74/2.11 cnf(a6, assumption,
% 13.74/2.11 X5 = X8).
% 13.74/2.11 cnf(c9, plain,
% 13.74/2.11 ~sP0(X4,sK2(X3,X4,X5),X3),
% 13.74/2.11 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])).
% 13.74/2.11 cnf(c10, plain,
% 13.74/2.11 set_union2(X6,X7) = X8,
% 13.74/2.11 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])).
% 13.74/2.11
% 13.74/2.11 cnf(c11, axiom,
% 13.74/2.11 sK7 != set_union2(sK6,sK7)).
% 13.74/2.11 cnf(a7, assumption,
% 13.74/2.11 set_union2(sK6,sK7) = set_union2(X6,X7)).
% 13.74/2.11 cnf(c12, plain,
% 13.74/2.11 $false,
% 13.74/2.11 inference(strict_subterm_extension, [assumptions([a7])], [c10, c11])).
% 13.74/2.11 cnf(c13, plain,
% 13.74/2.11 $false,
% 13.74/2.11 inference(strict_subterm_extension, [assumptions([a7])], [c10, c11])).
% 13.74/2.11 cnf(c14, plain,
% 13.74/2.11 sK7 != X8,
% 13.74/2.11 inference(strict_subterm_extension, [assumptions([a7])], [c10, c11])).
% 13.74/2.11
% 13.74/2.11 cnf(a8, assumption,
% 13.74/2.11 sK7 = X8).
% 13.74/2.11 cnf(c15, plain,
% 13.74/2.11 $false,
% 13.74/2.11 inference(reflexivity, [assumptions([a8])], [c14])).
% 13.74/2.11
% 13.74/2.11 cnf(c16, axiom,
% 13.74/2.11 sP0(X9,X10,X11) | ~in(X10,X9)).
% 13.74/2.11 cnf(a9, assumption,
% 13.74/2.11 X4 = X9).
% 13.74/2.11 cnf(a10, assumption,
% 13.74/2.11 sK2(X3,X4,X5) = X10).
% 13.74/2.11 cnf(a11, assumption,
% 13.74/2.11 X3 = X11).
% 13.74/2.11 cnf(c17, plain,
% 13.74/2.11 $false,
% 13.74/2.11 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c9, c16])).
% 13.74/2.11 cnf(c18, plain,
% 13.74/2.11 ~in(X10,X9),
% 13.74/2.11 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c9, c16])).
% 13.74/2.11
% 13.74/2.11 cnf(c19, plain,
% 13.74/2.11 in(X0,X1)).
% 13.74/2.11 cnf(a12, assumption,
% 13.74/2.11 X10 = X0).
% 13.74/2.11 cnf(a13, assumption,
% 13.74/2.11 X9 = X1).
% 13.74/2.11 cnf(c20, plain,
% 13.74/2.11 $false,
% 13.74/2.11 inference(predicate_reduction, [assumptions([a12, a13])], [c18, c19])).
% 13.74/2.11
% 13.74/2.11 cnf(c21, axiom,
% 13.74/2.11 in(X12,X13) | in(X12,X14) | ~sP0(X13,X12,X14)).
% 13.74/2.11 cnf(a14, assumption,
% 13.74/2.11 X0 = X12).
% 13.74/2.11 cnf(a15, assumption,
% 13.74/2.11 X2 = X14).
% 13.74/2.11 cnf(c22, plain,
% 13.74/2.11 $false,
% 13.74/2.11 inference(strict_predicate_extension, [assumptions([a14, a15])], [c6, c21])).
% 13.74/2.11 cnf(c23, plain,
% 13.74/2.11 in(X12,X13) | ~sP0(X13,X12,X14),
% 13.74/2.11 inference(strict_predicate_extension, [assumptions([a14, a15])], [c6, c21])).
% 13.74/2.11
% 13.74/2.11 cnf(c24, plain,
% 13.74/2.11 ~in(X0,X1)).
% 13.74/2.11 cnf(a16, assumption,
% 13.74/2.11 X12 = X0).
% 13.74/2.11 cnf(a17, assumption,
% 13.74/2.11 X13 = X1).
% 13.74/2.11 cnf(c25, plain,
% 13.74/2.11 ~sP0(X13,X12,X14),
% 13.74/2.11 inference(predicate_reduction, [assumptions([a16, a17])], [c23, c24])).
% 13.74/2.11
% 13.74/2.11 cnf(c26, axiom,
% 13.74/2.11 sP1(X15,X16,X17) | sP0(X16,sK2(X15,X16,X17),X15) | in(sK2(X15,X16,X17),X17)).
% 13.74/2.11 cnf(a18, assumption,
% 13.74/2.11 X13 = X16).
% 13.74/2.11 cnf(a19, assumption,
% 13.74/2.11 X12 = sK2(X15,X16,X17)).
% 13.74/2.11 cnf(a20, assumption,
% 13.74/2.11 X14 = X15).
% 13.74/2.11 cnf(c27, plain,
% 13.74/2.11 $false,
% 13.74/2.11 inference(strict_predicate_extension, [assumptions([a18, a19, a20])], [c25, c26])).
% 13.74/2.11 cnf(c28, plain,
% 13.74/2.11 sP1(X15,X16,X17) | in(sK2(X15,X16,X17),X17),
% 13.74/2.11 inference(strict_predicate_extension, [assumptions([a18, a19, a20])], [c25, c26])).
% 13.74/2.11
% 13.74/2.11 cnf(c29, plain,
% 13.74/2.11 ~sP1(X3,X4,X5)).
% 13.74/2.11 cnf(a21, assumption,
% 13.74/2.11 X15 = X3).
% 13.74/2.11 cnf(a22, assumption,
% 13.74/2.11 X16 = X4).
% 13.74/2.11 cnf(a23, assumption,
% 13.74/2.11 X17 = X5).
% 13.74/2.11 cnf(c30, plain,
% 13.74/2.11 in(sK2(X15,X16,X17),X17),
% 13.74/2.11 inference(predicate_reduction, [assumptions([a21, a22, a23])], [c28, c29])).
% 13.74/2.11
% 13.74/2.11 cnf(c31, plain,
% 13.74/2.11 ~in(X0,X1)).
% 13.74/2.11 cnf(a24, assumption,
% 13.74/2.11 sK2(X15,X16,X17) = X0).
% 13.74/2.11 cnf(a25, assumption,
% 13.74/2.11 X17 = X1).
% 13.74/2.11 cnf(c32, plain,
% 13.74/2.11 $false,
% 13.74/2.11 inference(predicate_reduction, [assumptions([a24, a25])], [c30, c31])).
% 13.74/2.11
% 13.74/2.11 cnf(c33, plain,
% 13.74/2.11 $false,
% 13.74/2.11 inference(constraint_solving, [
% 13.74/2.11 bind(X0, sK2(X3,X4,X5)),
% 13.74/2.11 bind(X1, sK7),
% 13.74/2.11 bind(X2, sK6),
% 13.74/2.11 bind(X3, sK6),
% 13.74/2.11 bind(X4, sK7),
% 13.74/2.11 bind(X5, sK7),
% 13.74/2.11 bind(X6, sK6),
% 13.74/2.11 bind(X7, sK7),
% 13.74/2.11 bind(X8, sK7),
% 13.74/2.11 bind(X9, sK7),
% 13.74/2.11 bind(X10, sK2(X3,X4,X5)),
% 13.74/2.11 bind(X11, sK6),
% 13.74/2.11 bind(X12, sK2(X3,X4,X5)),
% 13.74/2.11 bind(X13, sK7),
% 13.74/2.11 bind(X14, sK6),
% 13.74/2.11 bind(X15, sK6),
% 13.74/2.11 bind(X16, sK7),
% 13.74/2.11 bind(X17, sK7)
% 13.74/2.11 ],
% 13.74/2.11 [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])).
% 13.74/2.11
% 13.74/2.11 % SZS output end IncompleteProof
%------------------------------------------------------------------------------