%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET910+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 : n028.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:08 EDT 2022 % Result : Theorem 0.13s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SET910+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.13/0.33 % Computer : n028.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.34 % DateTime : Mon Jul 11 02:10:43 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.34 % SZS status Theorem % 0.13/0.34 % SZS output begin IncompleteProof % 0.13/0.34 cnf(c0, axiom, % 0.13/0.34 singleton(sK3) = set_intersection2(sK2,singleton(sK3))). % 0.13/0.34 cnf(c1, plain, % 0.13/0.34 singleton(sK3) = set_intersection2(sK2,singleton(sK3)), % 0.13/0.34 inference(start, [], [c0])). % 0.13/0.34 % 0.13/0.34 cnf(c2, axiom, % 0.13/0.34 in(X0,X1) | singleton(X0) != set_intersection2(X1,singleton(X0))). % 0.13/0.34 cnf(a0, assumption, % 0.13/0.34 set_intersection2(X1,singleton(X0)) = set_intersection2(sK2,singleton(sK3))). % 0.13/0.34 cnf(a1, assumption, % 0.13/0.34 singleton(sK3) = X2). % 0.13/0.34 cnf(c3, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.34 cnf(c4, plain, % 0.13/0.34 in(X0,X1), % 0.13/0.34 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.34 cnf(c5, plain, % 0.13/0.34 singleton(X0) != X2, % 0.13/0.34 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.34 % 0.13/0.34 cnf(a2, assumption, % 0.13/0.34 singleton(X0) = X2). % 0.13/0.34 cnf(c6, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(reflexivity, [assumptions([a2])], [c5])). % 0.13/0.34 % 0.13/0.34 cnf(c7, axiom, % 0.13/0.34 ~in(sK3,sK2)). % 0.13/0.34 cnf(a3, assumption, % 0.13/0.34 X0 = sK3). % 0.13/0.34 cnf(a4, assumption, % 0.13/0.34 X1 = sK2). % 0.13/0.34 cnf(c8, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c7])). % 0.13/0.34 cnf(c9, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c7])). % 0.13/0.34 % 0.13/0.34 cnf(c10, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(constraint_solving, [ % 0.13/0.34 bind(X0, sK3), % 0.13/0.34 bind(X1, sK2), % 0.13/0.34 bind(X2, singleton(sK3)) % 0.13/0.34 ], % 0.13/0.34 [a0, a1, a2, a3, a4])). % 0.13/0.34 % 0.13/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------