TSTP Solution File: SET867+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET867+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 : n009.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:48:52 EDT 2022
% Result : Theorem 0.14s 0.37s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SET867+1 : TPTP v8.1.0. Released v3.2.0.
% 0.13/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.36 % Computer : n009.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jul 11 02:18:07 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.37 % SZS status Theorem
% 0.14/0.37 % SZS output begin IncompleteProof
% 0.14/0.37 cnf(c0, axiom,
% 0.14/0.37 empty_set != union(empty_set)).
% 0.14/0.37 cnf(c1, plain,
% 0.14/0.37 empty_set != union(empty_set),
% 0.14/0.37 inference(start, [], [c0])).
% 0.14/0.37
% 0.14/0.37 cnf(c2, axiom,
% 0.14/0.37 empty_set = X0 | in(sK2(X0),X0)).
% 0.14/0.37 cnf(a0, assumption,
% 0.14/0.37 union(empty_set) = X0).
% 0.14/0.37 cnf(c3, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.14/0.37 cnf(c4, plain,
% 0.14/0.37 in(sK2(X0),X0),
% 0.14/0.37 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.14/0.37 cnf(c5, plain,
% 0.14/0.37 empty_set != X1 | empty_set != X1,
% 0.14/0.37 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.14/0.37
% 0.14/0.37 cnf(a1, assumption,
% 0.14/0.37 empty_set = X1).
% 0.14/0.37 cnf(c6, plain,
% 0.14/0.37 empty_set != X1,
% 0.14/0.37 inference(reflexivity, [assumptions([a1])], [c5])).
% 0.14/0.37
% 0.14/0.37 cnf(a2, assumption,
% 0.14/0.37 empty_set = X1).
% 0.14/0.37 cnf(c7, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(reflexivity, [assumptions([a2])], [c6])).
% 0.14/0.37
% 0.14/0.37 cnf(c8, axiom,
% 0.14/0.37 sP0(X2,X3) | ~in(X3,X4) | ~sP1(X2,X4)).
% 0.14/0.37 cnf(a3, assumption,
% 0.14/0.37 sK2(X0) = X3).
% 0.14/0.37 cnf(a4, assumption,
% 0.14/0.37 X0 = X4).
% 0.14/0.37 cnf(c9, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])).
% 0.14/0.37 cnf(c10, plain,
% 0.14/0.37 sP0(X2,X3) | ~sP1(X2,X4),
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])).
% 0.14/0.37
% 0.14/0.37 cnf(c11, axiom,
% 0.14/0.37 in(sK4(X5,X6),X5) | ~sP0(X5,X6)).
% 0.14/0.37 cnf(a5, assumption,
% 0.14/0.37 X2 = X5).
% 0.14/0.37 cnf(a6, assumption,
% 0.14/0.37 X3 = X6).
% 0.14/0.37 cnf(c12, plain,
% 0.14/0.37 ~sP1(X2,X4),
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 0.14/0.37 cnf(c13, plain,
% 0.14/0.37 in(sK4(X5,X6),X5),
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 0.14/0.37
% 0.14/0.37 cnf(c14, axiom,
% 0.14/0.37 ~in(X7,empty_set)).
% 0.14/0.37 cnf(a7, assumption,
% 0.14/0.37 sK4(X5,X6) = X7).
% 0.14/0.37 cnf(a8, assumption,
% 0.14/0.37 X5 = empty_set).
% 0.14/0.37 cnf(c15, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])).
% 0.14/0.37 cnf(c16, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])).
% 0.14/0.37
% 0.14/0.37 cnf(c17, axiom,
% 0.14/0.37 sP1(X8,union(X8))).
% 0.14/0.37 cnf(a9, assumption,
% 0.14/0.37 X2 = X8).
% 0.14/0.37 cnf(a10, assumption,
% 0.14/0.37 X4 = union(X8)).
% 0.14/0.37 cnf(c18, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a9, a10])], [c12, c17])).
% 0.14/0.37 cnf(c19, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a9, a10])], [c12, c17])).
% 0.14/0.37
% 0.14/0.37 cnf(c20, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(constraint_solving, [
% 0.14/0.37 bind(X0, union(empty_set)),
% 0.14/0.37 bind(X1, empty_set),
% 0.14/0.37 bind(X2, empty_set),
% 0.14/0.37 bind(X3, sK2(X0)),
% 0.14/0.37 bind(X4, union(empty_set)),
% 0.14/0.37 bind(X5, empty_set),
% 0.14/0.37 bind(X6, sK2(X0)),
% 0.14/0.37 bind(X7, sK4(X5,X6)),
% 0.14/0.37 bind(X8, empty_set)
% 0.14/0.37 ],
% 0.14/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 0.14/0.37
% 0.14/0.37 % SZS output end IncompleteProof
%------------------------------------------------------------------------------