%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COM003+3 : 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 : n023.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:52 EDT 2022 % Result : Theorem 2.59s 0.63s % Output : CNFRefutation 2.59s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.02/0.08 % Problem : COM003+3 : TPTP v8.1.0. Released v2.0.0. % 0.02/0.09 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.09/0.28 % Computer : n023.cluster.edu % 0.09/0.28 % Model : x86_64 x86_64 % 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.28 % Memory : 8042.1875MB % 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.28 % CPULimit : 300 % 0.09/0.28 % WCLimit : 600 % 0.09/0.28 % DateTime : Thu Jun 16 17:08:20 EDT 2022 % 0.09/0.28 % CPUTime : % 0.09/0.30 # No SInE strategy applied % 0.09/0.30 # Auto-Mode selected heuristic G_E___208_C47_F1_SE_CS_SP_PS_S0Y % 0.09/0.30 # and selection function SelectMaxLComplexAvoidPosPred. % 0.09/0.30 # % 0.09/0.30 # Presaturation interreduction done % 0.09/0.30 # Number of axioms: 50 Number of unprocessed: 44 % 0.09/0.30 # Tableaux proof search. % 0.09/0.30 # APR header successfully linked. % 0.09/0.30 # Hello from C++ % 0.09/0.30 # The folding up rule is enabled... % 0.09/0.30 # Local unification is enabled... % 0.09/0.30 # Any saturation attempts will use folding labels... % 0.09/0.30 # 44 beginning clauses after preprocessing and clausification % 0.09/0.30 # Creating start rules for all 2 conjectures. % 0.09/0.30 # There are 2 start rule candidates: % 0.09/0.30 # Found 1 unit axioms. % 0.09/0.30 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.09/0.30 # 2 start rule tableaux created. % 0.09/0.30 # 43 extension rule candidate clauses % 0.09/0.30 # 1 unit axiom clauses % 0.09/0.30 % 0.09/0.30 # Requested 8, 32 cores available to the main process. % 0.09/0.30 # There are not enough tableaux to fork, creating more from the initial 2 % 0.09/0.30 # Returning from population with 45 new_tableaux and 0 remaining starting tableaux. % 0.09/0.30 # We now have 45 tableaux to operate on % 0.13/0.43 # Ran out of tableaux, making start rules for all clauses % 0.13/0.45 # Ran out of tableaux, making start rules for all clauses % 2.18/0.58 # Ran out of tableaux, making start rules for all clauses % 2.59/0.63 # There were 3 total branch saturation attempts. % 2.59/0.63 # There were 0 of these attempts blocked. % 2.59/0.63 # There were 0 deferred branch saturation attempts. % 2.59/0.63 # There were 0 free duplicated saturations. % 2.59/0.63 # There were 3 total successful branch saturations. % 2.59/0.63 # There were 0 successful branch saturations in interreduction. % 2.59/0.63 # There were 0 successful branch saturations on the branch. % 2.59/0.63 # There were 3 successful branch saturations after the branch. % 2.59/0.63 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.59/0.63 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.59/0.63 # Begin clausification derivation % 2.59/0.63 % 2.59/0.63 # End clausification derivation % 2.59/0.63 # Begin listing active clauses obtained from FOF to CNF conversion % 2.59/0.63 cnf(i_0_50, negated_conjecture, (algorithm(esk11_0))). % 2.59/0.63 cnf(i_0_49, negated_conjecture, (decides(esk11_0,X1,X2)|~program(X1))). % 2.59/0.63 cnf(i_0_4, plain, (program(esk1_1(X1))|program(esk3_0)|~algorithm(X1))). % 2.59/0.63 cnf(i_0_2, plain, (program(esk3_0)|~decides(X1,esk1_1(X1),esk2_1(X1))|~algorithm(X1))). % 2.59/0.63 cnf(i_0_48, plain, (program(esk10_1(X1))|program(esk8_1(X1))|program(esk6_1(X1))|~program(X1))). % 2.59/0.63 cnf(i_0_9, plain, (outputs(X1,bad)|halts2(X2,X3)|program(esk4_1(X1))|~program(X2)|~program(X1))). % 2.59/0.63 cnf(i_0_3, plain, (decides(esk3_0,X1,X2)|program(esk1_1(X3))|~program(X1)|~algorithm(X3))). % 2.59/0.63 cnf(i_0_44, plain, (program(esk10_1(X1))|program(esk6_1(X1))|~halts2(esk8_1(X1),esk9_1(X1))|~program(X1))). % 2.59/0.63 cnf(i_0_7, plain, (outputs(X1,good)|~halts2(X2,X3)|~decides(X1,esk4_1(X1),esk5_1(X1))|~program(X2)|~program(X1))). % 2.59/0.63 cnf(i_0_11, plain, (outputs(X1,good)|program(esk4_1(X1))|~halts2(X2,X3)|~program(X2)|~program(X1))). % 2.59/0.63 cnf(i_0_36, plain, (halts2(esk6_1(X1),esk7_1(X1))|program(esk10_1(X1))|program(esk8_1(X1))|~program(X1))). % 2.59/0.63 cnf(i_0_1, plain, (decides(esk3_0,X1,X2)|~decides(X3,esk1_1(X3),esk2_1(X3))|~program(X1)|~algorithm(X3))). % 2.59/0.63 cnf(i_0_10, plain, (halts3(X1,X2,X3)|program(esk4_1(X1))|~program(X2)|~program(X1))). % 2.59/0.63 cnf(i_0_32, plain, (halts2(esk6_1(X1),esk7_1(X1))|program(esk10_1(X1))|~halts2(esk8_1(X1),esk9_1(X1))|~program(X1))). % 2.59/0.63 cnf(i_0_40, plain, (program(esk10_1(X1))|program(esk6_1(X1))|~outputs(X1,bad)|~halts3(X1,esk8_1(X1),esk9_1(X1))|~program(X1))). % 2.59/0.63 cnf(i_0_5, plain, (outputs(X1,bad)|halts2(X2,X3)|~decides(X1,esk4_1(X1),esk5_1(X1))|~program(X2)|~program(X1))). % 2.59/0.63 cnf(i_0_24, plain, (program(esk10_1(X1))|program(esk8_1(X1))|~outputs(X1,good)|~halts3(X1,esk6_1(X1),esk7_1(X1))|~program(X1))). % 2.59/0.63 cnf(i_0_20, plain, (program(esk10_1(X1))|~outputs(X1,good)|~halts3(X1,esk6_1(X1),esk7_1(X1))|~halts2(esk8_1(X1),esk9_1(X1))|~program(X1))). % 2.59/0.63 cnf(i_0_47, plain, (program(esk8_1(X1))|program(esk6_1(X1))|~outputs(X1,good)|~halts3(X1,X2,X2)|~halts2(esk10_1(X1),X2)|~program(X1)|~program(X2))). % 2.59/0.63 cnf(i_0_6, plain, (halts3(X1,X2,X3)|~decides(X1,esk4_1(X1),esk5_1(X1))|~program(X2)|~program(X1))). % 2.59/0.63 cnf(i_0_28, plain, (halts2(esk6_1(X1),esk7_1(X1))|program(esk10_1(X1))|~outputs(X1,bad)|~halts3(X1,esk8_1(X1),esk9_1(X1))|~program(X1))). % 2.59/0.63 cnf(i_0_45, plain, (outputs(esk10_1(X1),bad)|program(esk8_1(X1))|program(esk6_1(X1))|~outputs(X1,bad)|~halts3(X1,X2,X2)|~program(X2)|~program(X1))). % 2.59/0.63 cnf(i_0_46, plain, (halts2(esk10_1(X1),X2)|program(esk8_1(X1))|program(esk6_1(X1))|~outputs(X1,bad)|~halts3(X1,X2,X2)|~program(X2)|~program(X1))). % 2.59/0.63 cnf(i_0_16, plain, (program(esk10_1(X1))|~outputs(X1,good)|~outputs(X1,bad)|~halts3(X1,esk6_1(X1),esk7_1(X1))|~halts3(X1,esk8_1(X1),esk9_1(X1))|~program(X1))). % 2.59/0.63 cnf(i_0_43, plain, (program(esk6_1(X1))|~outputs(X1,good)|~halts3(X1,X2,X2)|~halts2(esk8_1(X1),esk9_1(X1))|~halts2(esk10_1(X1),X2)|~program(X1)|~program(X2))). % 2.59/0.63 cnf(i_0_33, plain, (outputs(esk10_1(X1),bad)|halts2(esk6_1(X1),esk7_1(X1))|program(esk8_1(X1))|~outputs(X1,bad)|~halts3(X1,X2,X2)|~program(X2)|~program(X1))). % 2.59/0.63 cnf(i_0_34, plain, (halts2(esk6_1(X1),esk7_1(X1))|halts2(esk10_1(X1),X2)|program(esk8_1(X1))|~outputs(X1,bad)|~halts3(X1,X2,X2)|~program(X2)|~program(X1))). % 2.59/0.63 cnf(i_0_19, plain, (~outputs(X1,good)|~halts3(X1,esk6_1(X1),esk7_1(X1))|~halts3(X1,X2,X2)|~halts2(esk8_1(X1),esk9_1(X1))|~halts2(esk10_1(X1),X2)|~program(X1)|~program(X2))). % 2.59/0.63 cnf(i_0_23, plain, (program(esk8_1(X1))|~outputs(X1,good)|~halts3(X1,esk6_1(X1),esk7_1(X1))|~halts3(X1,X2,X2)|~halts2(esk10_1(X1),X2)|~program(X1)|~program(X2))). % 2.59/0.63 cnf(i_0_42, plain, (halts2(esk10_1(X1),X2)|program(esk6_1(X1))|~outputs(X1,bad)|~halts3(X1,X2,X2)|~halts2(esk8_1(X1),esk9_1(X1))|~program(X2)|~program(X1))). % 2.59/0.63 cnf(i_0_31, plain, (halts2(esk6_1(X1),esk7_1(X1))|~outputs(X1,good)|~halts3(X1,X2,X2)|~halts2(esk8_1(X1),esk9_1(X1))|~halts2(esk10_1(X1),X2)|~program(X1)|~program(X2))). % 2.59/0.63 cnf(i_0_35, plain, (halts2(esk6_1(X1),esk7_1(X1))|program(esk8_1(X1))|~outputs(X1,good)|~halts3(X1,X2,X2)|~halts2(esk10_1(X1),X2)|~program(X1)|~program(X2))). % 2.59/0.63 cnf(i_0_41, plain, (outputs(esk10_1(X1),bad)|program(esk6_1(X1))|~outputs(X1,bad)|~halts3(X1,X2,X2)|~halts2(esk8_1(X1),esk9_1(X1))|~program(X2)|~program(X1))). % 2.59/0.63 cnf(i_0_37, plain, (outputs(esk10_1(X1),bad)|program(esk6_1(X1))|~outputs(X1,bad)|~halts3(X1,esk8_1(X1),esk9_1(X1))|~halts3(X1,X2,X2)|~program(X2)|~program(X1))). % 2.59/0.63 cnf(i_0_38, plain, (halts2(esk10_1(X1),X2)|program(esk6_1(X1))|~outputs(X1,bad)|~halts3(X1,esk8_1(X1),esk9_1(X1))|~halts3(X1,X2,X2)|~program(X2)|~program(X1))). % 2.59/0.63 cnf(i_0_39, plain, (program(esk6_1(X1))|~outputs(X1,good)|~outputs(X1,bad)|~halts3(X1,esk8_1(X1),esk9_1(X1))|~halts3(X1,X2,X2)|~program(X1)|~program(X2))). % 2.59/0.63 cnf(i_0_29, plain, (outputs(esk10_1(X1),bad)|halts2(esk6_1(X1),esk7_1(X1))|~outputs(X1,bad)|~halts3(X1,X2,X2)|~halts2(esk8_1(X1),esk9_1(X1))|~program(X2)|~program(X1))). % 2.59/0.63 cnf(i_0_30, plain, (halts2(esk6_1(X1),esk7_1(X1))|halts2(esk10_1(X1),X2)|~outputs(X1,bad)|~halts3(X1,X2,X2)|~halts2(esk8_1(X1),esk9_1(X1))|~program(X2)|~program(X1))). % 2.59/0.63 cnf(i_0_18, plain, (~outputs(X1,good)|~outputs(X1,bad)|~halts3(X1,esk6_1(X1),esk7_1(X1))|~halts3(X1,X2,X2)|~halts2(esk8_1(X1),esk9_1(X1))|~program(X2)|~program(X1))). % 2.59/0.63 cnf(i_0_14, plain, (~outputs(X1,good)|~outputs(X1,bad)|~halts3(X1,esk6_1(X1),esk7_1(X1))|~halts3(X1,esk8_1(X1),esk9_1(X1))|~halts3(X1,X2,X2)|~program(X2)|~program(X1))). % 2.59/0.63 cnf(i_0_25, plain, (outputs(esk10_1(X1),bad)|halts2(esk6_1(X1),esk7_1(X1))|~outputs(X1,bad)|~halts3(X1,esk8_1(X1),esk9_1(X1))|~halts3(X1,X2,X2)|~program(X2)|~program(X1))). % 2.59/0.63 cnf(i_0_22, plain, (program(esk8_1(X1))|~outputs(X1,good)|~outputs(X1,bad)|~halts3(X1,esk6_1(X1),esk7_1(X1))|~halts3(X1,X2,X2)|~program(X2)|~program(X1))). % 2.59/0.63 cnf(i_0_26, plain, (halts2(esk6_1(X1),esk7_1(X1))|halts2(esk10_1(X1),X2)|~outputs(X1,bad)|~halts3(X1,esk8_1(X1),esk9_1(X1))|~halts3(X1,X2,X2)|~program(X2)|~program(X1))). % 2.59/0.63 cnf(i_0_27, plain, (halts2(esk6_1(X1),esk7_1(X1))|~outputs(X1,good)|~outputs(X1,bad)|~halts3(X1,esk8_1(X1),esk9_1(X1))|~halts3(X1,X2,X2)|~program(X1)|~program(X2))). % 2.59/0.63 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.59/0.63 # Begin printing tableau % 2.59/0.63 # Found 8 steps % 2.59/0.63 cnf(i_0_49, negated_conjecture, (decides(esk11_0,esk1_1(esk11_0),esk2_1(esk11_0))|~program(esk1_1(esk11_0))), inference(start_rule)). % 2.59/0.63 cnf(i_0_8391, plain, (decides(esk11_0,esk1_1(esk11_0),esk2_1(esk11_0))), inference(extension_rule, [i_0_2])). % 2.59/0.63 cnf(i_0_12689, plain, (~algorithm(esk11_0)), inference(closure_rule, [i_0_50])). % 2.59/0.63 cnf(i_0_12687, plain, (program(esk3_0)), inference(extension_rule, [i_0_10])). % 2.59/0.63 cnf(i_0_12693, plain, (~program(esk3_0)), inference(closure_rule, [i_0_12687])). % 2.59/0.63 cnf(i_0_8392, plain, (~program(esk1_1(esk11_0))), inference(etableau_closure_rule, [i_0_8392, ...])). % 2.59/0.63 cnf(i_0_12690, plain, (halts3(esk3_0,esk3_0,X6)), inference(etableau_closure_rule, [i_0_12690, ...])). % 2.59/0.63 cnf(i_0_12691, plain, (program(esk4_1(esk3_0))), inference(etableau_closure_rule, [i_0_12691, ...])). % 2.59/0.63 # End printing tableau % 2.59/0.63 # SZS output end % 2.59/0.63 # Branches closed with saturation will be marked with an "s" % 2.59/0.63 # Child (27363) has found a proof. % 2.59/0.63 % 2.59/0.63 # Proof search is over... % 2.59/0.63 # Freeing feature tree %------------------------------------------------------------------------------