%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWB024+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.20s 0.38s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SWB024+2 : TPTP v8.1.0. Released v5.2.0. % 0.04/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n027.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Wed Jun 1 01:10:33 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 23 Number of unprocessed: 23 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.38 # The folding up rule is enabled... % 0.20/0.38 # Local unification is enabled... % 0.20/0.38 # Any saturation attempts will use folding labels... % 0.20/0.38 # 23 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 1 conjectures. % 0.20/0.38 # There are 1 start rule candidates: % 0.20/0.38 # Found 8 unit axioms. % 0.20/0.38 # 1 start rule tableaux created. % 0.20/0.38 # 15 extension rule candidate clauses % 0.20/0.38 # 8 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.38 # There were 3 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 3 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 3 successful branch saturations after the branch. % 0.20/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_16, plain, (iext(uri_ex_hasAncestor,uri_ex_alice,uri_ex_bob))). % 0.20/0.38 cnf(i_0_23, plain, (iext(uri_rdf_type,uri_ex_hasAncestor,uri_owl_TransitiveProperty))). % 0.20/0.38 cnf(i_0_17, plain, (iext(uri_rdf_type,uri_ex_bob,uri_ex_Person))). % 0.20/0.38 cnf(i_0_18, plain, (iext(uri_rdf_type,uri_ex_alice,uri_ex_Person))). % 0.20/0.38 cnf(i_0_20, plain, (iext(uri_owl_onProperty,esk6_0,uri_ex_hasAncestor))). % 0.20/0.38 cnf(i_0_21, plain, (iext(uri_rdf_type,esk6_0,uri_owl_Restriction))). % 0.20/0.38 cnf(i_0_22, plain, (iext(uri_rdfs_subClassOf,uri_ex_Person,esk6_0))). % 0.20/0.38 cnf(i_0_19, plain, (iext(uri_owl_minCardinality,esk6_0,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger)))). % 0.20/0.38 cnf(i_0_15, negated_conjecture, (~iext(uri_ex_hasAncestor,uri_ex_bob,X1)|~iext(uri_ex_hasAncestor,uri_ex_alice,X1))). % 0.20/0.38 cnf(i_0_14, plain, (ip(X1)|~icext(uri_owl_TransitiveProperty,X1))). % 0.20/0.39 cnf(i_0_8, plain, (ic(X1)|~iext(uri_rdfs_subClassOf,X2,X1))). % 0.20/0.39 cnf(i_0_9, plain, (ic(X1)|~iext(uri_rdfs_subClassOf,X1,X2))). % 0.20/0.39 cnf(i_0_1, plain, (iext(uri_rdf_type,X1,X2)|~icext(X2,X1))). % 0.20/0.39 cnf(i_0_2, plain, (icext(X1,X2)|~iext(uri_rdf_type,X2,X1))). % 0.20/0.39 cnf(i_0_10, plain, (icext(uri_owl_TransitiveProperty,X1)|~ip(X1)|~iext(X1,esk3_1(X1),esk5_1(X1)))). % 0.20/0.39 cnf(i_0_7, plain, (icext(X1,X2)|~icext(X3,X2)|~iext(uri_rdfs_subClassOf,X3,X1))). % 0.20/0.39 cnf(i_0_12, plain, (icext(uri_owl_TransitiveProperty,X1)|iext(X1,esk3_1(X1),esk4_1(X1))|~ip(X1))). % 0.20/0.39 cnf(i_0_11, plain, (icext(uri_owl_TransitiveProperty,X1)|iext(X1,esk4_1(X1),esk5_1(X1))|~ip(X1))). % 0.20/0.39 cnf(i_0_5, plain, (iext(uri_rdfs_subClassOf,X1,X2)|~ic(X1)|~ic(X2)|~icext(X2,esk2_2(X1,X2)))). % 0.20/0.39 cnf(i_0_6, plain, (icext(X1,esk2_2(X1,X2))|iext(uri_rdfs_subClassOf,X1,X2)|~ic(X2)|~ic(X1))). % 0.20/0.39 cnf(i_0_13, plain, (iext(X1,X2,X3)|~icext(uri_owl_TransitiveProperty,X1)|~iext(X1,X4,X3)|~iext(X1,X2,X4))). % 0.20/0.39 cnf(i_0_3, plain, (icext(X1,X2)|~iext(uri_owl_minCardinality,X1,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))|~iext(uri_owl_onProperty,X1,X3)|~iext(X3,X2,X4))). % 0.20/0.39 cnf(i_0_4, plain, (iext(X1,X2,esk1_3(X3,X1,X2))|~icext(X3,X2)|~iext(uri_owl_minCardinality,X3,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))|~iext(uri_owl_onProperty,X3,X1))). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 8 steps % 0.20/0.39 cnf(i_0_15, negated_conjecture, (~iext(uri_ex_hasAncestor,uri_ex_bob,uri_ex_bob)|~iext(uri_ex_hasAncestor,uri_ex_alice,uri_ex_bob)), inference(start_rule)). % 0.20/0.39 cnf(i_0_25, plain, (~iext(uri_ex_hasAncestor,uri_ex_alice,uri_ex_bob)), inference(closure_rule, [i_0_16])). % 0.20/0.39 cnf(i_0_24, plain, (~iext(uri_ex_hasAncestor,uri_ex_bob,uri_ex_bob)), inference(extension_rule, [i_0_13])). % 0.20/0.39 cnf(i_0_58, plain, (~iext(uri_ex_hasAncestor,uri_ex_alice,uri_ex_bob)), inference(closure_rule, [i_0_16])). % 0.20/0.39 cnf(i_0_57, plain, (~icext(uri_owl_TransitiveProperty,uri_ex_hasAncestor)), inference(extension_rule, [i_0_10])). % 0.20/0.39 cnf(i_0_59, plain, (~iext(uri_ex_hasAncestor,uri_ex_bob,uri_ex_alice)), inference(etableau_closure_rule, [i_0_59, ...])). % 0.20/0.39 cnf(i_0_81, plain, (~ip(uri_ex_hasAncestor)), inference(etableau_closure_rule, [i_0_81, ...])). % 0.20/0.39 cnf(i_0_82, plain, (~iext(uri_ex_hasAncestor,esk3_1(uri_ex_hasAncestor),esk5_1(uri_ex_hasAncestor))), inference(etableau_closure_rule, [i_0_82, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.20/0.39 # We now have 2 tableaux to operate on % 0.20/0.39 # Found closed tableau during pool population. % 0.20/0.39 # Proof search is over... % 0.20/0.39 # Freeing feature tree %------------------------------------------------------------------------------