TSTP Solution File: NUM020-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NUM020-1 : TPTP v8.1.0. Bugfixed v4.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:24:41 EDT 2022
% Result : Unsatisfiable 0.41s 0.73s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : NUM020-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.00/0.07 % Command : tptp2X_and_run_prover9 %d %s
% 0.06/0.25 % Computer : n006.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 600
% 0.06/0.25 % DateTime : Thu Jul 7 21:33:21 EDT 2022
% 0.06/0.25 % CPUTime :
% 0.41/0.73
% 0.41/0.73 WARNING: denials share constants (see output).
% 0.41/0.73
% 0.41/0.73 ============================== Prover9 ===============================
% 0.41/0.73 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.73 Process 22192 was started by sandbox on n006.cluster.edu,
% 0.41/0.73 Thu Jul 7 21:33:21 2022
% 0.41/0.73 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_22038_n006.cluster.edu".
% 0.41/0.73 ============================== end of head ===========================
% 0.41/0.73
% 0.41/0.73 ============================== INPUT =================================
% 0.41/0.73
% 0.41/0.73 % Reading from file /tmp/Prover9_22038_n006.cluster.edu
% 0.41/0.73
% 0.41/0.73 set(prolog_style_variables).
% 0.41/0.73 set(auto2).
% 0.41/0.73 % set(auto2) -> set(auto).
% 0.41/0.73 % set(auto) -> set(auto_inference).
% 0.41/0.73 % set(auto) -> set(auto_setup).
% 0.41/0.73 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.73 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.73 % set(auto) -> set(auto_limits).
% 0.41/0.73 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.73 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.73 % set(auto) -> set(auto_denials).
% 0.41/0.73 % set(auto) -> set(auto_process).
% 0.41/0.73 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.73 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.73 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.73 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.73 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.73 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.73 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.73 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.73 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.73 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.73 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.73 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.73 % set(auto2) -> assign(stats, some).
% 0.41/0.73 % set(auto2) -> clear(echo_input).
% 0.41/0.73 % set(auto2) -> set(quiet).
% 0.41/0.73 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.73 % set(auto2) -> clear(print_given).
% 0.41/0.73 assign(lrs_ticks,-1).
% 0.41/0.73 assign(sos_limit,10000).
% 0.41/0.73 assign(order,kbo).
% 0.41/0.73 set(lex_order_vars).
% 0.41/0.73 clear(print_given).
% 0.41/0.73
% 0.41/0.73 % formulas(sos). % not echoed (12 formulas)
% 0.41/0.73
% 0.41/0.73 ============================== end of input ==========================
% 0.41/0.73
% 0.41/0.73 % From the command line: assign(max_seconds, 300).
% 0.41/0.73
% 0.41/0.73 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.73
% 0.41/0.73 % Formulas that are not ordinary clauses:
% 0.41/0.73
% 0.41/0.73 ============================== end of process non-clausal formulas ===
% 0.41/0.73
% 0.41/0.73 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.73
% 0.41/0.73 ============================== PREDICATE ELIMINATION =================
% 0.41/0.73
% 0.41/0.73 ============================== end predicate elimination =============
% 0.41/0.73
% 0.41/0.73 Auto_denials:
% 0.41/0.73 % copying label prove_a_contradiction to answer in negative clause
% 0.41/0.73 % copying label deny_addition_lemma to answer in negative clause
% 0.41/0.73 % assign(max_proofs, 2). % (Horn set with more than one neg. clause)
% 0.41/0.73
% 0.41/0.73 WARNING, because some of the denials share constants,
% 0.41/0.73 some of the denials or their descendents may be subsumed,
% 0.41/0.73 preventing the target number of proofs from being found.
% 0.41/0.73 The shared constants are: n0.
% 0.41/0.73
% 0.41/0.73 Term ordering decisions:
% 0.41/0.73
% 0.41/0.73 % Assigning unary symbol successor kb_weight 0 and highest precedence (7).
% 0.41/0.73 Function symbol KB weights: n0=1. n1=1. a=1. add=1. multiply=1. successor=0.
% 0.41/0.73
% 0.41/0.73 ============================== end of process initial clauses ========
% 0.41/0.73
% 0.41/0.73 ============================== CLAUSES FOR SEARCH ====================
% 0.41/0.73
% 0.41/0.73 ============================== end of clauses for search =============
% 0.41/0.73
% 0.41/0.73 ============================== SEARCH ================================
% 0.41/0.73
% 0.41/0.73 % Starting search at 0.01 seconds.
% 0.41/0.73
% 0.41/0.73 ============================== PROOF =================================
% 0.41/0.73 % SZS status Unsatisfiable
% 0.41/0.73 % SZS output start Refutation
% 0.41/0.73
% 0.41/0.73 % Proof 1 at 0.01 (+ 0.00) seconds: deny_addition_lemma.
% 0.41/0.73 % Length of proof is 8.
% 0.41/0.73 % Level of proof is 2.
% 0.41/0.73 % Maximum clause weight is 9.000.
% 0.41/0.73 % Given clauses 12.
% 0.41/0.73
% 0.41/0.73 3 equalish(add(A,n0),A) # label(adding_zero) # label(axiom). [assumption].
% 0.41/0.73 5 equalish(add(A,successor(B)),successor(add(A,B))) # label(addition) # label(axiom). [assumption].
% 0.41/0.73 8 -equalish(add(a,successor(n0)),successor(a)) # label(deny_addition_lemma) # label(negated_conjecture) # answer(deny_addition_lemma). [assumption].
% 0.41/0.73 11 -equalish(A,B) | equalish(successor(A),successor(B)) # label(successor_substitution) # label(axiom). [assumption].
% 0.41/0.73 12 -equalisCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------