%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COM003+2 : TPTP v8.1.0. Bugfixed v2.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 : n007.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 01:14:51 EDT 2022 % Result : Theorem 0.19s 0.43s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : COM003+2 : TPTP v8.1.0. Bugfixed v2.2.0. % 0.03/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 : n007.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 : Thu Jun 16 19:54:41 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C47_F1_SE_CS_SP_PS_S0Y % 0.19/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.19/0.37 # % 0.19/0.37 # Presaturation interreduction done % 0.19/0.37 # Number of axioms: 43 Number of unprocessed: 43 % 0.19/0.37 # Tableaux proof search. % 0.19/0.37 # APR header successfully linked. % 0.19/0.37 # Hello from C++ % 0.19/0.43 # The folding up rule is enabled... % 0.19/0.43 # Local unification is enabled... % 0.19/0.43 # Any saturation attempts will use folding labels... % 0.19/0.43 # 43 beginning clauses after preprocessing and clausification % 0.19/0.43 # Creating start rules for all 1 conjectures. % 0.19/0.43 # There are 1 start rule candidates: % 0.19/0.43 # Found 1 unit axioms. % 0.19/0.43 # 1 start rule tableaux created. % 0.19/0.43 # 42 extension rule candidate clauses % 0.19/0.43 # 1 unit axiom clauses % 0.19/0.43 % 0.19/0.43 # Requested 8, 32 cores available to the main process. % 0.19/0.43 # There are not enough tableaux to fork, creating more from the initial 1 % 0.19/0.43 # There were 1 total branch saturation attempts. % 0.19/0.43 # There were 0 of these attempts blocked. % 0.19/0.43 # There were 0 deferred branch saturation attempts. % 0.19/0.43 # There were 0 free duplicated saturations. % 0.19/0.43 # There were 1 total successful branch saturations. % 0.19/0.43 # There were 0 successful branch saturations in interreduction. % 0.19/0.43 # There were 0 successful branch saturations on the branch. % 0.19/0.43 # There were 1 successful branch saturations after the branch. % 0.19/0.43 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.43 # Begin clausification derivation % 0.19/0.43 % 0.19/0.43 # End clausification derivation % 0.19/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.43 cnf(i_0_43, negated_conjecture, (algorithm_program_decides(esk10_0))). % 0.19/0.43 cnf(i_0_8, plain, (program_decides(X1)|~algorithm_program_decides(X1))). % 0.19/0.43 cnf(i_0_9, plain, (algorithm(X1)|~algorithm_program_decides(X1))). % 0.19/0.43 cnf(i_0_5, plain, (program_decides(X1)|~program_program_decides(X1))). % 0.19/0.43 cnf(i_0_6, plain, (program(X1)|~program_program_decides(X1))). % 0.19/0.43 cnf(i_0_34, plain, (program_program_decides(esk3_0)|~algorithm_program_decides(X1))). % 0.19/0.43 cnf(i_0_2, plain, (program(esk1_1(X1))|program_decides(X1))). % 0.19/0.43 cnf(i_0_17, plain, (~program_not_halts2(X1,X2)|~halts2(X1,X2))). % 0.19/0.43 cnf(i_0_12, plain, (program(X1)|~program_halts2(X1,X2))). % 0.19/0.43 cnf(i_0_18, plain, (program(X1)|~program_not_halts2(X1,X2))). % 0.19/0.43 cnf(i_0_7, plain, (algorithm_program_decides(X1)|~algorithm(X1)|~program_decides(X1))). % 0.19/0.43 cnf(i_0_4, plain, (program_program_decides(X1)|~program(X1)|~program_decides(X1))). % 0.19/0.43 cnf(i_0_11, plain, (halts2(X1,X2)|~program_halts2(X1,X2))). % 0.19/0.43 cnf(i_0_21, plain, (halts2(X1,X2)|~halts2_outputs(X1,X2,X3))). % 0.19/0.43 cnf(i_0_20, plain, (outputs(X1,X2)|~halts2_outputs(X1,X3,X2))). % 0.19/0.43 cnf(i_0_10, plain, (program_halts2(X1,X2)|~halts2(X1,X2)|~program(X1))). % 0.19/0.43 cnf(i_0_16, plain, (program_not_halts2(X1,X2)|halts2(X1,X2)|~program(X1))). % 0.19/0.43 cnf(i_0_36, plain, (program_halts2_halts3_outputs(X1,X2,X3,good)|~program_program_decides(X1))). % 0.19/0.43 cnf(i_0_14, plain, (outputs(X1,X2)|~halts3_outputs(X1,X3,X4,X2))). % 0.19/0.43 cnf(i_0_28, plain, (program_halts2_halts2_outputs(X1,X2,X3)|~halts2_outputs(X1,X2,X3))). % 0.19/0.43 cnf(i_0_31, plain, (program_not_halts2_halts2_outputs(X1,X2,X3)|~halts2_outputs(X1,X2,X3))). % 0.19/0.43 cnf(i_0_1, plain, (program_decides(X1)|~decides(X1,esk1_1(X1),esk2_1(X1)))). % 0.19/0.43 cnf(i_0_35, plain, (program_not_halts2_halts3_outputs(X1,X2,X3,bad)|~program_program_decides(X1))). % 0.19/0.43 cnf(i_0_3, plain, (decides(X1,X2,X3)|~program(X2)|~program_decides(X1))). % 0.19/0.43 cnf(i_0_15, plain, (halts3(X1,X2,X3)|~halts3_outputs(X1,X2,X3,X4))). % 0.19/0.43 cnf(i_0_22, plain, (program_halts2_halts3_outputs(X1,X2,X3,X4)|~halts3_outputs(X1,X2,X3,X4))). % 0.19/0.43 cnf(i_0_25, plain, (program_not_halts2_halts3_outputs(X1,X2,X3,X4)|~halts3_outputs(X1,X2,X3,X4))). % 0.19/0.43 cnf(i_0_29, plain, (program_halts2_halts2_outputs(X1,X2,X3)|program_halts2(X2,X2))). % 0.19/0.43 cnf(i_0_23, plain, (program_halts2_halts3_outputs(X1,X2,X3,X4)|program_halts2(X2,X3))). % 0.19/0.43 cnf(i_0_19, plain, (halts2_outputs(X1,X2,X3)|~outputs(X1,X3)|~halts2(X1,X2))). % 0.19/0.43 cnf(i_0_30, plain, (halts2_outputs(X1,X2,X3)|~program_halts2_halts2_outputs(X1,X2,X3)|~program_halts2(X2,X2))). % 0.19/0.43 cnf(i_0_33, plain, (halts2_outputs(X1,X2,X3)|~program_not_halts2_halts2_outputs(X1,X2,X3)|~program_not_halts2(X2,X2))). % 0.19/0.43 cnf(i_0_26, plain, (program_not_halts2_halts3_outputs(X1,X2,X3,X4)|program_not_halts2(X2,X3))). % 0.19/0.43 cnf(i_0_32, plain, (program_not_halts2_halts2_outputs(X1,X2,X3)|program_not_halts2(X2,X2))). % 0.19/0.43 cnf(i_0_42, plain, (program(esk9_0)|~program_not_halts2_halts2_outputs(X1,esk8_1(X1),bad)|~program_halts2_halts2_outputs(X1,esk7_1(X1),good)|~program(X1))). % 0.19/0.43 cnf(i_0_13, plain, (halts3_outputs(X1,X2,X3,X4)|~outputs(X1,X4)|~halts3(X1,X2,X3))). % 0.19/0.43 cnf(i_0_24, plain, (halts3_outputs(X1,X2,X3,X4)|~program_halts2_halts3_outputs(X1,X2,X3,X4)|~program_halts2(X2,X3))). % 0.19/0.43 cnf(i_0_27, plain, (halts3_outputs(X1,X2,X3,X4)|~program_not_halts2_halts3_outputs(X1,X2,X3,X4)|~program_not_halts2(X2,X3))). % 0.19/0.43 cnf(i_0_41, plain, (~program_not_halts2_halts2_outputs(X1,esk8_1(X1),bad)|~program_halts2_halts2_outputs(X1,esk7_1(X1),good)|~halts2(esk9_0,X2)|~program_halts2(X2,X2)|~program(X1))). % 0.19/0.43 cnf(i_0_40, plain, (program_not_halts2_halts2_outputs(esk9_0,X1,good)|~program_not_halts2_halts2_outputs(X2,esk8_1(X2),bad)|~program_halts2_halts2_outputs(X2,esk7_1(X2),good)|~program(X2))). % 0.19/0.43 cnf(i_0_39, plain, (program(esk6_0)|~program_not_halts2_halts3_outputs(X1,esk5_1(X1),esk5_1(X1),bad)|~program_halts2_halts3_outputs(X1,esk4_1(X1),esk4_1(X1),good)|~program(X1))). % 0.19/0.43 cnf(i_0_38, plain, (program_halts2_halts2_outputs(esk6_0,X1,good)|~program_not_halts2_halts3_outputs(X2,esk5_1(X2),esk5_1(X2),bad)|~program_halts2_halts3_outputs(X2,esk4_1(X2),esk4_1(X2),good)|~program(X2))). % 0.19/0.43 cnf(i_0_37, plain, (program_not_halts2_halts2_outputs(esk6_0,X1,bad)|~program_not_halts2_halts3_outputs(X2,esk5_1(X2),esk5_1(X2),bad)|~program_halts2_halts3_outputs(X2,esk4_1(X2),esk4_1(X2),good)|~program(X2))). % 0.19/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.43 # Begin printing tableau % 0.19/0.43 # Found 4 steps % 0.19/0.43 cnf(i_0_43, negated_conjecture, (algorithm_program_decides(esk10_0)), inference(start_rule)). % 0.19/0.43 cnf(i_0_44, plain, (algorithm_program_decides(esk10_0)), inference(extension_rule, [i_0_34])). % 0.19/0.43 cnf(i_0_53, plain, (program_program_decides(esk3_0)), inference(extension_rule, [i_0_5])). % 0.19/0.43 cnf(i_0_157, plain, (program_decides(esk3_0)), inference(etableau_closure_rule, [i_0_157, ...])). % 0.19/0.43 # End printing tableau % 0.19/0.43 # SZS output end % 0.19/0.43 # Branches closed with saturation will be marked with an "s" % 0.19/0.43 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux. % 0.19/0.43 # We now have 3 tableaux to operate on % 0.19/0.43 # Found closed tableau during pool population. % 0.19/0.43 # Proof search is over... % 0.19/0.43 # Freeing feature tree %------------------------------------------------------------------------------