TSTP Solution File: RNG040-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : RNG040-2 : 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:16 EDT 2022
% Result : Unsatisfiable 0.71s 1.03s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : RNG040-2 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n019.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 : Mon May 30 07:04:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.03 ============================== Prover9 ===============================
% 0.71/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.71/1.03 Process 3335 was started by sandbox on n019.cluster.edu,
% 0.71/1.03 Mon May 30 07:04:11 2022
% 0.71/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3182_n019.cluster.edu".
% 0.71/1.03 ============================== end of head ===========================
% 0.71/1.03
% 0.71/1.03 ============================== INPUT =================================
% 0.71/1.03
% 0.71/1.03 % Reading from file /tmp/Prover9_3182_n019.cluster.edu
% 0.71/1.03
% 0.71/1.03 set(prolog_style_variables).
% 0.71/1.03 set(auto2).
% 0.71/1.03 % set(auto2) -> set(auto).
% 0.71/1.03 % set(auto) -> set(auto_inference).
% 0.71/1.03 % set(auto) -> set(auto_setup).
% 0.71/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.71/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/1.03 % set(auto) -> set(auto_limits).
% 0.71/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/1.03 % set(auto) -> set(auto_denials).
% 0.71/1.03 % set(auto) -> set(auto_process).
% 0.71/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.71/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.71/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.71/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.71/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.71/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.71/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.71/1.03 % set(auto2) -> assign(stats, some).
% 0.71/1.03 % set(auto2) -> clear(echo_input).
% 0.71/1.03 % set(auto2) -> set(quiet).
% 0.71/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.71/1.03 % set(auto2) -> clear(print_given).
% 0.71/1.03 assign(lrs_ticks,-1).
% 0.71/1.03 assign(sos_limit,10000).
% 0.71/1.03 assign(order,kbo).
% 0.71/1.03 set(lex_order_vars).
% 0.71/1.03 clear(print_given).
% 0.71/1.03
% 0.71/1.03 % formulas(sos). % not echoed (25 formulas)
% 0.71/1.03
% 0.71/1.03 ============================== end of input ==========================
% 0.71/1.03
% 0.71/1.03 % From the command line: assign(max_seconds, 300).
% 0.71/1.03
% 0.71/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/1.03
% 0.71/1.03 % Formulas that are not ordinary clauses:
% 0.71/1.03
% 0.71/1.03 ============================== end of process non-clausal formulas ===
% 0.71/1.03
% 0.71/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/1.03
% 0.71/1.03 ============================== PREDICATE ELIMINATION =================
% 0.71/1.03
% 0.71/1.03 ============================== end predicate elimination =============
% 0.71/1.03
% 0.71/1.03 Auto_denials: (non-Horn, no changes).
% 0.71/1.03
% 0.71/1.03 Term ordering decisions:
% 0.71/1.03 Function symbol KB weights: additive_identity=1. multiplicative_identity=1. a=1. b=1. c=1. d=1. l=1. n=1. add=1. multiply=1. additive_inverse=1. h=1.
% 0.71/1.03
% 0.71/1.03 ============================== end of process initial clauses ========
% 0.71/1.03
% 0.71/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.71/1.03
% 0.71/1.03 ============================== end of clauses for search =============
% 0.71/1.03
% 0.71/1.03 ============================== SEARCH ================================
% 0.71/1.03
% 0.71/1.03 % Starting search at 0.01 seconds.
% 0.71/1.03
% 0.71/1.03 ============================== PROOF =================================
% 0.71/1.03 % SZS status Unsatisfiable
% 0.71/1.03 % SZS output start Refutation
% 0.71/1.03
% 0.71/1.03 % Proof 1 at 0.05 (+ 0.00) seconds.
% 0.71/1.03 % Length of proof is 14.
% 0.71/1.03 % Level of proof is 2.
% 0.71/1.03 % Maximum clause weight is 20.000.
% 0.71/1.03 % Given clauses 48.
% 0.71/1.03
% 0.71/1.03 5 sum(b,c,d) # label(b_plus_c) # label(negated_conjecture). [assumption].
% 0.71/1.03 6 product(d,a,additive_identity) # label(d_plus_a) # label(negated_conjecture). [assumption].
% 0.71/1.03 7 product(b,a,l) # label(b_plus_a) # label(negated_conjecture). [assumption].
% 0.71/1.03 8 product(c,a,n) # label(c_plus_a) # label(negated_conjecture). [assumption].
% 0.71/1.03 17 -sum(l,n,additive_identity) # label(prove_equation) # label(negated_conjecture). [assumption].
% 0.71/1.03 18 -sum(A,B,C) | sum(B,A,C) # label(commutativity_of_addition) # label(axiom). [assumption].
% 0.71/1.03 19 -product(A,B,C) | product(B,A,C) # label(product_symmetry) # label(hypothesis). [assumption].
% 0.71/1.03 26 -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.71/1.03 44 sum(c,b,d). [resolve(18,a,5,a)].
% 0.71/1.03 45 -sum(n,l,additive_identity). [ur(18,b,17,a)].
% 0.71/1.03 47 product(a,c,n). [resolve(19,a,8,a)].
% 0.71/1.03 48 product(a,b,l). [resolve(19,a,7,a)].
% 0.71/1.03 49 product(a,d,additive_identity). [resolve(19,a,6,a)].
% 0.71/1.03 348 $F. [ur(26,a,47,a,b,48,a,c,44,a,e,45,a),unit_del(a,49)].
% 0.71/1.03
% 0.71/1.03 % SZS output end Refutation
% 0.71/1.03 ============================== end of proof ==========================
% 0.71/1.03
% 0.71/1.03 ============================== STATISTICS ============================
% 0.71/1.03
% 0.71/1.03 Given=48. Generated=598. Kept=345. proofs=1.
% 0.71/1.03 Usable=48. Sos=284. Demods=0. Limbo=9, Disabled=29. Hints=0.
% 0.71/1.03 Megabytes=0.24.
% 0.71/1.03 User_CPU=0.05, System_CPU=0.00, Wall_clock=0.
% 0.71/1.03
% 0.71/1.03 ============================== end of statistics =====================
% 0.71/1.03
% 0.71/1.03 ============================== end of search =========================
% 0.71/1.03
% 0.71/1.03 THEOREM PROVED
% 0.71/1.03 % SZS status Unsatisfiable
% 0.71/1.03
% 0.71/1.03 Exiting with 1 proof.
% 0.71/1.03
% 0.71/1.03 Process 3335 exit (max_proofs) Mon May 30 07:04:11 2022
% 0.71/1.03 Prover9 interrupted
%------------------------------------------------------------------------------