%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ROB015-2 : 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 : n018.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:05 EDT 2022 % Result : Unsatisfiable 11.23s 11.44s % Output : CNFRefutation 11.23s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : ROB015-2 : TPTP v8.1.0. Released v1.0.0. % 0.04/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.34 % Computer : n018.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Thu Jun 9 16:01:53 EDT 2022 % 0.14/0.34 % CPUTime : % 0.21/0.37 # No SInE strategy applied % 0.21/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_PS_S0S % 0.21/0.37 # and selection function SelectComplexG. % 0.21/0.37 # % 0.21/0.37 # Presaturation interreduction done % 0.21/0.37 # Number of axioms: 13 Number of unprocessed: 13 % 0.21/0.37 # Tableaux proof search. % 0.21/0.37 # APR header successfully linked. % 0.21/0.37 # Hello from C++ % 7.59/7.74 # The folding up rule is enabled... % 7.59/7.74 # Local unification is enabled... % 7.59/7.74 # Any saturation attempts will use folding labels... % 7.59/7.74 # 13 beginning clauses after preprocessing and clausification % 7.59/7.74 # Creating start rules for all 1 conjectures. % 7.59/7.74 # There are 1 start rule candidates: % 7.59/7.74 # Found 9 unit axioms. % 7.59/7.74 # 1 start rule tableaux created. % 7.59/7.74 # 4 extension rule candidate clauses % 7.59/7.74 # 9 unit axiom clauses % 7.59/7.74 % 7.59/7.74 # Requested 8, 32 cores available to the main process. % 7.59/7.74 # There are not enough tableaux to fork, creating more from the initial 1 % 11.14/11.34 # Creating equality axioms % 11.14/11.34 # Ran out of tableaux, making start rules for all clauses % 11.14/11.34 # Returning from population with 17 new_tableaux and 0 remaining starting tableaux. % 11.14/11.34 # We now have 17 tableaux to operate on % 11.23/11.44 # There were 3 total branch saturation attempts. % 11.23/11.44 # There were 0 of these attempts blocked. % 11.23/11.44 # There were 0 deferred branch saturation attempts. % 11.23/11.44 # There were 0 free duplicated saturations. % 11.23/11.44 # There were 1 total successful branch saturations. % 11.23/11.44 # There were 0 successful branch saturations in interreduction. % 11.23/11.44 # There were 0 successful branch saturations on the branch. % 11.23/11.44 # There were 1 successful branch saturations after the branch. % 11.23/11.44 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 11.23/11.44 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 11.23/11.44 # Begin clausification derivation % 11.23/11.44 % 11.23/11.44 # End clausification derivation % 11.23/11.44 # Begin listing active clauses obtained from FOF to CNF conversion % 11.23/11.44 cnf(i_0_24, plain, (positive_integer(k))). % 11.23/11.44 cnf(i_0_23, hypothesis, (negate(add(negate(e),negate(add(d,negate(e)))))=d)). % 11.23/11.44 cnf(i_0_19, plain, (positive_integer(one))). % 11.23/11.44 cnf(i_0_17, plain, (multiply(one,X1)=X1)). % 11.23/11.44 cnf(i_0_15, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))). % 11.23/11.44 cnf(i_0_16, plain, (negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2)))))=X1)). % 11.23/11.44 cnf(i_0_14, plain, (add(X1,X2)=add(X2,X1))). % 11.23/11.44 cnf(i_0_25, plain, (negate(add(e,multiply(k,add(d,negate(add(d,negate(e)))))))!=negate(e))). % 11.23/11.44 cnf(i_0_26, negated_conjecture, (negate(add(e,multiply(successor(k),add(d,negate(add(d,negate(e)))))))!=negate(e))). % 11.23/11.44 cnf(i_0_20, plain, (positive_integer(successor(X1))|~positive_integer(X1))). % 11.23/11.44 cnf(i_0_21, plain, (X1=X2|negate(add(X1,negate(add(X2,X3))))!=negate(add(X2,negate(add(X1,X3)))))). % 11.23/11.44 cnf(i_0_18, plain, (multiply(successor(X1),X2)=add(X2,multiply(X1,X2))|~positive_integer(X2))). % 11.23/11.44 cnf(i_0_22, plain, (negate(add(X1,negate(add(X2,multiply(X3,add(X1,X4))))))=X4|negate(add(X1,negate(X2)))!=X4|~positive_integer(X3))). % 11.23/11.44 cnf(i_0_454840, plain, (X5=X5)). % 11.23/11.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 11.23/11.44 # Begin printing tableau % 11.23/11.44 # Found 6 steps % 11.23/11.44 cnf(i_0_17, plain, (multiply(one,negate(add(X5,negate(X6))))=negate(add(X5,negate(X6)))), inference(start_rule)). % 11.23/11.44 cnf(i_0_454852, plain, (multiply(one,negate(add(X5,negate(X6))))=negate(add(X5,negate(X6)))), inference(extension_rule, [i_0_22])). % 11.23/11.44 cnf(i_0_454905, plain, (~positive_integer(k)), inference(closure_rule, [i_0_24])). % 11.23/11.44 cnf(i_0_454903, plain, (negate(add(X5,negate(add(X6,multiply(k,add(X5,multiply(one,negate(add(X5,negate(X6))))))))))=multiply(one,negate(add(X5,negate(X6))))), inference(extension_rule, [i_0_454843])). % 11.23/11.44 cnf(i_0_454918, plain, (multiply(one,negate(add(X5,negate(X6))))!=negate(add(X5,negate(X6)))), inference(closure_rule, [i_0_17])). % 11.23/11.44 cnf(i_0_454916, plain, (negate(add(X5,negate(add(X6,multiply(k,add(X5,multiply(one,negate(add(X5,negate(X6))))))))))=negate(add(X5,negate(X6)))), inference(etableau_closure_rule, [i_0_454916, ...])). % 11.23/11.44 # End printing tableau % 11.23/11.44 # SZS output end % 11.23/11.44 # Branches closed with saturation will be marked with an "s" % 11.23/11.46 # Child (14322) has found a proof. % 11.23/11.46 % 11.23/11.46 # Proof search is over... % 11.23/11.46 # Freeing feature tree %------------------------------------------------------------------------------