TSTP Solution File: SET908+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET908+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 : n020.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:49:07 EDT 2022
% Result : Theorem 0.12s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET908+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 19:20:28 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 % SZS status Theorem
% 0.12/0.35 % SZS output begin IncompleteProof
% 0.12/0.35 cnf(c0, axiom,
% 0.12/0.35 empty_set = set_union2(singleton(sK8),sK9)).
% 0.12/0.35 cnf(c1, plain,
% 0.12/0.35 empty_set = set_union2(singleton(sK8),sK9),
% 0.12/0.35 inference(start, [], [c0])).
% 0.12/0.35
% 0.12/0.35 cnf(c2, axiom,
% 0.12/0.35 sP2(X0,X1,set_union2(X0,X1))).
% 0.12/0.35 cnf(a0, assumption,
% 0.12/0.35 set_union2(X0,X1) = set_union2(singleton(sK8),sK9)).
% 0.12/0.35 cnf(a1, assumption,
% 0.12/0.35 empty_set = X2).
% 0.12/0.35 cnf(c3, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.35 cnf(c4, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.35 cnf(c5, plain,
% 0.12/0.35 sP2(X0,X1,X2),
% 0.12/0.35 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.35
% 0.12/0.35 cnf(c6, axiom,
% 0.12/0.35 in(X3,X4) | ~sP1(X5,X3,X6) | ~sP2(X6,X5,X4)).
% 0.12/0.35 cnf(a2, assumption,
% 0.12/0.35 X0 = X6).
% 0.12/0.35 cnf(a3, assumption,
% 0.12/0.35 X1 = X5).
% 0.12/0.35 cnf(a4, assumption,
% 0.12/0.35 X2 = X4).
% 0.12/0.35 cnf(c7, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c5, c6])).
% 0.12/0.35 cnf(c8, plain,
% 0.12/0.35 in(X3,X4) | ~sP1(X5,X3,X6),
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c5, c6])).
% 0.12/0.35
% 0.12/0.35 cnf(c9, axiom,
% 0.12/0.35 ~in(X7,empty_set)).
% 0.12/0.35 cnf(a5, assumption,
% 0.12/0.35 X3 = X7).
% 0.12/0.35 cnf(a6, assumption,
% 0.12/0.35 X4 = empty_set).
% 0.12/0.35 cnf(c10, plain,
% 0.12/0.35 ~sP1(X5,X3,X6),
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a5, a6])], [c8, c9])).
% 0.12/0.35 cnf(c11, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a5, a6])], [c8, c9])).
% 0.12/0.35
% 0.12/0.35 cnf(c12, axiom,
% 0.12/0.35 sP1(X8,X9,X10) | ~in(X9,X10)).
% 0.12/0.35 cnf(a7, assumption,
% 0.12/0.35 X5 = X8).
% 0.12/0.35 cnf(a8, assumption,
% 0.12/0.35 X3 = X9).
% 0.12/0.35 cnf(a9, assumption,
% 0.12/0.35 X6 = X10).
% 0.12/0.35 cnf(c13, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c10, c12])).
% 0.12/0.35 cnf(c14, plain,
% 0.12/0.35 ~in(X9,X10),
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c10, c12])).
% 0.12/0.35
% 0.12/0.35 cnf(c15, axiom,
% 0.12/0.35 in(X11,X12) | ~sP0(X11,X12)).
% 0.12/0.35 cnf(a10, assumption,
% 0.12/0.35 X9 = X11).
% 0.12/0.35 cnf(a11, assumption,
% 0.12/0.35 X10 = X12).
% 0.12/0.35 cnf(c16, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a10, a11])], [c14, c15])).
% 0.12/0.35 cnf(c17, plain,
% 0.12/0.35 ~sP0(X11,X12),
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a10, a11])], [c14, c15])).
% 0.12/0.35
% 0.12/0.35 cnf(c18, axiom,
% 0.12/0.35 sP0(X13,singleton(X13))).
% 0.12/0.35 cnf(a12, assumption,
% 0.12/0.35 X11 = X13).
% 0.12/0.35 cnf(a13, assumption,
% 0.12/0.35 X12 = singleton(X13)).
% 0.12/0.35 cnf(c19, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c18])).
% 0.12/0.35 cnf(c20, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c18])).
% 0.12/0.35
% 0.12/0.35 cnf(c21, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(constraint_solving, [
% 0.12/0.35 bind(X0, singleton(sK8)),
% 0.12/0.35 bind(X1, sK9),
% 0.12/0.35 bind(X2, empty_set),
% 0.12/0.35 bind(X3, sK8),
% 0.12/0.35 bind(X4, empty_set),
% 0.12/0.35 bind(X5, sK9),
% 0.12/0.35 bind(X6, singleton(sK8)),
% 0.12/0.35 bind(X7, sK8),
% 0.12/0.35 bind(X8, sK9),
% 0.12/0.35 bind(X9, sK8),
% 0.12/0.35 bind(X10, singleton(sK8)),
% 0.12/0.35 bind(X11, sK8),
% 0.12/0.35 bind(X12, singleton(sK8)),
% 0.12/0.35 bind(X13, sK8)
% 0.12/0.35 ],
% 0.12/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 0.12/0.35
% 0.12/0.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------