%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUN062+2 : TPTP v8.1.0. Released 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 : n020.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 : Mon Jul 18 16:26:18 EDT 2022 % Result : Theorem 0.20s 0.38s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : NUN062+2 : TPTP v8.1.0. Released v7.3.0. % 0.12/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.34 % Computer : n020.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Thu Jun 2 02:40:38 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b % 0.20/0.37 # and selection function SelectCQIPrecW. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 29 Number of unprocessed: 29 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 29 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 2 conjectures. % 0.20/0.37 # There are 2 start rule candidates: % 0.20/0.37 # Found 17 unit axioms. % 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.37 # 2 start rule tableaux created. % 0.20/0.37 # 12 extension rule candidate clauses % 0.20/0.37 # 17 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 2 % 0.20/0.37 # Creating equality axioms % 0.20/0.37 # Ran out of tableaux, making start rules for all clauses % 0.20/0.37 # Returning from population with 32 new_tableaux and 0 remaining starting tableaux. % 0.20/0.37 # We now have 32 tableaux to operate on % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 1 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 1 successful branch saturations after the branch. % 0.20/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_30, plain, (r1(esk14_1(X1)))). % 0.20/0.38 cnf(i_0_2, plain, (r1(esk1_0))). % 0.20/0.38 cnf(i_0_32, plain, (r1(esk15_1(X1)))). % 0.20/0.38 cnf(i_0_34, plain, (r1(esk16_1(X1)))). % 0.20/0.38 cnf(i_0_6, plain, (r2(X1,esk2_1(X1)))). % 0.20/0.38 cnf(i_0_29, plain, (r3(X1,esk14_1(X1),X1))). % 0.20/0.38 cnf(i_0_21, plain, (r2(X1,esk7_2(X2,X1)))). % 0.20/0.38 cnf(i_0_26, plain, (r2(X1,esk11_2(X2,X1)))). % 0.20/0.38 cnf(i_0_17, plain, (r3(X1,X2,esk8_2(X1,X2)))). % 0.20/0.38 cnf(i_0_22, plain, (r4(X1,X2,esk12_2(X1,X2)))). % 0.20/0.38 cnf(i_0_10, plain, (r3(X1,X2,esk3_2(X1,X2)))). % 0.20/0.38 cnf(i_0_33, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))). % 0.20/0.38 cnf(i_0_14, plain, (r4(X1,X2,esk4_2(X1,X2)))). % 0.20/0.38 cnf(i_0_18, plain, (r2(esk8_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.38 cnf(i_0_20, plain, (r3(X1,esk7_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.38 cnf(i_0_23, plain, (r3(esk12_2(X1,X2),X1,esk9_2(X1,X2)))). % 0.20/0.38 cnf(i_0_25, plain, (r4(X1,esk11_2(X1,X2),esk9_2(X1,X2)))). % 0.20/0.38 cnf(i_0_3, plain, (X1=esk1_0|~r1(X1))). % 0.20/0.38 cnf(i_0_35, plain, (esk20_1(X1)=X1|esk18_1(X1)=X1)). % 0.20/0.38 cnf(i_0_39, plain, (~r2(X1,X2)|~r1(X2))). % 0.20/0.38 cnf(i_0_37, plain, (esk20_1(X1)=X1|r1(esk18_1(X1)))). % 0.20/0.38 cnf(i_0_7, plain, (X1=esk2_1(X2)|~r2(X2,X1))). % 0.20/0.38 cnf(i_0_36, plain, (esk18_1(X1)=X1|r2(esk19_1(X1),esk20_1(X1)))). % 0.20/0.38 cnf(i_0_41, negated_conjecture, (r1(esk22_2(X1,X2))|~r3(esk21_0,X2,X1))). % 0.20/0.38 cnf(i_0_40, negated_conjecture, (esk22_2(X1,X2)=X2|~r3(esk21_0,X2,X1))). % 0.20/0.38 cnf(i_0_38, plain, (r2(esk19_1(X1),esk20_1(X1))|r1(esk18_1(X1)))). % 0.20/0.38 cnf(i_0_11, plain, (X1=esk3_2(X2,X3)|~r3(X2,X3,X1))). % 0.20/0.38 cnf(i_0_15, plain, (X1=esk4_2(X2,X3)|~r4(X2,X3,X1))). % 0.20/0.38 cnf(i_0_27, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))). % 0.20/0.38 cnf(i_0_154, plain, (X92=X92)). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 5 steps % 0.20/0.38 cnf(i_0_30, plain, (r1(esk14_1(X5))), inference(start_rule)). % 0.20/0.38 cnf(i_0_162, plain, (r1(esk14_1(X5))), inference(extension_rule, [i_0_158])). % 0.20/0.38 cnf(i_0_237, plain, (r1(esk14_1(X5))), inference(extension_rule, [i_0_3])). % 0.20/0.38 cnf(i_0_238, plain, ($false), inference(closure_rule, [i_0_154])). % 0.20/0.38 cnf(i_0_254, plain, (esk14_1(X5)=esk1_0), inference(etableau_closure_rule, [i_0_254, ...])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 1 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 1 successful branch saturations after the branch. % 0.20/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_30, plain, (r1(esk14_1(X1)))). % 0.20/0.38 cnf(i_0_2, plain, (r1(esk1_0))). % 0.20/0.38 cnf(i_0_32, plain, (r1(esk15_1(X1)))). % 0.20/0.38 cnf(i_0_34, plain, (r1(esk16_1(X1)))). % 0.20/0.38 cnf(i_0_6, plain, (r2(X1,esk2_1(X1)))). % 0.20/0.38 cnf(i_0_29, plain, (r3(X1,esk14_1(X1),X1))). % 0.20/0.38 cnf(i_0_21, plain, (r2(X1,esk7_2(X2,X1)))). % 0.20/0.38 cnf(i_0_26, plain, (r2(X1,esk11_2(X2,X1)))). % 0.20/0.38 cnf(i_0_17, plain, (r3(X1,X2,esk8_2(X1,X2)))). % 0.20/0.38 cnf(i_0_22, plain, (r4(X1,X2,esk12_2(X1,X2)))). % 0.20/0.38 cnf(i_0_10, plain, (r3(X1,X2,esk3_2(X1,X2)))). % 0.20/0.38 cnf(i_0_33, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))). % 0.20/0.38 cnf(i_0_14, plain, (r4(X1,X2,esk4_2(X1,X2)))). % 0.20/0.38 cnf(i_0_18, plain, (r2(esk8_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.38 cnf(i_0_20, plain, (r3(X1,esk7_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.38 cnf(i_0_23, plain, (r3(esk12_2(X1,X2),X1,esk9_2(X1,X2)))). % 0.20/0.38 cnf(i_0_25, plain, (r4(X1,esk11_2(X1,X2),esk9_2(X1,X2)))). % 0.20/0.38 cnf(i_0_3, plain, (X1=esk1_0|~r1(X1))). % 0.20/0.38 cnf(i_0_35, plain, (esk20_1(X1)=X1|esk18_1(X1)=X1)). % 0.20/0.38 cnf(i_0_39, plain, (~r2(X1,X2)|~r1(X2))). % 0.20/0.38 cnf(i_0_37, plain, (esk20_1(X1)=X1|r1(esk18_1(X1)))). % 0.20/0.38 cnf(i_0_7, plain, (X1=esk2_1(X2)|~r2(X2,X1))). % 0.20/0.38 cnf(i_0_36, plain, (esk18_1(X1)=X1|r2(esk19_1(X1),esk20_1(X1)))). % 0.20/0.38 cnf(i_0_41, negated_conjecture, (r1(esk22_2(X1,X2))|~r3(esk21_0,X2,X1))). % 0.20/0.38 cnf(i_0_40, negated_conjecture, (esk22_2(X1,X2)=X2|~r3(esk21_0,X2,X1))). % 0.20/0.38 cnf(i_0_38, plain, (r2(esk19_1(X1),esk20_1(X1))|r1(esk18_1(X1)))). % 0.20/0.38 cnf(i_0_11, plain, (X1=esk3_2(X2,X3)|~r3(X2,X3,X1))). % 0.20/0.38 cnf(i_0_15, plain, (X1=esk4_2(X2,X3)|~r4(X2,X3,X1))). % 0.20/0.38 cnf(i_0_27, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))). % 0.20/0.38 cnf(i_0_154, plain, (X92=X92)). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 6 steps % 0.20/0.38 cnf(i_0_30, plain, (r1(esk14_1(X7))), inference(start_rule)). % 0.20/0.38 cnf(i_0_162, plain, (r1(esk14_1(X7))), inference(extension_rule, [i_0_39])). % 0.20/0.38 cnf(i_0_209, plain, (~r2(X2,esk14_1(X7))), inference(extension_rule, [i_0_159])). % 0.20/0.38 cnf(i_0_290, plain, ($false), inference(closure_rule, [i_0_154])). % 0.20/0.38 cnf(i_0_292, plain, (~r2(X2,esk2_1(X2))), inference(closure_rule, [i_0_6])). % 0.20/0.38 cnf(i_0_291, plain, (esk2_1(X2)!=esk14_1(X7)), inference(etableau_closure_rule, [i_0_291, ...])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 1 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 1 successful branch saturations after the branch. % 0.20/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_30, plain, (r1(esk14_1(X1)))). % 0.20/0.38 cnf(i_0_2, plain, (r1(esk1_0))). % 0.20/0.38 cnf(i_0_32, plain, (r1(esk15_1(X1)))). % 0.20/0.38 cnf(i_0_34, plain, (r1(esk16_1(X1)))). % 0.20/0.38 cnf(i_0_6, plain, (r2(X1,esk2_1(X1)))). % 0.20/0.38 cnf(i_0_29, plain, (r3(X1,esk14_1(X1),X1))). % 0.20/0.38 cnf(i_0_21, plain, (r2(X1,esk7_2(X2,X1)))). % 0.20/0.38 cnf(i_0_26, plain, (r2(X1,esk11_2(X2,X1)))). % 0.20/0.38 cnf(i_0_17, plain, (r3(X1,X2,esk8_2(X1,X2)))). % 0.20/0.38 cnf(i_0_22, plain, (r4(X1,X2,esk12_2(X1,X2)))). % 0.20/0.38 cnf(i_0_10, plain, (r3(X1,X2,esk3_2(X1,X2)))). % 0.20/0.38 cnf(i_0_33, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))). % 0.20/0.38 cnf(i_0_14, plain, (r4(X1,X2,esk4_2(X1,X2)))). % 0.20/0.38 cnf(i_0_18, plain, (r2(esk8_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.38 cnf(i_0_20, plain, (r3(X1,esk7_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.38 cnf(i_0_23, plain, (r3(esk12_2(X1,X2),X1,esk9_2(X1,X2)))). % 0.20/0.38 cnf(i_0_25, plain, (r4(X1,esk11_2(X1,X2),esk9_2(X1,X2)))). % 0.20/0.38 cnf(i_0_3, plain, (X1=esk1_0|~r1(X1))). % 0.20/0.38 cnf(i_0_35, plain, (esk20_1(X1)=X1|esk18_1(X1)=X1)). % 0.20/0.38 cnf(i_0_39, plain, (~r2(X1,X2)|~r1(X2))). % 0.20/0.38 cnf(i_0_37, plain, (esk20_1(X1)=X1|r1(esk18_1(X1)))). % 0.20/0.38 cnf(i_0_7, plain, (X1=esk2_1(X2)|~r2(X2,X1))). % 0.20/0.38 cnf(i_0_36, plain, (esk18_1(X1)=X1|r2(esk19_1(X1),esk20_1(X1)))). % 0.20/0.38 cnf(i_0_41, negated_conjecture, (r1(esk22_2(X1,X2))|~r3(esk21_0,X2,X1))). % 0.20/0.38 cnf(i_0_40, negated_conjecture, (esk22_2(X1,X2)=X2|~r3(esk21_0,X2,X1))). % 0.20/0.38 cnf(i_0_38, plain, (r2(esk19_1(X1),esk20_1(X1))|r1(esk18_1(X1)))). % 0.20/0.38 cnf(i_0_11, plain, (X1=esk3_2(X2,X3)|~r3(X2,X3,X1))). % 0.20/0.38 cnf(i_0_15, plain, (X1=esk4_2(X2,X3)|~r4(X2,X3,X1))). % 0.20/0.38 cnf(i_0_27, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))). % 0.20/0.38 cnf(i_0_154, plain, (X92=X92)). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 6 steps % 0.20/0.38 cnf(i_0_2, plain, (r1(esk1_0)), inference(start_rule)). % 0.20/0.38 cnf(i_0_163, plain, (r1(esk1_0)), inference(extension_rule, [i_0_3])). % 0.20/0.38 cnf(i_0_254, plain, (esk1_0=esk1_0), inference(extension_rule, [i_0_159])). % 0.20/0.38 cnf(i_0_439, plain, ($false), inference(closure_rule, [i_0_154])). % 0.20/0.38 cnf(i_0_440, plain, (~r2(esk1_0,esk2_1(esk1_0))), inference(closure_rule, [i_0_6])). % 0.20/0.38 cnf(i_0_437, plain, (r2(esk1_0,esk2_1(esk1_0))), inference(etableau_closure_rule, [i_0_437, ...])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # Child (31903) has found a proof. % 0.20/0.38 % 0.20/0.38 # Proof search is over... % 0.20/0.38 # Freeing feature tree %------------------------------------------------------------------------------