TSTP Solution File: SEU162+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SEU162+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 : 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 : Tue Jul 19 11:53:39 EDT 2022
% Result : Theorem 0.11s 0.33s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SEU162+1 : TPTP v8.1.0. Released v3.3.0.
% 0.02/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.11/0.32 % Computer : n024.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sun Jun 19 05:11:17 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.11/0.33 % SZS status Theorem
% 0.11/0.33 % SZS output begin IncompleteProof
% 0.11/0.33 cnf(c0, axiom,
% 0.11/0.33 ~in(sK1,sK0) | sK0 = set_difference(sK0,singleton(sK1))).
% 0.11/0.33 cnf(c1, plain,
% 0.11/0.33 ~in(sK1,sK0) | sK0 = set_difference(sK0,singleton(sK1)),
% 0.11/0.33 inference(start, [], [c0])).
% 0.11/0.33
% 0.11/0.33 cnf(c2, axiom,
% 0.11/0.33 disjoint(singleton(X0),X1) | in(X0,X1)).
% 0.11/0.33 cnf(a0, assumption,
% 0.11/0.33 sK1 = X0).
% 0.11/0.33 cnf(a1, assumption,
% 0.11/0.33 sK0 = X1).
% 0.11/0.33 cnf(c3, plain,
% 0.11/0.33 sK0 = set_difference(sK0,singleton(sK1)),
% 0.11/0.33 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.11/0.33 cnf(c4, plain,
% 0.11/0.33 disjoint(singleton(X0),X1),
% 0.11/0.33 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.11/0.33
% 0.11/0.33 cnf(c5, axiom,
% 0.11/0.33 disjoint(X2,X3) | ~disjoint(X3,X2)).
% 0.11/0.33 cnf(a2, assumption,
% 0.11/0.33 singleton(X0) = X3).
% 0.11/0.33 cnf(a3, assumption,
% 0.11/0.33 X1 = X2).
% 0.11/0.33 cnf(c6, plain,
% 0.11/0.33 $false,
% 0.11/0.33 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.11/0.33 cnf(c7, plain,
% 0.11/0.33 disjoint(X2,X3),
% 0.11/0.33 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.11/0.33
% 0.11/0.33 cnf(c8, axiom,
% 0.11/0.33 set_difference(X4,X5) = X4 | ~disjoint(X4,X5)).
% 0.11/0.33 cnf(a4, assumption,
% 0.11/0.33 X2 = X4).
% 0.11/0.33 cnf(a5, assumption,
% 0.11/0.33 X3 = X5).
% 0.11/0.33 cnf(c9, plain,
% 0.11/0.33 $false,
% 0.11/0.33 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.11/0.33 cnf(c10, plain,
% 0.11/0.33 set_difference(X4,X5) = X4,
% 0.11/0.33 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.11/0.33
% 0.11/0.33 cnf(c11, axiom,
% 0.11/0.33 in(sK1,sK0) | sK0 != set_difference(sK0,singleton(sK1))).
% 0.11/0.33 cnf(a6, assumption,
% 0.11/0.33 set_difference(sK0,singleton(sK1)) = set_difference(X4,X5)).
% 0.11/0.33 cnf(c12, plain,
% 0.11/0.33 $false,
% 0.11/0.33 inference(strict_subterm_extension, [assumptions([a6])], [c10, c11])).
% 0.11/0.33 cnf(c13, plain,
% 0.11/0.33 in(sK1,sK0),
% 0.11/0.33 inference(strict_subterm_extension, [assumptions([a6])], [c10, c11])).
% 0.11/0.33 cnf(c14, plain,
% 0.11/0.33 sK0 != X4,
% 0.11/0.33 inference(strict_subterm_extension, [assumptions([a6])], [c10, c11])).
% 0.11/0.33
% 0.11/0.33 cnf(a7, assumption,
% 0.11/0.33 sK0 = X4).
% 0.11/0.33 cnf(c15, plain,
% 0.11/0.33 $false,
% 0.11/0.33 inference(reflexivity, [assumptions([a7])], [c14])).
% 0.11/0.33
% 0.11/0.33 cnf(c16, plain,
% 0.11/0.33 ~in(sK1,sK0)).
% 0.11/0.33 cnf(a8, assumption,
% 0.11/0.33 sK1 = sK1).
% 0.11/0.33 cnf(a9, assumption,
% 0.11/0.33 sK0 = sK0).
% 0.11/0.33 cnf(c17, plain,
% 0.11/0.33 $false,
% 0.11/0.33 inference(predicate_reduction, [assumptions([a8, a9])], [c13, c16])).
% 0.11/0.33
% 0.11/0.33 cnf(c18, axiom,
% 0.11/0.33 disjoint(X6,X7) | set_difference(X6,X7) != X6).
% 0.11/0.33 cnf(a10, assumption,
% 0.11/0.33 set_difference(X6,X7) = set_difference(sK0,singleton(sK1))).
% 0.11/0.33 cnf(a11, assumption,
% 0.11/0.33 sK0 = X8).
% 0.11/0.33 cnf(c19, plain,
% 0.11/0.33 $false,
% 0.11/0.33 inference(strict_subterm_extension, [assumptions([a10, a11])], [c3, c18])).
% 0.11/0.33 cnf(c20, plain,
% 0.11/0.33 disjoint(X6,X7),
% 0.11/0.33 inference(strict_subterm_extension, [assumptions([a10, a11])], [c3, c18])).
% 0.11/0.33 cnf(c21, plain,
% 0.11/0.33 X8 != X6,
% 0.11/0.33 inference(strict_subterm_extension, [assumptions([a10, a11])], [c3, c18])).
% 0.11/0.33
% 0.11/0.33 cnf(a12, assumption,
% 0.11/0.33 X8 = X6).
% 0.11/0.33 cnf(c22, plain,
% 0.11/0.33 $false,
% 0.11/0.33 inference(reflexivity, [assumptions([a12])], [c21])).
% 0.11/0.33
% 0.11/0.33 cnf(c23, axiom,
% 0.11/0.33 disjoint(X9,X10) | ~disjoint(X10,X9)).
% 0.11/0.33 cnf(a13, assumption,
% 0.11/0.33 X6 = X10).
% 0.11/0.33 cnf(a14, assumption,
% 0.11/0.33 X7 = X9).
% 0.11/0.33 cnf(c24, plain,
% 0.11/0.33 $false,
% 0.11/0.33 inference(strict_predicate_extension, [assumptions([a13, a14])], [c20, c23])).
% 0.11/0.33 cnf(c25, plain,
% 0.11/0.33 disjoint(X9,X10),
% 0.11/0.33 inference(strict_predicate_extension, [assumptions([a13, a14])], [c20, c23])).
% 0.11/0.33
% 0.11/0.33 cnf(c26, axiom,
% 0.11/0.33 ~in(X11,X12) | ~disjoint(singleton(X11),X12)).
% 0.11/0.33 cnf(a15, assumption,
% 0.11/0.33 X9 = singleton(X11)).
% 0.11/0.33 cnf(a16, assumption,
% 0.11/0.33 X10 = X12).
% 0.11/0.33 cnf(c27, plain,
% 0.11/0.33 $false,
% 0.11/0.33 inference(strict_predicate_extension, [assumptions([a15, a16])], [c25, c26])).
% 0.11/0.33 cnf(c28, plain,
% 0.11/0.33 ~in(X11,X12),
% 0.11/0.33 inference(strict_predicate_extension, [assumptions([a15, a16])], [c25, c26])).
% 0.11/0.33
% 0.11/0.33 cnf(c29, plain,
% 0.11/0.33 in(sK1,sK0)).
% 0.11/0.33 cnf(a17, assumption,
% 0.11/0.33 X11 = sK1).
% 0.11/0.33 cnf(a18, assumption,
% 0.11/0.33 X12 = sK0).
% 0.11/0.33 cnf(c30, plain,
% 0.11/0.33 $false,
% 0.11/0.33 inference(predicate_reduction, [assumptions([a17, a18])], [c28, c29])).
% 0.11/0.33
% 0.11/0.33 cnf(c31, plain,
% 0.11/0.33 $false,
% 0.11/0.33 inference(constraint_solving, [
% 0.11/0.33 bind(X0, sK1),
% 0.11/0.33 bind(X1, sK0),
% 0.11/0.33 bind(X2, sK0),
% 0.11/0.33 bind(X3, singleton(X0)),
% 0.11/0.33 bind(X4, sK0),
% 0.11/0.33 bind(X5, singleton(X0)),
% 0.11/0.33 bind(X6, sK0),
% 0.11/0.33 bind(X7, singleton(sK1)),
% 0.11/0.33 bind(X8, sK0),
% 0.11/0.33 bind(X9, singleton(sK1)),
% 0.11/0.33 bind(X10, sK0),
% 0.11/0.33 bind(X11, sK1),
% 0.11/0.33 bind(X12, sK0)
% 0.11/0.33 ],
% 0.11/0.33 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18])).
% 0.11/0.33
% 0.11/0.33 % SZS output end IncompleteProof
%------------------------------------------------------------------------------