%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : PHI040+1 : TPTP v8.1.0. Released v7.4.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n032.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:45:39 EDT 2022 % Result : CounterSatisfiable 0.13s 0.32s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.09 % Problem : PHI040+1 : TPTP v8.1.0. Released v7.4.0. % 0.00/0.10 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.09/0.28 % Computer : n032.cluster.edu % 0.09/0.28 % Model : x86_64 x86_64 % 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.28 % Memory : 8042.1875MB % 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.28 % CPULimit : 300 % 0.09/0.28 % WCLimit : 600 % 0.09/0.28 % DateTime : Thu Jun 2 02:11:15 EDT 2022 % 0.09/0.29 % CPUTime : % 0.13/0.32 # No SInE strategy applied % 0.13/0.32 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.32 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.32 # % 0.13/0.32 # Presaturation interreduction done % 0.13/0.32 # Number of axioms: 58 Number of unprocessed: 56 % 0.13/0.32 # Tableaux proof search. % 0.13/0.32 # APR header successfully linked. % 0.13/0.32 # Hello from C++ % 0.13/0.32 # The folding up rule is enabled... % 0.13/0.32 # Local unification is enabled... % 0.13/0.32 # Any saturation attempts will use folding labels... % 0.13/0.32 # 56 beginning clauses after preprocessing and clausification % 0.13/0.32 # Creating start rules for all 4 conjectures. % 0.13/0.32 # There are 4 start rule candidates: % 0.13/0.32 # Found 1 unit axioms. % 0.13/0.32 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.32 # 4 start rule tableaux created. % 0.13/0.32 # 55 extension rule candidate clauses % 0.13/0.32 # 1 unit axiom clauses % 0.13/0.32 % 0.13/0.32 # Requested 8, 32 cores available to the main process. % 0.13/0.32 # There are not enough tableaux to fork, creating more from the initial 4 % 0.13/0.32 # Creating equality axioms % 0.13/0.32 # Ran out of tableaux, making start rules for all clauses % 0.13/0.32 # Returning from population with 57 new_tableaux and 0 remaining starting tableaux. % 0.13/0.32 # We now have 57 tableaux to operate on % 0.13/0.32 # 18791 Satisfiable branch % 0.13/0.32 # 18793 Satisfiable branch % 0.13/0.32 # Satisfiable branch found. % 0.13/0.32 # There were 1 total branch saturation attempts. % 0.13/0.32 # There were 0 of these attempts blocked. % 0.13/0.32 # There were 0 deferred branch saturation attempts. % 0.13/0.32 # There were 0 free duplicated saturations. % 0.13/0.32 # There were 0 total successful branch saturations. % 0.13/0.32 # There were 0 successful branch saturations in interreduction. % 0.13/0.32 # There were 0 successful branch saturations on the branch. % 0.13/0.32 # There were 0 successful branch saturations after the branch. % 0.13/0.32 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.32 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.32 # Begin clausification derivation % 0.13/0.32 % 0.13/0.32 # End clausification derivation % 0.13/0.32 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.32 cnf(i_0_5, plain, (conceivedThru(X1,X1))). % 0.13/0.32 cnf(i_0_45, negated_conjecture, (existsOnlyByNecessityOfOwnNature(esk1_0)|free(esk1_0))). % 0.13/0.32 cnf(i_0_46, negated_conjecture, (~determinedByItselfAlone(esk2_0,esk1_0)|~existsOnlyByNecessityOfOwnNature(esk1_0)|~free(esk1_0))). % 0.13/0.32 cnf(i_0_47, negated_conjecture, (actionOf(esk2_0,esk1_0)|~existsOnlyByNecessityOfOwnNature(esk1_0)|~free(esk1_0))). % 0.13/0.32 cnf(i_0_44, negated_conjecture, (determinedByItselfAlone(esk2_0,esk1_0)|free(esk1_0)|~actionOf(esk2_0,esk1_0))). % 0.13/0.32 cnf(i_0_17, plain, (~essenceInvExistence(X1)|~canBeConceivedAsNonExisting(X1))). % 0.13/0.32 cnf(i_0_20, plain, (essenceInvExistence(X1)|~selfCaused(X1))). % 0.13/0.32 cnf(i_0_57, plain, (selfCaused(X1)|~inItself(X1))). % 0.13/0.32 cnf(i_0_43, plain, (substance(X1)|~absolutelyInfinite(X1))). % 0.13/0.32 cnf(i_0_27, plain, (attribute(X1)|~intPercAsConstEssSub(X1))). % 0.13/0.32 cnf(i_0_37, plain, (being(X1)|~god(X1))). % 0.13/0.32 cnf(i_0_36, plain, (absolutelyInfinite(X1)|~god(X1))). % 0.13/0.32 cnf(i_0_19, plain, (natureConcOnlyByExistence(X1)|~selfCaused(X1))). % 0.13/0.32 cnf(i_0_54, plain, (eternity(X1)|~existConcFollowFromDefEternal(X1))). % 0.13/0.32 cnf(i_0_26, plain, (inItself(X1)|~substance(X1))). % 0.13/0.32 cnf(i_0_25, plain, (conceivedThruItself(X1)|~substance(X1))). % 0.13/0.32 cnf(i_0_28, plain, (intPercAsConstEssSub(X1)|~attribute(X1))). % 0.13/0.32 cnf(i_0_56, plain, (being(X1)|~substance(X1))). % 0.13/0.32 cnf(i_0_42, plain, (constInInfAttributes(X1)|~absolutelyInfinite(X1))). % 0.13/0.32 cnf(i_0_13, plain, (~canBeUnderstoodInTermsOf(X1,X2)|~haveNothingInCommon(X2,X1))). % 0.13/0.32 cnf(i_0_11, plain, (~conceptionInvolves(X1,X2)|~haveNothingInCommon(X2,X1))). % 0.13/0.32 cnf(i_0_14, plain, (~canBeUnderstoodInTermsOf(X1,X2)|~haveNothingInCommon(X1,X2))). % 0.13/0.32 cnf(i_0_12, plain, (~conceptionInvolves(X1,X2)|~haveNothingInCommon(X1,X2))). % 0.13/0.32 cnf(i_0_55, plain, (existConcFollowFromDefEternal(X1)|~eternity(X1))). % 0.13/0.32 cnf(i_0_58, plain, (hasEssence(X1)|~being(X1))). % 0.13/0.32 cnf(i_0_10, plain, (knowledgeOfACause(X1)|~knowledgeOfEffect(X1,X2))). % 0.13/0.32 cnf(i_0_59, plain, (exists(X1)|~hasEssence(X1)|~essenceInvExistence(X1))). % 0.13/0.32 cnf(i_0_18, plain, (selfCaused(X1)|~natureConcOnlyByExistence(X1)|~essenceInvExistence(X1))). % 0.13/0.32 cnf(i_0_50, plain, (isMethodExistence(X1)|isMethodAction(X1)|~necessary(X2))). % 0.13/0.32 cnf(i_0_8, plain, (effectNecessarilyFollowsFrom(X1,X2)|~definiteCause(X2))). % 0.13/0.32 cnf(i_0_24, plain, (substance(X1)|~conceivedThruItself(X1)|~inItself(X1))). % 0.13/0.32 cnf(i_0_35, plain, (god(X1)|~absolutelyInfinite(X1)|~being(X1))). % 0.13/0.32 cnf(i_0_2, plain, (exists(X1)|~existsIn(X1,X1))). % 0.13/0.32 cnf(i_0_30, plain, (mode(X1)|~modification(X1,X2)|~substance(X2))). % 0.13/0.32 cnf(i_0_9, plain, (knowledgeOfEffect(X1,X2)|~knowledgeOfACause(X1))). % 0.13/0.32 cnf(i_0_16, plain, (correspondWith(X1,X2)|~trueIdea(X1))). % 0.13/0.32 cnf(i_0_23, plain, (canBeLimitedBy(X1,X2)|~finiteAfterItsKind(X1))). % 0.13/0.32 cnf(i_0_22, plain, (sameKind(X1,X2)|~finiteAfterItsKind(X1))). % 0.13/0.32 cnf(i_0_53, plain, (externalTo(X1,X2)|~necessary(X2))). % 0.13/0.32 cnf(i_0_52, plain, (determinedByFixedMethod(X1,X2)|~necessary(X1))). % 0.13/0.32 cnf(i_0_51, plain, (determinedByDefiniteMethod(X1,X2)|~necessary(X1))). % 0.13/0.32 cnf(i_0_21, plain, (finiteAfterItsKind(X1)|~sameKind(X1,X2)|~canBeLimitedBy(X1,X2))). % 0.13/0.32 cnf(i_0_29, plain, (mode(X1)|~conceivedThru(X1,X2)|~existsIn(X1,X2))). % 0.13/0.32 cnf(i_0_41, plain, (expressesEternalEssentiality(X1)|~attributeOf(X1,X2)|~absolutelyInfinite(X2))). % 0.13/0.32 cnf(i_0_40, plain, (expressesInfiniteEssentiality(X1)|~attributeOf(X1,X2)|~absolutelyInfinite(X2))). % 0.13/0.32 cnf(i_0_1, plain, (X1=X2|exists(X1)|~existsIn(X1,X2))). % 0.13/0.32 cnf(i_0_3, plain, (existsIn(X1,X1)|~exists(X1))). % 0.13/0.32 cnf(i_0_15, plain, (objectOf(X1,X2)|ideateOf(X1,X2)|~trueIdea(X2))). % 0.13/0.32 cnf(i_0_38, plain, (absolutelyInfinite(X1)|~expressesInfiniteEssentiality(X2)|~expressesEternalEssentiality(X2)|~constInInfAttributes(X1)|~substance(X1))). % 0.13/0.32 cnf(i_0_31, plain, (substance(X1)|conceivedThru(X2,X3)|~mode(X2))). % 0.13/0.32 cnf(i_0_39, plain, (attributeOf(X1,X2)|absolutelyInfinite(X2)|~constInInfAttributes(X2)|~substance(X2))). % 0.13/0.32 cnf(i_0_49, plain, (necessary(X1)# Satisfiable branch found. % 0.13/0.32 # There were 1 total branch saturation attempts. % 0.13/0.32 # There were 0 of these attempts blocked. % 0.13/0.32 # There were 0 deferred branch saturation attempts. % 0.13/0.32 # There were 0 free duplicated saturations. % 0.13/0.32 # There were 0 total successful branch saturations. % 0.13/0.32 # There were 0 successful branch saturations in interreduction. % 0.13/0.32 # There were 0 successful branch saturations on the branch. % 0.13/0.32 # There were 0 successful branch saturations after the branch. % 0.13/0.32 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.32 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.32 # Begin clausification derivation % 0.13/0.32 % 0.13/0.32 # End clausification derivation % 0.13/0.32 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.32 cnf(i_0_5, plain, (conceivedThru(X1,X1))). % 0.13/0.32 cnf(i_0_45, negated_conjecture, (existsOnlyByNecessityOfOwnNature(esk1_0)|free(esk1_0))). % 0.13/0.32 cnf(i_0_46, negated_conjecture, (~determinedByItselfAlone(esk2_0,esk1_0)|~existsOnlyByNecessityOfOwnNature(esk1_0)|~free(esk1_0))). % 0.13/0.32 cnf(i_0_47, negated_conjecture, (actionOf(esk2_0,esk1_0)|~existsOnlyByNecessityOfOwnNature(esk1_0)|~free(esk1_0))). % 0.13/0.32 cnf(i_0_44, negated_conjecture, (determinedByItselfAlone(esk2_0,esk1_0)|free(esk1_0)|~actionOf(esk2_0,esk1_0))). % 0.13/0.32 cnf(i_0_17, plain, (~essenceInvExistence(X1)|~canBeConceivedAsNonExisting(X1))). % 0.13/0.32 cnf(i_0_20, plain, (essenceInvExistence(X1)|~selfCaused(X1))). % 0.13/0.32 cnf(i_0_57, plain, (selfCaused(X1)|~inItself(X1))). % 0.13/0.32 cnf(i_0_43, plain, (substance(X1)|~absolutelyInfinite(X1))). % 0.13/0.32 cnf(i_0_27, plain, (attribute(X1)|~intPercAsConstEssSub(X1))). % 0.13/0.32 cnf(i_0_37, plain, (being(X1)|~god(X1))). % 0.13/0.32 cnf(i_0_36, plain, (absolutelyInfinite(X1)|~god(X1))). % 0.13/0.32 cnf(i_0_19, plain, (natureConcOnlyByExistence(X1)|~selfCaused(X1))). % 0.13/0.32 cnf(i_0_54, plain, (eternity(X1)|~existConcFollowFromDefEternal(X1))). % 0.13/0.32 cnf(i_0_26, plain, (inItself(X1)|~substance(X1))). % 0.13/0.32 cnf(i_0_25, plain, (conceivedThruItself(X1)|~substance(X1))). % 0.13/0.32 cnf(i_0_28, plain, (intPercAsConstEssSub(X1)|~attribute(X1))). % 0.13/0.32 cnf(i_0_56, plain, (being(X1)|~substance(X1))). % 0.13/0.32 cnf(i_0_42, plain, (constInInfAttributes(X1)|~absolutelyInfinite(X1))). % 0.13/0.32 cnf(i_0_13, plain, (~canBeUnderstoodInTermsOf(X1,X2)|~haveNothingInCommon(X2,X1))). % 0.13/0.32 cnf(i_0_11, plain, (~conceptionInvolves(X1,X2)|~haveNothingInCommon(X2,X1))). % 0.13/0.32 cnf(i_0_14, plain, (~canBeUnderstoodInTermsOf(X1,X2)|~haveNothingInCommon(X1,X2))). % 0.13/0.32 cnf(i_0_12, plain, (~conceptionInvolves(X1,X2)|~haveNothingInCommon(X1,X2))). % 0.13/0.32 cnf(i_0_55, plain, (existConcFollowFromDefEternal(X1)|~eternity(X1))). % 0.13/0.32 cnf(i_0_58, plain, (hasEssence(X1)|~being(X1))). % 0.13/0.32 cnf(i_0_10, plain, (knowledgeOfACause(X1)|~knowledgeOfEffect(X1,X2))). % 0.13/0.32 cnf(i_0_59, plain, (exists(X1)|~hasEssence(X1)|~essenceInvExistence(X1))). % 0.13/0.32 cnf(i_0_18, plain, (selfCaused(X1)|~natureConcOnlyByExistence(X1)|~essenceInvExistence(X1))). % 0.13/0.32 cnf(i_0_50, plain, (isMethodExistence(X1)|isMethodAction(X1)|~necessary(X2))). % 0.13/0.32 cnf(i_0_8, plain, (effectNecessarilyFollowsFrom(X1,X2)|~definiteCause(X2))). % 0.13/0.32 cnf(i_0_24, plain, (substance(X1)|~conceivedThruItself(X1)|~inItself(X1))). % 0.13/0.32 cnf(i_0_35, plain, (god(X1)|~absolutelyInfinite(X1)|~being(X1))). % 0.13/0.32 cnf(i_0_2, plain, (exists(X1)|~existsIn(X1,X1))). % 0.13/0.32 cnf(i_0_30, plain, (mode(X1)|~modification(X1,X2)|~substance(X2))). % 0.13/0.32 cnf(i_0_9, plain, (knowledgeOfEffect(X1,X2)|~knowledgeOfACause(X1))). % 0.13/0.32 cnf(i_0_16, plain, (correspondWith(X1,X2)|~trueIdea(X1))). % 0.13/0.32 cnf(i_0_23, plain, (canBeLimitedBy(X1,X2)|~finiteAfterItsKind(X1))). % 0.13/0.32 cnf(i_0_22, plain, (sameKind(X1,X2)|~finiteAfterItsKind(X1))). % 0.13/0.32 cnf(i_0_53, plain, (externalTo(X1,X2)|~necessary(X2))). % 0.13/0.32 cnf(i_0_52, plain, (determinedByFixedMethod(X1,X2)|~necessary(X1))). % 0.13/0.32 cnf(i_0_51, plain, (determinedByDefiniteMethod(X1,X2)|~necessary(X1))). % 0.13/0.32 cnf(i_0_21, plain, (finiteAfterItsKind(X1)|~sameKind(X1,X2)|~canBeLimitedBy(X1,X2))). % 0.13/0.32 cnf(i_0_29, plain, (mode(X1)|~conceivedThru(X1,X2)|~existsIn(X1,X2))). % 0.13/0.32 cnf(i_0_41, plain, (expressesEternalEssentiality(X1)|~attributeOf(X1,X2)|~absolutelyInfinite(X2))). % 0.13/0.32 cnf(i_0_40, plain, (expressesInfiniteEssentiality(X1)|~attributeOf(X1,X2)|~absolutelyInfinite(X2))). % 0.13/0.32 cnf(i_0_1, plain, (X1=X2|exists(X1)|~existsIn(X1,X2))). % 0.13/0.32 cnf(i_0_3, plain, (existsIn(X1,X1)|~exists(X1))). % 0.13/0.32 cnf(i_0_15, plain, (objectOf(X1,X2)|ideateOf(X1,X2)|~trueIdea(X2))). % 0.13/0.32 cnf(i_0_38, plain, (absolutelyInfinite(X1)|~expressesInfiniteEssentiality(X2)|~expressesEternalEssentiality(X2)|~constInInfAttributes(X1)|~substance(X1))). % 0.13/0.32 cnf(i_0_31, plain, (substance(X1)|conceivedThru(X2,X3)|~mode(X2))). % 0.13/0.32 cnf(i_0_39, plain, (attributeOf(X1,X2)|absolutelyInfinite(X2)|~constInInfAttributes(X2)|~substance(X2))). % 0.13/0.32 cnf(i_0_49, plain, (necessary(X1)|~isMethodAction(X2)|~determinedByDefiniteMethod(X1,X2)|~determinedByFixedMethod(X1,X2)|~externalTo(X2,X1))). % 0.13/0.32 cnf(i_0_32, plain, (substance(X1)|existsIn(X2,X3)|~mode(X2))). % 0.13/0.32 cnf(i_0_34, plain, (modification(X1,X2)|existsIn(X1,X3)|~mode(X1))). % 0.13/0.32 cnf(i_0_33, plain, (modification(X1,X2)|conceivedThru(X1,X3)|~mode(X1))). % 0.13/0.32 cnf(i_0_48, plain, (necessary(X1)|~isMethodExistence(X2)|~determinedByDefiniteMethod(X1,X2)|~determinedByFixedMethod(X1,X2)|~externalTo(X2,X1))). % 0.13/0.32 cnf(i_0_1613, plain, (X37=X37)). % 0.13/0.32 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.32 # Begin printing tableau % 0.13/0.32 # Found 4 steps % 0.13/0.32 cnf(i_0_44, negated_conjecture, (determinedByItselfAlone(esk2_0,esk1_0)|free(esk1_0)|~actionOf(esk2_0,esk1_0)), inference(start_rule)). % 0.13/0.32 cnf(i_0_1674, plain, (determinedByItselfAlone(esk2_0,esk1_0)), inference(extension_rule, [i_0_1655])). % 0.13/0.32 cnf(i_0_2394, plain, ($false), inference(closure_rule, [i_0_1613])). % 0.13/0.32 cnf(i_0_2393, plain, (determinedByItselfAlone(esk2_0,esk1_0)), inference(extension_rule, [i_0_46])). % 0.13/0.32 # End printing tableau % 0.13/0.32 # SZS output end % 0.13/0.32 # Branches closed with saturation will be marked with an "s" % 0.13/0.32 |~isMethodAction(X2)|~determinedByDefiniteMethod(X1,X2)|~determinedByFixedMethod(X1,X2)|~externalTo(X2,X1))). % 0.13/0.32 cnf(i_0_32, plain, (substance(X1)|existsIn(X2,X3)|~mode(X2))). % 0.13/0.32 cnf(i_0_34, plain, (modification(X1,X2)|existsIn(X1,X3)|~mode(X1))). % 0.13/0.32 cnf(i_0_33, plain, (modification(X1,X2)|conceivedThru(X1,X3)|~mode(X1))). % 0.13/0.32 cnf(i_0_48, plain, (necessary(X1)|~isMethodExistence(X2)|~determinedByDefiniteMethod(X1,X2)|~determinedByFixedMethod(X1,X2)|~externalTo(X2,X1))). % 0.13/0.32 cnf(i_0_1613, plain, (X37=X37)). % 0.13/0.32 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.32 # Begin printing tableau % 0.13/0.32 # Found 4 steps % 0.13/0.32 cnf(i_0_46, negated_conjecture, (~determinedByItselfAlone(esk2_0,esk1_0)|~existsOnlyByNecessityOfOwnNature(esk1_0)|~free(esk1_0)), inference(start_rule)). % 0.13/0.32 cnf(i_0_1668, plain, (~determinedByItselfAlone(esk2_0,esk1_0)), inference(extension_rule, [i_0_1655])). % 0.13/0.32 cnf(i_0_2394, plain, ($false), inference(closure_rule, [i_0_1613])). % 0.13/0.32 cnf(i_0_2396, plain, (~determinedByItselfAlone(esk2_0,esk1_0)), inference(extension_rule, [i_0_44])). % 0.13/0.32 # End printing tableau % 0.13/0.32 # SZS output end % 0.13/0.32 # Branches closed with saturation will be marked with an "s" % 0.13/0.32 # Child (18793) has found a proof. % 0.13/0.32 % 0.13/0.32 # Proof search is over... % 0.13/0.32 # Freeing feature tree %------------------------------------------------------------------------------