TSTP Solution File: SEU160+3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SEU160+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 : n004.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:38 EDT 2022
% Result : Theorem 0.12s 0.39s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.11 % Problem : SEU160+3 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n004.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 Jun 19 07:49:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.39 % SZS status Theorem
% 0.12/0.39 % SZS output begin IncompleteProof
% 0.12/0.39 cnf(c0, axiom,
% 0.12/0.39 sK2 = singleton(sK3) | empty_set = sK2 | subset(sK2,singleton(sK3))).
% 0.12/0.39 cnf(c1, plain,
% 0.12/0.39 sK2 = singleton(sK3) | empty_set = sK2 | subset(sK2,singleton(sK3)),
% 0.12/0.39 inference(start, [], [c0])).
% 0.12/0.39
% 0.12/0.39 cnf(c2, axiom,
% 0.12/0.39 sK2 != singleton(sK3) | ~subset(sK2,singleton(sK3))).
% 0.12/0.39 cnf(a0, assumption,
% 0.12/0.39 singleton(sK3) = singleton(sK3)).
% 0.12/0.39 cnf(a1, assumption,
% 0.12/0.39 sK2 = X0).
% 0.12/0.39 cnf(c3, plain,
% 0.12/0.39 empty_set = sK2 | subset(sK2,singleton(sK3)),
% 0.12/0.39 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.39 cnf(c4, plain,
% 0.12/0.39 sK2 != singleton(sK3),
% 0.12/0.39 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.39 cnf(c5, plain,
% 0.12/0.39 ~subset(sK2,X0),
% 0.12/0.39 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.39
% 0.12/0.39 cnf(c6, axiom,
% 0.12/0.39 subset(X1,X1)).
% 0.12/0.39 cnf(a2, assumption,
% 0.12/0.39 sK2 = X1).
% 0.12/0.39 cnf(a3, assumption,
% 0.12/0.39 X0 = X1).
% 0.12/0.39 cnf(c7, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])).
% 0.12/0.39 cnf(c8, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])).
% 0.12/0.39
% 0.12/0.39 cnf(c9, plain,
% 0.12/0.39 sK2 = singleton(sK3)).
% 0.12/0.39 cnf(a4, assumption,
% 0.12/0.39 singleton(sK3) = singleton(sK3)).
% 0.12/0.39 cnf(a5, assumption,
% 0.12/0.39 sK2 = X2).
% 0.12/0.39 cnf(c10, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(equality_reduction, [assumptions([a4, a5])], [c4, c9])).
% 0.12/0.39 cnf(c11, plain,
% 0.12/0.39 sK2 != X2,
% 0.12/0.39 inference(equality_reduction, [assumptions([a4, a5])], [c4, c9])).
% 0.12/0.39
% 0.12/0.39 cnf(a6, assumption,
% 0.12/0.39 sK2 = X2).
% 0.12/0.39 cnf(c12, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(reflexivity, [assumptions([a6])], [c11])).
% 0.12/0.39
% 0.12/0.39 cnf(c13, axiom,
% 0.12/0.39 empty_set != sK2 | ~subset(sK2,singleton(sK3))).
% 0.12/0.39 cnf(a7, assumption,
% 0.12/0.39 sK2 = sK2).
% 0.12/0.39 cnf(a8, assumption,
% 0.12/0.39 empty_set = X3).
% 0.12/0.39 cnf(c14, plain,
% 0.12/0.39 subset(sK2,singleton(sK3)),
% 0.12/0.39 inference(strict_subterm_extension, [assumptions([a7, a8])], [c3, c13])).
% 0.12/0.39 cnf(c15, plain,
% 0.12/0.39 ~subset(sK2,singleton(sK3)),
% 0.12/0.39 inference(strict_subterm_extension, [assumptions([a7, a8])], [c3, c13])).
% 0.12/0.39 cnf(c16, plain,
% 0.12/0.39 empty_set != X3,
% 0.12/0.39 inference(strict_subterm_extension, [assumptions([a7, a8])], [c3, c13])).
% 0.12/0.39
% 0.12/0.39 cnf(a9, assumption,
% 0.12/0.39 empty_set = X3).
% 0.12/0.39 cnf(c17, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(reflexivity, [assumptions([a9])], [c16])).
% 0.12/0.39
% 0.12/0.39 cnf(c18, plain,
% 0.12/0.39 empty_set = sK2).
% 0.12/0.39 cnf(a10, assumption,
% 0.12/0.39 sK2 = sK2).
% 0.12/0.39 cnf(a11, assumption,
% 0.12/0.39 empty_set = X4).
% 0.12/0.39 cnf(c19, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(equality_reduction, [assumptions([a10, a11])], [c15, c18])).
% 0.12/0.39 cnf(c20, plain,
% 0.12/0.39 ~subset(X4,singleton(sK3)),
% 0.12/0.39 inference(equality_reduction, [assumptions([a10, a11])], [c15, c18])).
% 0.12/0.39
% 0.12/0.39 cnf(c21, axiom,
% 0.12/0.39 subset(empty_set,singleton(X5))).
% 0.12/0.39 cnf(a12, assumption,
% 0.12/0.39 X4 = empty_set).
% 0.12/0.39 cnf(a13, assumption,
% 0.12/0.39 singleton(sK3) = singleton(X5)).
% 0.12/0.39 cnf(c22, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(strict_predicate_extension, [assumptions([a12, a13])], [c20, c21])).
% 0.12/0.39 cnf(c23, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(strict_predicate_extension, [assumptions([a12, a13])], [c20, c21])).
% 0.12/0.39
% 0.12/0.39 cnf(c24, axiom,
% 0.12/0.39 singleton(X6) = X7 | empty_set = X7 | ~subset(X7,singleton(X6))).
% 0.12/0.39 cnf(a14, assumption,
% 0.12/0.39 sK2 = X7).
% 0.12/0.39 cnf(a15, assumption,
% 0.12/0.39 singleton(sK3) = singleton(X6)).
% 0.12/0.39 cnf(c25, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(strict_predicate_extension, [assumptions([a14, a15])], [c14, c24])).
% 0.12/0.39 cnf(c26, plain,
% 0.12/0.39 singleton(X6) = X7 | empty_set = X7,
% 0.12/0.39 inference(strict_predicate_extension, [assumptions([a14, a15])], [c14, c24])).
% 0.12/0.39
% 0.12/0.39 cnf(c27, plain,
% 0.12/0.39 sK2 != singleton(sK3)).
% 0.12/0.39 cnf(a16, assumption,
% 0.12/0.39 singleton(sK3) = singleton(X6)).
% 0.12/0.39 cnf(c28, plain,
% 0.12/0.39 empty_set = X7,
% 0.12/0.39 inference(subterm_reduction, [assumptions([a16])], [c26, c27])).
% 0.12/0.39 cnf(c29, plain,
% 0.12/0.39 sK2 != X7,
% 0.12/0.39 inference(subterm_reduction, [assumptions([a16])], [c26, c27])).
% 0.12/0.39
% 0.12/0.39 cnf(a17, assumption,
% 0.12/0.39 sK2 = X7).
% 0.12/0.39 cnf(c30, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(reflexivity, [assumptions([a17])], [c29])).
% 0.12/0.39
% 0.12/0.39 cnf(c31, plain,
% 0.12/0.39 empty_set != sK2).
% 0.12/0.39 cnf(a18, assumption,
% 0.12/0.39 sK2 = X7).
% 0.12/0.39 cnf(a19, assumption,
% 0.12/0.39 empty_set = X8).
% 0.12/0.39 cnf(c32, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(subterm_reduction, [assumptions([a18, a19])], [c28, c31])).
% 0.12/0.39 cnf(c33, plain,
% 0.12/0.39 empty_set != X8,
% 0.12/0.39 inference(subterm_reduction, [assumptions([a18, a19])], [c28, c31])).
% 0.12/0.39
% 0.12/0.39 cnf(a20, assumption,
% 0.12/0.39 empty_set = X8).
% 0.12/0.39 cnf(c34, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(reflexivity, [assumptions([a20])], [c33])).
% 0.12/0.39
% 0.12/0.39 cnf(c35, plain,
% 0.12/0.39 $false,
% 0.12/0.39 inference(constraint_solving, [
% 0.12/0.39 bind(X0, sK2),
% 0.12/0.39 bind(X1, sK2),
% 0.12/0.39 bind(X2, sK2),
% 0.12/0.39 bind(X3, empty_set),
% 0.12/0.39 bind(X4, empty_set),
% 0.12/0.39 bind(X5, sK3),
% 0.12/0.39 bind(X6, sK3),
% 0.12/0.39 bind(X7, sK2),
% 0.12/0.39 bind(X8, empty_set)
% 0.12/0.39 ],
% 0.12/0.39 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20])).
% 0.12/0.39
% 0.12/0.39 % SZS output end IncompleteProof
%------------------------------------------------------------------------------