%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWC391-1 : TPTP v8.1.0. Released v2.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 : n029.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 21:08:35 EDT 2022 % Result : Unsatisfiable 0.20s 0.49s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : SWC391-1 : TPTP v8.1.0. Released v2.4.0. % 0.10/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n029.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 Jun 12 19:28:39 EDT 2022 % 0.12/0.33 % CPUTime : % 0.20/0.49 % SZS status Unsatisfiable % 0.20/0.49 % SZS output begin IncompleteProof % 0.20/0.49 cnf(c0, axiom, % 0.20/0.49 sk2 = sk4). % 0.20/0.49 cnf(c1, plain, % 0.20/0.49 sk2 = sk4, % 0.20/0.49 inference(start, [], [c0])). % 0.20/0.49 % 0.20/0.49 cnf(c2, axiom, % 0.20/0.49 sk3 = sk4). % 0.20/0.49 cnf(a0, assumption, % 0.20/0.49 sk4 = sk4). % 0.20/0.49 cnf(a1, assumption, % 0.20/0.49 sk2 = X0). % 0.20/0.49 cnf(c3, plain, % 0.20/0.49 $false, % 0.20/0.49 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.49 cnf(c4, plain, % 0.20/0.49 $false, % 0.20/0.49 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.49 cnf(c5, plain, % 0.20/0.49 sk3 = X0, % 0.20/0.49 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.49 % 0.20/0.49 cnf(c6, axiom, % 0.20/0.49 sk1 = sk3). % 0.20/0.49 cnf(a2, assumption, % 0.20/0.49 sk3 = sk3). % 0.20/0.49 cnf(c7, plain, % 0.20/0.49 $false, % 0.20/0.49 inference(strict_subterm_extension, [assumptions([a2])], [c5, c6])). % 0.20/0.49 cnf(c8, plain, % 0.20/0.49 $false, % 0.20/0.49 inference(strict_subterm_extension, [assumptions([a2])], [c5, c6])). % 0.20/0.49 cnf(c9, plain, % 0.20/0.49 sk1 = X0, % 0.20/0.49 inference(strict_subterm_extension, [assumptions([a2])], [c5, c6])). % 0.20/0.49 % 0.20/0.49 cnf(c10, axiom, % 0.20/0.49 ~memberP(sk2,sk5)). % 0.20/0.49 cnf(a3, assumption, % 0.20/0.49 sk2 = X0). % 0.20/0.49 cnf(a4, assumption, % 0.20/0.49 sk1 = X1). % 0.20/0.49 cnf(c11, plain, % 0.20/0.49 $false, % 0.20/0.49 inference(strict_subterm_extension, [assumptions([a3, a4])], [c9, c10])). % 0.20/0.49 cnf(c12, plain, % 0.20/0.49 $false, % 0.20/0.49 inference(strict_subterm_extension, [assumptions([a3, a4])], [c9, c10])). % 0.20/0.49 cnf(c13, plain, % 0.20/0.49 ~memberP(X1,sk5), % 0.20/0.49 inference(strict_subterm_extension, [assumptions([a3, a4])], [c9, c10])). % 0.20/0.49 % 0.20/0.49 cnf(c14, axiom, % 0.20/0.49 memberP(sk1,sk5)). % 0.20/0.49 cnf(a5, assumption, % 0.20/0.49 X1 = sk1). % 0.20/0.49 cnf(a6, assumption, % 0.20/0.49 sk5 = sk5). % 0.20/0.49 cnf(c15, plain, % 0.20/0.49 $false, % 0.20/0.49 inference(strict_predicate_extension, [assumptions([a5, a6])], [c13, c14])). % 0.20/0.49 cnf(c16, plain, % 0.20/0.49 $false, % 0.20/0.49 inference(strict_predicate_extension, [assumptions([a5, a6])], [c13, c14])). % 0.20/0.49 % 0.20/0.49 cnf(c17, plain, % 0.20/0.49 $false, % 0.20/0.49 inference(constraint_solving, [ % 0.20/0.49 bind(X0, sk2), % 0.20/0.49 bind(X1, sk1) % 0.20/0.49 ], % 0.20/0.49 [a0, a1, a2, a3, a4, a5, a6])). % 0.20/0.49 % 0.20/0.49 % SZS output end IncompleteProof %------------------------------------------------------------------------------