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