%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET065+1 : TPTP v8.1.0. Bugfixed v5.4.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n005.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:43:15 EDT 2022 % Result : Theorem 0.21s 0.42s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET065+1 : TPTP v8.1.0. Bugfixed v5.4.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.33 % Computer : n005.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.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Mon Jul 11 00:00:52 EDT 2022 % 0.13/0.34 % CPUTime : % 0.21/0.42 % SZS status Theorem % 0.21/0.42 % SZS output begin IncompleteProof % 0.21/0.42 cnf(c0, axiom, % 0.21/0.42 ~member(null_class,universal_class)). % 0.21/0.42 cnf(c1, plain, % 0.21/0.42 ~member(null_class,universal_class), % 0.21/0.42 inference(start, [], [c0])). % 0.21/0.42 % 0.21/0.42 cnf(c2, axiom, % 0.21/0.42 member(X0,X1) | ~member(X0,X2) | ~subclass(X2,X1)). % 0.21/0.42 cnf(a0, assumption, % 0.21/0.42 null_class = X0). % 0.21/0.42 cnf(a1, assumption, % 0.21/0.42 universal_class = X1). % 0.21/0.42 cnf(c3, plain, % 0.21/0.42 $false, % 0.21/0.42 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.21/0.42 cnf(c4, plain, % 0.21/0.42 ~member(X0,X2) | ~subclass(X2,X1), % 0.21/0.42 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.21/0.42 % 0.21/0.42 cnf(c5, axiom, % 0.21/0.42 member(null_class,X3) | ~inductive(X3)). % 0.21/0.42 cnf(a2, assumption, % 0.21/0.42 X0 = null_class). % 0.21/0.42 cnf(a3, assumption, % 0.21/0.42 X2 = X3). % 0.21/0.42 cnf(c6, plain, % 0.21/0.42 ~subclass(X2,X1), % 0.21/0.42 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.21/0.42 cnf(c7, plain, % 0.21/0.42 ~inductive(X3), % 0.21/0.42 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.21/0.42 % 0.21/0.42 cnf(c8, axiom, % 0.21/0.42 inductive(sK3)). % 0.21/0.42 cnf(a4, assumption, % 0.21/0.42 X3 = sK3). % 0.21/0.42 cnf(c9, plain, % 0.21/0.42 $false, % 0.21/0.42 inference(strict_predicate_extension, [assumptions([a4])], [c7, c8])). % 0.21/0.42 cnf(c10, plain, % 0.21/0.42 $false, % 0.21/0.42 inference(strict_predicate_extension, [assumptions([a4])], [c7, c8])). % 0.21/0.42 % 0.21/0.42 cnf(c11, axiom, % 0.21/0.42 subclass(X4,universal_class)). % 0.21/0.42 cnf(a5, assumption, % 0.21/0.42 X2 = X4). % 0.21/0.42 cnf(a6, assumption, % 0.21/0.42 X1 = universal_class). % 0.21/0.42 cnf(c12, plain, % 0.21/0.42 $false, % 0.21/0.42 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c11])). % 0.21/0.42 cnf(c13, plain, % 0.21/0.42 $false, % 0.21/0.42 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c11])). % 0.21/0.42 % 0.21/0.42 cnf(c14, plain, % 0.21/0.42 $false, % 0.21/0.42 inference(constraint_solving, [ % 0.21/0.42 bind(X0, null_class), % 0.21/0.42 bind(X1, universal_class), % 0.21/0.42 bind(X2, sK3), % 0.21/0.42 bind(X3, sK3), % 0.21/0.42 bind(X4, sK3) % 0.21/0.42 ], % 0.21/0.42 [a0, a1, a2, a3, a4, a5, a6])). % 0.21/0.42 % 0.21/0.42 % SZS output end IncompleteProof %------------------------------------------------------------------------------