%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : PRO010+2 : TPTP v8.1.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n019.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 : Mon Jul 18 17:48:48 EDT 2022 % Result : Theorem 54.19s 7.89s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : PRO010+2 : TPTP v8.1.0. Released v4.0.0. % 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.15/0.35 % Computer : n019.cluster.edu % 0.15/0.35 % Model : x86_64 x86_64 % 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.35 % Memory : 8042.1875MB % 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.35 % CPULimit : 300 % 0.15/0.35 % WCLimit : 600 % 0.15/0.35 % DateTime : Mon Jun 13 02:30:55 EDT 2022 % 0.15/0.35 % CPUTime : % 54.19/7.89 % SZS status Theorem % 54.19/7.89 % SZS output begin IncompleteProof % 54.19/7.89 cnf(c0, axiom, % 54.19/7.89 occurrence_of(sK27,tptp0)). % 54.19/7.89 cnf(c1, plain, % 54.19/7.89 occurrence_of(sK27,tptp0), % 54.19/7.89 inference(start, [], [c0])). % 54.19/7.89 % 54.19/7.89 cnf(c2, axiom, % 54.19/7.89 ~min_precedes(X0,X1,X2) | ~leaf_occ(X0,X3) | ~occurrence_of(X3,X2)). % 54.19/7.89 cnf(a0, assumption, % 54.19/7.89 sK27 = X3). % 54.19/7.89 cnf(a1, assumption, % 54.19/7.89 tptp0 = X2). % 54.19/7.89 cnf(c3, plain, % 54.19/7.89 $false, % 54.19/7.89 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 54.19/7.89 cnf(c4, plain, % 54.19/7.89 ~min_precedes(X0,X1,X2) | ~leaf_occ(X0,X3), % 54.19/7.89 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 54.19/7.89 % 54.19/7.89 cnf(c5, axiom, % 54.19/7.89 min_precedes(X4,sK26(X4),tptp0) | ~sP5(X4)). % 54.19/7.89 cnf(a2, assumption, % 54.19/7.89 X0 = X4). % 54.19/7.89 cnf(a3, assumption, % 54.19/7.89 X1 = sK26(X4)). % 54.19/7.89 cnf(a4, assumption, % 54.19/7.89 X2 = tptp0). % 54.19/7.89 cnf(c6, plain, % 54.19/7.89 ~leaf_occ(X0,X3), % 54.19/7.89 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])). % 54.19/7.89 cnf(c7, plain, % 54.19/7.89 ~sP5(X4), % 54.19/7.89 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])). % 54.19/7.89 % 54.19/7.89 cnf(c8, axiom, % 54.19/7.89 sP5(X5) | ~sP7(X5,X6)). % 54.19/7.89 cnf(a5, assumption, % 54.19/7.89 X4 = X5). % 54.19/7.89 cnf(c9, plain, % 54.19/7.89 $false, % 54.19/7.89 inference(strict_predicate_extension, [assumptions([a5])], [c7, c8])). % 54.19/7.89 cnf(c10, plain, % 54.19/7.89 ~sP7(X5,X6), % 54.19/7.89 inference(strict_predicate_extension, [assumptions([a5])], [c7, c8])). % 54.19/7.89 % 54.19/7.89 cnf(c11, axiom, % 54.19/7.89 sP6(X7) | sP7(X7,X8) | ~leaf_occ(X8,sK27)). % 54.19/7.89 cnf(a6, assumption, % 54.19/7.89 X5 = X7). % 54.19/7.89 cnf(a7, assumption, % 54.19/7.89 X6 = X8). % 54.19/7.89 cnf(c12, plain, % 54.19/7.89 $false, % 54.19/7.89 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 54.19/7.89 cnf(c13, plain, % 54.19/7.89 sP6(X7) | ~leaf_occ(X8,sK27), % 54.19/7.89 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 54.19/7.89 % 54.19/7.89 cnf(c14, axiom, % 54.19/7.89 min_precedes(X9,sK25(X9),tptp0) | ~sP6(X9)). % 54.19/7.89 cnf(a8, assumption, % 54.19/7.89 X7 = X9). % 54.19/7.89 cnf(c15, plain, % 54.19/7.89 ~leaf_occ(X8,sK27), % 54.19/7.89 inference(strict_predicate_extension, [assumptions([a8])], [c13, c14])). % 54.19/7.89 cnf(c16, plain, % 54.19/7.89 min_precedes(X9,sK25(X9),tptp0), % 54.19/7.89 inference(strict_predicate_extension, [assumptions([a8])], [c13, c14])). % 54.19/7.89 % 54.19/7.89 cnf(c17, axiom, % 54.19/7.89 ~min_precedes(X10,X11,X12) | ~leaf_occ(X10,X13) | ~occurrence_of(X13,X12)). % 54.19/7.89 cnf(a9, assumption, % 54.19/7.89 X9 = X10). % 54.19/7.89 cnf(a10, assumption, % 54.19/7.89 sK25(X9) = X11). % 54.19/7.89 cnf(a11, assumption, % 54.19/7.89 tptp0 = X12). % 54.19/7.89 cnf(c18, plain, % 54.19/7.89 $false, % 54.19/7.89 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c16, c17])). % 54.19/7.89 cnf(c19, plain, % 54.19/7.89 ~leaf_occ(X10,X13) | ~occurrence_of(X13,X12), % 54.19/7.89 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c16, c17])). % 54.19/7.89 % 54.19/7.89 cnf(c20, axiom, % 54.19/7.89 leaf_occ(sK24(X14),X14) | ~sP4(X14)). % 54.19/7.89 cnf(a12, assumption, % 54.19/7.89 X10 = sK24(X14)). % 54.19/7.89 cnf(a13, assumption, % 54.19/7.89 X13 = X14). % 54.19/7.89 cnf(c21, plain, % 54.19/7.89 ~occurrence_of(X13,X12), % 54.19/7.89 inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])). % 54.19/7.89 cnf(c22, plain, % 54.19/7.89 ~sP4(X14), % 54.19/7.89 inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])). % 54.19/7.89 % 54.19/7.89 cnf(c23, axiom, % 54.19/7.89 sP4(X15) | ~occurrence_of(X15,tptp0)). % 54.19/7.89 cnf(a14, assumption, % 54.19/7.89 X14 = X15). % 54.19/7.89 cnf(c24, plain, % 54.19/7.89 $false, % 54.19/7.89 inference(strict_predicate_extension, [assumptions([a14])], [c22, c23])). % 54.19/7.89 cnf(c25, plain, % 54.19/7.89 ~occurrence_of(X15,tptp0), % 54.19/7.89 inference(strict_predicate_extension, [assumptions([a14])], [c22, c23])). % 54.19/7.89 % 54.19/7.89 cnf(c26, plain, % 54.19/7.89 occurrence_of(sK27,tptp0)). % 54.19/7.89 cnf(a15, assumption, % 54.19/7.89 X15 = sK27). % 54.19/7.89 cnf(a16, assumption, % 54.19/7.89 tptp0 = tptp0). % 54.19/7.89 cnf(c27, plain, % 54.19/7.89 $false, % 54.19/7.89 inference(predicate_reduction, [assumptions([a15, a16])], [c25, c26])). % 54.19/7.89 % 54.19/7.89 cnf(c28, plain, % 54.19/7.89 occurrence_of(sK27,tptp0)). % 54.19/7.89 cnf(a17, assumption, % 54.19/7.89 X13 = sK27). % 54.19/7.89 cnf(a18, assumption, % 54.19/7.89 X12 = tptp0). % 54.19/7.89 cnf(c29, plain, % 54.19/7.89 $false, % 54.19/7.89 inference(predicate_reduction, [assumptions([a17, a18])], [c21, c28])). % 54.19/7.89 % 54.19/7.89 cnf(c30, plain, % 54.19/7.89 leaf_occ(X10,X13)). % 54.19/7.89 cnf(a19, assumption, % 54.19/7.89 X8 = X10). % 54.19/7.89 cnf(a20, assumption, % 54.19/7.89 sK27 = X13). % 54.19/7.89 cnf(c31, plain, % 54.19/7.89 $false, % 54.19/7.89 inference(predicate_reduction, [assumptions([a19, a20])], [c15, c30])). % 54.19/7.89 % 54.19/7.89 cnf(c32, plain, % 54.19/7.89 leaf_occ(X10,X13)). % 54.19/7.89 cnf(a21, assumption, % 54.19/7.89 X0 = X10). % 54.19/7.89 cnf(a22, assumption, % 54.19/7.89 X3 = X13). % 54.19/7.89 cnf(c33, plain, % 54.19/7.89 $false, % 54.19/7.89 inference(predicate_reduction, [assumptions([a21, a22])], [c6, c32])). % 54.19/7.89 % 54.19/7.89 cnf(c34, plain, % 54.19/7.89 $false, % 54.19/7.89 inference(constraint_solving, [ % 54.19/7.89 bind(X0, sK24(X14)), % 54.19/7.89 bind(X1, sK26(X4)), % 54.19/7.89 bind(X2, tptp0), % 54.19/7.89 bind(X3, sK27), % 54.19/7.89 bind(X4, sK24(X14)), % 54.19/7.89 bind(X5, sK24(X14)), % 54.19/7.89 bind(X6, sK24(X14)), % 54.19/7.89 bind(X7, sK24(X14)), % 54.19/7.89 bind(X8, sK24(X14)), % 54.19/7.89 bind(X9, sK24(X14)), % 54.19/7.89 bind(X10, sK24(X14)), % 54.19/7.89 bind(X11, sK25(X9)), % 54.19/7.89 bind(X12, tptp0), % 54.19/7.89 bind(X13, sK27), % 54.19/7.89 bind(X14, sK27), % 54.19/7.89 bind(X15, sK27) % 54.19/7.89 ], % 54.19/7.89 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22])). % 54.19/7.89 % 54.19/7.89 % SZS output end IncompleteProof %------------------------------------------------------------------------------