TSTP Solution File: RNG001-5 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : RNG001-5 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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 20:39:07 EDT 2022
% Result : Unsatisfiable 0.44s 0.93s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : RNG001-5 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon May 30 15:42:40 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.44/0.93 ============================== Prover9 ===============================
% 0.44/0.93 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.93 Process 14513 was started by sandbox on n019.cluster.edu,
% 0.44/0.93 Mon May 30 15:42:41 2022
% 0.44/0.93 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14140_n019.cluster.edu".
% 0.44/0.93 ============================== end of head ===========================
% 0.44/0.93
% 0.44/0.93 ============================== INPUT =================================
% 0.44/0.93
% 0.44/0.93 % Reading from file /tmp/Prover9_14140_n019.cluster.edu
% 0.44/0.93
% 0.44/0.93 set(prolog_style_variables).
% 0.44/0.93 set(auto2).
% 0.44/0.93 % set(auto2) -> set(auto).
% 0.44/0.93 % set(auto) -> set(auto_inference).
% 0.44/0.93 % set(auto) -> set(auto_setup).
% 0.44/0.93 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.93 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.93 % set(auto) -> set(auto_limits).
% 0.44/0.93 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.93 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.93 % set(auto) -> set(auto_denials).
% 0.44/0.93 % set(auto) -> set(auto_process).
% 0.44/0.93 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.93 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.93 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.93 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.93 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.93 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.93 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.93 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.93 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.93 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.93 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.93 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.93 % set(auto2) -> assign(stats, some).
% 0.44/0.93 % set(auto2) -> clear(echo_input).
% 0.44/0.93 % set(auto2) -> set(quiet).
% 0.44/0.93 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.93 % set(auto2) -> clear(print_given).
% 0.44/0.93 assign(lrs_ticks,-1).
% 0.44/0.93 assign(sos_limit,10000).
% 0.44/0.93 assign(order,kbo).
% 0.44/0.93 set(lex_order_vars).
% 0.44/0.93 clear(print_given).
% 0.44/0.93
% 0.44/0.93 % formulas(sos). % not echoed (30 formulas)
% 0.44/0.93
% 0.44/0.93 ============================== end of input ==========================
% 0.44/0.93
% 0.44/0.93 % From the command line: assign(max_seconds, 300).
% 0.44/0.93
% 0.44/0.93 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.93
% 0.44/0.93 % Formulas that are not ordinary clauses:
% 0.44/0.93
% 0.44/0.93 ============================== end of process non-clausal formulas ===
% 0.44/0.93
% 0.44/0.93 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.93
% 0.44/0.93 ============================== PREDICATE ELIMINATION =================
% 0.44/0.93
% 0.44/0.93 ============================== end predicate elimination =============
% 0.44/0.93
% 0.44/0.93 Auto_denials:
% 0.44/0.93 % copying label prove_multiplicative_identity_axiom to answer in negative clause
% 0.44/0.93
% 0.44/0.93 Term ordering decisions:
% 0.44/0.93
% 0.44/0.93 % Assigning unary symbol additive_inverse kb_weight 0 and highest precedence (8).
% 0.44/0.93 Function symbol KB weights: additive_identity=1. a=1. add=1. multiply=1. additive_inverse=0.
% 0.44/0.93
% 0.44/0.93 ============================== end of process initial clauses ========
% 0.44/0.93
% 0.44/0.93 ============================== CLAUSES FOR SEARCH ====================
% 0.44/0.93
% 0.44/0.93 ============================== end of clauses for search =============
% 0.44/0.93
% 0.44/0.93 ============================== SEARCH ================================
% 0.44/0.93
% 0.44/0.93 % Starting search at 0.01 seconds.
% 0.44/0.93
% 0.44/0.93 ============================== PROOF =================================
% 0.44/0.93 % SZS status Unsatisfiable
% 0.44/0.93 % SZS output start Refutation
% 0.44/0.93
% 0.44/0.93 % Proof 1 at 0.03 (+ 0.00) seconds: prove_multiplicative_identity_axiom.
% 0.44/0.93 % Length of proof is 14.
% 0.44/0.93 % Level of proof is 4.
% 0.44/0.93 % Maximum clause weight is 20.000.
% 0.44/0.93 % Given clauses 35.
% 0.44/0.93
% 0.44/0.93 2 sum(additive_identity,A,A) # label(additive_identity1) # label(axiom). [assumption].
% 0.44/0.93 3 sum(A,additive_identity,A) # label(additive_identity2) # label(axiom). [assumption].
% 0.44/0.93 5 sum(A,additive_inverse(A),additive_identity) # label(right_inverse) # label(axiom). [assumption].
% 0.44/0.93 6 product(A,B,multiply(A,B)) # label(closure_of_multiplication) # label(axiom). [assumption].
% 0.44/0.93 8 -product(a,additive_identity,additive_identity) # label(prove_multiplicative_identity_axiom) # label(negated_conjecture) # answer(prove_multiplicative_identity_axiom). [assumption].
% 0.44/0.93 20 -equalish(A,B) | -product(C,D,A) | product(C,D,B) # label(product_substitution3) # label(axiom). [assumption].
% 0.44/0.93 21 -sum(A,B,C) | -sum(A,B,D) | equalish(C,D) # label(addition_is_well_defined) # label(axiom). [assumption].
% 0.44/0.93 23 -sum(A,B,C) | -sum(B,D,E) | -sum(C,D,F) | sum(A,E,F) # label(associativity_of_addition1) # label(axiom). [assumption].
% 0.44/0.93 27 -product(A,B,C) | -product(A,D,E) | -sum(B,D,F) | -product(A,F,V6) | sum(C,E,V6) # label(distributivity1) # label(axiom). [assumption].
% 0.44/0.93 35 -equalish(multiply(a,additive_identity),additive_identity) # answer(prove_multiplicative_identity_axiom). [ur(20,b,6,a,c,8,a)].
% 0.44/0.93 123 sum(multiply(A,additive_identity),multiply(A,B),multiply(A,B)). [ur(27,a,6,a,b,6,a,c,2,a,d,6,a)].
% 0.44/0.93 239 -sum(multiply(a,additive_identity),additive_identity,additive_identity) # answer(prove_multiplicative_identity_axiom). [ur(21,a,3,a,c,35,a)].
% 0.44/0.93 281 -sum(multiply(a,additive_identity),A,A) # answer(prove_multiplicative_identity_axiom). [ur(23,b,5,a,c,5,a,d,239,a)].
% 0.44/0.93 282 $F # answer(prove_multiplicative_identity_axiom). [resolve(281,a,123,a)].
% 0.44/0.93
% 0.44/0.93 % SZS output end Refutation
% 0.44/0.93 ============================== end of proof ==========================
% 0.44/0.93
% 0.44/0.93 ============================== STATISTICS ============================
% 0.44/0.93
% 0.44/0.93 Given=35. Generated=617. Kept=281. proofs=1.
% 0.44/0.93 Usable=35. Sos=223. Demods=0. Limbo=15, Disabled=37. Hints=0.
% 0.44/0.93 Megabytes=0.20.
% 0.44/0.93 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.44/0.93
% 0.44/0.93 ============================== end of statistics =====================
% 0.44/0.93
% 0.44/0.93 ============================== end of search =========================
% 0.44/0.93
% 0.44/0.93 THEOREM PROVED
% 0.44/0.93 % SZS status Unsatisfiable
% 0.44/0.93
% 0.44/0.93 Exiting with 1 proof.
% 0.44/0.93
% 0.44/0.93 Process 14513 exit (max_proofs) Mon May 30 15:42:41 2022
% 0.44/0.93 Prover9 interrupted
%------------------------------------------------------------------------------