%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : PHI022+1 : TPTP v8.1.0. Released v7.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 : n021.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 16:47:12 EDT 2022 % Result : Theorem 0.12s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : PHI022+1 : TPTP v8.1.0. Released v7.4.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n021.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 : Thu Jun 2 01:40:31 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.35 % SZS status Theorem % 0.12/0.35 % SZS output begin IncompleteProof % 0.12/0.35 cnf(c0, axiom, % 0.12/0.35 substance(sK7)). % 0.12/0.35 cnf(c1, plain, % 0.12/0.35 substance(sK7), % 0.12/0.35 inference(start, [], [c0])). % 0.12/0.35 % 0.12/0.35 cnf(c2, axiom, % 0.12/0.35 being(X0) | ~substance(X0)). % 0.12/0.35 cnf(a0, assumption, % 0.12/0.35 sK7 = X0). % 0.12/0.35 cnf(c3, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.35 cnf(c4, plain, % 0.12/0.35 being(X0), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.35 % 0.12/0.35 cnf(c5, axiom, % 0.12/0.35 hasEssence(X1) | ~being(X1)). % 0.12/0.35 cnf(a1, assumption, % 0.12/0.35 X0 = X1). % 0.12/0.35 cnf(c6, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.12/0.35 cnf(c7, plain, % 0.12/0.35 hasEssence(X1), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.12/0.35 % 0.12/0.35 cnf(c8, axiom, % 0.12/0.35 exists(X2) | ~hasEssence(X2) | ~essenceInvExistence(X2)). % 0.12/0.35 cnf(a2, assumption, % 0.12/0.35 X1 = X2). % 0.12/0.35 cnf(c9, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.12/0.35 cnf(c10, plain, % 0.12/0.35 exists(X2) | ~essenceInvExistence(X2), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.12/0.35 % 0.12/0.35 cnf(c11, axiom, % 0.12/0.35 ~exists(sK7)). % 0.12/0.35 cnf(a3, assumption, % 0.12/0.35 X2 = sK7). % 0.12/0.35 cnf(c12, plain, % 0.12/0.35 ~essenceInvExistence(X2), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.12/0.35 cnf(c13, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.12/0.35 % 0.12/0.35 cnf(c14, axiom, % 0.12/0.35 essenceInvExistence(X3) | ~selfCaused(X3)). % 0.12/0.35 cnf(a4, assumption, % 0.12/0.35 X2 = X3). % 0.12/0.35 cnf(c15, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])). % 0.12/0.35 cnf(c16, plain, % 0.12/0.35 ~selfCaused(X3), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])). % 0.12/0.35 % 0.12/0.35 cnf(c17, axiom, % 0.12/0.35 selfCaused(X4) | ~inItself(X4)). % 0.12/0.35 cnf(a5, assumption, % 0.12/0.35 X3 = X4). % 0.12/0.35 cnf(c18, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])). % 0.12/0.35 cnf(c19, plain, % 0.12/0.35 ~inItself(X4), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])). % 0.12/0.35 % 0.12/0.35 cnf(c20, axiom, % 0.12/0.35 inItself(X5) | ~substance(X5)). % 0.12/0.35 cnf(a6, assumption, % 0.12/0.35 X4 = X5). % 0.12/0.35 cnf(c21, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])). % 0.12/0.35 cnf(c22, plain, % 0.12/0.35 ~substance(X5), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])). % 0.12/0.35 % 0.12/0.35 cnf(c23, plain, % 0.12/0.35 substance(sK7)). % 0.12/0.35 cnf(a7, assumption, % 0.12/0.35 X5 = sK7). % 0.12/0.35 cnf(c24, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(predicate_reduction, [assumptions([a7])], [c22, c23])). % 0.12/0.35 % 0.12/0.35 cnf(c25, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(constraint_solving, [ % 0.12/0.35 bind(X0, sK7), % 0.12/0.35 bind(X1, sK7), % 0.12/0.35 bind(X2, sK7), % 0.12/0.35 bind(X3, sK7), % 0.12/0.35 bind(X4, sK7), % 0.12/0.35 bind(X5, sK7) % 0.12/0.35 ], % 0.12/0.35 [a0, a1, a2, a3, a4, a5, a6, a7])). % 0.12/0.35 % 0.12/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------