TSTP Solution File: SET880+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET880+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 : n023.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:57 EDT 2022
% Result : Theorem 0.14s 0.37s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET880+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.36 % Computer : n023.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 : Sun Jul 10 04:19:10 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 = set_difference(singleton(sK4),singleton(sK5))).
% 0.14/0.37 cnf(c1, plain,
% 0.14/0.37 empty_set = set_difference(singleton(sK4),singleton(sK5)),
% 0.14/0.37 inference(start, [], [c0])).
% 0.14/0.37
% 0.14/0.37 cnf(c2, axiom,
% 0.14/0.37 in(X0,X1) | empty_set != set_difference(singleton(X0),X1)).
% 0.14/0.37 cnf(a0, assumption,
% 0.14/0.37 set_difference(singleton(X0),X1) = set_difference(singleton(sK4),singleton(sK5))).
% 0.14/0.37 cnf(a1, assumption,
% 0.14/0.37 empty_set = X2).
% 0.14/0.37 cnf(c3, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.37 cnf(c4, plain,
% 0.14/0.37 in(X0,X1),
% 0.14/0.37 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.37 cnf(c5, plain,
% 0.14/0.37 empty_set != X2,
% 0.14/0.37 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.37
% 0.14/0.37 cnf(a2, assumption,
% 0.14/0.37 empty_set = X2).
% 0.14/0.37 cnf(c6, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(reflexivity, [assumptions([a2])], [c5])).
% 0.14/0.37
% 0.14/0.37 cnf(c7, axiom,
% 0.14/0.37 X3 = X4 | ~in(X4,X5) | ~sP0(X3,X5)).
% 0.14/0.37 cnf(a3, assumption,
% 0.14/0.37 X0 = X4).
% 0.14/0.37 cnf(a4, assumption,
% 0.14/0.37 X1 = X5).
% 0.14/0.37 cnf(c8, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c7])).
% 0.14/0.37 cnf(c9, plain,
% 0.14/0.37 X3 = X4 | ~sP0(X3,X5),
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c7])).
% 0.14/0.37
% 0.14/0.37 cnf(c10, axiom,
% 0.14/0.37 sK4 != sK5).
% 0.14/0.37 cnf(a5, assumption,
% 0.14/0.37 sK5 = X3).
% 0.14/0.37 cnf(c11, plain,
% 0.14/0.37 ~sP0(X3,X5),
% 0.14/0.37 inference(strict_subterm_extension, [assumptions([a5])], [c9, c10])).
% 0.14/0.37 cnf(c12, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_subterm_extension, [assumptions([a5])], [c9, c10])).
% 0.14/0.37 cnf(c13, plain,
% 0.14/0.37 sK4 != X4,
% 0.14/0.37 inference(strict_subterm_extension, [assumptions([a5])], [c9, c10])).
% 0.14/0.37
% 0.14/0.37 cnf(a6, assumption,
% 0.14/0.37 sK4 = X4).
% 0.14/0.37 cnf(c14, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(reflexivity, [assumptions([a6])], [c13])).
% 0.14/0.37
% 0.14/0.37 cnf(c15, axiom,
% 0.14/0.37 sP0(X6,singleton(X6))).
% 0.14/0.37 cnf(a7, assumption,
% 0.14/0.37 X3 = X6).
% 0.14/0.37 cnf(a8, assumption,
% 0.14/0.37 X5 = singleton(X6)).
% 0.14/0.37 cnf(c16, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c15])).
% 0.14/0.37 cnf(c17, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c15])).
% 0.14/0.37
% 0.14/0.37 cnf(c18, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(constraint_solving, [
% 0.14/0.37 bind(X0, sK4),
% 0.14/0.37 bind(X1, singleton(sK5)),
% 0.14/0.37 bind(X2, empty_set),
% 0.14/0.37 bind(X3, sK5),
% 0.14/0.37 bind(X4, sK4),
% 0.14/0.37 bind(X5, singleton(sK5)),
% 0.14/0.37 bind(X6, sK5)
% 0.14/0.37 ],
% 0.14/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 0.14/0.37
% 0.14/0.37 % SZS output end IncompleteProof
%------------------------------------------------------------------------------