%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : PHI014+1 : TPTP v8.1.0. Released v7.2.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 : n026.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:35 EDT 2022 % Result : Theorem 0.15s 0.40s % Output : CNFRefutation 0.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : PHI014+1 : TPTP v8.1.0. Released v7.2.0. % 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.15/0.36 % Computer : n026.cluster.edu % 0.15/0.36 % Model : x86_64 x86_64 % 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.36 % Memory : 8042.1875MB % 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.36 % CPULimit : 300 % 0.15/0.36 % WCLimit : 600 % 0.15/0.36 % DateTime : Thu Jun 2 01:30:42 EDT 2022 % 0.15/0.36 % CPUTime : % 0.15/0.39 # No SInE strategy applied % 0.15/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.15/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.15/0.39 # % 0.15/0.39 # Presaturation interreduction done % 0.15/0.39 # Number of axioms: 13 Number of unprocessed: 13 % 0.15/0.39 # Tableaux proof search. % 0.15/0.39 # APR header successfully linked. % 0.15/0.39 # Hello from C++ % 0.15/0.39 # The folding up rule is enabled... % 0.15/0.39 # Local unification is enabled... % 0.15/0.39 # Any saturation attempts will use folding labels... % 0.15/0.39 # 13 beginning clauses after preprocessing and clausification % 0.15/0.39 # Creating start rules for all 1 conjectures. % 0.15/0.39 # There are 1 start rule candidates: % 0.15/0.39 # Found 2 unit axioms. % 0.15/0.39 # 1 start rule tableaux created. % 0.15/0.39 # 11 extension rule candidate clauses % 0.15/0.39 # 2 unit axiom clauses % 0.15/0.39 % 0.15/0.39 # Requested 8, 32 cores available to the main process. % 0.15/0.39 # There are not enough tableaux to fork, creating more from the initial 1 % 0.15/0.40 # There were 4 total branch saturation attempts. % 0.15/0.40 # There were 0 of these attempts blocked. % 0.15/0.40 # There were 0 deferred branch saturation attempts. % 0.15/0.40 # There were 0 free duplicated saturations. % 0.15/0.40 # There were 4 total successful branch saturations. % 0.15/0.40 # There were 0 successful branch saturations in interreduction. % 0.15/0.40 # There were 0 successful branch saturations on the branch. % 0.15/0.40 # There were 4 successful branch saturations after the branch. % 0.15/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.40 # Begin clausification derivation % 0.15/0.40 % 0.15/0.40 # End clausification derivation % 0.15/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.40 cnf(i_0_12, plain, (is_the(god,none_greater))). % 0.15/0.40 cnf(i_0_13, negated_conjecture, (~exemplifies_property(existence,god))). % 0.15/0.40 cnf(i_0_2, plain, (object(X1)|~is_the(X1,X2))). % 0.15/0.40 cnf(i_0_8, plain, (exemplifies_property(conceivable,X1)|~exemplifies_property(none_greater,X1)|~object(X1))). % 0.15/0.40 cnf(i_0_3, plain, (property(X1)|~is_the(X2,X1))). % 0.15/0.40 cnf(i_0_11, plain, (exemplifies_property(existence,X1)|object(esk2_1(X1))|~is_the(X1,none_greater))). % 0.15/0.40 cnf(i_0_6, plain, (exemplifies_property(none_greater,X1)|object(esk1_1(X1))|~exemplifies_property(conceivable,X1)|~object(X1))). % 0.15/0.40 cnf(i_0_7, plain, (~exemplifies_relation(greater_than,X1,X2)|~exemplifies_property(none_greater,X2)|~exemplifies_property(conceivable,X1)|~object(X2)|~object(X1))). % 0.15/0.40 cnf(i_0_1, plain, (exemplifies_property(X1,X2)|~is_the(X2,X1)|~is_the(X3,X1))). % 0.15/0.40 cnf(i_0_9, plain, (exemplifies_property(conceivable,esk2_1(X1))|exemplifies_property(existence,X1)|~is_the(X1,none_greater))). % 0.15/0.40 cnf(i_0_4, plain, (exemplifies_property(conceivable,esk1_1(X1))|exemplifies_property(none_greater,X1)|~exemplifies_property(conceivable,X1)|~object(X1))). % 0.15/0.40 cnf(i_0_10, plain, (exemplifies_relation(greater_than,esk2_1(X1),X1)|exemplifies_property(existence,X1)|~is_the(X1,none_greater))). % 0.15/0.40 cnf(i_0_5, plain, (exemplifies_relation(greater_than,esk1_1(X1),X1)|exemplifies_property(none_greater,X1)|~exemplifies_property(conceivable,X1)|~object(X1))). % 0.15/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.40 # Begin printing tableau % 0.15/0.40 # Found 8 steps % 0.15/0.40 cnf(i_0_13, negated_conjecture, (~exemplifies_property(existence,god)), inference(start_rule)). % 0.15/0.40 cnf(i_0_14, plain, (~exemplifies_property(existence,god)), inference(extension_rule, [i_0_10])). % 0.15/0.40 cnf(i_0_46, plain, (~is_the(god,none_greater)), inference(closure_rule, [i_0_12])). % 0.15/0.40 cnf(i_0_44, plain, (exemplifies_relation(greater_than,esk2_1(god),god)), inference(extension_rule, [i_0_7])). % 0.15/0.40 cnf(i_0_66, plain, (~exemplifies_property(none_greater,god)), inference(etableau_closure_rule, [i_0_66, ...])). % 0.15/0.40 cnf(i_0_67, plain, (~exemplifies_property(conceivable,esk2_1(god))), inference(etableau_closure_rule, [i_0_67, ...])). % 0.15/0.40 cnf(i_0_68, plain, (~object(god)), inference(etableau_closure_rule, [i_0_68, ...])). % 0.15/0.40 cnf(i_0_69, plain, (~object(esk2_1(god))), inference(etableau_closure_rule, [i_0_69, ...])). % 0.15/0.40 # End printing tableau % 0.15/0.40 # SZS output end % 0.15/0.40 # Branches closed with saturation will be marked with an "s" % 0.15/0.40 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.15/0.40 # We now have 4 tableaux to operate on % 0.15/0.40 # Found closed tableau during pool population. % 0.15/0.40 # Proof search is over... % 0.15/0.40 # Freeing feature tree %------------------------------------------------------------------------------