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