%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWB029+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 : n019.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:36 EDT 2022 % Result : Theorem 0.13s 0.30s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.08 % Problem : SWB029+2 : TPTP v8.1.0. Released v5.2.0. % 0.00/0.09 % 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 : n019.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 : Wed Jun 1 05:14:25 EDT 2022 % 0.09/0.28 % CPUTime : % 0.13/0.30 # No SInE strategy applied % 0.13/0.30 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI % 0.13/0.30 # and selection function SelectCQArNTNpEqFirst. % 0.13/0.30 # % 0.13/0.30 # Presaturation interreduction done % 0.13/0.30 # Number of axioms: 25 Number of unprocessed: 25 % 0.13/0.30 # Tableaux proof search. % 0.13/0.30 # APR header successfully linked. % 0.13/0.30 # Hello from C++ % 0.13/0.30 # The folding up rule is enabled... % 0.13/0.30 # Local unification is enabled... % 0.13/0.30 # Any saturation attempts will use folding labels... % 0.13/0.30 # 25 beginning clauses after preprocessing and clausification % 0.13/0.30 # Creating start rules for all 1 conjectures. % 0.13/0.30 # There are 1 start rule candidates: % 0.13/0.30 # Found 10 unit axioms. % 0.13/0.30 # 1 start rule tableaux created. % 0.13/0.30 # 15 extension rule candidate clauses % 0.13/0.30 # 10 unit axiom clauses % 0.13/0.30 % 0.13/0.30 # Requested 8, 32 cores available to the main process. % 0.13/0.30 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.30 # There were 2 total branch saturation attempts. % 0.13/0.30 # There were 0 of these attempts blocked. % 0.13/0.30 # There were 0 deferred branch saturation attempts. % 0.13/0.30 # There were 1 free duplicated saturations. % 0.13/0.30 # There were 2 total successful branch saturations. % 0.13/0.30 # There were 0 successful branch saturations in interreduction. % 0.13/0.30 # There were 0 successful branch saturations on the branch. % 0.13/0.30 # There were 1 successful branch saturations after the branch. % 0.13/0.30 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.30 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.30 # Begin clausification derivation % 0.13/0.30 % 0.13/0.30 # End clausification derivation % 0.13/0.30 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.30 cnf(i_0_23, plain, (iext(uri_rdf_type,uri_ex_w,esk2_0))). % 0.13/0.30 cnf(i_0_24, plain, (iext(uri_rdf_type,uri_ex_B,uri_owl_Class))). % 0.13/0.30 cnf(i_0_25, plain, (iext(uri_rdf_type,uri_ex_A,uri_owl_Class))). % 0.13/0.30 cnf(i_0_17, plain, (iext(uri_owl_complementOf,esk3_0,uri_ex_A))). % 0.13/0.30 cnf(i_0_21, plain, (iext(uri_rdf_first,esk4_0,uri_ex_A))). % 0.13/0.30 cnf(i_0_19, plain, (iext(uri_rdf_first,esk5_0,esk3_0))). % 0.13/0.30 cnf(i_0_20, plain, (iext(uri_rdf_rest,esk4_0,esk5_0))). % 0.13/0.30 cnf(i_0_18, plain, (iext(uri_rdf_rest,esk5_0,uri_rdf_nil))). % 0.13/0.30 cnf(i_0_22, plain, (iext(uri_owl_intersectionOf,esk2_0,esk4_0))). % 0.13/0.30 cnf(i_0_16, negated_conjecture, (~iext(uri_rdf_type,uri_ex_w,uri_ex_B))). % 0.13/0.30 cnf(i_0_5, plain, (ic(X1)|~iext(uri_owl_complementOf,X2,X1))). % 0.13/0.30 cnf(i_0_6, plain, (ic(X1)|~iext(uri_owl_complementOf,X1,X2))). % 0.13/0.30 cnf(i_0_1, plain, (iext(uri_rdf_type,X1,X2)|~icext(X2,X1))). % 0.13/0.30 cnf(i_0_2, plain, (icext(X1,X2)|~iext(uri_rdf_type,X2,X1))). % 0.13/0.30 cnf(i_0_4, plain, (~icext(X1,X2)|~icext(X3,X2)|~iext(uri_owl_complementOf,X3,X1))). % 0.13/0.30 cnf(i_0_3, plain, (icext(X1,X2)|icext(X3,X2)|~iext(uri_owl_complementOf,X3,X1))). % 0.13/0.30 cnf(i_0_13, plain, (ic(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_intersectionOf,X5,X3))). % 0.13/0.30 cnf(i_0_14, plain, (ic(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_intersectionOf,X5,X4))). % 0.13/0.30 cnf(i_0_15, plain, (ic(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_intersectionOf,X1,X4))). % 0.13/0.30 cnf(i_0_11, plain, (icext(X1,X2)|~icext(X3,X2)|~iext(uri_rdf_rest,X4,uri_rdf_nil)|~iext(uri_rdf_first,X4,X1)|~iext(uri_rdf_first,X5,X6)|~iext(uri_rdf_rest,X5,X4)|~iext(uri_owl_intersectionOf,X3,X5))). % 0.13/0.30 cnf(i_0_12, plain, (icext(X1,X2)|~icext(X3,X2)|~iext(uri_rdf_rest,X4,uri_rdf_nil)|~iext(uri_rdf_first,X4,X5)|~iext(uri_rdf_first,X6,X1)|~iext(uri_rdf_rest,X6,X4)|~iext(uri_owl_intersectionOf,X3,X6))). % 0.13/0.30 cnf(i_0_10, plain, (icext(X1,X2)|~icext(X3,X2)|~icext(X4,X2)|~iext(uri_rdf_rest,X5,uri_rdf_nil)|~iext(uri_rdf_first,X5,X3)|~iext(uri_rdf_first,X6,X4)|~iext(uri_rdf_rest,X6,X5)|~iext(uri_owl_intersectionOf,X1,X6))). % 0.13/0.30 cnf(i_0_7, plain, (icext(X1,esk1_5(X2,X3,X4,X5,X1))|icext(X2,esk1_5(X2,X3,X4,X5,X1))|iext(uri_owl_intersectionOf,X2,X3)|~ic(X4)|~ic(X2)|~ic(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.13/0.30 cnf(i_0_8, plain, (icext(X1,esk1_5(X2,X3,X1,X4,X5))|icext(X2,esk1_5(X2,X3,X1,X4,X5))|iext(uri_owl_intersectionOf,X2,X3)|~ic(X5)|~ic(X2)|~ic(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.13/0.30 cnf(i_0_9, plain, (iext(uri_owl_intersectionOf,X1,X2)|~ic(X3)|~ic(X4)|~ic(X1)|~icext(X3,esk1_5(X1,X2,X4,X5,X3))|~icext(X4,esk1_5(X1,X2,X4,X5,X3))|~icext(X1,esk1_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.13/0.30 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.30 # Begin printing tableau % 0.13/0.30 # Found 5 steps % 0.13/0.30 cnf(i_0_16, negated_conjecture, (~iext(uri_rdf_type,uri_ex_w,uri_ex_B)), inference(start_rule)). % 0.13/0.30 cnf(i_0_26, plain, (~iext(uri_rdf_type,uri_ex_w,uri_ex_B)), inference(extension_rule, [i_0_1])). % 0.13/0.30 cnf(i_0_32, plain, (~icext(uri_ex_B,uri_ex_w)), inference(extension_rule, [i_0_3])). % 0.13/0.30 cnf(i_0_123, plain, (icext(uri_ex_B,uri_ex_w)), inference(closure_rule, [i_0_32])). % 0.13/0.30 cnf(i_0_125, plain, (~iext(uri_owl_complementOf,uri_ex_B,uri_ex_B)), inference(etableau_closure_rule, [i_0_125, ...])). % 0.13/0.30 # End printing tableau % 0.13/0.30 # SZS output end % 0.13/0.30 # Branches closed with saturation will be marked with an "s" % 0.13/0.30 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.13/0.30 # We now have 2 tableaux to operate on % 0.13/0.30 # Found closed tableau during pool population. % 0.13/0.30 # Proof search is over... % 0.13/0.30 # Freeing feature tree %------------------------------------------------------------------------------