TSTP Solution File: NUM361+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NUM361+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n004.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 13:26:55 EDT 2022
% Result : Timeout 300.05s 300.34s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM361+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.32 % Computer : n004.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 600
% 0.13/0.32 % DateTime : Wed Jul 6 23:46:07 EDT 2022
% 0.17/0.32 % CPUTime :
% 0.81/1.09 ============================== Prover9 ===============================
% 0.81/1.09 Prover9 (32) version 2009-11A, November 2009.
% 0.81/1.09 Process 32603 was started by sandbox on n004.cluster.edu,
% 0.81/1.09 Wed Jul 6 23:46:08 2022
% 0.81/1.09 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_32450_n004.cluster.edu".
% 0.81/1.09 ============================== end of head ===========================
% 0.81/1.09
% 0.81/1.09 ============================== INPUT =================================
% 0.81/1.09
% 0.81/1.09 % Reading from file /tmp/Prover9_32450_n004.cluster.edu
% 0.81/1.09
% 0.81/1.09 set(prolog_style_variables).
% 0.81/1.09 set(auto2).
% 0.81/1.09 % set(auto2) -> set(auto).
% 0.81/1.09 % set(auto) -> set(auto_inference).
% 0.81/1.09 % set(auto) -> set(auto_setup).
% 0.81/1.09 % set(auto_setup) -> set(predicate_elim).
% 0.81/1.09 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.81/1.09 % set(auto) -> set(auto_limits).
% 0.81/1.09 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.81/1.09 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.81/1.09 % set(auto) -> set(auto_denials).
% 0.81/1.09 % set(auto) -> set(auto_process).
% 0.81/1.09 % set(auto2) -> assign(new_constants, 1).
% 0.81/1.09 % set(auto2) -> assign(fold_denial_max, 3).
% 0.81/1.09 % set(auto2) -> assign(max_weight, "200.000").
% 0.81/1.09 % set(auto2) -> assign(max_hours, 1).
% 0.81/1.09 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.81/1.09 % set(auto2) -> assign(max_seconds, 0).
% 0.81/1.09 % set(auto2) -> assign(max_minutes, 5).
% 0.81/1.09 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.81/1.09 % set(auto2) -> set(sort_initial_sos).
% 0.81/1.09 % set(auto2) -> assign(sos_limit, -1).
% 0.81/1.09 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.81/1.09 % set(auto2) -> assign(max_megs, 400).
% 0.81/1.09 % set(auto2) -> assign(stats, some).
% 0.81/1.09 % set(auto2) -> clear(echo_input).
% 0.81/1.09 % set(auto2) -> set(quiet).
% 0.81/1.09 % set(auto2) -> clear(print_initial_clauses).
% 0.81/1.09 % set(auto2) -> clear(print_given).
% 0.81/1.09 assign(lrs_ticks,-1).
% 0.81/1.09 assign(sos_limit,10000).
% 0.81/1.09 assign(order,kbo).
% 0.81/1.09 set(lex_order_vars).
% 0.81/1.09 clear(print_given).
% 0.81/1.09
% 0.81/1.09 % formulas(sos). % not echoed (402 formulas)
% 0.81/1.09
% 0.81/1.09 ============================== end of input ==========================
% 0.81/1.09
% 0.81/1.09 % From the command line: assign(max_seconds, 300).
% 0.81/1.09
% 0.81/1.09 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.81/1.09
% 0.81/1.09 % Formulas that are not ordinary clauses:
% 0.81/1.09 1 (all X all Y all Z (rdn_positive_less(rdnn(X),rdnn(Y)) & rdn_positive_less(rdnn(Y),rdnn(Z)) -> rdn_positive_less(rdnn(X),rdnn(Z)))) # label(rdn_positive_less_transitivity) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 2 (all Ds all Os all Db all Ob (rdn_positive_less(Os,Ob) -> rdn_positive_less(rdn(rdnn(Ds),Os),rdn(rdnn(Db),Ob)))) # label(rdn_positive_less_multi_digit_high) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 3 (all Ds all O all Db (rdn_positive_less(rdnn(Ds),rdnn(Db)) & rdn_non_zero(O) -> rdn_positive_less(rdn(rdnn(Ds),O),rdn(rdnn(Db),O)))) # label(rdn_positive_less_multi_digit_low) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 4 (all D all Db all Ob (rdn_non_zero(Ob) -> rdn_positive_less(rdnn(D),rdn(rdnn(Db),Ob)))) # label(rdn_extra_digits_positive_less) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 5 (all X (rdn_non_zero_digit(rdnn(X)) -> rdn_non_zero(rdnn(X)))) # label(rdn_non_zero_by_digit) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 6 (all D all O (rdn_non_zero(O) -> rdn_non_zero(rdn(rdnn(D),O)))) # label(rdn_non_zero_by_structure) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 7 (all X all Y all RDN_X all RDN_Y (rdn_translate(X,rdn_pos(RDN_X)) & rdn_translate(Y,rdn_pos(RDN_Y)) & rdn_positive_less(RDN_X,RDN_Y) -> less(X,Y))) # label(less_entry_point_pos_pos) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 8 (all X all Y all RDN_X all RDN_Y (rdn_translate(X,rdn_neg(RDN_X)) & rdn_translate(Y,rdn_pos(RDN_Y)) -> less(X,Y))) # label(less_entry_point_neg_pos) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 9 (all X all Y all RDN_X all RDN_Y (rdn_translate(X,rdn_neg(RDN_X)) & rdn_translate(Y,rdn_neg(RDN_Y)) & rdn_positive_less(RDN_Y,RDN_X) -> less(X,Y))) # label(less_entry_point_neg_neg) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 10 (all X all Y (less(X,Y) <-> -less(Y,X) & Y != X)) # label(less_property) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 11 (all X all Y (less_or_equal(X,Y) <-> less(X,Y) | X = Y)) # label(less_or_equal) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 12 (all X all Y all Z (sum(X,n1,Y) & less(Z,Y) -> less_or_equal(Z,X))) # label(less_successor) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 13 (all X all Y all Z all RDN_X all RDN_Y all RDN_Z (rdn_translate(X,rdn_pos(RDN_X)) & rdn_translate(Y,rdn_pos(RDN_Y)) & rdn_add_with_carry(rdnn(n0),RDN_X,RDN_Y,RDN_Z) & rdn_translate(Z,rdn_pos(RDN_Z)) -> sum(X,Y,Z))) # label(sum_entry_point_pos_pos) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 14 (all X all Y all Z all RDN_X all RDN_Y all RDN_Z (rdn_translate(X,rdn_neg(RDN_X)) & rdn_translate(Y,rdn_neg(RDN_Y)) & rdn_add_with_carry(rdnn(n0),RDN_X,RDN_Y,RDN_Z) & rdn_translate(Z,rdn_neg(RDN_Z)) -> sum(X,Y,Z))) # label(sum_entry_point_neg_neg) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 15 (all X all Y all Z all RDN_X all RDN_Y all RDN_Z (rdn_translate(X,rdn_pos(RDN_X)) & rdn_translate(Y,rdn_neg(RDN_Y)) & rdn_positive_less(RDN_X,RDN_Y) & rdn_add_with_carry(rdnn(n0),RDN_X,RDN_Z,RDN_Y) & rdn_translate(Z,rdn_neg(RDN_Z)) -> sum(X,Y,Z))) # label(sum_entry_point_pos_neg_1) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 16 (all X all Y all Z all RDN_X all RDN_Y all RDN_Z (rdn_translate(X,rdn_pos(RDN_X)) & rdn_translate(Y,rdn_neg(RDN_Y)) & rdn_positive_less(RDN_Y,RDN_X) & rdn_add_with_carry(rdnn(n0),RDN_Y,RDN_Z,RDN_X) & rdn_translate(Z,rdn_pos(RDN_Z)) -> sum(X,Y,Z))) # label(sum_entry_point_pos_neg_2) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 17 (all POS_X all NEG_X all RDN_X (rdn_translate(POS_X,rdn_pos(RDN_X)) & rdn_translate(NEG_X,rdn_neg(RDN_X)) -> sum(POS_X,NEG_X,n0))) # label(sum_entry_point_posx_negx) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 18 (all X all Y all Z all RDN_X all RDN_Y (rdn_translate(X,rdn_neg(RDN_X)) & rdn_translate(Y,rdn_pos(RDN_Y)) & sum(Y,X,Z) -> sum(X,Y,Z))) # label(sum_entry_point_neg_pos) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 19 (all X all Y all Z1 all Z2 (sum(X,Y,Z1) & sum(X,Y,Z2) -> Z1 = Z2)) # label(unique_sum) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 20 (all X1 all X2 all Y all Z (sum(X1,Y,Z) & sum(X2,Y,Z) -> X1 = X2)) # label(unique_LHS) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 21 (all X all Y1 all Y2 all Z (sum(X,Y1,Z) & sum(X,Y2,Z) -> Y1 = Y2)) # label(unique_RHS) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 22 (all X all Y all Z (sum(Y,Z,X) <-> difference(X,Y,Z))) # label(minus_entry_point) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 23 (all C all D1 all D2 all RD all ID (rdn_digit_add(rdnn(D1),rdnn(D2),rdnn(ID),rdnn(n0)) & rdn_digit_add(rdnn(ID),rdnn(C),rdnn(RD),rdnn(n0)) -> rdn_add_with_carry(rdnn(C),rdnn(D1),rdnn(D2),rdnn(RD)))) # label(add_digit_digit_digit) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 24 (all C all D1 all D2 all ID all RD all IC1 all IC2 (rdn_digit_add(rdnn(D1),rdnn(D2),rdnn(ID),rdnn(IC1)) & rdn_digit_add(rdnn(ID),rdnn(C),rdnn(RD),rdnn(IC2)) & rdn_digit_add(rdnn(IC1),rdnn(IC2),rdnn(n1),rdnn(n0)) -> rdn_add_with_carry(rdnn(C),rdnn(D1),rdnn(D2),rdn(rdnn(RD),rdnn(n1))))) # label(add_digit_digit_rdn) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 25 (all C all D1 all D2 all O2 all RD all RO all ID all IC1 all IC2 all NC (rdn_digit_add(rdnn(D1),rdnn(D2),rdnn(ID),rdnn(IC1)) & rdn_digit_add(rdnn(ID),rdnn(C),rdnn(RD),rdnn(IC2)) & rdn_digit_add(rdnn(IC1),rdnn(IC2),rdnn(NC),rdnn(n0)) & rdn_add_with_carry(rdnn(NC),rdnn(n0),O2,RO) & rdn_non_zero(O2) & rdn_non_zero(RO) -> rdn_add_with_carry(rdnn(C),rdnn(D1),rdn(rdnn(D2),O2),rdn(rdnn(RD),RO)))) # label(add_digit_rdn_rdn) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.09 26 (all C all D1 all O1 all D2 all O2 all RD all RO all ID all IC1 all IC2 all RC (rdn_digit_add(rdnn(D1),rdnn(D2),rdnn(ID),rdnn(IC1)) & rdn_digit_add(rdnn(ID),rdnn(C),rdnn(RD),rdnn(IC2)) & rdn_digit_add(rdnn(IC1),rdnn(IC2),rdnn(RC),rdnn(n0)) & rdn_add_with_carry(rdnn(RC),O1,O2,RO) & rdn_non_zero(O1) & rdn_non_zero(O2) & rdn_non_zero(RO) -> rdn_add_with_carry(rdnn(C),rdn(rdnn(D1),O1),rdn(rdnn(D2),O2),rdn(rdnn(RD),RO)))) # laCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------