TSTP Solution File: RNG038-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : RNG038-2 : 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:15 EDT 2022
% Result : Unsatisfiable 0.71s 1.01s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : RNG038-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 : n020.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 19:31:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.40/0.98
% 0.40/0.98 WARNING: denials share constants (see output).
% 0.40/0.98
% 0.71/1.01 ============================== Prover9 ===============================
% 0.71/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.71/1.01 Process 26174 was started by sandbox2 on n020.cluster.edu,
% 0.71/1.01 Mon May 30 19:31:54 2022
% 0.71/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_26021_n020.cluster.edu".
% 0.71/1.01 ============================== end of head ===========================
% 0.71/1.01
% 0.71/1.01 ============================== INPUT =================================
% 0.71/1.01
% 0.71/1.01 % Reading from file /tmp/Prover9_26021_n020.cluster.edu
% 0.71/1.01
% 0.71/1.01 set(prolog_style_variables).
% 0.71/1.01 set(auto2).
% 0.71/1.01 % set(auto2) -> set(auto).
% 0.71/1.01 % set(auto) -> set(auto_inference).
% 0.71/1.01 % set(auto) -> set(auto_setup).
% 0.71/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.71/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/1.01 % set(auto) -> set(auto_limits).
% 0.71/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/1.01 % set(auto) -> set(auto_denials).
% 0.71/1.01 % set(auto) -> set(auto_process).
% 0.71/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.71/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.71/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.71/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.71/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.71/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.71/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.71/1.01 % set(auto2) -> assign(stats, some).
% 0.71/1.01 % set(auto2) -> clear(echo_input).
% 0.71/1.01 % set(auto2) -> set(quiet).
% 0.71/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.71/1.01 % set(auto2) -> clear(print_given).
% 0.71/1.01 assign(lrs_ticks,-1).
% 0.71/1.01 assign(sos_limit,10000).
% 0.71/1.01 assign(order,kbo).
% 0.71/1.01 set(lex_order_vars).
% 0.71/1.01 clear(print_given).
% 0.71/1.01
% 0.71/1.01 % formulas(sos). % not echoed (30 formulas)
% 0.71/1.01
% 0.71/1.01 ============================== end of input ==========================
% 0.71/1.01
% 0.71/1.01 % From the command line: assign(max_seconds, 300).
% 0.71/1.01
% 0.71/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/1.01
% 0.71/1.01 % Formulas that are not ordinary clauses:
% 0.71/1.01
% 0.71/1.01 ============================== end of process non-clausal formulas ===
% 0.71/1.01
% 0.71/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/1.01
% 0.71/1.01 ============================== PREDICATE ELIMINATION =================
% 0.71/1.01
% 0.71/1.01 ============================== end predicate elimination =============
% 0.71/1.01
% 0.71/1.01 Auto_denials:
% 0.71/1.01 % copying label a_not_additive_identity to answer in negative clause
% 0.71/1.01 % copying label prove_b_is_additive_identity to answer in negative clause
% 0.71/1.01 % assign(max_proofs, 2). % (Horn set with more than one neg. clause)
% 0.71/1.01
% 0.71/1.01 WARNING, because some of the denials share constants,
% 0.71/1.01 some of the denials or their descendents may be subsumed,
% 0.71/1.01 preventing the target number of proofs from being found.
% 0.71/1.01 The shared constants are: additive_identity.
% 0.71/1.01
% 0.71/1.01 Term ordering decisions:
% 0.71/1.01
% 0.71/1.01 % Assigning unary symbol additive_inverse kb_weight 0 and highest precedence (10).
% 0.71/1.01 Function symbol KB weights: additive_identity=1. a=1. b=1. add=1. multiply=1. h=1. additive_inverse=0.
% 0.71/1.01
% 0.71/1.01 ============================== end of process initial clauses ========
% 0.71/1.01
% 0.71/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.71/1.01
% 0.71/1.01 ============================== end of clauses for search =============
% 0.71/1.01
% 0.71/1.01 ============================== SEARCH ================================
% 0.71/1.01
% 0.71/1.01 % Starting search at 0.01 seconds.
% 0.71/1.01
% 0.71/1.01 ============================== PROOF =================================
% 0.71/1.01 % SZS status Unsatisfiable
% 0.71/1.01 % SZS output start Refutation
% 0.71/1.01
% 0.71/1.01 % Proof 1 at 0.04 (+ 0.00) seconds: a_not_additive_identity.
% 0.71/1.01 % Length of proof is 10.
% 0.71/1.01 % Level of proof is 3.
% 0.71/1.01 % Maximum clause weight is 11.000.
% 0.71/1.01 % Given clauses 36.
% 0.71/1.01
% 0.71/1.01 1 sum(A,additive_identity,A) # label(additive_identity2) # label(axiom). [assumption].
% 0.71/1.01 2 product(additive_identity,A,additive_identity) # label(multiplicative_identity1) # label(axiom). [assumption].
% 0.71/1.01 8 -equalish(a,additive_identity) # label(a_not_additive_identity) # label(negated_conjecture) # answer(a_not_additive_identity). [assumption].
% 0.71/1.01 12 -equalish(A,additive_identity) | product(A,h(A,B),B) # label(some_property) # label(hypothesis). [assumption].
% 0.71/1.01 21 -sum(A,B,C) | -sum(A,B,D) | equalish(C,D) # label(addition_is_well_defined) # label(axiom). [assumption].
% 0.71/1.01 22 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(multiplication_is_well_defined) # label(axiom). [assumption].
% 0.71/1.01 42 equalish(A,A). [ur(21,a,1,a,b,1,a)].
% 0.71/1.01 62 -product(additive_identity,A,a) # answer(a_not_additive_identity). [ur(22,b,2,a,c,8,a)].
% 0.71/1.01 386 product(additive_identity,h(additive_identity,A),A). [ur(12,a,42,a)].
% 0.71/1.01 387 $F # answer(a_not_additive_identity). [resolve(386,a,62,a)].
% 0.71/1.01
% 0.71/1.01 % SZS output end Refutation
% 0.71/1.01 ============================== end of proof ==========================
% 0.71/1.01
% 0.71/1.01 ============================== PROOF =================================
% 0.71/1.01 % SZS status Unsatisfiable
% 0.71/1.01 % SZS output start Refutation
% 0.71/1.01
% 0.71/1.01 % Proof 2 at 0.04 (+ 0.00) seconds: prove_b_is_additive_identity.
% 0.71/1.01 % Length of proof is 10.
% 0.71/1.01 % Level of proof is 3.
% 0.71/1.01 % Maximum clause weight is 11.000.
% 0.71/1.01 % Given clauses 36.
% 0.71/1.01
% 0.71/1.01 1 sum(A,additive_identity,A) # label(additive_identity2) # label(axiom). [assumption].
% 0.71/1.01 2 product(additive_identity,A,additive_identity) # label(multiplicative_identity1) # label(axiom). [assumption].
% 0.71/1.01 9 -equalish(b,additive_identity) # label(prove_b_is_additive_identity) # label(negated_conjecture) # answer(prove_b_is_additive_identity). [assumption].
% 0.71/1.01 12 -equalish(A,additive_identity) | product(A,h(A,B),B) # label(some_property) # label(hypothesis). [assumption].
% 0.71/1.01 21 -sum(A,B,C) | -sum(A,B,D) | equalish(C,D) # label(addition_is_well_defined) # label(axiom). [assumption].
% 0.71/1.01 22 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(multiplication_is_well_defined) # label(axiom). [assumption].
% 0.71/1.01 42 equalish(A,A). [ur(21,a,1,a,b,1,a)].
% 0.71/1.01 61 -product(additive_identity,A,b) # answer(prove_b_is_additive_identity). [ur(22,b,2,a,c,9,a)].
% 0.71/1.01 386 product(additive_identity,h(additive_identity,A),A). [ur(12,a,42,a)].
% 0.71/1.01 388 $F # answer(prove_b_is_additive_identity). [resolve(386,a,61,a)].
% 0.71/1.01
% 0.71/1.01 % SZS output end Refutation
% 0.71/1.01 ============================== end of proof ==========================
% 0.71/1.01
% 0.71/1.01 ============================== STATISTICS ============================
% 0.71/1.01
% 0.71/1.01 Given=36. Generated=913. Kept=386. proofs=2.
% 0.71/1.01 Usable=36. Sos=333. Demods=0. Limbo=0, Disabled=46. Hints=0.
% 0.71/1.01 Megabytes=0.25.
% 0.71/1.01 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.71/1.01
% 0.71/1.01 ============================== end of statistics =====================
% 0.71/1.01
% 0.71/1.01 ============================== end of search =========================
% 0.71/1.01
% 0.71/1.01 THEOREM PROVED
% 0.71/1.01 % SZS status Unsatisfiable
% 0.71/1.01
% 0.71/1.01 Exiting with 2 proofs.
% 0.71/1.01
% 0.71/1.01 Process 26174 exit (max_proofs) Mon May 30 19:31:54 2022
% 0.71/1.01 Prover9 interrupted
%------------------------------------------------------------------------------