%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN950+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 : n010.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:21 EDT 2022 % Result : Theorem 0.09s 0.30s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.09 % Problem : SYN950+1 : TPTP v8.1.0. Released v3.1.0. % 0.04/0.09 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.09/0.29 % Computer : n010.cluster.edu % 0.09/0.29 % Model : x86_64 x86_64 % 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.29 % Memory : 8042.1875MB % 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.29 % CPULimit : 300 % 0.09/0.29 % WCLimit : 600 % 0.09/0.29 % DateTime : Tue Jul 12 07:41:30 EDT 2022 % 0.09/0.29 % CPUTime : % 0.09/0.30 % SZS status Theorem % 0.09/0.30 % SZS output begin IncompleteProof % 0.09/0.30 cnf(c0, axiom, % 0.09/0.30 ~p(sK2) | sP0(sK1,X0)). % 0.09/0.30 cnf(c1, plain, % 0.09/0.30 ~p(sK2) | sP0(sK1,X0), % 0.09/0.30 inference(start, [], [c0])). % 0.09/0.30 % 0.09/0.30 cnf(c2, axiom, % 0.09/0.30 p(X1) | ~q(X1)). % 0.09/0.30 cnf(a0, assumption, % 0.09/0.30 sK2 = X1). % 0.09/0.30 cnf(c3, plain, % 0.09/0.30 sP0(sK1,X0), % 0.09/0.30 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.09/0.30 cnf(c4, plain, % 0.09/0.30 ~q(X1), % 0.09/0.30 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.09/0.30 % 0.09/0.30 cnf(c5, axiom, % 0.09/0.30 q(X2) | sP0(sK1,X2)). % 0.09/0.30 cnf(a1, assumption, % 0.09/0.30 X1 = X2). % 0.09/0.30 cnf(c6, plain, % 0.09/0.30 $false, % 0.09/0.30 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.09/0.30 cnf(c7, plain, % 0.09/0.30 sP0(sK1,X2), % 0.09/0.30 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.09/0.30 % 0.09/0.30 cnf(c8, axiom, % 0.09/0.30 p(X3) | ~sP0(X4,X3)). % 0.09/0.30 cnf(a2, assumption, % 0.09/0.30 sK1 = X4). % 0.09/0.30 cnf(a3, assumption, % 0.09/0.30 X2 = X3). % 0.09/0.30 cnf(c9, plain, % 0.09/0.30 $false, % 0.09/0.30 inference(strict_predicate_extension, [assumptions([a2, a3])], [c7, c8])). % 0.09/0.30 cnf(c10, plain, % 0.09/0.30 p(X3), % 0.09/0.30 inference(strict_predicate_extension, [assumptions([a2, a3])], [c7, c8])). % 0.09/0.30 % 0.09/0.30 cnf(c11, plain, % 0.09/0.30 ~p(sK2)). % 0.09/0.30 cnf(a4, assumption, % 0.09/0.30 X3 = sK2). % 0.09/0.30 cnf(c12, plain, % 0.09/0.30 $false, % 0.09/0.30 inference(predicate_reduction, [assumptions([a4])], [c10, c11])). % 0.09/0.30 % 0.09/0.30 cnf(c13, axiom, % 0.09/0.30 ~p(X5) | ~sP0(X5,X6)). % 0.09/0.30 cnf(a5, assumption, % 0.09/0.30 sK1 = X5). % 0.09/0.30 cnf(a6, assumption, % 0.09/0.30 X0 = X6). % 0.09/0.30 cnf(c14, plain, % 0.09/0.30 $false, % 0.09/0.30 inference(strict_predicate_extension, [assumptions([a5, a6])], [c3, c13])). % 0.09/0.30 cnf(c15, plain, % 0.09/0.30 ~p(X5), % 0.09/0.30 inference(strict_predicate_extension, [assumptions([a5, a6])], [c3, c13])). % 0.09/0.30 % 0.09/0.30 cnf(c16, axiom, % 0.09/0.30 p(X7) | ~sP0(X8,X7)). % 0.09/0.30 cnf(a7, assumption, % 0.09/0.30 X5 = X7). % 0.09/0.30 cnf(c17, plain, % 0.09/0.30 $false, % 0.09/0.30 inference(strict_predicate_extension, [assumptions([a7])], [c15, c16])). % 0.09/0.30 cnf(c18, plain, % 0.09/0.30 ~sP0(X8,X7), % 0.09/0.30 inference(strict_predicate_extension, [assumptions([a7])], [c15, c16])). % 0.09/0.30 % 0.09/0.30 cnf(c19, plain, % 0.09/0.30 sP0(sK1,X0)). % 0.09/0.30 cnf(a8, assumption, % 0.09/0.30 X8 = sK1). % 0.09/0.30 cnf(a9, assumption, % 0.09/0.30 X7 = X0). % 0.09/0.30 cnf(c20, plain, % 0.09/0.30 $false, % 0.09/0.30 inference(predicate_reduction, [assumptions([a8, a9])], [c18, c19])). % 0.09/0.30 % 0.09/0.30 cnf(c21, plain, % 0.09/0.30 $false, % 0.09/0.30 inference(constraint_solving, [ % 0.09/0.30 bind(X0, sK1), % 0.09/0.30 bind(X1, sK2), % 0.09/0.30 bind(X2, sK2), % 0.09/0.30 bind(X3, sK2), % 0.09/0.30 bind(X4, sK1), % 0.09/0.30 bind(X5, sK1), % 0.09/0.30 bind(X6, sK1), % 0.09/0.30 bind(X7, sK1), % 0.09/0.30 bind(X8, sK1) % 0.09/0.30 ], % 0.09/0.30 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])). % 0.09/0.30 % 0.09/0.30 % SZS output end IncompleteProof %------------------------------------------------------------------------------