%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM925+1 : TPTP v8.1.0. Released v5.3.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 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 11:37:43 EDT 2022 % Result : Theorem 2.36s 0.66s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : NUM925+1 : TPTP v8.1.0. Released v5.3.0. % 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n029.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 : Tue Jul 5 06:58:27 EDT 2022 % 0.12/0.33 % CPUTime : % 2.36/0.66 % SZS status Theorem % 2.36/0.66 % SZS output begin IncompleteProof % 2.36/0.66 cnf(c0, axiom, % 2.36/0.66 pls = power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls))))). % 2.36/0.66 cnf(c1, plain, % 2.36/0.66 pls = power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls)))), % 2.36/0.66 inference(start, [], [c0])). % 2.36/0.66 % 2.36/0.66 cnf(c2, axiom, % 2.36/0.66 ord_less_int(pls,power_power_int(X0,number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls))))) | pls = X0). % 2.36/0.66 cnf(a0, assumption, % 2.36/0.66 power_power_int(X0,number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls)))) = power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls))))). % 2.36/0.66 cnf(a1, assumption, % 2.36/0.66 pls = X1). % 2.36/0.66 cnf(c3, plain, % 2.36/0.66 $false, % 2.36/0.66 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 2.36/0.66 cnf(c4, plain, % 2.36/0.66 pls = X0, % 2.36/0.66 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 2.36/0.66 cnf(c5, plain, % 2.36/0.66 ord_less_int(pls,X1), % 2.36/0.66 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 2.36/0.66 % 2.36/0.66 cnf(c6, axiom, % 2.36/0.66 ~ord_less_int(pls,pls)). % 2.36/0.66 cnf(a2, assumption, % 2.36/0.66 pls = pls). % 2.36/0.66 cnf(a3, assumption, % 2.36/0.66 X1 = pls). % 2.36/0.66 cnf(c7, plain, % 2.36/0.66 $false, % 2.36/0.66 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 2.36/0.66 cnf(c8, plain, % 2.36/0.66 $false, % 2.36/0.66 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 2.36/0.66 % 2.36/0.66 cnf(c9, axiom, % 2.36/0.66 ord_less_int(pls,plus_plus_int(one_one_int,semiri1621563631at_int(n)))). % 2.36/0.66 cnf(a4, assumption, % 2.36/0.66 plus_plus_int(one_one_int,semiri1621563631at_int(n)) = X0). % 2.36/0.66 cnf(a5, assumption, % 2.36/0.66 pls = X2). % 2.36/0.66 cnf(c10, plain, % 2.36/0.66 $false, % 2.36/0.66 inference(strict_subterm_extension, [assumptions([a4, a5])], [c4, c9])). % 2.36/0.66 cnf(c11, plain, % 2.36/0.66 $false, % 2.36/0.66 inference(strict_subterm_extension, [assumptions([a4, a5])], [c4, c9])). % 2.36/0.66 cnf(c12, plain, % 2.36/0.66 ord_less_int(pls,X2), % 2.36/0.66 inference(strict_subterm_extension, [assumptions([a4, a5])], [c4, c9])). % 2.36/0.66 % 2.36/0.66 cnf(c13, plain, % 2.36/0.66 ~ord_less_int(pls,X1)). % 2.36/0.66 cnf(a6, assumption, % 2.36/0.66 pls = pls). % 2.36/0.66 cnf(a7, assumption, % 2.36/0.66 X2 = X1). % 2.36/0.66 cnf(c14, plain, % 2.36/0.66 $false, % 2.36/0.66 inference(predicate_reduction, [assumptions([a6, a7])], [c12, c13])). % 2.36/0.66 % 2.36/0.66 cnf(c15, plain, % 2.36/0.66 $false, % 2.36/0.66 inference(constraint_solving, [ % 2.36/0.66 bind(X0, plus_plus_int(one_one_int,semiri1621563631at_int(n))), % 2.36/0.66 bind(X1, pls), % 2.36/0.66 bind(X2, pls) % 2.36/0.66 ], % 2.36/0.66 [a0, a1, a2, a3, a4, a5, a6, a7])). % 2.36/0.66 % 2.36/0.66 % SZS output end IncompleteProof %------------------------------------------------------------------------------