%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN918+1 : TPTP v8.1.0. Released v3.1.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 : Thu Jul 21 06:14:50 EDT 2022 % Result : Theorem 0.12s 0.36s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : SYN918+1 : TPTP v8.1.0. Released v3.1.0. % 0.11/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 : Mon Jul 11 19:27:32 EDT 2022 % 0.12/0.33 % 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_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 9 Number of unprocessed: 9 % 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.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 9 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 9 conjectures. % 0.12/0.36 # There are 9 start rule candidates: % 0.12/0.36 # Found 0 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 9 start rule tableaux created. % 0.12/0.36 # 9 extension rule candidate clauses % 0.12/0.36 # 0 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There were 1 total branch saturation attempts. % 0.12/0.36 # There were 0 of these attempts blocked. % 0.12/0.36 # There were 0 deferred branch saturation attempts. % 0.12/0.36 # There were 0 free duplicated saturations. % 0.12/0.36 # There were 1 total successful branch saturations. % 0.12/0.36 # There were 0 successful branch saturations in interreduction. % 0.12/0.36 # There were 0 successful branch saturations on the branch. % 0.12/0.36 # There were 1 successful branch saturations after the branch. % 0.12/0.36 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.36 # Begin clausification derivation % 0.12/0.36 % 0.12/0.36 # End clausification derivation % 0.12/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.36 cnf(i_0_7, negated_conjecture, (g(X1)|f(esk1_0))). % 0.12/0.36 cnf(i_0_4, negated_conjecture, (~h(X1)|~g(esk1_0))). % 0.12/0.36 cnf(i_0_5, negated_conjecture, (f(esk1_0)|~h(X1))). % 0.12/0.36 cnf(i_0_8, negated_conjecture, (f(X1)|~g(esk1_0))). % 0.12/0.36 cnf(i_0_6, negated_conjecture, (g(X1)|~g(esk1_0))). % 0.12/0.36 cnf(i_0_9, negated_conjecture, (f(esk1_0)|f(X1))). % 0.12/0.36 cnf(i_0_2, negated_conjecture, (g(X1)|~h(X1)|~f(X1))). % 0.12/0.36 cnf(i_0_1, negated_conjecture, (h(X1)|~g(X1)|~f(X1))). % 0.12/0.36 cnf(i_0_3, negated_conjecture, (h(X1)|g(X2)|~f(X1)|~f(X2))). % 0.12/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.36 # Begin printing tableau % 0.12/0.36 # Found 14 steps % 0.12/0.36 cnf(i_0_4, negated_conjecture, (~h(esk1_0)|~g(esk1_0)), inference(start_rule)). % 0.12/0.36 cnf(i_0_28, plain, (~h(esk1_0)), inference(extension_rule, [i_0_3])). % 0.12/0.36 cnf(i_0_33, plain, (g(esk1_0)), inference(extension_rule, [i_0_6])). % 0.12/0.36 cnf(i_0_44, plain, (g(esk1_0)), inference(extension_rule, [i_0_1])). % 0.12/0.36 cnf(i_0_46, plain, (h(esk1_0)), inference(closure_rule, [i_0_28])). % 0.12/0.36 cnf(i_0_34, plain, (~f(esk1_0)), inference(extension_rule, [i_0_9])). % 0.12/0.36 cnf(i_0_53, plain, (f(esk1_0)), inference(closure_rule, [i_0_34])). % 0.12/0.36 cnf(i_0_35, plain, (~f(esk1_0)), inference(closure_rule, [i_0_34])). % 0.12/0.36 cnf(i_0_48, plain, (~f(esk1_0)), inference(closure_rule, [i_0_34])). % 0.12/0.36 cnf(i_0_29, plain, (~g(esk1_0)), inference(extension_rule, [i_0_7])). % 0.12/0.36 cnf(i_0_64, plain, (f(esk1_0)), inference(extension_rule, [i_0_3])). % 0.12/0.36 cnf(i_0_75, plain, (g(esk1_0)), inference(closure_rule, [i_0_29])). % 0.12/0.36 cnf(i_0_77, plain, (~f(esk1_0)), inference(closure_rule, [i_0_64])). % 0.12/0.36 cnf(i_0_74, plain, (h(esk1_0)), inference(etableau_closure_rule, [i_0_74, ...])). % 0.12/0.36 # End printing tableau % 0.12/0.36 # SZS output end % 0.12/0.36 # Branches closed with saturation will be marked with an "s" % 0.12/0.36 # There were 3 total branch saturation attempts. % 0.12/0.36 # There were 0 of these attempts blocked. % 0.12/0.36 # There were 0 deferred branch saturation attempts. % 0.12/0.36 # There were 0 free duplicated saturations. % 0.12/0.36 # There were 3 total successful branch saturations. % 0.12/0.36 # There were 2 successful branch saturations in interreduction. % 0.12/0.36 # There were 0 successful branch saturations on the branch. % 0.12/0.36 # There were 1 successful branch saturations after the branch. % 0.12/0.36 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.36 # Begin clausification derivation % 0.12/0.36 % 0.12/0.36 # End clausification derivation % 0.12/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.36 cnf(i_0_7, negated_conjecture, (g(X1)|f(esk1_0))). % 0.12/0.36 cnf(i_0_4, negated_conjecture, (~h(X1)|~g(esk1_0))). % 0.12/0.36 cnf(i_0_5, negated_conjecture, (f(esk1_0)|~h(X1))). % 0.12/0.36 cnf(i_0_8, negated_conjecture, (f(X1)|~g(esk1_0))). % 0.12/0.36 cnf(i_0_6, negated_conjecture, (g(X1)|~g(esk1_0))). % 0.12/0.36 cnf(i_0_9, negated_conjecture, (f(esk1_0)|f(X1))). % 0.12/0.36 cnf(i_0_2, negated_conjecture, (g(X1)|~h(X1)|~f(X1))). % 0.12/0.36 cnf(i_0_1, negated_conjecture, (h(X1)|~g(X1)|~f(X1))). % 0.12/0.36 cnf(i_0_3, negated_conjecture, (h(X1)|g(X2)|~f(X1)|~f(X2))). % 0.12/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.36 # Begin printing tableau % 0.12/0.36 # Found 9 steps % 0.12/0.36 cnf(i_0_2, negated_conjecture, (g(esk1_0)|~h(esk1_0)|~f(esk1_0)), inference(start_rule)). % 0.12/0.36 cnf(i_0_17, plain, (g(esk1_0)), inference(extension_rule, [i_0_6])). % 0.12/0.36 cnf(i_0_44, plain, (g(esk1_0)), inference(extension_rule, [i_0_1])). % 0.12/0.36 cnf(i_0_18, plain, (~h(esk1_0)), inference(etableau_closure_rule, [i_0_18, ...])). % 0.12/0.36 cnf(i_0_19, plain, (~f(esk1_0)), inference(etableau_closure_rule, [i_0_19, ...])). % 0.12/0.36 cnf(i_0_50, plain, (h(esk1_0)), inference(extension_rule, [i_0_5])). % 0.12/0.36 cnf(i_0_52, plain, (~f(esk1_0)), inference(extension_rule, [i_0_9])). % 0.12/0.36 cnf(i_0_85, plain, (f(esk1_0)), inference(closure_rule, [i_0_52])). % 0.12/0.36 cnf(i_0_75, plain, (f(esk1_0)), inference(etableau_closure_rule, [i_0_75, ...])). % 0.12/0.36 # End printing tableau % 0.12/0.36 # SZS output end % 0.12/0.36 # Branches closed with saturation will be marked with an "s" % 0.12/0.36 # Child (6527) has found a proof. % 0.12/0.36 % 0.12/0.36 # Proof search is over... % 0.12/0.36 # Freeing feature tree %------------------------------------------------------------------------------