TSTP Solution File: NUM283-1.005 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NUM283-1.005 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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:25 EDT 2022
% Result : Unsatisfiable 0.97s 1.23s
% Output : Refutation 0.97s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM283-1.005 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n006.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 Jul 7 01:08:21 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.97/1.23 ============================== Prover9 ===============================
% 0.97/1.23 Prover9 (32) version 2009-11A, November 2009.
% 0.97/1.23 Process 14415 was started by sandbox on n006.cluster.edu,
% 0.97/1.23 Thu Jul 7 01:08:22 2022
% 0.97/1.23 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14262_n006.cluster.edu".
% 0.97/1.23 ============================== end of head ===========================
% 0.97/1.23
% 0.97/1.23 ============================== INPUT =================================
% 0.97/1.23
% 0.97/1.23 % Reading from file /tmp/Prover9_14262_n006.cluster.edu
% 0.97/1.23
% 0.97/1.23 set(prolog_style_variables).
% 0.97/1.23 set(auto2).
% 0.97/1.23 % set(auto2) -> set(auto).
% 0.97/1.23 % set(auto) -> set(auto_inference).
% 0.97/1.23 % set(auto) -> set(auto_setup).
% 0.97/1.23 % set(auto_setup) -> set(predicate_elim).
% 0.97/1.23 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.97/1.23 % set(auto) -> set(auto_limits).
% 0.97/1.23 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.97/1.23 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.97/1.23 % set(auto) -> set(auto_denials).
% 0.97/1.23 % set(auto) -> set(auto_process).
% 0.97/1.23 % set(auto2) -> assign(new_constants, 1).
% 0.97/1.23 % set(auto2) -> assign(fold_denial_max, 3).
% 0.97/1.23 % set(auto2) -> assign(max_weight, "200.000").
% 0.97/1.23 % set(auto2) -> assign(max_hours, 1).
% 0.97/1.23 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.97/1.23 % set(auto2) -> assign(max_seconds, 0).
% 0.97/1.23 % set(auto2) -> assign(max_minutes, 5).
% 0.97/1.23 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.97/1.23 % set(auto2) -> set(sort_initial_sos).
% 0.97/1.23 % set(auto2) -> assign(sos_limit, -1).
% 0.97/1.23 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.97/1.23 % set(auto2) -> assign(max_megs, 400).
% 0.97/1.23 % set(auto2) -> assign(stats, some).
% 0.97/1.23 % set(auto2) -> clear(echo_input).
% 0.97/1.23 % set(auto2) -> set(quiet).
% 0.97/1.23 % set(auto2) -> clear(print_initial_clauses).
% 0.97/1.23 % set(auto2) -> clear(print_given).
% 0.97/1.23 assign(lrs_ticks,-1).
% 0.97/1.23 assign(sos_limit,10000).
% 0.97/1.23 assign(order,kbo).
% 0.97/1.23 set(lex_order_vars).
% 0.97/1.23 clear(print_given).
% 0.97/1.23
% 0.97/1.23 % formulas(sos). % not echoed (7 formulas)
% 0.97/1.23
% 0.97/1.23 ============================== end of input ==========================
% 0.97/1.23
% 0.97/1.23 % From the command line: assign(max_seconds, 300).
% 0.97/1.23
% 0.97/1.23 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.97/1.23
% 0.97/1.23 % Formulas that are not ordinary clauses:
% 0.97/1.23
% 0.97/1.23 ============================== end of process non-clausal formulas ===
% 0.97/1.23
% 0.97/1.23 ============================== PROCESS INITIAL CLAUSES ===============
% 0.97/1.23
% 0.97/1.23 ============================== PREDICATE ELIMINATION =================
% 0.97/1.23
% 0.97/1.23 ============================== end predicate elimination =============
% 0.97/1.23
% 0.97/1.23 Auto_denials:
% 0.97/1.23 % copying label prove_factorial to answer in negative clause
% 0.97/1.23
% 0.97/1.23 Term ordering decisions:
% 0.97/1.23
% 0.97/1.23 % Assigning unary symbol s kb_weight 0 and highest precedence (5).
% 0.97/1.23 Function symbol KB weights: n0=1. s=0.
% 0.97/1.23
% 0.97/1.23 ============================== end of process initial clauses ========
% 0.97/1.23
% 0.97/1.23 ============================== CLAUSES FOR SEARCH ====================
% 0.97/1.23
% 0.97/1.23 ============================== end of clauses for search =============
% 0.97/1.23
% 0.97/1.23 ============================== SEARCH ================================
% 0.97/1.23
% 0.97/1.23 % Starting search at 0.01 seconds.
% 0.97/1.23
% 0.97/1.23 ============================== PROOF =================================
% 0.97/1.23 % SZS status Unsatisfiable
% 0.97/1.23 % SZS output start Refutation
% 0.97/1.23
% 0.97/1.23 % Proof 1 at 0.25 (+ 0.00) seconds: prove_factorial.
% 0.97/1.23 % Length of proof is 48.
% 0.97/1.23 % Level of proof is 26.
% 0.97/1.23 % Maximum clause weight is 78.000.
% 0.97/1.23 % Given clauses 355.
% 0.97/1.23
% 0.97/1.23 1 sum(A,n0,A) # label(add_0) # label(axiom). [assumption].
% 0.97/1.23 2 factorial(n0,s(n0)) # label(factorial_0) # label(axiom). [assumption].
% 0.97/1.23 3 product(s(n0),A,A) # label(times1) # label(axiom). [assumption].
% 0.97/1.23 4 -factorial(s(s(s(s(s(n0))))),A) # label(prove_factorial) # label(negated_conjecture) # answer(prove_factorial). [assumption].
% 0.97/1.23 5 -sum(A,B,C) | sum(A,s(B),s(C)) # label(add) # label(axiom). [assumption].
% 0.97/1.23 6 -factorial(A,B) | -product(s(A),B,C) | factorial(s(A),C) # label(factorial) # label(axiom). [assumption].
% 0.97/1.23 7 -sum(A,B,C) | -product(D,B,A) | product(s(D),B,C) # label(times) # label(axiom). [assumption].
% 0.97/1.23 8 sum(A,s(n0),s(A)). [ur(5,a,1,a)].
% 0.97/1.23 9 -factorial(s(s(s(s(n0)))),A) | -product(s(s(s(s(s(n0))))),A,B) # answer(prove_factorial). [resolve(6,c,4,a)].
% 0.97/1.23 10 factorial(s(n0),s(n0)). [ur(6,a,2,a,b,3,a)].
% 0.97/1.23 12 product(s(s(n0)),s(n0),s(s(n0))). [ur(7,a,8,a,b,3,a)].
% 0.97/1.23 13 sum(A,s(s(n0)),s(s(A))). [ur(5,a,8,a)].
% 0.97/1.23 15 -factorial(s(s(s(s(n0)))),A) | -sum(B,A,C) | -product(s(s(s(s(n0)))),A,B) # answer(prove_factorial). [resolve(9,b,7,c)].
% 0.97/1.23 20 -factorial(s(s(s(s(n0)))),A) | -sum(B,A,C) | -sum(D,A,B) | -product(s(s(s(n0))),A,D) # answer(prove_factorial). [resolve(15,c,7,c)].
% 0.97/1.23 28 product(s(s(n0)),s(s(n0)),s(s(s(s(n0))))). [ur(7,a,13,a,b,3,a)].
% 0.97/1.23 29 sum(A,s(s(s(n0))),s(s(s(A)))). [ur(5,a,13,a)].
% 0.97/1.23 31 factorial(s(s(n0)),s(s(n0))). [ur(6,a,10,a,b,12,a)].
% 0.97/1.23 49 sum(A,s(s(s(s(n0)))),s(s(s(s(A))))). [ur(5,a,29,a)].
% 0.97/1.23 65 product(s(s(s(n0))),s(s(n0)),s(s(s(s(s(s(n0))))))). [ur(7,a,13,a,b,28,a)].
% 0.97/1.23 79 sum(A,s(s(s(s(s(n0))))),s(s(s(s(s(A)))))). [ur(5,a,49,a)].
% 0.97/1.23 98 sum(A,s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(A))))))). [ur(5,a,79,a)].
% 0.97/1.23 103 factorial(s(s(s(n0))),s(s(s(s(s(s(n0))))))). [ur(6,a,31,a,b,65,a)].
% 0.97/1.23 114 -factorial(s(s(s(s(n0)))),A) | -sum(B,A,C) | -sum(D,A,B) | -sum(E,A,D) | -product(s(s(n0)),A,E) # answer(prove_factorial). [resolve(20,d,7,c)].
% 0.97/1.23 130 product(s(s(n0)),s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))). [ur(7,a,98,a,b,3,a)].
% 0.97/1.23 131 sum(A,s(s(s(s(s(s(s(n0))))))),s(s(s(s(s(s(s(A)))))))). [ur(5,a,98,a)].
% 0.97/1.23 169 sum(A,s(s(s(s(s(s(s(s(n0)))))))),s(s(s(s(s(s(s(s(A))))))))). [ur(5,a,131,a)].
% 0.97/1.23 206 sum(A,s(s(s(s(s(s(s(s(s(n0))))))))),s(s(s(s(s(s(s(s(s(A)))))))))). [ur(5,a,169,a)].
% 0.97/1.23 251 sum(A,s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(s(s(s(s(s(s(s(A))))))))))). [ur(5,a,206,a)].
% 0.97/1.23 286 product(s(s(s(n0))),s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))))))). [ur(7,a,98,a,b,130,a)].
% 0.97/1.23 325 sum(A,s(s(s(s(s(s(s(s(s(s(s(n0))))))))))),s(s(s(s(s(s(s(s(s(s(s(A)))))))))))). [ur(5,a,251,a)].
% 0.97/1.23 381 sum(A,s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(A))))))))))))). [ur(5,a,325,a)].
% 0.97/1.23 485 sum(A,s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(A)))))))))))))). [ur(5,a,381,a)].
% 0.97/1.23 525 sum(A,s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(A))))))))))))))). [ur(5,a,485,a)].
% 0.97/1.23 540 product(s(s(s(s(n0)))),s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))))))))))))). [ur(7,a,98,a,b,286,a)].
% 0.97/1.23 581 sum(A,s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(A)))))))))))))))). [ur(5,a,525,a)].
% 0.97/1.23 702 sum(A,s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(A))))))))))))))))). [ur(5,a,581,a)].
% 0.97/1.23 763 sum(A,s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(A)))))))))))))))))). [ur(5,a,702,a)].
% 0.97/1.23 781 factorial(s(s(s(s(n0)))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))))))))))))). [ur(6,a,103,a,b,540,a)].
% 0.97/1.23 846 sum(A,s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(A))))))))))))))))))). [ur(5,a,763,a)].
% 0.97/1.23 992 sum(A,s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(A)))))))))))))))))))). [ur(5,a,846,a)].
% 0.97/1.23 1044 sum(A,s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(A))))))))))))))))))))). [ur(5,a,992,a)].
% 0.97/1.23 1179 sum(A,s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(A)))))))))))))))))))))). [ur(5,a,1044,a)].
% 0.97/1.23 1314 sum(A,s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(A))))))))))))))))))))))). [ur(5,a,1179,a)].
% 0.97/1.23 1423 sum(A,s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(A)))))))))))))))))))))))). [ur(5,a,1314,a)].
% 0.97/1.23 1471 sum(A,s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(A))))))))))))))))))))))))). [ur(5,a,1423,a)].
% 0.97/1.23 1582 product(s(s(n0)),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))))))))),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))))))))))))))))))))))))))))))))))))). [ur(7,a,1471,a,b,3,a)].
% 0.97/1.23 1584 -product(s(s(n0)),s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))))))))))),A) # answer(prove_factorial). [ur(114,a,781,a,b,1471,a,c,1471,a,d,1471,a)].
% 0.97/1.23 1585 $F # answer(prove_factorial). [resolve(1584,a,1582,a)].
% 0.97/1.23
% 0.97/1.23 % SZS output end Refutation
% 0.97/1.23 ============================== end of proof ==========================
% 0.97/1.23
% 0.97/1.23 ============================== STATISTICS ============================
% 0.97/1.23
% 0.97/1.23 Given=355. Generated=2589. Kept=1584. proofs=1.
% 0.97/1.23 Usable=344. Sos=991. Demods=0. Limbo=26, Disabled=229. Hints=0.
% 0.97/1.23 Megabytes=2.61.
% 0.97/1.23 User_CPU=0.25, System_CPU=0.00, Wall_clock=0.
% 0.97/1.23
% 0.97/1.23 ============================== end of statistics =====================
% 0.97/1.23
% 0.97/1.23 ============================== end of search =========================
% 0.97/1.23
% 0.97/1.23 THEOREM PROVED
% 0.97/1.23 % SZS status Unsatisfiable
% 0.97/1.23
% 0.97/1.23 Exiting with 1 proof.
% 0.97/1.23
% 0.97/1.23 Process 14415 exit (max_proofs) Thu Jul 7 01:08:22 2022
% 0.97/1.23 Prover9 interrupted
%------------------------------------------------------------------------------