%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ROB011-1 : TPTP v8.1.0. Released v1.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 : n019.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 20:52:04 EDT 2022 % Result : Unsatisfiable 0.13s 0.37s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : ROB011-1 : TPTP v8.1.0. Released v1.0.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.13/0.34 % Computer : n019.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 9 16:09:25 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni % 0.13/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 9 Number of unprocessed: 9 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 9 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 1 conjectures. % 0.13/0.37 # There are 1 start rule candidates: % 0.13/0.37 # Found 7 unit axioms. % 0.13/0.37 # 1 start rule tableaux created. % 0.13/0.37 # 2 extension rule candidate clauses % 0.13/0.37 # 7 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.37 # Creating equality axioms % 0.13/0.37 # Ran out of tableaux, making start rules for all clauses % 0.13/0.37 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 12 tableaux to operate on % 0.13/0.37 # There were 1 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 1 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 1 successful branch saturations after the branch. % 0.13/0.37 # There were 1 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 1 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 1 successful branch saturations after the branch. % 0.13/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_15, plain, (positive_integer(one))). % 0.13/0.37 cnf(i_0_17, hypothesis, (negate(add(a,negate(b)))=c)). % 0.13/0.37 cnf(i_0_13, plain, (multiply(one,X1)=X1)). % 0.13/0.37 cnf(i_0_11, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))). % 0.13/0.37 cnf(i_0_12, plain, (negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2)))))=X1)). % 0.13/0.37 cnf(i_0_10, plain, (add(X1,X2)=add(X2,X1))). % 0.13/0.37 cnf(i_0_18, negated_conjecture, (negate(add(a,negate(add(b,add(a,c)))))!=c)). % 0.13/0.37 cnf(i_0_16, plain, (positive_integer(successor(X1))|~positive_integer(X1))). % 0.13/0.37 cnf(i_0_14, plain, (multiply(successor(X1),X2)=add(X2,multiply(X1,X2))|~positive_integer(X2))). % 0.13/0.37 cnf(i_0_24, plain, (X4=X4)). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 6 steps % 0.13/0.37 cnf(i_0_10, plain, (add(X10,X10)=add(X10,X10)), inference(start_rule)). % 0.13/0.37 cnf(i_0_38, plain, (add(X10,X10)=add(X10,X10)), inference(extension_rule, [i_0_27])). % 0.13/0.37 cnf(i_0_79, plain, (multiply(one,add(X10,X10))!=add(X10,X10)), inference(closure_rule, [i_0_13])). % 0.13/0.37 cnf(i_0_77, plain, (add(X10,X10)=multiply(one,add(X10,X10))), inference(extension_rule, [i_0_28])). % 0.13/0.37 cnf(i_0_90, plain, (negate(add(a,negate(b)))!=c), inference(closure_rule, [i_0_17])). % 0.13/0.37 cnf(i_0_88, plain, (add(add(X10,X10),negate(add(a,negate(b))))=add(multiply(one,add(X10,X10)),c)), inference(etableau_closure_rule, [i_0_88, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_15, plain, (positive_integer(one))). % 0.13/0.37 cnf(i_0_17, hypothesis, (negate(add(a,negate(b)))=c)). % 0.13/0.37 cnf(i_0_13, plain, (multiply(one,X1)=X1)). % 0.13/0.37 cnf(i_0_11, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))). % 0.13/0.37 cnf(i_0_12, plain, (negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2)))))=X1)). % 0.13/0.37 cnf(i_0_10, plain, (add(X1,X2)=add(X2,X1))). % 0.13/0.37 cnf(i_0_18, negated_conjecture, (negate(add(a,negate(add(b,add(a,c)))))!=c)). % 0.13/0.37 cnf(i_0_16, plain, (positive_integer(successor(X1))|~positive_integer(X1))). % 0.13/0.37 cnf(i_0_14, plain, (multiply(successor(X1),X2)=add(X2,multiply(X1,X2))|~positive_integer(X2))). % 0.13/0.37 cnf(i_0_24, plain, (X4=X4)). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 5 steps % 0.13/0.37 cnf(i_0_15, plain, (positive_integer(one)), inference(start_rule)). % 0.13/0.37 cnf(i_0_33, plain, (positive_integer(one)), inference(extension_rule, [i_0_31])). % 0.13/0.37 cnf(i_0_65, plain, (multiply(one,one)!=one), inference(closure_rule, [i_0_13])). % 0.13/0.37 cnf(i_0_64, plain, (positive_integer(multiply(one,one))), inference(extension_rule, [i_0_16])). % 0.13/0.37 cnf(i_0_69, plain, (positive_integer(successor(multiply(one,one)))), inference(etableau_closure_rule, [i_0_69, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # There were 1 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 1 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 1 successful branch saturations after the branch. % 0.13/0.37 # There were 1 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 1 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 1 successful branch saturations after the branch. % 0.13/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_15, plain, (positive_integer(one))). % 0.13/0.37 cnf(i_0_17, hypothesis, (negate(add(a,negate(b)))=c)). % 0.13/0.37 cnf(i_0_13, plain, (multiply(one,X1)=X1)). % 0.13/0.37 cnf(i_0_11, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))). % 0.13/0.37 cnf(i_0_12, plain, (negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2)))))=X1)). % 0.13/0.37 cnf(i_0_10, plain, (add(X1,X2)=add(X2,X1))). % 0.13/0.37 cnf(i_0_18, negated_conjecture, (negate(add(a,negate(add(b,add(a,c)))))!=c)). % 0.13/0.37 cnf(i_0_16, plain, (positive_integer(successor(X1))|~positive_integer(X1))). % 0.13/0.37 cnf(i_0_14, plain, (multiply(successor(X1),X2)=add(X2,multiply(X1,X2))|~positive_integer(X2))). % 0.13/0.37 cnf(i_0_24, plain, (X4=X4)). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 5 steps % 0.13/0.37 cnf(i_0_17, hypothesis, (negate(add(a,negate(b)))=c), inference(start_rule)). % 0.13/0.37 cnf(i_0_34, plain, (negate(add(a,negate(b)))=c), inference(extension_rule, [i_0_28])). % 0.13/0.37 cnf(i_0_82, plain, (negate(add(a,negate(b)))!=c), inference(closure_rule, [i_0_17])). % 0.13/0.37 cnf(i_0_80, plain, (add(negate(add(a,negate(b))),negate(add(a,negate(b))))=add(c,c)), inference(extension_rule, [i_0_29])). % 0.13/0.37 cnf(i_0_94, plain, (negate(add(negate(add(a,negate(b))),negate(add(a,negate(b)))))=negate(add(c,c))), inference(etableau_closure_rule, [i_0_94, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_15, plain, (positive_integer(one))). % 0.13/0.37 cnf(i_0_17, hypothesis, (negate(add(a,negate(b)))=c)). % 0.13/0.37 cnf(i_0_13, plain, (multiply(one,X1)=X1)). % 0.13/0.37 cnf(i_0_11, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))). % 0.13/0.37 cnf(i_0_12, plain, (negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2)))))=X1)). % 0.13/0.37 cnf(i_0_10, plain, (add(X1,X2)=add(X2,X1))). % 0.13/0.37 cnf(i_0_18, negated_conjecture, (negate(add(a,negate(add(b,add(a,c)))))!=c)). % 0.13/0.37 cnf(i_0_16, plain, (positive_integer(successor(X1))|~positive_integer(X1))). % 0.13/0.37 cnf(i_0_14, plain, (multiply(successor(X1),X2)=add(X2,multiply(X1,X2))|~positive_integer(X2))). % 0.13/0.37 cnf(i_0_24, plain, (X4=X4)). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 4 steps % 0.13/0.37 cnf(i_0_15, plain, (positive_integer(one)), inference(start_rule)). % 0.13/0.37 cnf(i_0_33, plain, (positive_integer(one)), inference(extension_rule, [i_0_16])). % 0.13/0.37 cnf(i_0_45, plain, (positive_integer(successor(one))), inference(extension_rule, [i_0_16])). % 0.13/0.37 cnf(i_0_69, plain, (positive_integer(successor(successor(one)))), inference(etableau_closure_rule, [i_0_69, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # There were 1 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 1 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 1 successful branch saturations after the branch. % 0.13/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_15, plain, (positive_integer(one))). % 0.13/0.37 cnf(i_0_17, hypothesis, (negate(add(a,negate(b)))=c)). % 0.13/0.37 cnf(i_0_13, plain, (multiply(one,X1)=X1)). % 0.13/0.37 cnf(i_0_11, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))). % 0.13/0.37 cnf(i_0_12, plain, (negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2)))))=X1)). % 0.13/0.37 cnf(i_0_10, plain, (add(X1,X2)=add(X2,X1))). % 0.13/0.37 cnf(i_0_18, negated_conjecture, (negate(add(a,negate(add(b,add(a,c)))))!=c)). % 0.13/0.37 cnf(i_0_16, plain, (positive_integer(successor(X1))|~positive_integer(X1))). % 0.13/0.37 cnf(i_0_14, plain, (multiply(successor(X1),X2)=add(X2,multiply(X1,X2))|~positive_integer(X2))). % 0.13/0.37 cnf(i_0_24, plain, (X4=X4)). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 5 steps % 0.13/0.37 cnf(i_0_15, plain, (positive_integer(one)), inference(start_rule)). % 0.13/0.37 cnf(i_0_33, plain, (positive_integer(one)), inference(extension_rule, [i_0_14])). % 0.13/0.37 cnf(i_0_47, plain, (multiply(successor(X3),one)=add(one,multiply(X3,one))), inference(extension_rule, [i_0_28])). % 0.13/0.37 cnf(i_0_82, plain, (negate(add(a,negate(b)))!=c), inference(closure_rule, [i_0_17])). % 0.13/0.37 cnf(i_0_80, plain, (add(multiply(successor(X3),one),negate(add(a,negate(b))))=add(add(one,multiply(X3,one)),c)), inference(etableau_closure_rule, [i_0_80, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # Child (22506) has found a proof. % 0.13/0.37 % 0.13/0.37 # Proof search is over... % 0.13/0.37 # Freeing feature tree %------------------------------------------------------------------------------