%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWB025+2 : TPTP v8.1.0. Released v5.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 : n027.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 : Tue Jul 19 19:02:33 EDT 2022 % Result : Theorem 0.45s 0.74s % Output : CNFRefutation 0.45s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SWB025+2 : TPTP v8.1.0. Released v5.2.0. % 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n027.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Wed Jun 1 08:40:48 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI % 0.12/0.36 # and selection function SelectCQArNTNpEqFirst. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 29 Number of unprocessed: 29 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 29 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 1 conjectures. % 0.12/0.37 # There are 1 start rule candidates: % 0.12/0.37 # Found 15 unit axioms. % 0.12/0.37 # 1 start rule tableaux created. % 0.12/0.37 # 14 extension rule candidate clauses % 0.12/0.37 # 15 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.44/0.61 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.44/0.61 # We now have 11 tableaux to operate on % 0.45/0.74 # There were 23 total branch saturation attempts. % 0.45/0.74 # There were 0 of these attempts blocked. % 0.45/0.74 # There were 0 deferred branch saturation attempts. % 0.45/0.74 # There were 12 free duplicated saturations. % 0.45/0.74 # There were 23 total successful branch saturations. % 0.45/0.74 # There were 0 successful branch saturations in interreduction. % 0.45/0.74 # There were 0 successful branch saturations on the branch. % 0.45/0.74 # There were 11 successful branch saturations after the branch. % 0.45/0.74 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.45/0.74 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.45/0.74 # Begin clausification derivation % 0.45/0.74 % 0.45/0.74 # End clausification derivation % 0.45/0.74 # Begin listing active clauses obtained from FOF to CNF conversion % 0.45/0.74 cnf(i_0_17, plain, (iext(uri_ex_hasCousin,uri_ex_alice,uri_ex_bob))). % 0.45/0.74 cnf(i_0_15, plain, (iext(uri_ex_hasUncle,uri_ex_bob,uri_ex_dave))). % 0.45/0.74 cnf(i_0_16, plain, (iext(uri_ex_hasFather,uri_ex_bob,uri_ex_charly))). % 0.45/0.74 cnf(i_0_28, plain, (iext(uri_rdf_first,esk6_0,uri_ex_hasCousin))). % 0.45/0.74 cnf(i_0_26, plain, (iext(uri_rdf_first,esk7_0,uri_ex_hasFather))). % 0.45/0.74 cnf(i_0_23, plain, (iext(uri_rdf_first,esk8_0,uri_ex_hasUncle))). % 0.45/0.74 cnf(i_0_21, plain, (iext(uri_rdf_first,esk9_0,esk10_0))). % 0.45/0.74 cnf(i_0_27, plain, (iext(uri_rdf_rest,esk6_0,esk7_0))). % 0.45/0.74 cnf(i_0_29, plain, (iext(uri_owl_propertyChainAxiom,uri_ex_hasUncle,esk6_0))). % 0.45/0.74 cnf(i_0_24, plain, (iext(uri_owl_propertyChainAxiom,uri_ex_hasCousin,esk8_0))). % 0.45/0.74 cnf(i_0_18, plain, (iext(uri_ex_hasFather,uri_ex_alice,uri_ex_dave))). % 0.45/0.74 cnf(i_0_25, plain, (iext(uri_rdf_rest,esk7_0,uri_rdf_nil))). % 0.45/0.74 cnf(i_0_22, plain, (iext(uri_rdf_rest,esk8_0,esk9_0))). % 0.45/0.74 cnf(i_0_20, plain, (iext(uri_rdf_rest,esk9_0,uri_rdf_nil))). % 0.45/0.74 cnf(i_0_19, plain, (iext(uri_owl_inverseOf,esk10_0,uri_ex_hasFather))). % 0.45/0.74 cnf(i_0_14, negated_conjecture, (~iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly)|~iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice))). % 0.45/0.74 cnf(i_0_12, plain, (ip(X1)|~iext(uri_owl_inverseOf,X2,X1))). % 0.45/0.74 cnf(i_0_13, plain, (ip(X1)|~iext(uri_owl_inverseOf,X1,X2))). % 0.45/0.74 cnf(i_0_10, plain, (iext(X1,X2,X3)|~iext(uri_owl_inverseOf,X1,X4)|~iext(X4,X3,X2))). % 0.45/0.74 cnf(i_0_11, plain, (iext(X1,X2,X3)|~iext(uri_owl_inverseOf,X4,X1)|~iext(X4,X3,X2))). % 0.45/0.74 cnf(i_0_5, plain, (ip(X1)|~iext(uri_rdf_rest,X2,uri_rdf_nil)|~iext(uri_rdf_first,X2,X1)|~iext(uri_rdf_first,X3,X4)|~iext(uri_rdf_rest,X3,X2)|~iext(uri_owl_propertyChainAxiom,X5,X3))). % 0.45/0.74 cnf(i_0_6, plain, (ip(X1)|~iext(uri_rdf_rest,X2,uri_rdf_nil)|~iext(uri_rdf_first,X2,X3)|~iext(uri_rdf_first,X4,X1)|~iext(uri_rdf_rest,X4,X2)|~iext(uri_owl_propertyChainAxiom,X5,X4))). % 0.45/0.74 cnf(i_0_7, plain, (ip(X1)|~iext(uri_rdf_rest,X2,uri_rdf_nil)|~iext(uri_rdf_first,X2,X3)|~iext(uri_rdf_first,X4,X5)|~iext(uri_rdf_rest,X4,X2)|~iext(uri_owl_propertyChainAxiom,X1,X4))). % 0.45/0.74 cnf(i_0_9, plain, (iext(uri_owl_inverseOf,X1,X2)|~ip(X2)|~ip(X1)|~iext(X2,esk5_2(X1,X2),esk4_2(X1,X2))|~iext(X1,esk4_2(X1,X2),esk5_2(X1,X2)))). % 0.45/0.74 cnf(i_0_8, plain, (iext(X1,esk4_2(X1,X2),esk5_2(X1,X2))|iext(X2,esk5_2(X1,X2),esk4_2(X1,X2))|iext(uri_owl_inverseOf,X1,X2)|~ip(X2)|~ip(X1))). % 0.45/0.74 cnf(i_0_1, plain, (iext(uri_owl_propertyChainAxiom,X1,X2)|~ip(X3)|~ip(X4)|~ip(X1)|~iext(X1,esk1_5(X1,X2,X4,X5,X3),esk3_5(X1,X2,X4,X5,X3))|~iext(uri_rdf_rest,X5,uri_rdf_nil)|~iext(uri_rdf_first,X5,X3)|~iext(uri_rdf_first,X2,X4)|~iext(uri_rdf_rest,X2,X5))). % 0.45/0.74 cnf(i_0_4, plain, (iext(X1,X2,X3)|~iext(uri_rdf_rest,X4,uri_rdf_nil)|~iext(uri_rdf_first,X4,X5)|~iext(uri_rdf_first,X6,X7)|~iext(uri_rdf_rest,X6,X4)|~iext(uri_owl_propertyChainAxiom,X1,X6)|~iext(X5,X8,X3)|~iext(X7,X2,X8))). % 0.45/0.74 cnf(i_0_3, plain, (iext(X1,esk1_5(X2,X3,X1,X4,X5),esk2_5(X2,X3,X1,X4,X5))|iext(uri_owl_propertyChainAxiom,X2,X3)|~ip(X5)|~ip(X2)|~ip(X1)|~iext(uri_rdf_rest,X4,uri_rdf_nil)|~iext(uri_rdf_first,X4,X5)|~iext(uri_rdf_first,X3,X1)|~iext(uri_rdf_rest,X3,X4))). % 0.45/0.74 cnf(i_0_2, plain, (iext(X1,esk2_5(X2,X3,X4,X5,X1),esk3_5(X2,X3,X4,X5,X1))|iext(uri_owl_propertyChainAxiom,X2,X3)|~ip(X4)|~ip(X2)|~ip(X1)|~iext(uri_rdf_rest,X5,uri_rdf_nil)|~iext(uri_rdf_first,X5,X1)|~iext(uri_rdf_first,X3,X4)|~iext(uri_rdf_rest,X3,X5))). % 0.45/0.74 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.45/0.74 # Begin printing tableau % 0.45/0.74 # Found 14 steps % 0.45/0.74 cnf(i_0_14, negated_conjecture, (~iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly)|~iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice)), inference(start_rule)). % 0.45/0.74 cnf(i_0_31, plain, (~iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice)), inference(extension_rule, [i_0_4])). % 0.45/0.74 cnf(i_0_155, plain, (~iext(uri_rdf_rest,esk7_0,uri_rdf_nil)), inference(closure_rule, [i_0_25])). % 0.45/0.74 cnf(i_0_156, plain, (~iext(uri_rdf_first,esk7_0,uri_ex_hasFather)), inference(closure_rule, [i_0_26])). % 0.45/0.74 cnf(i_0_157, plain, (~iext(uri_rdf_first,esk6_0,uri_ex_hasCousin)), inference(closure_rule, [i_0_28])). % 0.45/0.74 cnf(i_0_158, plain, (~iext(uri_rdf_rest,esk6_0,esk7_0)), inference(closure_rule, [i_0_27])). % 0.45/0.74 cnf(i_0_159, plain, (~iext(uri_owl_propertyChainAxiom,uri_ex_hasCousin,esk6_0)), inference(extension_rule, [i_0_11])). % 0.45/0.74 cnf(i_0_929, plain, (~iext(uri_rdf_first,esk6_0,uri_ex_hasCousin)), inference(closure_rule, [i_0_28])). % 0.45/0.74 cnf(i_0_30, plain, (~iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly)), inference(etableau_closure_rule, [i_0_30, ...])). % 0.45/0.74 cnf(i_0_928, plain, (~iext(uri_owl_inverseOf,uri_rdf_first,uri_owl_propertyChainAxiom)), inference(etableau_closure_rule, [i_0_928, ...])). % 0.45/0.74 cnf(i_0_160, plain, (~iext(uri_ex_hasFather,uri_ex_bob,uri_ex_alice)), inference(extension_rule, [i_0_10])). % 0.45/0.74 cnf(i_0_3807, plain, (~iext(uri_ex_hasCousin,uri_ex_alice,uri_ex_bob)), inference(closure_rule, [i_0_17])). % 0.45/0.74 cnf(i_0_161, plain, (~iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_bob)), inference(etableau_closure_rule, [i_0_161, ...])). % 0.45/0.74 cnf(i_0_3806, plain, (~iext(uri_owl_inverseOf,uri_ex_hasFather,uri_ex_hasCousin)), inference(etableau_closure_rule, [i_0_3806, ...])). % 0.45/0.74 # End printing tableau % 0.45/0.74 # SZS output end % 0.45/0.74 # Branches closed with saturation will be marked with an "s" % 0.45/0.74 # Child (26279) has found a proof. % 0.45/0.74 % 0.45/0.74 # Proof search is over... % 0.45/0.74 # Freeing feature tree %------------------------------------------------------------------------------