TSTP Solution File: NUM024-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NUM024-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:43 EDT 2022
% Result : Unsatisfiable 0.77s 1.04s
% Output : Refutation 0.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM024-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n020.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 : Wed Jul 6 08:19:59 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.77/1.04 ============================== Prover9 ===============================
% 0.77/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.77/1.04 Process 23739 was started by sandbox on n020.cluster.edu,
% 0.77/1.04 Wed Jul 6 08:20:00 2022
% 0.77/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_23585_n020.cluster.edu".
% 0.77/1.04 ============================== end of head ===========================
% 0.77/1.04
% 0.77/1.04 ============================== INPUT =================================
% 0.77/1.04
% 0.77/1.04 % Reading from file /tmp/Prover9_23585_n020.cluster.edu
% 0.77/1.04
% 0.77/1.04 set(prolog_style_variables).
% 0.77/1.04 set(auto2).
% 0.77/1.04 % set(auto2) -> set(auto).
% 0.77/1.04 % set(auto) -> set(auto_inference).
% 0.77/1.04 % set(auto) -> set(auto_setup).
% 0.77/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.77/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.77/1.04 % set(auto) -> set(auto_limits).
% 0.77/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.77/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.77/1.04 % set(auto) -> set(auto_denials).
% 0.77/1.04 % set(auto) -> set(auto_process).
% 0.77/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.77/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.77/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.77/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.77/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.77/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.77/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.77/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.77/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.77/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.77/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.77/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.77/1.04 % set(auto2) -> assign(stats, some).
% 0.77/1.04 % set(auto2) -> clear(echo_input).
% 0.77/1.04 % set(auto2) -> set(quiet).
% 0.77/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.77/1.04 % set(auto2) -> clear(print_given).
% 0.77/1.04 assign(lrs_ticks,-1).
% 0.77/1.04 assign(sos_limit,10000).
% 0.77/1.04 assign(order,kbo).
% 0.77/1.04 set(lex_order_vars).
% 0.77/1.04 clear(print_given).
% 0.77/1.04
% 0.77/1.04 % formulas(sos). % not echoed (16 formulas)
% 0.77/1.04
% 0.77/1.04 ============================== end of input ==========================
% 0.77/1.04
% 0.77/1.04 % From the command line: assign(max_seconds, 300).
% 0.77/1.04
% 0.77/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.77/1.04
% 0.77/1.04 % Formulas that are not ordinary clauses:
% 0.77/1.04
% 0.77/1.04 ============================== end of process non-clausal formulas ===
% 0.77/1.04
% 0.77/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.77/1.04
% 0.77/1.04 ============================== PREDICATE ELIMINATION =================
% 0.77/1.04
% 0.77/1.04 ============================== end predicate elimination =============
% 0.77/1.04
% 0.77/1.04 Auto_denials:
% 0.77/1.04 % copying label prove_a_contradiction to answer in negative clause
% 0.77/1.04
% 0.77/1.04 Term ordering decisions:
% 0.77/1.04
% 0.77/1.04 % Assigning unary symbol successor kb_weight 0 and highest precedence (8).
% 0.77/1.04 Function symbol KB weights: n0=1. a=1. add=1. multiply=1. predecessor_of_1st_minus_2nd=1. successor=0.
% 0.77/1.04
% 0.77/1.04 ============================== end of process initial clauses ========
% 0.77/1.04
% 0.77/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.77/1.04
% 0.77/1.04 ============================== end of clauses for search =============
% 0.77/1.04
% 0.77/1.04 ============================== SEARCH ================================
% 0.77/1.04
% 0.77/1.04 % Starting search at 0.01 seconds.
% 0.77/1.04
% 0.77/1.04 ============================== PROOF =================================
% 0.77/1.04 % SZS status Unsatisfiable
% 0.77/1.04 % SZS output start Refutation
% 0.77/1.04
% 0.77/1.04 % Proof 1 at 0.03 (+ 0.00) seconds: prove_a_contradiction.
% 0.77/1.04 % Length of proof is 14.
% 0.77/1.04 % Level of proof is 4.
% 0.77/1.04 % Maximum clause weight is 11.000.
% 0.77/1.04 % Given clauses 73.
% 0.77/1.04
% 0.77/1.04 2 less(a,a) # label(impossible_a_is_less_than_itself) # label(hypothesis). [assumption].
% 0.77/1.04 3 equalish(add(A,n0),A) # label(adding_zero) # label(axiom). [assumption].
% 0.77/1.04 5 equalish(add(A,B),add(B,A)) # label(commutativity_of_plus) # label(axiom). [assumption].
% 0.77/1.04 8 -equalish(successor(A),n0) # label(prove_a_contradiction) # label(negated_conjecture) # answer(prove_a_contradiction). [assumption].
% 0.77/1.04 9 -equalish(A,B) | equalish(B,A) # label(symmetry) # label(axiom). [assumption].
% 0.77/1.04 14 -equalish(A,B) | -equalish(B,C) | equalish(A,C) # label(transitivity) # label(axiom). [assumption].
% 0.77/1.04 15 -equalish(add(A,B),add(C,B)) | equalish(A,C) # label(plus_substitution) # label(axiom). [assumption].
% 0.77/1.04 16 -less(A,B) | equalish(add(successor(predecessor_of_1st_minus_2nd(B,A)),A),B) # label(less_lemma) # label(axiom). [assumption].
% 0.77/1.04 21 equalish(A,add(A,n0)). [ur(9,a,3,a)].
% 0.77/1.04 45 -equalish(add(successor(A),B),add(n0,B)) # answer(prove_a_contradiction). [resolve(15,b,8,a)].
% 0.77/1.04 46 equalish(add(successor(predecessor_of_1st_minus_2nd(a,a)),a),a). [ur(16,a,2,a)].
% 0.77/1.04 80 equalish(A,add(n0,A)). [ur(14,a,21,a,b,5,a)].
% 0.77/1.04 561 -equalish(add(successor(A),B),B) # answer(prove_a_contradiction). [ur(14,b,80,a,c,45,a)].
% 0.77/1.04 562 $F # answer(prove_a_contradiction). [resolve(561,a,46,a)].
% 0.77/1.04
% 0.77/1.04 % SZS output end Refutation
% 0.77/1.04 ============================== end of proof ==========================
% 0.77/1.04
% 0.77/1.04 ============================== STATISTICS ============================
% 0.77/1.04
% 0.77/1.04 Given=73. Generated=1282. Kept=561. proofs=1.
% 0.77/1.04 Usable=67. Sos=458. Demods=0. Limbo=7, Disabled=44. Hints=0.
% 0.77/1.04 Megabytes=0.41.
% 0.77/1.04 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.77/1.04
% 0.77/1.04 ============================== end of statistics =====================
% 0.77/1.04
% 0.77/1.04 ============================== end of search =========================
% 0.77/1.04
% 0.77/1.04 THEOREM PROVED
% 0.77/1.04 % SZS status Unsatisfiable
% 0.77/1.04
% 0.77/1.04 Exiting with 1 proof.
% 0.77/1.04
% 0.77/1.04 Process 23739 exit (max_proofs) Wed Jul 6 08:20:00 2022
% 0.77/1.04 Prover9 interrupted
%------------------------------------------------------------------------------