%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET064+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 : n024.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:14 EDT 2022 % Result : Theorem 0.19s 0.45s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET064+1 : TPTP v8.1.0. Bugfixed v5.4.0. % 0.07/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n024.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sun Jul 10 13:47:43 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.45 % SZS status Theorem % 0.19/0.45 % SZS output begin IncompleteProof % 0.19/0.45 cnf(c0, axiom, % 0.19/0.45 ~member(X0,sK9)). % 0.19/0.45 cnf(c1, plain, % 0.19/0.45 ~member(X0,sK9), % 0.19/0.45 inference(start, [], [c0])). % 0.19/0.45 % 0.19/0.45 cnf(c2, axiom, % 0.19/0.45 member(sK7(X1),X1) | ~sP1(X1)). % 0.19/0.45 cnf(a0, assumption, % 0.19/0.45 X0 = sK7(X1)). % 0.19/0.45 cnf(a1, assumption, % 0.19/0.45 sK9 = X1). % 0.19/0.45 cnf(c3, plain, % 0.19/0.45 $false, % 0.19/0.45 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.19/0.45 cnf(c4, plain, % 0.19/0.45 ~sP1(X1), % 0.19/0.45 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.19/0.45 % 0.19/0.45 cnf(c5, axiom, % 0.19/0.45 sP1(X2) | null_class = X2). % 0.19/0.45 cnf(a2, assumption, % 0.19/0.45 X1 = X2). % 0.19/0.45 cnf(c6, plain, % 0.19/0.45 $false, % 0.19/0.45 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])). % 0.19/0.45 cnf(c7, plain, % 0.19/0.45 null_class = X2, % 0.19/0.45 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])). % 0.19/0.45 % 0.19/0.45 cnf(c8, axiom, % 0.19/0.45 null_class != sK9). % 0.19/0.45 cnf(a3, assumption, % 0.19/0.45 sK9 = X2). % 0.19/0.45 cnf(a4, assumption, % 0.19/0.45 null_class = X3). % 0.19/0.45 cnf(c9, plain, % 0.19/0.45 $false, % 0.19/0.45 inference(strict_subterm_extension, [assumptions([a3, a4])], [c7, c8])). % 0.19/0.45 cnf(c10, plain, % 0.19/0.45 $false, % 0.19/0.45 inference(strict_subterm_extension, [assumptions([a3, a4])], [c7, c8])). % 0.19/0.45 cnf(c11, plain, % 0.19/0.45 null_class != X3, % 0.19/0.45 inference(strict_subterm_extension, [assumptions([a3, a4])], [c7, c8])). % 0.19/0.45 % 0.19/0.45 cnf(a5, assumption, % 0.19/0.45 null_class = X3). % 0.19/0.45 cnf(c12, plain, % 0.19/0.45 $false, % 0.19/0.45 inference(reflexivity, [assumptions([a5])], [c11])). % 0.19/0.45 % 0.19/0.45 cnf(c13, plain, % 0.19/0.45 $false, % 0.19/0.45 inference(constraint_solving, [ % 0.19/0.45 bind(X0, sK7(X1)), % 0.19/0.45 bind(X1, sK9), % 0.19/0.45 bind(X2, sK9), % 0.19/0.45 bind(X3, null_class) % 0.19/0.45 ], % 0.19/0.45 [a0, a1, a2, a3, a4, a5])). % 0.19/0.45 % 0.19/0.45 % SZS output end IncompleteProof %------------------------------------------------------------------------------