%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN724+1 : TPTP v8.1.0. Released v2.5.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n025.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:13:02 EDT 2022 % Result : Theorem 0.13s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : SYN724+1 : TPTP v8.1.0. Released v2.5.0. % 0.10/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.33 % Computer : n025.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.33 % DateTime : Tue Jul 12 02:01:33 EDT 2022 % 0.13/0.33 % 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 sP2 | sP1). % 0.13/0.34 cnf(c1, plain, % 0.13/0.34 sP2 | sP1, % 0.13/0.34 inference(start, [], [c0])). % 0.13/0.34 % 0.13/0.34 cnf(c2, axiom, % 0.13/0.34 ~sP2 | ~sP1). % 0.13/0.34 cnf(c3, plain, % 0.13/0.34 sP1, % 0.13/0.34 inference(strict_predicate_extension, [], [c1, c2])). % 0.13/0.34 cnf(c4, plain, % 0.13/0.34 ~sP1, % 0.13/0.34 inference(strict_predicate_extension, [], [c1, c2])). % 0.13/0.34 % 0.13/0.34 cnf(c5, axiom, % 0.13/0.34 sP1 | ~s(sK4)). % 0.13/0.34 cnf(c6, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(strict_predicate_extension, [], [c4, c5])). % 0.13/0.34 cnf(c7, plain, % 0.13/0.34 ~s(sK4), % 0.13/0.34 inference(strict_predicate_extension, [], [c4, c5])). % 0.13/0.34 % 0.13/0.34 cnf(c8, axiom, % 0.13/0.34 s(X0) | ~sP0(X0)). % 0.13/0.34 cnf(a0, assumption, % 0.13/0.34 sK4 = X0). % 0.13/0.34 cnf(c9, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a0])], [c7, c8])). % 0.13/0.34 cnf(c10, plain, % 0.13/0.34 ~sP0(X0), % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a0])], [c7, c8])). % 0.13/0.34 % 0.13/0.34 cnf(c11, axiom, % 0.13/0.34 sP0(X1) | ~r(X1) | ~sP2). % 0.13/0.34 cnf(a1, assumption, % 0.13/0.34 X0 = X1). % 0.13/0.34 cnf(c12, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a1])], [c10, c11])). % 0.13/0.34 cnf(c13, plain, % 0.13/0.34 ~r(X1) | ~sP2, % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a1])], [c10, c11])). % 0.13/0.34 % 0.13/0.34 cnf(c14, axiom, % 0.13/0.34 sP1 | r(sK4)). % 0.13/0.34 cnf(a2, assumption, % 0.13/0.34 X1 = sK4). % 0.13/0.34 cnf(c15, plain, % 0.13/0.34 ~sP2, % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a2])], [c13, c14])). % 0.13/0.34 cnf(c16, plain, % 0.13/0.34 sP1, % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a2])], [c13, c14])). % 0.13/0.34 % 0.13/0.34 cnf(c17, plain, % 0.13/0.34 ~sP1). % 0.13/0.34 cnf(c18, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(predicate_reduction, [], [c16, c17])). % 0.13/0.34 % 0.13/0.34 cnf(c19, plain, % 0.13/0.34 sP2). % 0.13/0.34 cnf(c20, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(predicate_reduction, [], [c15, c19])). % 0.13/0.34 % 0.13/0.34 cnf(c21, axiom, % 0.13/0.34 s(X2) | ~r(X2) | ~sP1). % 0.13/0.34 cnf(c22, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(strict_predicate_extension, [], [c3, c21])). % 0.13/0.34 cnf(c23, plain, % 0.13/0.34 s(X2) | ~r(X2), % 0.13/0.34 inference(strict_predicate_extension, [], [c3, c21])). % 0.13/0.34 % 0.13/0.34 cnf(c24, axiom, % 0.13/0.34 sP0(X3) | ~s(X3) | ~r(X3)). % 0.13/0.34 cnf(a3, assumption, % 0.13/0.34 X2 = X3). % 0.13/0.34 cnf(c25, plain, % 0.13/0.34 ~r(X2), % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a3])], [c23, c24])). % 0.13/0.34 cnf(c26, plain, % 0.13/0.34 sP0(X3) | ~r(X3), % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a3])], [c23, c24])). % 0.13/0.34 % 0.13/0.34 cnf(c27, axiom, % 0.13/0.34 r(X4) | ~sP0(X4)). % 0.13/0.34 cnf(a4, assumption, % 0.13/0.34 X3 = X4). % 0.13/0.34 cnf(c28, plain, % 0.13/0.34 ~r(X3), % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a4])], [c26, c27])). % 0.13/0.34 cnf(c29, plain, % 0.13/0.34 r(X4), % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a4])], [c26, c27])). % 0.13/0.34 % 0.13/0.34 cnf(c30, axiom, % 0.13/0.34 sP2 | ~r(sK3) | ~sP0(sK3)). % 0.13/0.34 cnf(a5, assumption, % 0.13/0.34 X4 = sK3). % 0.13/0.34 cnf(c31, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a5])], [c29, c30])). % 0.13/0.34 cnf(c32, plain, % 0.13/0.34 sP2 | ~sP0(sK3), % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a5])], [c29, c30])). % 0.13/0.34 % 0.13/0.34 cnf(c33, plain, % 0.13/0.34 ~sP2). % 0.13/0.34 cnf(c34, plain, % 0.13/0.34 ~sP0(sK3), % 0.13/0.34 inference(predicate_reduction, [], [c32, c33])). % 0.13/0.34 % 0.13/0.34 cnf(c35, plain, % 0.13/0.34 sP0(X3)). % 0.13/0.34 cnf(a6, assumption, % 0.13/0.34 sK3 = X3). % 0.13/0.34 cnf(c36, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(predicate_reduction, [assumptions([a6])], [c34, c35])). % 0.13/0.34 % 0.13/0.34 cnf(c37, axiom, % 0.13/0.34 sP2 | r(sK3) | sP0(sK3)). % 0.13/0.34 cnf(a7, assumption, % 0.13/0.34 X3 = sK3). % 0.13/0.34 cnf(c38, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a7])], [c28, c37])). % 0.13/0.34 cnf(c39, plain, % 0.13/0.34 sP2 | sP0(sK3), % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a7])], [c28, c37])). % 0.13/0.34 % 0.13/0.34 cnf(c40, plain, % 0.13/0.34 ~sP2). % 0.13/0.34 cnf(c41, plain, % 0.13/0.34 sP0(sK3), % 0.13/0.34 inference(predicate_reduction, [], [c39, c40])). % 0.13/0.34 % 0.13/0.34 cnf(c42, plain, % 0.13/0.34 ~sP0(X3)). % 0.13/0.34 cnf(a8, assumption, % 0.13/0.34 sK3 = X3). % 0.13/0.34 cnf(c43, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(predicate_reduction, [assumptions([a8])], [c41, c42])). % 0.13/0.34 % 0.13/0.34 cnf(c44, plain, % 0.13/0.34 r(X3)). % 0.13/0.34 cnf(a9, assumption, % 0.13/0.34 X2 = X3). % 0.13/0.34 cnf(c45, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(predicate_reduction, [assumptions([a9])], [c25, c44])). % 0.13/0.34 % 0.13/0.34 cnf(c46, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(constraint_solving, [ % 0.13/0.34 bind(X0, sK4), % 0.13/0.34 bind(X1, sK4), % 0.13/0.34 bind(X2, sK3), % 0.13/0.34 bind(X3, sK3), % 0.13/0.34 bind(X4, sK3) % 0.13/0.34 ], % 0.13/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])). % 0.13/0.34 % 0.13/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------