%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ROB015-10 : TPTP v8.1.0. Released v7.5.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 : n022.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 27.81s 3.87s % Output : CNFRefutation 27.81s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : ROB015-10 : TPTP v8.1.0. Released v7.5.0. % 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n022.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Thu Jun 9 14:05:19 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 18 Number of unprocessed: 18 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 18 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 2 conjectures. % 0.12/0.36 # There are 2 start rule candidates: % 0.12/0.36 # Found 18 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 2 start rule tableaux created. % 0.12/0.36 # 0 extension rule candidate clauses % 0.12/0.36 # 18 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 2 % 0.12/0.36 # Creating equality axioms % 0.12/0.36 # Ran out of tableaux, making start rules for all clauses % 0.12/0.36 # Returning from population with 43 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 43 tableaux to operate on % 27.81/3.87 # There were 1 total branch saturation attempts. % 27.81/3.87 # There were 0 of these attempts blocked. % 27.81/3.87 # There were 0 deferred branch saturation attempts. % 27.81/3.87 # There were 0 free duplicated saturations. % 27.81/3.87 # There were 1 total successful branch saturations. % 27.81/3.87 # There were 0 successful branch saturations in interreduction. % 27.81/3.87 # There were 0 successful branch saturations on the branch. % 27.81/3.87 # There were 1 successful branch saturations after the branch. % 27.81/3.87 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 27.81/3.87 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 27.81/3.87 # Begin clausification derivation % 27.81/3.87 % 27.81/3.87 # End clausification derivation % 27.81/3.87 # Begin listing active clauses obtained from FOF to CNF conversion % 27.81/3.87 cnf(i_0_32, hypothesis, (negate(add(negate(e),negate(add(d,negate(e)))))=d)). % 27.81/3.87 cnf(i_0_33, plain, (positive_integer(k)=true)). % 27.81/3.87 cnf(i_0_34, plain, (ifeq3(negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))),negate(e),a,b)=b)). % 27.81/3.87 cnf(i_0_35, negated_conjecture, (ifeq3(negate(add(e,multiply(successor(k),add(d,negate(add(d,negate(e))))))),negate(e),a,b)=b)). % 27.81/3.87 cnf(i_0_28, plain, (positive_integer(one)=true)). % 27.81/3.87 cnf(i_0_26, plain, (multiply(one,X1)=X1)). % 27.81/3.87 cnf(i_0_19, plain, (ifeq4(X1,X1,X2,X3)=X2)). % 27.81/3.87 cnf(i_0_20, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 27.81/3.87 cnf(i_0_21, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 27.81/3.87 cnf(i_0_22, plain, (ifeq(X1,X1,X2,X3)=X2)). % 27.81/3.87 cnf(i_0_24, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))). % 27.81/3.87 cnf(i_0_25, plain, (negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2)))))=X1)). % 27.81/3.87 cnf(i_0_29, plain, (ifeq(positive_integer(X1),true,positive_integer(successor(X1)),true)=true)). % 27.81/3.87 cnf(i_0_30, plain, (ifeq4(negate(add(X1,negate(add(X2,X3)))),negate(add(X2,negate(add(X1,X3)))),X1,X2)=X2)). % 27.81/3.87 cnf(i_0_27, plain, (ifeq2(positive_integer(X1),true,add(X1,multiply(X2,X1)),multiply(successor(X2),X1))=multiply(successor(X2),X1))). % 27.81/3.87 cnf(i_0_31, plain, (ifeq2(positive_integer(X1),true,ifeq4(negate(add(X2,negate(X3))),X4,negate(add(X2,negate(add(X3,multiply(X1,add(X2,X4)))))),X4),X4)=X4)). % 27.81/3.87 cnf(i_0_23, plain, (add(X1,X2)=add(X2,X1))). % 27.81/3.87 cnf(i_0_36, negated_conjecture, (a!=b)). % 27.81/3.87 cnf(i_0_39, plain, (X5=X5)). % 27.81/3.87 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 27.81/3.87 # Begin printing tableau % 27.81/3.87 # Found 5 steps % 27.81/3.87 cnf(i_0_32, hypothesis, (negate(add(negate(e),negate(add(d,negate(e)))))=d), inference(start_rule)). % 27.81/3.87 cnf(i_0_52, plain, (negate(add(negate(e),negate(add(d,negate(e)))))=d), inference(extension_rule, [i_0_48])). % 27.81/3.87 cnf(i_0_101, plain, (negate(negate(add(negate(e),negate(add(d,negate(e))))))=negate(d)), inference(extension_rule, [i_0_42])). % 27.81/3.87 cnf(i_0_116, plain, (negate(d)!=multiply(one,negate(d))), inference(closure_rule, [i_0_26])). % 27.81/3.87 cnf(i_0_114, plain, (negate(negate(add(negate(e),negate(add(d,negate(e))))))=multiply(one,negate(d))), inference(etableau_closure_rule, [i_0_114, ...])). % 27.81/3.87 # End printing tableau % 27.81/3.87 # SZS output end % 27.81/3.87 # Branches closed with saturation will be marked with an "s" % 27.81/3.89 # There were 1 total branch saturation attempts. % 27.81/3.89 # There were 0 of these attempts blocked. % 27.81/3.89 # There were 0 deferred branch saturation attempts. % 27.81/3.89 # There were 0 free duplicated saturations. % 27.81/3.89 # There were 1 total successful branch saturations. % 27.81/3.89 # There were 0 successful branch saturations in interreduction. % 27.81/3.89 # There were 0 successful branch saturations on the branch. % 27.81/3.89 # There were 1 successful branch saturations after the branch. % 27.81/3.89 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 27.81/3.89 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 27.81/3.89 # Begin clausification derivation % 27.81/3.89 % 27.81/3.89 # End clausification derivation % 27.81/3.89 # Begin listing active clauses obtained from FOF to CNF conversion % 27.81/3.89 cnf(i_0_32, hypothesis, (negate(add(negate(e),negate(add(d,negate(e)))))=d)). % 27.81/3.89 cnf(i_0_33, plain, (positive_integer(k)=true)). % 27.81/3.89 cnf(i_0_34, plain, (ifeq3(negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))),negate(e),a,b)=b)). % 27.81/3.89 cnf(i_0_35, negated_conjecture, (ifeq3(negate(add(e,multiply(successor(k),add(d,negate(add(d,negate(e))))))),negate(e),a,b)=b)). % 27.81/3.89 cnf(i_0_28, plain, (positive_integer(one)=true)). % 27.81/3.89 cnf(i_0_26, plain, (multiply(one,X1)=X1)). % 27.81/3.89 cnf(i_0_19, plain, (ifeq4(X1,X1,X2,X3)=X2)). % 27.81/3.89 cnf(i_0_20, plain, (ifeq3(X1,X1,X2,X3)=X2)). % 27.81/3.89 cnf(i_0_21, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 27.81/3.89 cnf(i_0_22, plain, (ifeq(X1,X1,X2,X3)=X2)). % 27.81/3.89 cnf(i_0_24, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))). % 27.81/3.89 cnf(i_0_25, plain, (negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2)))))=X1)). % 27.81/3.89 cnf(i_0_29, plain, (ifeq(positive_integer(X1),true,positive_integer(successor(X1)),true)=true)). % 27.81/3.89 cnf(i_0_30, plain, (ifeq4(negate(add(X1,negate(add(X2,X3)))),negate(add(X2,negate(add(X1,X3)))),X1,X2)=X2)). % 27.81/3.89 cnf(i_0_27, plain, (ifeq2(positive_integer(X1),true,add(X1,multiply(X2,X1)),multiply(successor(X2),X1))=multiply(successor(X2),X1))). % 27.81/3.89 cnf(i_0_31, plain, (ifeq2(positive_integer(X1),true,ifeq4(negate(add(X2,negate(X3))),X4,negate(add(X2,negate(add(X3,multiply(X1,add(X2,X4)))))),X4),X4)=X4)). % 27.81/3.89 cnf(i_0_23, plain, (add(X1,X2)=add(X2,X1))). % 27.81/3.89 cnf(i_0_36, negated_conjecture, (a!=b)). % 27.81/3.89 cnf(i_0_39, plain, (X5=X5)). % 27.81/3.89 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 27.81/3.89 # Begin printing tableau % 27.81/3.89 # Found 6 steps % 27.81/3.89 cnf(i_0_32, hypothesis, (negate(add(negate(e),negate(add(d,negate(e)))))=d), inference(start_rule)). % 27.81/3.89 cnf(i_0_52, plain, (negate(add(negate(e),negate(add(d,negate(e)))))=d), inference(extension_rule, [i_0_49])). % 27.81/3.89 cnf(i_0_104, plain, (negate(add(negate(e),negate(add(d,negate(e)))))!=d), inference(closure_rule, [i_0_32])). % 27.81/3.89 cnf(i_0_103, plain, (multiply(negate(add(negate(e),negate(add(d,negate(e))))),negate(add(negate(e),negate(add(d,negate(e))))))=multiply(d,d)), inference(extension_rule, [i_0_42])). % 27.81/3.89 cnf(i_0_116, plain, (multiply(d,d)!=multiply(one,multiply(d,d))), inference(closure_rule, [i_0_26])). % 27.81/3.89 cnf(i_0_114, plain, (multiply(negate(add(negate(e),negate(add(d,negate(e))))),negate(add(negate(e),negate(add(d,negate(e))))))=multiply(one,multiply(d,d))), inference(etableau_closure_rule, [i_0_114, ...])). % 27.81/3.89 # End printing tableau % 27.81/3.89 # SZS output end % 27.81/3.89 # Branches closed with saturation will be marked with an "s" % 27.81/3.89 # Child (32106) has found a proof. % 27.81/3.89 % 27.81/3.89 # Proof search is over... % 27.81/3.89 # Freeing feature tree %------------------------------------------------------------------------------