%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUN068+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 : 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 : Mon Jul 18 16:26:19 EDT 2022 % Result : Theorem 0.20s 0.40s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : NUN068+2 : TPTP v8.1.0. Released v7.3.0. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.35 % Computer : n029.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Thu Jun 2 08:27:31 EDT 2022 % 0.14/0.35 % CPUTime : % 0.14/0.38 # No SInE strategy applied % 0.14/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b % 0.14/0.38 # and selection function SelectCQIPrecW. % 0.14/0.38 # % 0.14/0.38 # Presaturation interreduction done % 0.14/0.38 # Number of axioms: 33 Number of unprocessed: 33 % 0.14/0.38 # Tableaux proof search. % 0.14/0.38 # APR header successfully linked. % 0.14/0.38 # Hello from C++ % 0.14/0.38 # The folding up rule is enabled... % 0.14/0.38 # Local unification is enabled... % 0.14/0.38 # Any saturation attempts will use folding labels... % 0.14/0.38 # 33 beginning clauses after preprocessing and clausification % 0.14/0.38 # Creating start rules for all 6 conjectures. % 0.14/0.38 # There are 6 start rule candidates: % 0.14/0.38 # Found 17 unit axioms. % 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.38 # 6 start rule tableaux created. % 0.14/0.38 # 16 extension rule candidate clauses % 0.14/0.38 # 17 unit axiom clauses % 0.14/0.38 % 0.14/0.38 # Requested 8, 32 cores available to the main process. % 0.14/0.38 # There are not enough tableaux to fork, creating more from the initial 6 % 0.14/0.38 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.14/0.38 # We now have 12 tableaux to operate on % 0.20/0.39 # Creating equality axioms % 0.20/0.39 # Ran out of tableaux, making start rules for all clauses % 0.20/0.39 # Creating equality axioms % 0.20/0.39 # Ran out of tableaux, making start rules for all clauses % 0.20/0.39 # Creating equality axioms % 0.20/0.39 # Ran out of tableaux, making start rules for all clauses % 0.20/0.39 # Creating equality axioms % 0.20/0.39 # Ran out of tableaux, making start rules for all clauses % 0.20/0.40 # Creating equality axioms % 0.20/0.40 # Ran out of tableaux, making start rules for all clauses % 0.20/0.40 # Creating equality axioms % 0.20/0.40 # Ran out of tableaux, making start rules for all clauses % 0.20/0.40 # Creating equality axioms % 0.20/0.40 # Ran out of tableaux, making start rules for all clauses % 0.20/0.40 # There were 1 total branch saturation attempts. % 0.20/0.40 # There were 0 of these attempts blocked. % 0.20/0.40 # There were 0 deferred branch saturation attempts. % 0.20/0.40 # There were 0 free duplicated saturations. % 0.20/0.40 # There were 1 total successful branch saturations. % 0.20/0.40 # There were 0 successful branch saturations in interreduction. % 0.20/0.40 # There were 0 successful branch saturations on the branch. % 0.20/0.40 # There were 1 successful branch saturations after the branch. % 0.20/0.40 # There were 1 total branch saturation attempts. % 0.20/0.40 # There were 0 of these attempts blocked. % 0.20/0.40 # There were 0 deferred branch saturation attempts. % 0.20/0.40 # There were 0 free duplicated saturations. % 0.20/0.40 # There were 1 total successful branch saturations. % 0.20/0.40 # There were 0 successful branch saturations in interreduction. % 0.20/0.40 # There were 0 successful branch saturations on the branch. % 0.20/0.40 # There were 1 successful branch saturations after the branch. % 0.20/0.40 # There were 1 total branch saturation attempts. % 0.20/0.40 # There were 0 of these attempts blocked. % 0.20/0.40 # There were 0 deferred branch saturation attempts. % 0.20/0.40 # There were 0 free duplicated saturations. % 0.20/0.40 # There were 1 total successful branch saturations. % 0.20/0.40 # There were 0 successful branch saturations in interreduction. % 0.20/0.40 # There were 0 successful branch saturations on the branch. % 0.20/0.40 # There were 1 successful branch saturations after the branch. % 0.20/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.40 # Begin clausification derivation % 0.20/0.40 % 0.20/0.40 # End clausification derivation % 0.20/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.40 cnf(i_0_30, plain, (r1(esk14_1(X1)))). % 0.20/0.40 cnf(i_0_2, plain, (r1(esk1_0))). % 0.20/0.40 cnf(i_0_32, plain, (r1(esk15_1(X1)))). % 0.20/0.40 cnf(i_0_34, plain, (r1(esk16_1(X1)))). % 0.20/0.40 cnf(i_0_6, plain, (r2(X1,esk2_1(X1)))). % 0.20/0.40 cnf(i_0_21, plain, (r2(X1,esk7_2(X2,X1)))). % 0.20/0.40 cnf(i_0_26, plain, (r2(X1,esk11_2(X2,X1)))). % 0.20/0.40 cnf(i_0_29, plain, (r3(X1,esk14_1(X1),X1))). % 0.20/0.40 cnf(i_0_33, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))). % 0.20/0.40 cnf(i_0_17, plain, (r3(X1,X2,esk8_2(X1,X2)))). % 0.20/0.40 cnf(i_0_22, plain, (r4(X1,X2,esk12_2(X1,X2)))). % 0.20/0.40 cnf(i_0_18, plain, (r2(esk8_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.40 cnf(i_0_10, plain, (r3(X1,X2,esk3_2(X1,X2)))). % 0.20/0.40 cnf(i_0_14, plain, (r4(X1,X2,esk4_2(X1,X2)))). % 0.20/0.40 cnf(i_0_20, plain, (r3(X1,esk7_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.40 cnf(i_0_25, plain, (r4(X1,esk11_2(X1,X2),esk9_2(X1,X2)))). % 0.20/0.40 cnf(i_0_23, plain, (r3(esk12_2(X1,X2),X1,esk9_2(X1,X2)))). % 0.20/0.40 cnf(i_0_3, plain, (X1=esk1_0|~r1(X1))). % 0.20/0.40 cnf(i_0_45, negated_conjecture, (r1(esk23_1(X1))|r1(esk22_1(X1)))). % 0.20/0.40 cnf(i_0_39, plain, (~r2(X1,X2)|~r1(X2))). % 0.20/0.40 cnf(i_0_40, negated_conjecture, (esk23_1(X1)=X1|esk21_1(X1)=X1)). % 0.20/0.40 cnf(i_0_44, negated_conjecture, (esk23_1(X1)=X1|r1(esk22_1(X1)))). % 0.20/0.40 cnf(i_0_41, negated_conjecture, (esk21_1(X1)=X1|r1(esk23_1(X1)))). % 0.20/0.40 cnf(i_0_43, negated_conjecture, (r2(esk22_1(X1),esk21_1(X1))|r1(esk23_1(X1)))). % 0.20/0.40 cnf(i_0_42, negated_conjecture, (esk23_1(X1)=X1|r2(esk22_1(X1),esk21_1(X1)))). % 0.20/0.40 cnf(i_0_35, plain, (esk20_1(X1)=X1|esk18_1(X1)=X1)). % 0.20/0.40 cnf(i_0_37, plain, (esk20_1(X1)=X1|r1(esk18_1(X1)))). % 0.20/0.40 cnf(i_0_7, plain, (X1=esk2_1(X2)|~r2(X2,X1))). % 0.20/0.40 cnf(i_0_38, plain, (r2(esk19_1(X1),esk20_1(X1))|r1(esk18_1(X1)))). % 0.20/0.40 cnf(i_0_36, plain, (esk18_1(X1)=X1|r2(esk19_1(X1),esk20_1(X1)))). % 0.20/0.40 cnf(i_0_27, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))). % 0.20/0.40 cnf(i_0_11, plain, (X1=esk3_2(X2,X3)|~r3(X2,X3,X1))). % 0.20/0.40 cnf(i_0_15, plain, (X1=esk4_2(X2,X3)|~r4(X2,X3,X1))). % 0.20/0.40 cnf(i_0_229, plain, (X91=X91)). % 0.20/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.40 # Begin printing tableau % 0.20/0.40 # Found 5 steps % 0.20/0.40 cnf(i_0_229, plain, (esk14_1(X3)=esk14_1(X3)), inference(start_rule)). % 0.20/0.40 cnf(i_0_287, plain, (esk14_1(X3)=esk14_1(X3)), inference(extension_rule, [i_0_233])). % 0.20/0.40 cnf(i_0_330, plain, (~r1(esk14_1(X3))), inference(closure_rule, [i_0_30])). % 0.20/0.40 cnf(i_0_328, plain, (r1(esk14_1(X3))), inference(extension_rule, [i_0_3])). % 0.20/0.40 cnf(i_0_331, plain, (esk14_1(X3)=esk1_0), inference(etableau_closure_rule, [i_0_331, ...])). % 0.20/0.40 # End printing tableau % 0.20/0.40 # SZS output end % 0.20/0.40 # Branches closed with saturation will be marked with an "s" % 0.20/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.40 # Begin clausification derivation % 0.20/0.40 % 0.20/0.40 # End clausification derivation % 0.20/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.40 cnf(i_0_30, plain, (r1(esk14_1(X1)))). % 0.20/0.40 cnf(i_0_2, plain, (r1(esk1_0))). % 0.20/0.40 cnf(i_0_32, plain, (r1(esk15_1(X1)))). % 0.20/0.40 cnf(i_0_34, plain, (r1(esk16_1(X1)))). % 0.20/0.40 cnf(i_0_6, plain, (r2(X1,esk2_1(X1)))). % 0.20/0.40 cnf(i_0_21, plain, (r2(X1,esk7_2(X2,X1)))). % 0.20/0.40 cnf(i_0_26, plain, (r2(X1,esk11_2(X2,X1)))). % 0.20/0.40 cnf(i_0_29, plain, (r3(X1,esk14_1(X1),X1))). % 0.20/0.40 cnf(i_0_33, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))). % 0.20/0.40 cnf(i_0_17, plain, (r3(X1,X2,esk8_2(X1,X2)))). % 0.20/0.40 cnf(i_0_22, plain, (r4(X1,X2,esk12_2(X1,X2)))). % 0.20/0.40 cnf(i_0_18, plain, (r2(esk8_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.40 cnf(i_0_10, plain, (r3(X1,X2,esk3_2(X1,X2)))). % 0.20/0.40 cnf(i_0_14, plain, (r4(X1,X2,esk4_2(X1,X2)))). % 0.20/0.40 cnf(i_0_20, plain, (r3(X1,esk7_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.40 cnf(i_0_25, plain, (r4(X1,esk11_2(X1,X2),esk9_2(X1,X2)))). % 0.20/0.40 cnf(i_0_23, plain, (r3(esk12_2(X1,X2),X1,esk9_2(X1,X2)))). % 0.20/0.40 cnf(i_0_3, plain, (X1=esk1_0|~r1(X1))). % 0.20/0.40 cnf(i_0_45, negated_conjecture, (r1(esk23_1(X1))|r1(esk22_1(X1)))). % 0.20/0.40 cnf(i_0_39, plain, (~r2(X1,X2)|~r1(X2))). % 0.20/0.40 cnf(i_0_40, negated_conjecture, (esk23_1(X1)=X1|esk21_1(X1)=X1)). % 0.20/0.40 cnf(i_0_44, negated_conjecture, (esk23_1(X1)=X1|r1(esk22_1(X1)))). % 0.20/0.40 cnf(i_0_41, negated_conjecture, (esk21_1(X1)=X1|r1(esk23_1(X1)))). % 0.20/0.40 cnf(i_0_43, negated_conjecture, (r2(esk22_1(X1),esk21_1(X1))|r1(esk23_1(X1)))). % 0.20/0.40 cnf(i_0_42, negated_conjecture, (esk23_1(X1)=X1|r2(esk22_1(X1),esk21_1(X1)))). % 0.20/0.40 cnf(i_0_35, plain, (esk20_1(X1)=X1|esk18_1(X1)=X1)). % 0.20/0.40 cnf(i_0_37, plain, (esk20_1(X1)=X1|r1(esk18_1(X1)))). % 0.20/0.40 cnf(i_0_7, plain, (X1=esk2_1(X2)|~r2(X2,X1))). % 0.20/0.40 cnf(i_0_38, plain, (r2(esk19_1(X1),esk20_1(X1))|r1(esk18_1(X1)))). % 0.20/0.40 cnf(i_0_36, plain, (esk18_1(X1)=X1|r2(esk19_1(X1),esk20_1(X1)))). % 0.20/0.40 cnf(i_0_27, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))). % 0.20/0.40 cnf(i_0_11, plain, (X1=esk3_2(X2,X3)|~r3(X2,X3,X1))). % 0.20/0.40 cnf(i_0_15, plain, (X1=esk4_2(X2,X3)|~r4(X2,X3,X1))). % 0.20/0.40 cnf(i_0_229, plain, (X91=X91)). % 0.20/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.40 # Begin printing tableau % 0.20/0.40 # Found 5 steps % 0.20/0.40 cnf(i_0_229, plain, (esk14_1(X3)=esk14_1(X3)), inference(start_rule)). % 0.20/0.40 cnf(i_0_287, plain, (esk14_1(X3)=esk14_1(X3)), inference(extension_rule, [i_0_233])). % 0.20/0.40 cnf(i_0_330, plain, (~r1(esk14_1(X3))), inference(closure_rule, [i_0_30])). % 0.20/0.40 cnf(i_0_328, plain, (r1(esk14_1(X3))), inference(extension_rule, [i_0_3])). % 0.20/0.40 cnf(i_0_331, plain, (esk14_1(X3)=esk1_0), inference(etableau_closure_rule, [i_0_331, ...])). % 0.20/0.40 # End printing tableau % 0.20/0.40 # SZS output end % 0.20/0.40 # Branches closed with saturation will be marked with an "s" % 0.20/0.40 # There were 1 total branch saturation attempts. % 0.20/0.40 # There were 0 of these attempts blocked. % 0.20/0.40 # There were 0 deferred branch saturation attempts. % 0.20/0.40 # There were 0 free duplicated saturations. % 0.20/0.40 # There were 1 total successful branch saturations. % 0.20/0.40 # There were 0 successful branch saturations in interreduction. % 0.20/0.40 # There were 0 successful branch saturations on the branch. % 0.20/0.40 # There were 1 successful branch saturations after the branch. % 0.20/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.40 # Begin clausification derivation % 0.20/0.40 % 0.20/0.40 # End clausification derivation % 0.20/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.40 cnf(i_0_30, plain, (r1(esk14_1(X1)))). % 0.20/0.40 cnf(i_0_2, plain, (r1(esk1_0))). % 0.20/0.40 cnf(i_0_32, plain, (r1(esk15_1(X1)))). % 0.20/0.40 cnf(i_0_34, plain, (r1(esk16_1(X1)))). % 0.20/0.40 cnf(i_0_6, plain, (r2(X1,esk2_1(X1)))). % 0.20/0.40 cnf(i_0_21, plain, (r2(X1,esk7_2(X2,X1)))). % 0.20/0.40 cnf(i_0_26, plain, (r2(X1,esk11_2(X2,X1)))). % 0.20/0.40 cnf(i_0_29, plain, (r3(X1,esk14_1(X1),X1))). % 0.20/0.40 cnf(i_0_33, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))). % 0.20/0.40 cnf(i_0_17, plain, (r3(X1,X2,esk8_2(X1,X2)))). % 0.20/0.40 cnf(i_0_22, plain, (r4(X1,X2,esk12_2(X1,X2)))). % 0.20/0.40 cnf(i_0_18, plain, (r2(esk8_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.40 cnf(i_0_10, plain, (r3(X1,X2,esk3_2(X1,X2)))). % 0.20/0.40 cnf(i_0_14, plain, (r4(X1,X2,esk4_2(X1,X2)))). % 0.20/0.40 cnf(i_0_20, plain, (r3(X1,esk7_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.40 cnf(i_0_25, plain, (r4(X1,esk11_2(X1,X2),esk9_2(X1,X2)))). % 0.20/0.40 cnf(i_0_23, plain, (r3(esk12_2(X1,X2),X1,esk9_2(X1,X2)))). % 0.20/0.40 cnf(i_0_3, plain, (X1=esk1_0|~r1(X1))). % 0.20/0.40 cnf(i_0_45, negated_conjecture, (r1(esk23_1(X1))|r1(esk22_1(X1)))). % 0.20/0.40 cnf(i_0_39, plain, (~r2(X1,X2)|~r1(X2))). % 0.20/0.40 cnf(i_0_40, negated_conjecture, (esk23_1(X1)=X1|esk21_1(X1)=X1)). % 0.20/0.40 cnf(i_0_44, negated_conjecture, (esk23_1(X1)=X1|r1(esk22_1(X1)))). % 0.20/0.40 cnf(i_0_41, negated_conjecture, (esk21_1(X1)=X1|r1(esk23_1(X1)))). % 0.20/0.40 cnf(i_0_43, negated_conjecture, (r2(esk22_1(X1),esk21_1(X1))|r1(esk23_1(X1)))). % 0.20/0.40 cnf(i_0_42, negated_conjecture, (esk23_1(X1)=X1|r2(esk22_1(X1),esk21_1(X1)))). % 0.20/0.40 cnf(i_0_35, plain, (esk20_1(X1)=X1|esk18_1(X1)=X1)). % 0.20/0.40 cnf(i_0_37, plain, (esk20_1(X1)=X1|r1(esk18_1(X1)))). % 0.20/0.40 cnf(i_0_7, plain, (X1=esk2_1(X2)|~r2(X2,X1))). % 0.20/0.40 cnf(i_0_38, plain, (r2(esk19_1(X1),esk20_1(X1))|r1(esk18_1(X1)))). % 0.20/0.40 cnf(i_0_36, plain, (esk18_1(X1)=X1|r2(esk19_1(X1),esk20_1(X1)))). % 0.20/0.40 cnf(i_0_27, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))). % 0.20/0.40 cnf(i_0_11, plain, (X1=esk3_2(X2,X3)|~r3(X2,X3,X1))). % 0.20/0.40 cnf(i_0_15, plain, (X1=esk4_2(X2,X3)|~r4(X2,X3,X1))). % 0.20/0.40 cnf(i_0_196, plain, (X91=X91)). % 0.20/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.40 # Begin printing tableau % 0.20/0.40 # Found 5 steps % 0.20/0.40 cnf(i_0_196, plain, (esk14_1(X3)=esk14_1(X3)), inference(start_rule)). % 0.20/0.40 cnf(i_0_254, plain, (esk14_1(X3)=esk14_1(X3)), inference(extension_rule, [i_0_200])). % 0.20/0.40 cnf(i_0_297, plain, (~r1(esk14_1(X3))), inference(closure_rule, [i_0_30])). % 0.20/0.40 cnf(i_0_295, plain, (r1(esk14_1(X3))), inference(extension_rule, [i_0_3])). % 0.20/0.40 cnf(i_0_298, plain, (esk14_1(X3)=esk1_0), inference(etableau_closure_rule, [i_0_298, ...])). % 0.20/0.40 # End printing tableau % 0.20/0.40 # SZS output end % 0.20/0.40 # Branches closed with saturation will be marked with an "s" % 0.20/0.40 # There were 1 total branch saturation attempts. % 0.20/0.40 # There were 0 of these attempts blocked. % 0.20/0.40 # There were 0 deferred branch saturation attempts. % 0.20/0.40 # There were 0 free duplicated saturations. % 0.20/0.40 # There were 1 total successful branch saturations. % 0.20/0.40 # There were 0 successful branch saturations in interreduction. % 0.20/0.40 # There were 0 successful branch saturations on the branch. % 0.20/0.40 # There were 1 successful branch saturations after the branch. % 0.20/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.40 # Begin clausification derivation % 0.20/0.40 % 0.20/0.40 # End clausification derivation % 0.20/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.40 cnf(i_0_30, plain, (r1(esk14_1(X1)))). % 0.20/0.40 cnf(i_0_2, plain, (r1(esk1_0))). % 0.20/0.40 cnf(i_0_32, plain, (r1(esk15_1(X1)))). % 0.20/0.40 cnf(i_0_34, plain, (r1(esk16_1(X1)))). % 0.20/0.40 cnf(i_0_6, plain, (r2(X1,esk2_1(X1)))). % 0.20/0.40 cnf(i_0_21, plain, (r2(X1,esk7_2(X2,X1)))). % 0.20/0.40 cnf(i_0_26, plain, (r2(X1,esk11_2(X2,X1)))). % 0.20/0.40 cnf(i_0_29, plain, (r3(X1,esk14_1(X1),X1))). % 0.20/0.40 cnf(i_0_33, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))). % 0.20/0.40 cnf(i_0_17, plain, (r3(X1,X2,esk8_2(X1,X2)))). % 0.20/0.40 cnf(i_0_22, plain, (r4(X1,X2,esk12_2(X1,X2)))). % 0.20/0.40 cnf(i_0_18, plain, (r2(esk8_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.40 cnf(i_0_10, plain, (r3(X1,X2,esk3_2(X1,X2)))). % 0.20/0.40 cnf(i_0_14, plain, (r4(X1,X2,esk4_2(X1,X2)))). % 0.20/0.40 cnf(i_0_20, plain, (r3(X1,esk7_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.40 cnf(i_0_25, plain, (r4(X1,esk11_2(X1,X2),esk9_2(X1,X2)))). % 0.20/0.40 cnf(i_0_23, plain, (r3(esk12_2(X1,X2),X1,esk9_2(X1,X2)))). % 0.20/0.40 cnf(i_0_3, plain, (X1=esk1_0|~r1(X1))). % 0.20/0.40 cnf(i_0_45, negated_conjecture, (r1(esk23_1(X1))|r1(esk22_1(X1)))). % 0.20/0.40 cnf(i_0_39, plain, (~r2(X1,X2)|~r1(X2))). % 0.20/0.40 cnf(i_0_40, negated_conjecture, (esk23_1(X1)=X1|esk21_1(X1)=X1)). % 0.20/0.40 cnf(i_0_44, negated_conjecture, (esk23_1(X1)=X1|r1(esk22_1(X1)))). % 0.20/0.40 cnf(i_0_41, negated_conjecture, (esk21_1(X1)=X1|r1(esk23_1(X1)))). % 0.20/0.40 cnf(i_0_43, negated_conjecture, (r2(esk22_1(X1),esk21_1(X1))|r1(esk23_1(X1)))). % 0.20/0.40 cnf(i_0_42, negated_conjecture, (esk23_1(X1)=X1|r2(esk22_1(X1),esk21_1(X1)))). % 0.20/0.40 cnf(i_0_35, plain, (esk20_1(X1)=X1|esk18_1(X1)=X1)). % 0.20/0.40 cnf(i_0_37, plain, (esk20_1(X1)=X1|r1(esk18_1(X1)))). % 0.20/0.40 cnf(i_0_7, plain, (X1=esk2_1(X2)|~r2(X2,X1))). % 0.20/0.40 cnf(i_0_38, plain, (r2(esk19_1(X1),esk20_1(X1))|r1(esk18_1(X1)))). % 0.20/0.40 cnf(i_0_36, plain, (esk18_1(X1)=X1|r2(esk19_1(X1),esk20_1(X1)))). % 0.20/0.40 cnf(i_0_27, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))). % 0.20/0.40 cnf(i_0_11, plain, (X1=esk3_2(X2,X3)|~r3(X2,X3,X1))). % 0.20/0.40 cnf(i_0_15, plain, (X1=esk4_2(X2,X3)|~r4(X2,X3,X1))). % 0.20/0.40 cnf(i_0_196, plain, (X91=X91)). % 0.20/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.40 # Begin printing tableau % 0.20/0.40 # Found 5 steps % 0.20/0.40 cnf(i_0_196, plain, (esk14_1(X3)=esk14_1(X3)), inference(start_rule)). % 0.20/0.40 cnf(i_0_254, plain, (esk14_1(X3)=esk14_1(X3)), inference(extension_rule, [i_0_200])). % 0.20/0.40 cnf(i_0_297, plain, (~r1(esk14_1(X3))), inference(closure_rule, [i_0_30])). % 0.20/0.40 cnf(i_0_295, plain, (r1(esk14_1(X3))), inference(extension_rule, [i_0_3])). % 0.20/0.40 cnf(i_0_298, plain, (esk14_1(X3)=esk1_0), inference(etableau_closure_rule, [i_0_298, ...])). % 0.20/0.40 # End printing tableau % 0.20/0.40 # SZS output end % 0.20/0.40 # Branches closed with saturation will be marked with an "s" % 0.20/0.40 # There were 1 total branch saturation attempts. % 0.20/0.40 # There were 0 of these attempts blocked. % 0.20/0.40 # There were 0 deferred branch saturation attempts. % 0.20/0.40 # There were 0 free duplicated saturations. % 0.20/0.40 # There were 1 total successful branch saturations. % 0.20/0.40 # There were 0 successful branch saturations in interreduction. % 0.20/0.40 # There were 0 successful branch saturations on the branch. % 0.20/0.40 # There were 1 successful branch saturations after the branch. % 0.20/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.40 # Begin clausification derivation % 0.20/0.40 % 0.20/0.40 # End clausification derivation % 0.20/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.40 cnf(i_0_30, plain, (r1(esk14_1(X1)))). % 0.20/0.40 cnf(i_0_2, plain, (r1(esk1_0))). % 0.20/0.40 cnf(i_0_32, plain, (r1(esk15_1(X1)))). % 0.20/0.40 cnf(i_0_34, plain, (r1(esk16_1(X1)))). % 0.20/0.40 cnf(i_0_6, plain, (r2(X1,esk2_1(X1)))). % 0.20/0.40 cnf(i_0_21, plain, (r2(X1,esk7_2(X2,X1)))). % 0.20/0.40 cnf(i_0_26, plain, (r2(X1,esk11_2(X2,X1)))). % 0.20/0.40 cnf(i_0_29, plain, (r3(X1,esk14_1(X1),X1))). % 0.20/0.40 cnf(i_0_33, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))). % 0.20/0.40 cnf(i_0_17, plain, (r3(X1,X2,esk8_2(X1,X2)))). % 0.20/0.40 cnf(i_0_22, plain, (r4(X1,X2,esk12_2(X1,X2)))). % 0.20/0.40 cnf(i_0_18, plain, (r2(esk8_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.40 cnf(i_0_10, plain, (r3(X1,X2,esk3_2(X1,X2)))). % 0.20/0.40 cnf(i_0_14, plain, (r4(X1,X2,esk4_2(X1,X2)))). % 0.20/0.40 cnf(i_0_20, plain, (r3(X1,esk7_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.40 cnf(i_0_25, plain, (r4(X1,esk11_2(X1,X2),esk9_2(X1,X2)))). % 0.20/0.40 cnf(i_0_23, plain, (r3(esk12_2(X1,X2),X1,esk9_2(X1,X2)))). % 0.20/0.40 cnf(i_0_3, plain, (X1=esk1_0|~r1(X1))). % 0.20/0.40 cnf(i_0_45, negated_conjecture, (r1(esk23_1(X1))|r1(esk22_1(X1)))). % 0.20/0.40 cnf(i_0_39, plain, (~r2(X1,X2)|~r1(X2))). % 0.20/0.40 cnf(i_0_40, negated_conjecture, (esk23_1(X1)=X1|esk21_1(X1)=X1)). % 0.20/0.40 cnf(i_0_44, negated_conjecture, (esk23_1(X1)=X1|r1(esk22_1(X1)))). % 0.20/0.40 cnf(i_0_41, negated_conjecture, (esk21_1(X1)=X1|r1(esk23_1(X1)))). % 0.20/0.40 cnf(i_0_43, negated_conjecture, (r2(esk22_1(X1),esk21_1(X1))|r1(esk23_1(X1)))). % 0.20/0.40 cnf(i_0_42, negated_conjecture, (esk23_1(X1)=X1|r2(esk22_1(X1),esk21_1(X1)))). % 0.20/0.40 cnf(i_0_35, plain, (esk20_1(X1)=X1|esk18_1(X1)=X1)). % 0.20/0.40 cnf(i_0_37, plain, (esk20_1(X1)=X1|r1(esk18_1(X1)))). % 0.20/0.40 cnf(i_0_7, plain, (X1=esk2_1(X2)|~r2(X2,X1))). % 0.20/0.40 cnf(i_0_38, plain, (r2(esk19_1(X1),esk20_1(X1))|r1(esk18_1(X1)))). % 0.20/0.40 cnf(i_0_36, plain, (esk18_1(X1)=X1|r2(esk19_1(X1),esk20_1(X1)))). % 0.20/0.40 cnf(i_0_27, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))). % 0.20/0.40 cnf(i_0_11, plain, (X1=esk3_2(X2,X3)|~r3(X2,X3,X1))). % 0.20/0.40 cnf(i_0_15, plain, (X1=esk4_2(X2,X3)|~r4(X2,X3,X1))). % 0.20/0.40 cnf(i_0_196, plain, (X91=X91)). % 0.20/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.40 # Begin printing tableau % 0.20/0.40 # Found 5 steps % 0.20/0.40 cnf(i_0_196, plain, (esk14_1(X3)=esk14_1(X3)), inference(start_rule)). % 0.20/0.40 cnf(i_0_254, plain, (esk14_1(X3)=esk14_1(X3)), inference(extension_rule, [i_0_200])). % 0.20/0.40 cnf(i_0_297, plain, (~r1(esk14_1(X3))), inference(closure_rule, [i_0_30])). % 0.20/0.40 cnf(i_0_295, plain, (r1(esk14_1(X3))), inference(extension_rule, [i_0_3])). % 0.20/0.40 cnf(i_0_298, plain, (esk14_1(X3)=esk1_0), inference(etableau_closure_rule, [i_0_298, ...])). % 0.20/0.40 # End printing tableau % 0.20/0.40 # SZS output end % 0.20/0.40 # Branches closed with saturation will be marked with an "s" % 0.20/0.40 # There were 1 total branch saturation attempts. % 0.20/0.40 # There were 0 of these attempts blocked. % 0.20/0.40 # There were 0 deferred branch saturation attempts. % 0.20/0.40 # There were 0 free duplicated saturations. % 0.20/0.40 # There were 1 total successful branch saturations. % 0.20/0.40 # There were 0 successful branch saturations in interreduction. % 0.20/0.40 # There were 0 successful branch saturations on the branch. % 0.20/0.40 # There were 1 successful branch saturations after the branch. % 0.20/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.40 # Begin clausification derivation % 0.20/0.40 % 0.20/0.40 # End clausification derivation % 0.20/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.40 cnf(i_0_30, plain, (r1(esk14_1(X1)))). % 0.20/0.40 cnf(i_0_2, plain, (r1(esk1_0))). % 0.20/0.40 cnf(i_0_32, plain, (r1(esk15_1(X1)))). % 0.20/0.40 cnf(i_0_34, plain, (r1(esk16_1(X1)))). % 0.20/0.40 cnf(i_0_6, plain, (r2(X1,esk2_1(X1)))). % 0.20/0.40 cnf(i_0_21, plain, (r2(X1,esk7_2(X2,X1)))). % 0.20/0.40 cnf(i_0_26, plain, (r2(X1,esk11_2(X2,X1)))). % 0.20/0.40 cnf(i_0_29, plain, (r3(X1,esk14_1(X1),X1))). % 0.20/0.40 cnf(i_0_33, plain, (r4(X1,esk16_1(X1),esk15_1(X1)))). % 0.20/0.40 cnf(i_0_17, plain, (r3(X1,X2,esk8_2(X1,X2)))). % 0.20/0.40 cnf(i_0_22, plain, (r4(X1,X2,esk12_2(X1,X2)))). % 0.20/0.40 cnf(i_0_18, plain, (r2(esk8_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.40 cnf(i_0_10, plain, (r3(X1,X2,esk3_2(X1,X2)))). % 0.20/0.40 cnf(i_0_14, plain, (r4(X1,X2,esk4_2(X1,X2)))). % 0.20/0.40 cnf(i_0_20, plain, (r3(X1,esk7_2(X1,X2),esk5_2(X1,X2)))). % 0.20/0.40 cnf(i_0_25, plain, (r4(X1,esk11_2(X1,X2),esk9_2(X1,X2)))). % 0.20/0.40 cnf(i_0_23, plain, (r3(esk12_2(X1,X2),X1,esk9_2(X1,X2)))). % 0.20/0.40 cnf(i_0_3, plain, (X1=esk1_0|~r1(X1))). % 0.20/0.40 cnf(i_0_45, negated_conjecture, (r1(esk23_1(X1))|r1(esk22_1(X1)))). % 0.20/0.40 cnf(i_0_39, plain, (~r2(X1,X2)|~r1(X2))). % 0.20/0.40 cnf(i_0_40, negated_conjecture, (esk23_1(X1)=X1|esk21_1(X1)=X1)). % 0.20/0.40 cnf(i_0_44, negated_conjecture, (esk23_1(X1)=X1|r1(esk22_1(X1)))). % 0.20/0.40 cnf(i_0_41, negated_conjecture, (esk21_1(X1)=X1|r1(esk23_1(X1)))). % 0.20/0.40 cnf(i_0_43, negated_conjecture, (r2(esk22_1(X1),esk21_1(X1))|r1(esk23_1(X1)))). % 0.20/0.40 cnf(i_0_42, negated_conjecture, (esk23_1(X1)=X1|r2(esk22_1(X1),esk21_1(X1)))). % 0.20/0.40 cnf(i_0_35, plain, (esk20_1(X1)=X1|esk18_1(X1)=X1)). % 0.20/0.40 cnf(i_0_37, plain, (esk20_1(X1)=X1|r1(esk18_1(X1)))). % 0.20/0.40 cnf(i_0_7, plain, (X1=esk2_1(X2)|~r2(X2,X1))). % 0.20/0.40 cnf(i_0_38, plain, (r2(esk19_1(X1),esk20_1(X1))|r1(esk18_1(X1)))). % 0.20/0.40 cnf(i_0_36, plain, (esk18_1(X1)=X1|r2(esk19_1(X1),esk20_1(X1)))). % 0.20/0.40 cnf(i_0_27, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3))). % 0.20/0.40 cnf(i_0_11, plain, (X1=esk3_2(X2,X3)|~r3(X2,X3,X1))). % 0.20/0.40 cnf(i_0_15, plain, (X1=esk4_2(X2,X3)|~r4(X2,X3,X1))). % 0.20/0.40 cnf(i_0_429, plain, (X91=X91)). % 0.20/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.40 # Begin printing tableau % 0.20/0.40 # Found 5 steps % 0.20/0.40 cnf(i_0_429, plain, (esk14_1(X6)=esk14_1(X6)), inference(start_rule)). % 0.20/0.40 cnf(i_0_487, plain, (esk14_1(X6)=esk14_1(X6)), inference(extension_rule, [i_0_433])). % 0.20/0.40 cnf(i_0_530, plain, (~r1(esk14_1(X6))), inference(closure_rule, [i_0_30])). % 0.20/0.40 cnf(i_0_528, plain, (r1(esk14_1(X6))), inference(extension_rule, [i_0_39])). % 0.20/0.40 cnf(i_0_560, plain, (~r2(X3,esk14_1(X6))), inference(etableau_closure_rule, [i_0_560, ...])). % 0.20/0.40 # End printing tableau % 0.20/0.40 # SZS output end % 0.20/0.40 # Branches closed with saturation will be marked with an "s" % 0.20/0.40 # Child (11448) has found a proof. % 0.20/0.40 % 0.20/0.40 # Proof search is over... % 0.20/0.40 # Freeing feature tree %------------------------------------------------------------------------------