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