%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWB014+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 : n029.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:27 EDT 2022 % Result : Theorem 0.18s 0.37s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SWB014+2 : TPTP v8.1.0. Released v5.2.0. % 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n029.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Wed Jun 1 08:48:45 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.36 # No SInE strategy applied % 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI % 0.18/0.36 # and selection function SelectCQArNTNpEqFirst. % 0.18/0.36 # % 0.18/0.36 # Presaturation interreduction done % 0.18/0.36 # Number of axioms: 20 Number of unprocessed: 20 % 0.18/0.36 # Tableaux proof search. % 0.18/0.36 # APR header successfully linked. % 0.18/0.36 # Hello from C++ % 0.18/0.36 # The folding up rule is enabled... % 0.18/0.36 # Local unification is enabled... % 0.18/0.36 # Any saturation attempts will use folding labels... % 0.18/0.36 # 20 beginning clauses after preprocessing and clausification % 0.18/0.36 # Creating start rules for all 1 conjectures. % 0.18/0.36 # There are 1 start rule candidates: % 0.18/0.36 # Found 8 unit axioms. % 0.18/0.36 # 1 start rule tableaux created. % 0.18/0.36 # 12 extension rule candidate clauses % 0.18/0.36 # 8 unit axiom clauses % 0.18/0.36 % 0.18/0.36 # Requested 8, 32 cores available to the main process. % 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.18/0.37 # There were 2 total branch saturation attempts. % 0.18/0.37 # There were 0 of these attempts blocked. % 0.18/0.37 # There were 0 deferred branch saturation attempts. % 0.18/0.37 # There were 0 free duplicated saturations. % 0.18/0.37 # There were 2 total successful branch saturations. % 0.18/0.37 # There were 0 successful branch saturations in interreduction. % 0.18/0.37 # There were 0 successful branch saturations on the branch. % 0.18/0.37 # There were 2 successful branch saturations after the branch. % 0.18/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.37 # Begin clausification derivation % 0.18/0.37 % 0.18/0.37 # End clausification derivation % 0.18/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.37 cnf(i_0_18, plain, (iext(uri_rdf_type,uri_ex_harry,esk2_0))). % 0.18/0.37 cnf(i_0_20, plain, (iext(uri_rdf_type,uri_ex_Eagle,uri_ex_Species))). % 0.18/0.37 cnf(i_0_19, plain, (iext(uri_rdf_type,uri_ex_Falcon,uri_ex_Species))). % 0.18/0.37 cnf(i_0_16, plain, (iext(uri_rdf_first,esk3_0,uri_ex_Eagle))). % 0.18/0.37 cnf(i_0_14, plain, (iext(uri_rdf_first,esk4_0,uri_ex_Falcon))). % 0.18/0.37 cnf(i_0_15, plain, (iext(uri_rdf_rest,esk3_0,esk4_0))). % 0.18/0.37 cnf(i_0_13, plain, (iext(uri_rdf_rest,esk4_0,uri_rdf_nil))). % 0.18/0.37 cnf(i_0_17, plain, (iext(uri_owl_unionOf,esk2_0,esk3_0))). % 0.18/0.37 cnf(i_0_12, negated_conjecture, (~iext(uri_rdf_type,X1,uri_ex_Species)|~iext(uri_rdf_type,uri_ex_harry,X1))). % 0.18/0.37 cnf(i_0_1, plain, (iext(uri_rdf_type,X1,X2)|~icext(X2,X1))). % 0.18/0.37 cnf(i_0_2, plain, (icext(X1,X2)|~iext(uri_rdf_type,X2,X1))). % 0.18/0.37 cnf(i_0_9, 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_unionOf,X5,X3))). % 0.18/0.37 cnf(i_0_10, 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_unionOf,X5,X4))). % 0.18/0.37 cnf(i_0_11, 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_unionOf,X1,X4))). % 0.18/0.37 cnf(i_0_6, plain, (icext(X1,X2)|~icext(X3,X2)|~iext(uri_rdf_rest,X4,uri_rdf_nil)|~iext(uri_rdf_first,X4,X3)|~iext(uri_rdf_first,X5,X6)|~iext(uri_rdf_rest,X5,X4)|~iext(uri_owl_unionOf,X1,X5))). % 0.18/0.37 cnf(i_0_7, 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,X3)|~iext(uri_rdf_rest,X6,X4)|~iext(uri_owl_unionOf,X1,X6))). % 0.18/0.37 cnf(i_0_8, 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,X1)|~iext(uri_rdf_rest,X6,X5)|~iext(uri_owl_unionOf,X4,X6))). % 0.18/0.37 cnf(i_0_5, plain, (iext(uri_owl_unionOf,X1,X2)|~ic(X3)|~ic(X1)|~ic(X4)|~icext(X1,esk1_5(X1,X2,X4,X5,X3))|~icext(X4,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.18/0.37 cnf(i_0_4, plain, (iext(uri_owl_unionOf,X1,X2)|~ic(X3)|~ic(X1)|~ic(X4)|~icext(X1,esk1_5(X1,X2,X3,X5,X4))|~icext(X4,esk1_5(X1,X2,X3,X5,X4))|~iext(uri_rdf_rest,X5,uri_rdf_nil)|~iext(uri_rdf_first,X5,X4)|~iext(uri_rdf_first,X2,X3)|~iext(uri_rdf_rest,X2,X5))). % 0.18/0.37 cnf(i_0_3, plain, (icext(X1,esk1_5(X1,X2,X3,X4,X5))|icext(X3,esk1_5(X1,X2,X3,X4,X5))|icext(X5,esk1_5(X1,X2,X3,X4,X5))|iext(uri_owl_unionOf,X1,X2)|~ic(X5)|~ic(X3)|~ic(X1)|~iext(uri_rdf_rest,X4,uri_rdf_nil)|~iext(uri_rdf_first,X4,X5)|~iext(uri_rdf_first,X2,X3)|~iext(uri_rdf_rest,X2,X4))). % 0.18/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.37 # Begin printing tableau % 0.18/0.37 # Found 10 steps % 0.18/0.37 cnf(i_0_12, negated_conjecture, (~iext(uri_rdf_type,uri_ex_Eagle,uri_ex_Species)|~iext(uri_rdf_type,uri_ex_harry,uri_ex_Eagle)), inference(start_rule)). % 0.18/0.37 cnf(i_0_21, plain, (~iext(uri_rdf_type,uri_ex_Eagle,uri_ex_Species)), inference(closure_rule, [i_0_20])). % 0.18/0.37 cnf(i_0_22, plain, (~iext(uri_rdf_type,uri_ex_harry,uri_ex_Eagle)), inference(extension_rule, [i_0_1])). % 0.18/0.37 cnf(i_0_24, plain, (~icext(uri_ex_Eagle,uri_ex_harry)), inference(extension_rule, [i_0_6])). % 0.18/0.37 cnf(i_0_124, plain, (~iext(uri_rdf_rest,esk4_0,uri_rdf_nil)), inference(closure_rule, [i_0_13])). % 0.18/0.37 cnf(i_0_125, plain, (~iext(uri_rdf_first,esk4_0,uri_ex_Falcon)), inference(closure_rule, [i_0_14])). % 0.18/0.37 cnf(i_0_126, plain, (~iext(uri_rdf_first,esk3_0,uri_ex_Eagle)), inference(closure_rule, [i_0_16])). % 0.18/0.37 cnf(i_0_127, plain, (~iext(uri_rdf_rest,esk3_0,esk4_0)), inference(closure_rule, [i_0_15])). % 0.18/0.37 cnf(i_0_123, plain, (~icext(uri_ex_Falcon,uri_ex_harry)), inference(etableau_closure_rule, [i_0_123, ...])). % 0.18/0.37 cnf(i_0_128, plain, (~iext(uri_owl_unionOf,uri_ex_Eagle,esk3_0)), inference(etableau_closure_rule, [i_0_128, ...])). % 0.18/0.37 # End printing tableau % 0.18/0.37 # SZS output end % 0.18/0.37 # Branches closed with saturation will be marked with an "s" % 0.18/0.37 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux. % 0.18/0.37 # We now have 1 tableaux to operate on % 0.18/0.37 # Found closed tableau during pool population. % 0.18/0.37 # Proof search is over... % 0.18/0.37 # Freeing feature tree %------------------------------------------------------------------------------