TSTP Solution File: RNG041-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : RNG041-1 : TPTP v8.1.0. Released v1.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 20:39:16 EDT 2022
% Result : Unsatisfiable 0.72s 1.18s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : RNG041-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon May 30 04:42:54 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.72/1.18 ============================== Prover9 ===============================
% 0.72/1.18 Prover9 (32) version 2009-11A, November 2009.
% 0.72/1.18 Process 1646 was started by sandbox2 on n020.cluster.edu,
% 0.72/1.18 Mon May 30 04:42:54 2022
% 0.72/1.18 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_1490_n020.cluster.edu".
% 0.72/1.18 ============================== end of head ===========================
% 0.72/1.18
% 0.72/1.18 ============================== INPUT =================================
% 0.72/1.18
% 0.72/1.18 % Reading from file /tmp/Prover9_1490_n020.cluster.edu
% 0.72/1.18
% 0.72/1.18 set(prolog_style_variables).
% 0.72/1.18 set(auto2).
% 0.72/1.18 % set(auto2) -> set(auto).
% 0.72/1.18 % set(auto) -> set(auto_inference).
% 0.72/1.18 % set(auto) -> set(auto_setup).
% 0.72/1.18 % set(auto_setup) -> set(predicate_elim).
% 0.72/1.18 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/1.18 % set(auto) -> set(auto_limits).
% 0.72/1.18 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/1.18 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/1.18 % set(auto) -> set(auto_denials).
% 0.72/1.18 % set(auto) -> set(auto_process).
% 0.72/1.18 % set(auto2) -> assign(new_constants, 1).
% 0.72/1.18 % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/1.18 % set(auto2) -> assign(max_weight, "200.000").
% 0.72/1.18 % set(auto2) -> assign(max_hours, 1).
% 0.72/1.18 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/1.18 % set(auto2) -> assign(max_seconds, 0).
% 0.72/1.18 % set(auto2) -> assign(max_minutes, 5).
% 0.72/1.18 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/1.18 % set(auto2) -> set(sort_initial_sos).
% 0.72/1.18 % set(auto2) -> assign(sos_limit, -1).
% 0.72/1.18 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/1.18 % set(auto2) -> assign(max_megs, 400).
% 0.72/1.18 % set(auto2) -> assign(stats, some).
% 0.72/1.18 % set(auto2) -> clear(echo_input).
% 0.72/1.18 % set(auto2) -> set(quiet).
% 0.72/1.18 % set(auto2) -> clear(print_initial_clauses).
% 0.72/1.18 % set(auto2) -> clear(print_given).
% 0.72/1.18 assign(lrs_ticks,-1).
% 0.72/1.18 assign(sos_limit,10000).
% 0.72/1.18 assign(order,kbo).
% 0.72/1.18 set(lex_order_vars).
% 0.72/1.18 clear(print_given).
% 0.72/1.18
% 0.72/1.18 % formulas(sos). % not echoed (26 formulas)
% 0.72/1.18
% 0.72/1.18 ============================== end of input ==========================
% 0.72/1.18
% 0.72/1.18 % From the command line: assign(max_seconds, 300).
% 0.72/1.18
% 0.72/1.18 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/1.18
% 0.72/1.18 % Formulas that are not ordinary clauses:
% 0.72/1.18
% 0.72/1.18 ============================== end of process non-clausal formulas ===
% 0.72/1.18
% 0.72/1.18 ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/1.18
% 0.72/1.18 ============================== PREDICATE ELIMINATION =================
% 0.72/1.18
% 0.72/1.18 ============================== end predicate elimination =============
% 0.72/1.18
% 0.72/1.18 Auto_denials: (non-Horn, no changes).
% 0.72/1.18
% 0.72/1.18 Term ordering decisions:
% 0.72/1.18 Function symbol KB weights: additive_identity=1. multiplicative_identity=1. a=1. b=1. add=1. multiply=1. additive_inverse=1. h=1.
% 0.72/1.18
% 0.72/1.18 ============================== end of process initial clauses ========
% 0.72/1.18
% 0.72/1.18 ============================== CLAUSES FOR SEARCH ====================
% 0.72/1.18
% 0.72/1.18 ============================== end of clauses for search =============
% 0.72/1.18
% 0.72/1.18 ============================== SEARCH ================================
% 0.72/1.18
% 0.72/1.18 % Starting search at 0.01 seconds.
% 0.72/1.18
% 0.72/1.18 ============================== PROOF =================================
% 0.72/1.18 % SZS status Unsatisfiable
% 0.72/1.18 % SZS output start Refutation
% 0.72/1.18
% 0.72/1.18 % Proof 1 at 0.18 (+ 0.01) seconds.
% 0.72/1.18 % Length of proof is 12.
% 0.72/1.18 % Level of proof is 3.
% 0.72/1.18 % Maximum clause weight is 16.000.
% 0.72/1.18 % Given clauses 151.
% 0.72/1.18
% 0.72/1.18 4 product(A,additive_identity,additive_identity) # label(multiplicative_identity2) # label(hypothesis). [assumption].
% 0.72/1.18 6 product(multiplicative_identity,A,A) # label(left_multiplicative_identity) # label(hypothesis). [assumption].
% 0.72/1.18 7 product(a,b,additive_identity) # label(a_times_b) # label(negated_conjecture). [assumption].
% 0.72/1.18 14 product(h(A),A,multiplicative_identity) | A = additive_identity # label(clause42) # label(hypothesis). [assumption].
% 0.72/1.18 15 product(h(A),A,multiplicative_identity) | additive_identity = A. [copy(14),flip(b)].
% 0.72/1.18 16 a != additive_identity # label(a_not_additive_identity) # label(negated_conjecture). [assumption].
% 0.72/1.18 17 b != additive_identity # label(prove_b_is_additive_identity) # label(negated_conjecture). [assumption].
% 0.72/1.18 20 -product(A,B,C) | -product(A,B,D) | C = D # label(multiplication_is_well_defined) # label(axiom). [assumption].
% 0.72/1.18 24 -product(A,B,C) | -product(B,D,E) | -product(A,E,F) | product(C,D,F) # label(associativity_of_multiplication2) # label(axiom). [assumption].
% 0.72/1.18 85 -product(multiplicative_identity,b,additive_identity). [ur(20,b,6,a,c,17,a(flip))].
% 0.72/1.18 528 -product(A,a,multiplicative_identity). [ur(24,b,7,a,c,4,a,d,85,a)].
% 0.72/1.18 941 $F. [resolve(528,a,15,a),flip(a),unit_del(a,16)].
% 0.72/1.18
% 0.72/1.18 % SZS output end Refutation
% 0.72/1.18 ============================== end of proof ==========================
% 0.72/1.18
% 0.72/1.18 ============================== STATISTICS ============================
% 0.72/1.18
% 0.72/1.18 Given=151. Generated=7635. Kept=938. proofs=1.
% 0.72/1.18 Usable=141. Sos=488. Demods=9. Limbo=0, Disabled=335. Hints=0.
% 0.72/1.18 Megabytes=0.46.
% 0.72/1.18 User_CPU=0.18, System_CPU=0.01, Wall_clock=1.
% 0.72/1.18
% 0.72/1.18 ============================== end of statistics =====================
% 0.72/1.18
% 0.72/1.18 ============================== end of search =========================
% 0.72/1.18
% 0.72/1.18 THEOREM PROVED
% 0.72/1.18 % SZS status Unsatisfiable
% 0.72/1.18
% 0.72/1.18 Exiting with 1 proof.
% 0.72/1.18
% 0.72/1.18 Process 1646 exit (max_proofs) Mon May 30 04:42:55 2022
% 0.72/1.18 Prover9 interrupted
%------------------------------------------------------------------------------