%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN377+1 : TPTP v8.1.0. Released v2.0.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 : n025.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:10:29 EDT 2022 % Result : Theorem 0.12s 0.37s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SYN377+1 : TPTP v8.1.0. Released v2.0.0. % 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n025.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Tue Jul 12 06:11:18 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 8 Number of unprocessed: 3 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 3 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 3 conjectures. % 0.12/0.37 # There are 3 start rule candidates: % 0.12/0.37 # Found 0 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 3 start rule tableaux created. % 0.12/0.37 # 3 extension rule candidate clauses % 0.12/0.37 # 0 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 3 % 0.12/0.37 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 10 tableaux to operate on % 0.12/0.37 # Closed tableau found in foldup close cycle with 2 folds and 3 closures done. % 0.12/0.37 # There were 0 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 0 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 0 successful branch saturations after the branch. % 0.12/0.37 # Closed tableau found in foldup close cycle with 6 folds and 4 closures done. % 0.12/0.37 # There were 0 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 0 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 0 successful branch saturations after the branch. % 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_8, negated_conjecture, (~big_p(esk1_0)|~big_p(esk2_0)|~big_p(esk3_0)|~big_p(X1))). % 0.12/0.37 cnf(i_0_5, negated_conjecture, (big_p(esk4_0)|big_p(esk1_0)|big_p(X1)|big_p(X2))). % 0.12/0.37 cnf(i_0_4, negated_conjecture, (big_p(X1)|big_p(X2)|~big_p(X3)|~big_p(X4))). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 20 steps % 0.12/0.37 cnf(i_0_4, negated_conjecture, (big_p(esk1_0)|big_p(esk1_0)|~big_p(esk1_0)|~big_p(esk1_0)), inference(start_rule)). % 0.12/0.37 cnf(i_0_10, plain, (big_p(esk1_0)), inference(extension_rule, [i_0_8])). % 0.12/0.37 cnf(i_0_41, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_10])). % 0.12/0.37 cnf(i_0_42, plain, (~big_p(esk2_0)), inference(extension_rule, [i_0_4])). % 0.12/0.37 cnf(i_0_46, plain, (big_p(esk2_0)), inference(closure_rule, [i_0_42])). % 0.12/0.37 cnf(i_0_47, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_10])). % 0.12/0.37 cnf(i_0_48, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_10])). % 0.12/0.37 cnf(i_0_43, plain, (~big_p(esk3_0)), inference(extension_rule, [i_0_4])). % 0.12/0.37 cnf(i_0_58, plain, (big_p(esk3_0)), inference(closure_rule, [i_0_43])). % 0.12/0.37 cnf(i_0_59, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_10])). % 0.12/0.37 cnf(i_0_60, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_10])). % 0.12/0.37 cnf(i_0_9, plain, (big_p(esk1_0)), inference(closure_rule, [i_0_10])). % 0.12/0.37 cnf(i_0_11, plain, (~big_p(esk1_0)), inference(extension_rule, [i_0_5])). % 0.12/0.37 cnf(i_0_63, plain, (big_p(esk1_0)), inference(closure_rule, [i_0_11])). % 0.12/0.37 cnf(i_0_64, plain, (big_p(esk1_0)), inference(closure_rule, [i_0_11])). % 0.12/0.37 cnf(i_0_61, plain, (big_p(esk4_0)), inference(extension_rule, [i_0_4])). % 0.12/0.37 cnf(i_0_69, plain, (big_p(esk1_0)), inference(closure_rule, [i_0_11])). % 0.12/0.37 cnf(i_0_70, plain, (big_p(esk1_0)), inference(closure_rule, [i_0_11])). % 0.12/0.37 cnf(i_0_72, plain, (~big_p(esk4_0)), inference(closure_rule, [i_0_61])). % 0.12/0.37 cnf(i_0_12, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_11])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_8, negated_conjecture, (~big_p(esk1_0)|~big_p(esk2_0)|~big_p(esk3_0)|~big_p(X1))). % 0.12/0.37 cnf(i_0_5, negated_conjecture, (big_p(esk4_0)|big_p(esk1_0)|big_p(X1)|big_p(X2))). % 0.12/0.37 cnf(i_0_4, negated_conjecture, (big_p(X1)|big_p(X2)|~big_p(X3)|~big_p(X4))). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 20 steps % 0.12/0.37 cnf(i_0_8, negated_conjecture, (~big_p(esk1_0)|~big_p(esk2_0)|~big_p(esk3_0)|~big_p(esk1_0)), inference(start_rule)). % 0.12/0.37 cnf(i_0_17, plain, (~big_p(esk1_0)), inference(extension_rule, [i_0_4])). % 0.12/0.37 cnf(i_0_46, plain, (big_p(esk1_0)), inference(closure_rule, [i_0_17])). % 0.12/0.37 cnf(i_0_47, plain, (~big_p(esk1_0)), inference(extension_rule, [i_0_5])). % 0.12/0.37 cnf(i_0_51, plain, (big_p(esk1_0)), inference(closure_rule, [i_0_47])). % 0.12/0.37 cnf(i_0_52, plain, (big_p(esk1_0)), inference(closure_rule, [i_0_47])). % 0.12/0.37 cnf(i_0_49, plain, (big_p(esk4_0)), inference(extension_rule, [i_0_4])). % 0.12/0.37 cnf(i_0_57, plain, (big_p(esk1_0)), inference(closure_rule, [i_0_47])). % 0.12/0.37 cnf(i_0_58, plain, (big_p(esk1_0)), inference(closure_rule, [i_0_47])). % 0.12/0.37 cnf(i_0_60, plain, (~big_p(esk4_0)), inference(closure_rule, [i_0_49])). % 0.12/0.37 cnf(i_0_48, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_47])). % 0.12/0.37 cnf(i_0_20, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_17])). % 0.12/0.37 cnf(i_0_18, plain, (~big_p(esk2_0)), inference(extension_rule, [i_0_4])). % 0.12/0.37 cnf(i_0_70, plain, (big_p(esk2_0)), inference(closure_rule, [i_0_18])). % 0.12/0.37 cnf(i_0_71, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_17])). % 0.12/0.37 cnf(i_0_72, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_17])). % 0.12/0.37 cnf(i_0_19, plain, (~big_p(esk3_0)), inference(extension_rule, [i_0_4])). % 0.12/0.37 cnf(i_0_82, plain, (big_p(esk3_0)), inference(closure_rule, [i_0_19])). % 0.12/0.37 cnf(i_0_83, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_17])). % 0.12/0.37 cnf(i_0_84, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_17])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # Closed tableau found in foldup close cycle with 4 folds and 3 closures done. % 0.12/0.37 # There were 0 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 0 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 0 successful branch saturations after the branch. % 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_8, negated_conjecture, (~big_p(esk1_0)|~big_p(esk2_0)|~big_p(esk3_0)|~big_p(X1))). % 0.12/0.37 cnf(i_0_5, negated_conjecture, (big_p(esk4_0)|big_p(esk1_0)|big_p(X1)|big_p(X2))). % 0.12/0.37 cnf(i_0_4, negated_conjecture, (big_p(X1)|big_p(X2)|~big_p(X3)|~big_p(X4))). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 26 steps % 0.12/0.37 cnf(i_0_5, negated_conjecture, (big_p(esk4_0)|big_p(esk1_0)|big_p(esk4_0)|big_p(esk4_0)), inference(start_rule)). % 0.12/0.37 cnf(i_0_13, plain, (big_p(esk4_0)), inference(extension_rule, [i_0_4])). % 0.12/0.37 cnf(i_0_48, plain, (~big_p(esk4_0)), inference(closure_rule, [i_0_13])). % 0.12/0.37 cnf(i_0_45, plain, (big_p(esk1_0)), inference(extension_rule, [i_0_8])). % 0.12/0.37 cnf(i_0_56, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_45])). % 0.12/0.37 cnf(i_0_54, plain, (~big_p(esk2_0)), inference(extension_rule, [i_0_4])). % 0.12/0.37 cnf(i_0_62, plain, (big_p(esk2_0)), inference(closure_rule, [i_0_54])). % 0.12/0.37 cnf(i_0_63, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_45])). % 0.12/0.37 cnf(i_0_64, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_45])). % 0.12/0.37 cnf(i_0_55, plain, (~big_p(esk3_0)), inference(extension_rule, [i_0_4])). % 0.12/0.37 cnf(i_0_74, plain, (big_p(esk3_0)), inference(closure_rule, [i_0_55])). % 0.12/0.37 cnf(i_0_75, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_45])). % 0.12/0.37 cnf(i_0_76, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_45])). % 0.12/0.37 cnf(i_0_46, plain, (big_p(esk1_0)), inference(closure_rule, [i_0_45])). % 0.12/0.37 cnf(i_0_15, plain, (big_p(esk4_0)), inference(closure_rule, [i_0_13])). % 0.12/0.37 cnf(i_0_16, plain, (big_p(esk4_0)), inference(closure_rule, [i_0_13])). % 0.12/0.37 cnf(i_0_14, plain, (big_p(esk1_0)), inference(extension_rule, [i_0_8])). % 0.12/0.37 cnf(i_0_84, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_14])). % 0.12/0.37 cnf(i_0_82, plain, (~big_p(esk2_0)), inference(extension_rule, [i_0_4])). % 0.12/0.37 cnf(i_0_90, plain, (big_p(esk2_0)), inference(closure_rule, [i_0_82])). % 0.12/0.37 cnf(i_0_91, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_14])). % 0.12/0.37 cnf(i_0_92, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_14])). % 0.12/0.37 cnf(i_0_83, plain, (~big_p(esk3_0)), inference(extension_rule, [i_0_4])). % 0.12/0.37 cnf(i_0_102, plain, (big_p(esk3_0)), inference(closure_rule, [i_0_83])). % 0.12/0.37 cnf(i_0_103, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_14])). % 0.12/0.37 cnf(i_0_104, plain, (~big_p(esk1_0)), inference(closure_rule, [i_0_14])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # Closed tableau found in foldup close cycle with 9 folds and 4 closures done. % 0.12/0.37 # There were 0 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 0 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 0 successful branch saturations after the branch. % 0.12/0.37 # Child (6514) has found a proof. % 0.12/0.37 % 0.12/0.37 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------