TSTP Solution File: SEU165+3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SEU165+3 : 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 : n007.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:42 EDT 2022
% Result : Theorem 0.21s 0.42s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU165+3 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 20 07:19:59 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.42 % SZS status Theorem
% 0.21/0.42 % SZS output begin IncompleteProof
% 0.21/0.42 cnf(c0, axiom,
% 0.21/0.42 ~in(sK3,sK5) | ~in(sK2,sK4) | ~in(unordered_pair(unordered_pair(sK2,sK3),singleton(sK2)),cartesian_product2(sK4,sK5))).
% 0.21/0.42 cnf(c1, plain,
% 0.21/0.42 ~in(sK3,sK5) | ~in(sK2,sK4) | ~in(unordered_pair(unordered_pair(sK2,sK3),singleton(sK2)),cartesian_product2(sK4,sK5)),
% 0.21/0.42 inference(start, [], [c0])).
% 0.21/0.42
% 0.21/0.42 cnf(c2, axiom,
% 0.21/0.42 in(X0,X1) | ~in(unordered_pair(unordered_pair(X2,X0),singleton(X2)),cartesian_product2(X3,X1))).
% 0.21/0.42 cnf(a0, assumption,
% 0.21/0.42 sK3 = X0).
% 0.21/0.42 cnf(a1, assumption,
% 0.21/0.42 sK5 = X1).
% 0.21/0.42 cnf(c3, plain,
% 0.21/0.42 ~in(sK2,sK4) | ~in(unordered_pair(unordered_pair(sK2,sK3),singleton(sK2)),cartesian_product2(sK4,sK5)),
% 0.21/0.42 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.21/0.42 cnf(c4, plain,
% 0.21/0.42 ~in(unordered_pair(unordered_pair(X2,X0),singleton(X2)),cartesian_product2(X3,X1)),
% 0.21/0.42 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.21/0.42
% 0.21/0.42 cnf(c5, axiom,
% 0.21/0.42 in(sK3,sK5) | in(unordered_pair(unordered_pair(sK2,sK3),singleton(sK2)),cartesian_product2(sK4,sK5))).
% 0.21/0.42 cnf(a2, assumption,
% 0.21/0.42 unordered_pair(unordered_pair(X2,X0),singleton(X2)) = unordered_pair(unordered_pair(sK2,sK3),singleton(sK2))).
% 0.21/0.42 cnf(a3, assumption,
% 0.21/0.42 cartesian_product2(X3,X1) = cartesian_product2(sK4,sK5)).
% 0.21/0.42 cnf(c6, plain,
% 0.21/0.42 $false,
% 0.21/0.42 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.21/0.42 cnf(c7, plain,
% 0.21/0.42 in(sK3,sK5),
% 0.21/0.42 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.21/0.42
% 0.21/0.42 cnf(c8, plain,
% 0.21/0.42 ~in(sK3,sK5)).
% 0.21/0.42 cnf(a4, assumption,
% 0.21/0.42 sK3 = sK3).
% 0.21/0.42 cnf(a5, assumption,
% 0.21/0.42 sK5 = sK5).
% 0.21/0.42 cnf(c9, plain,
% 0.21/0.42 $false,
% 0.21/0.42 inference(predicate_reduction, [assumptions([a4, a5])], [c7, c8])).
% 0.21/0.42
% 0.21/0.42 cnf(c10, axiom,
% 0.21/0.42 in(sK2,sK4) | in(unordered_pair(unordered_pair(sK2,sK3),singleton(sK2)),cartesian_product2(sK4,sK5))).
% 0.21/0.42 cnf(a6, assumption,
% 0.21/0.42 sK2 = sK2).
% 0.21/0.42 cnf(a7, assumption,
% 0.21/0.42 sK4 = sK4).
% 0.21/0.42 cnf(c11, plain,
% 0.21/0.42 ~in(unordered_pair(unordered_pair(sK2,sK3),singleton(sK2)),cartesian_product2(sK4,sK5)),
% 0.21/0.42 inference(strict_predicate_extension, [assumptions([a6, a7])], [c3, c10])).
% 0.21/0.42 cnf(c12, plain,
% 0.21/0.42 in(unordered_pair(unordered_pair(sK2,sK3),singleton(sK2)),cartesian_product2(sK4,sK5)),
% 0.21/0.42 inference(strict_predicate_extension, [assumptions([a6, a7])], [c3, c10])).
% 0.21/0.42
% 0.21/0.42 cnf(c13, axiom,
% 0.21/0.42 in(X4,X5) | ~in(unordered_pair(unordered_pair(X4,X6),singleton(X4)),cartesian_product2(X5,X7))).
% 0.21/0.42 cnf(a8, assumption,
% 0.21/0.42 unordered_pair(unordered_pair(sK2,sK3),singleton(sK2)) = unordered_pair(unordered_pair(X4,X6),singleton(X4))).
% 0.21/0.42 cnf(a9, assumption,
% 0.21/0.42 cartesian_product2(sK4,sK5) = cartesian_product2(X5,X7)).
% 0.21/0.42 cnf(c14, plain,
% 0.21/0.42 $false,
% 0.21/0.42 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c13])).
% 0.21/0.42 cnf(c15, plain,
% 0.21/0.42 in(X4,X5),
% 0.21/0.42 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c13])).
% 0.21/0.42
% 0.21/0.42 cnf(c16, plain,
% 0.21/0.42 ~in(sK2,sK4)).
% 0.21/0.42 cnf(a10, assumption,
% 0.21/0.42 X4 = sK2).
% 0.21/0.42 cnf(a11, assumption,
% 0.21/0.42 X5 = sK4).
% 0.21/0.42 cnf(c17, plain,
% 0.21/0.42 $false,
% 0.21/0.42 inference(predicate_reduction, [assumptions([a10, a11])], [c15, c16])).
% 0.21/0.42
% 0.21/0.42 cnf(c18, axiom,
% 0.21/0.42 in(unordered_pair(unordered_pair(X8,X9),singleton(X8)),cartesian_product2(X10,X11)) | ~in(X9,X11) | ~in(X8,X10)).
% 0.21/0.42 cnf(a12, assumption,
% 0.21/0.42 unordered_pair(unordered_pair(sK2,sK3),singleton(sK2)) = unordered_pair(unordered_pair(X8,X9),singleton(X8))).
% 0.21/0.42 cnf(a13, assumption,
% 0.21/0.42 cartesian_product2(sK4,sK5) = cartesian_product2(X10,X11)).
% 0.21/0.42 cnf(c19, plain,
% 0.21/0.42 $false,
% 0.21/0.42 inference(strict_predicate_extension, [assumptions([a12, a13])], [c11, c18])).
% 0.21/0.42 cnf(c20, plain,
% 0.21/0.42 ~in(X9,X11) | ~in(X8,X10),
% 0.21/0.42 inference(strict_predicate_extension, [assumptions([a12, a13])], [c11, c18])).
% 0.21/0.42
% 0.21/0.42 cnf(c21, plain,
% 0.21/0.42 in(sK3,sK5)).
% 0.21/0.42 cnf(a14, assumption,
% 0.21/0.42 X9 = sK3).
% 0.21/0.42 cnf(a15, assumption,
% 0.21/0.42 X11 = sK5).
% 0.21/0.42 cnf(c22, plain,
% 0.21/0.42 ~in(X8,X10),
% 0.21/0.42 inference(predicate_reduction, [assumptions([a14, a15])], [c20, c21])).
% 0.21/0.42
% 0.21/0.42 cnf(c23, plain,
% 0.21/0.42 in(sK2,sK4)).
% 0.21/0.42 cnf(a16, assumption,
% 0.21/0.42 X8 = sK2).
% 0.21/0.42 cnf(a17, assumption,
% 0.21/0.42 X10 = sK4).
% 0.21/0.42 cnf(c24, plain,
% 0.21/0.42 $false,
% 0.21/0.42 inference(predicate_reduction, [assumptions([a16, a17])], [c22, c23])).
% 0.21/0.42
% 0.21/0.42 cnf(c25, plain,
% 0.21/0.42 $false,
% 0.21/0.42 inference(constraint_solving, [
% 0.21/0.42 bind(X0, sK3),
% 0.21/0.42 bind(X1, sK5),
% 0.21/0.42 bind(X2, sK2),
% 0.21/0.42 bind(X3, sK4),
% 0.21/0.42 bind(X4, sK2),
% 0.21/0.42 bind(X5, sK4),
% 0.21/0.42 bind(X6, sK3),
% 0.21/0.42 bind(X7, sK5),
% 0.21/0.42 bind(X8, sK2),
% 0.21/0.42 bind(X9, sK3),
% 0.21/0.42 bind(X10, sK4),
% 0.21/0.42 bind(X11, sK5)
% 0.21/0.42 ],
% 0.21/0.42 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])).
% 0.21/0.42
% 0.21/0.42 % SZS output end IncompleteProof
%------------------------------------------------------------------------------