%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN920+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n007.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 : Thu Jul 21 08:14:11 EDT 2022 % Result : Theorem 0.12s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : SYN920+1 : TPTP v8.1.0. Released v3.1.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 : n007.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 : Mon Jul 11 21:23:18 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.34 % SZS status Theorem % 0.12/0.34 % SZS output begin IncompleteProof % 0.12/0.34 cnf(c0, axiom, % 0.12/0.34 h(X0) | ~f(X0) | g(X1) | ~f(X1)). % 0.12/0.34 cnf(c1, plain, % 0.12/0.34 h(X0) | ~f(X0) | g(X1) | ~f(X1), % 0.12/0.34 inference(start, [], [c0])). % 0.12/0.34 % 0.12/0.34 cnf(c2, axiom, % 0.12/0.34 g(X2) | ~h(X2) | ~f(X2)). % 0.12/0.34 cnf(a0, assumption, % 0.12/0.34 X0 = X2). % 0.12/0.34 cnf(c3, plain, % 0.12/0.34 ~f(X0) | g(X1) | ~f(X1), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.34 cnf(c4, plain, % 0.12/0.34 g(X2) | ~f(X2), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.34 % 0.12/0.34 cnf(c5, axiom, % 0.12/0.34 ~g(sK2) | sP0). % 0.12/0.34 cnf(a1, assumption, % 0.12/0.34 X2 = sK2). % 0.12/0.34 cnf(c6, plain, % 0.12/0.34 ~f(X2), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.12/0.34 cnf(c7, plain, % 0.12/0.34 sP0, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.12/0.34 % 0.12/0.34 cnf(c8, axiom, % 0.12/0.34 ~h(sK1) | ~sP0). % 0.12/0.34 cnf(c9, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [], [c7, c8])). % 0.12/0.34 cnf(c10, plain, % 0.12/0.34 ~h(sK1), % 0.12/0.34 inference(strict_predicate_extension, [], [c7, c8])). % 0.12/0.34 % 0.12/0.34 cnf(c11, axiom, % 0.12/0.34 h(X3) | ~g(X3) | ~f(X3)). % 0.12/0.34 cnf(a2, assumption, % 0.12/0.34 sK1 = X3). % 0.12/0.34 cnf(c12, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2])], [c10, c11])). % 0.12/0.34 cnf(c13, plain, % 0.12/0.34 ~g(X3) | ~f(X3), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2])], [c10, c11])). % 0.12/0.34 % 0.12/0.34 cnf(c14, axiom, % 0.12/0.34 g(sK1) | ~sP0). % 0.12/0.34 cnf(a3, assumption, % 0.12/0.34 X3 = sK1). % 0.12/0.34 cnf(c15, plain, % 0.12/0.34 ~f(X3), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3])], [c13, c14])). % 0.12/0.34 cnf(c16, plain, % 0.12/0.34 ~sP0, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3])], [c13, c14])). % 0.12/0.34 % 0.12/0.34 cnf(c17, plain, % 0.12/0.34 sP0). % 0.12/0.34 cnf(c18, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(predicate_reduction, [], [c16, c17])). % 0.12/0.34 % 0.12/0.34 cnf(c19, axiom, % 0.12/0.34 f(sK1) | ~sP0). % 0.12/0.34 cnf(a4, assumption, % 0.12/0.34 X3 = sK1). % 0.12/0.34 cnf(c20, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a4])], [c15, c19])). % 0.12/0.34 cnf(c21, plain, % 0.12/0.34 ~sP0, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a4])], [c15, c19])). % 0.12/0.34 % 0.12/0.34 cnf(c22, plain, % 0.12/0.34 sP0). % 0.12/0.34 cnf(c23, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(predicate_reduction, [], [c21, c22])). % 0.12/0.34 % 0.12/0.34 cnf(c24, axiom, % 0.12/0.34 f(sK2) | sP0). % 0.12/0.34 cnf(a5, assumption, % 0.12/0.34 X2 = sK2). % 0.12/0.34 cnf(c25, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a5])], [c6, c24])). % 0.12/0.34 cnf(c26, plain, % 0.12/0.34 sP0, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a5])], [c6, c24])). % 0.12/0.34 % 0.12/0.34 cnf(c27, plain, % 0.12/0.34 ~sP0). % 0.12/0.34 cnf(c28, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(predicate_reduction, [], [c26, c27])). % 0.12/0.34 % 0.12/0.34 cnf(c29, plain, % 0.12/0.34 f(X2)). % 0.12/0.34 cnf(a6, assumption, % 0.12/0.34 X0 = X2). % 0.12/0.34 cnf(c30, plain, % 0.12/0.34 g(X1) | ~f(X1), % 0.12/0.34 inference(predicate_reduction, [assumptions([a6])], [c3, c29])). % 0.12/0.34 % 0.12/0.34 cnf(c31, plain, % 0.12/0.34 ~g(X2)). % 0.12/0.34 cnf(a7, assumption, % 0.12/0.34 X1 = X2). % 0.12/0.34 cnf(c32, plain, % 0.12/0.34 ~f(X1), % 0.12/0.34 inference(predicate_reduction, [assumptions([a7])], [c30, c31])). % 0.12/0.34 % 0.12/0.34 cnf(c33, plain, % 0.12/0.34 f(X2)). % 0.12/0.34 cnf(a8, assumption, % 0.12/0.34 X1 = X2). % 0.12/0.34 cnf(c34, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(predicate_reduction, [assumptions([a8])], [c32, c33])). % 0.12/0.34 % 0.12/0.34 cnf(c35, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(constraint_solving, [ % 0.12/0.34 bind(X0, sK2), % 0.12/0.34 bind(X1, sK2), % 0.12/0.34 bind(X2, sK2), % 0.12/0.34 bind(X3, sK1) % 0.12/0.34 ], % 0.12/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8])). % 0.12/0.34 % 0.12/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------