%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ROB016-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 : 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 0.19s 0.40s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : ROB016-1 : TPTP v8.1.0. Released v1.0.0. % 0.03/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 : n018.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 14:57:53 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___207_C18_F1_AE_CS_SP_PI_PS_S0S % 0.13/0.37 # and selection function SelectComplexG. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 11 Number of unprocessed: 11 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.19/0.37 # The folding up rule is enabled... % 0.19/0.37 # Local unification is enabled... % 0.19/0.37 # Any saturation attempts will use folding labels... % 0.19/0.37 # 11 beginning clauses after preprocessing and clausification % 0.19/0.37 # Creating start rules for all 1 conjectures. % 0.19/0.37 # There are 1 start rule candidates: % 0.19/0.37 # Found 8 unit axioms. % 0.19/0.37 # 1 start rule tableaux created. % 0.19/0.37 # 3 extension rule candidate clauses % 0.19/0.37 # 8 unit axiom clauses % 0.19/0.37 % 0.19/0.37 # Requested 8, 32 cores available to the main process. % 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.19/0.37 # Creating equality axioms % 0.19/0.37 # Ran out of tableaux, making start rules for all clauses % 0.19/0.37 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux. % 0.19/0.37 # We now have 15 tableaux to operate on % 0.19/0.40 # There were 1 total branch saturation attempts. % 0.19/0.40 # There were 0 of these attempts blocked. % 0.19/0.40 # There were 0 deferred branch saturation attempts. % 0.19/0.40 # There were 0 free duplicated saturations. % 0.19/0.40 # There were 1 total successful branch saturations. % 0.19/0.40 # There were 0 successful branch saturations in interreduction. % 0.19/0.40 # There were 0 successful branch saturations on the branch. % 0.19/0.40 # There were 1 successful branch saturations after the branch. % 0.19/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.40 # Begin clausification derivation % 0.19/0.40 % 0.19/0.40 # End clausification derivation % 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.40 cnf(i_0_20, plain, (positive_integer(k))). % 0.19/0.40 cnf(i_0_17, plain, (positive_integer(one))). % 0.19/0.40 cnf(i_0_15, plain, (multiply(one,X1)=X1)). % 0.19/0.40 cnf(i_0_13, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))). % 0.19/0.40 cnf(i_0_14, plain, (negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2)))))=X1)). % 0.19/0.40 cnf(i_0_19, hypothesis, (negate(add(e,d))=negate(e))). % 0.19/0.40 cnf(i_0_12, plain, (add(X1,X2)=add(X2,X1))). % 0.19/0.40 cnf(i_0_22, negated_conjecture, (negate(add(e,multiply(k,add(d,negate(add(d,negate(e)))))))!=negate(e))). % 0.19/0.40 cnf(i_0_18, plain, (positive_integer(successor(X1))|~positive_integer(X1))). % 0.19/0.40 cnf(i_0_16, plain, (multiply(successor(X1),X2)=add(X2,multiply(X1,X2))|~positive_integer(X2))). % 0.19/0.40 cnf(i_0_21, plain, (negate(add(X1,multiply(X2,add(X3,negate(add(X3,negate(X1)))))))=negate(X1)|negate(add(negate(X1),negate(add(X3,negate(X1)))))!=X3|~positive_integer(X2))). % 0.19/0.40 cnf(i_0_38, plain, (X4=X4)). % 0.19/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.40 # Begin printing tableau % 0.19/0.40 # Found 5 steps % 0.19/0.40 cnf(i_0_14, plain, (negate(add(negate(add(negate(e),X2)),negate(add(negate(e),negate(X2)))))=negate(e)), inference(start_rule)). % 0.19/0.40 cnf(i_0_51, plain, (negate(add(negate(add(negate(e),X2)),negate(add(negate(e),negate(X2)))))=negate(e)), inference(extension_rule, [i_0_41])). % 0.19/0.40 cnf(i_0_101, plain, (negate(add(e,multiply(k,add(d,negate(add(d,negate(e)))))))=negate(e)), inference(closure_rule, [i_0_22])). % 0.19/0.40 cnf(i_0_102, plain, (negate(add(e,multiply(k,add(d,negate(add(d,negate(e)))))))!=negate(add(negate(add(negate(e),X2)),negate(add(negate(e),negate(X2)))))), inference(extension_rule, [i_0_43])). % 0.19/0.40 cnf(i_0_119, plain, (add(negate(add(negate(e),X2)),negate(add(negate(e),negate(X2))))!=add(e,multiply(k,add(d,negate(add(d,negate(e))))))), inference(etableau_closure_rule, [i_0_119, ...])). % 0.19/0.40 # End printing tableau % 0.19/0.40 # SZS output end % 0.19/0.40 # Branches closed with saturation will be marked with an "s" % 0.19/0.40 # Child (6573) has found a proof. % 0.19/0.40 % 0.19/0.40 # Proof search is over... % 0.19/0.40 # Freeing feature tree %------------------------------------------------------------------------------