%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : CSR101+6 : TPTP v8.1.0. Bugfixed v7.3.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 : n024.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 : Fri Jul 15 03:17:33 EDT 2022 % Result : Theorem 1.45s 1.65s % Output : CNFRefutation 1.45s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : CSR101+6 : TPTP v8.1.0. Bugfixed v7.3.0. % 0.07/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.35 % Computer : n024.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Thu Jun 9 18:10:34 EDT 2022 % 0.13/0.35 % CPUTime : % 1.45/1.65 # SinE strategy is gf200_h_gu_R03_F100_L20000 % 1.45/1.65 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 1.45/1.65 # and selection function SelectComplexExceptUniqMaxHorn. % 1.45/1.65 # % 1.45/1.65 # Presaturation interreduction done % 1.45/1.65 # Number of axioms: 20 Number of unprocessed: 20 % 1.45/1.65 # Tableaux proof search. % 1.45/1.65 # APR header successfully linked. % 1.45/1.65 # Hello from C++ % 1.45/1.65 # The folding up rule is enabled... % 1.45/1.65 # Local unification is enabled... % 1.45/1.65 # Any saturation attempts will use folding labels... % 1.45/1.65 # 20 beginning clauses after preprocessing and clausification % 1.45/1.65 # Creating start rules for all 2 conjectures. % 1.45/1.65 # There are 2 start rule candidates: % 1.45/1.65 # Found 14 unit axioms. % 1.45/1.65 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 1.45/1.65 # 2 start rule tableaux created. % 1.45/1.65 # 6 extension rule candidate clauses % 1.45/1.65 # 14 unit axiom clauses % 1.45/1.65 % 1.45/1.65 # Requested 8, 32 cores available to the main process. % 1.45/1.65 # There are not enough tableaux to fork, creating more from the initial 2 % 1.45/1.65 # There were 1 total branch saturation attempts. % 1.45/1.65 # There were 0 of these attempts blocked. % 1.45/1.65 # There were 0 deferred branch saturation attempts. % 1.45/1.65 # There were 0 free duplicated saturations. % 1.45/1.65 # There were 1 total successful branch saturations. % 1.45/1.65 # There were 0 successful branch saturations in interreduction. % 1.45/1.65 # There were 0 successful branch saturations on the branch. % 1.45/1.65 # There were 1 successful branch saturations after the branch. % 1.45/1.65 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.45/1.65 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.45/1.65 # Begin clausification derivation % 1.45/1.65 % 1.45/1.65 # End clausification derivation % 1.45/1.65 # Begin listing active clauses obtained from FOF to CNF conversion % 1.45/1.65 cnf(i_0_2, negated_conjecture, (s__instance(esk1_0,s__Class32_2))). % 1.45/1.65 cnf(i_0_5, plain, (s__subclass(s__Class32_1,s__Class32_2))). % 1.45/1.65 cnf(i_0_3, plain, (s__instance(s__Class32_1,s__Class))). % 1.45/1.65 cnf(i_0_7, plain, (s__instance(s__Class32_2,s__Class))). % 1.45/1.65 cnf(i_0_17, plain, (s__subclass(s__Animal,s__Organism))). % 1.45/1.65 cnf(i_0_4, plain, (s__subclass(s__Class32_1,s__Animal))). % 1.45/1.65 cnf(i_0_24, plain, (s__subclass(s__Organism,s__Agent))). % 1.45/1.65 cnf(i_0_10, plain, (s__subclass(s__Class,s__SetOrClass))). % 1.45/1.65 cnf(i_0_8, plain, (s__subclass(s__Class32_2,s__Animal))). % 1.45/1.65 cnf(i_0_9, plain, (s__subclass(s__Class32_2,s__Class32_3))). % 1.45/1.65 cnf(i_0_6, plain, (s__subclass(s__Class32_3,s__Class32_1))). % 1.45/1.65 cnf(i_0_18, plain, (s__instance(s__Class32_3,s__Class))). % 1.45/1.65 cnf(i_0_19, plain, (s__subclass(s__Class32_3,s__Animal))). % 1.45/1.65 cnf(i_0_1, negated_conjecture, (~s__instance(esk1_0,s__Class32_1))). % 1.45/1.65 cnf(i_0_11, plain, (s__instance(X1,s__SetOrClass)|~s__subclass(X2,X1))). % 1.45/1.65 cnf(i_0_12, plain, (s__instance(X1,s__SetOrClass)|~s__subclass(X1,X2))). % 1.45/1.65 cnf(i_0_14, plain, (s__subclass(X1,X1)|~s__instance(X1,s__SetOrClass))). % 1.45/1.65 cnf(i_0_15, plain, (X1=X2|~s__subclass(X2,X1)|~s__subclass(X1,X2))). % 1.45/1.65 cnf(i_0_13, plain, (s__instance(X1,X2)|~s__instance(X1,X3)|~s__subclass(X3,X2))). % 1.45/1.65 cnf(i_0_16, plain, (s__subclass(X1,X2)|~s__subclass(X1,X3)|~s__subclass(X3,X2))). % 1.45/1.65 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.45/1.65 # Begin printing tableau % 1.45/1.65 # Found 6 steps % 1.45/1.65 cnf(i_0_2, negated_conjecture, (s__instance(esk1_0,s__Class32_2)), inference(start_rule)). % 1.45/1.65 cnf(i_0_26, plain, (s__instance(esk1_0,s__Class32_2)), inference(extension_rule, [i_0_13])). % 1.45/1.65 cnf(i_0_51, plain, (s__instance(esk1_0,s__Class32_1)), inference(closure_rule, [i_0_1])). % 1.45/1.65 cnf(i_0_53, plain, (~s__subclass(s__Class32_2,s__Class32_1)), inference(extension_rule, [i_0_16])). % 1.45/1.65 cnf(i_0_70, plain, (~s__subclass(s__Class32_2,s__Animal)), inference(closure_rule, [i_0_8])). % 1.45/1.65 cnf(i_0_71, plain, (~s__subclass(s__Animal,s__Class32_1)), inference(etableau_closure_rule, [i_0_71, ...])). % 1.45/1.65 # End printing tableau % 1.45/1.65 # SZS output end % 1.45/1.65 # Branches closed with saturation will be marked with an "s" % 1.45/1.65 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 1.45/1.65 # We now have 2 tableaux to operate on % 1.45/1.65 # Found closed tableau during pool population. % 1.45/1.65 # Proof search is over... % 1.45/1.65 # Freeing feature tree %------------------------------------------------------------------------------