TSTP Solution File: RNG001-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : RNG001-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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 8.83s 9.15s
% Output : Refutation 8.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : RNG001-2 : TPTP v8.1.0. Released v1.0.0.
% 0.02/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.30 % Computer : n025.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Mon May 30 11:05:42 EDT 2022
% 0.10/0.30 % CPUTime :
% 8.83/9.15 ============================== Prover9 ===============================
% 8.83/9.15 Prover9 (32) version 2009-11A, November 2009.
% 8.83/9.15 Process 16580 was started by sandbox2 on n025.cluster.edu,
% 8.83/9.15 Mon May 30 11:05:42 2022
% 8.83/9.15 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_16426_n025.cluster.edu".
% 8.83/9.15 ============================== end of head ===========================
% 8.83/9.15
% 8.83/9.15 ============================== INPUT =================================
% 8.83/9.15
% 8.83/9.15 % Reading from file /tmp/Prover9_16426_n025.cluster.edu
% 8.83/9.15
% 8.83/9.15 set(prolog_style_variables).
% 8.83/9.15 set(auto2).
% 8.83/9.15 % set(auto2) -> set(auto).
% 8.83/9.15 % set(auto) -> set(auto_inference).
% 8.83/9.15 % set(auto) -> set(auto_setup).
% 8.83/9.15 % set(auto_setup) -> set(predicate_elim).
% 8.83/9.15 % set(auto_setup) -> assign(eq_defs, unfold).
% 8.83/9.15 % set(auto) -> set(auto_limits).
% 8.83/9.15 % set(auto_limits) -> assign(max_weight, "100.000").
% 8.83/9.15 % set(auto_limits) -> assign(sos_limit, 20000).
% 8.83/9.15 % set(auto) -> set(auto_denials).
% 8.83/9.15 % set(auto) -> set(auto_process).
% 8.83/9.15 % set(auto2) -> assign(new_constants, 1).
% 8.83/9.15 % set(auto2) -> assign(fold_denial_max, 3).
% 8.83/9.15 % set(auto2) -> assign(max_weight, "200.000").
% 8.83/9.15 % set(auto2) -> assign(max_hours, 1).
% 8.83/9.15 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 8.83/9.15 % set(auto2) -> assign(max_seconds, 0).
% 8.83/9.15 % set(auto2) -> assign(max_minutes, 5).
% 8.83/9.15 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 8.83/9.15 % set(auto2) -> set(sort_initial_sos).
% 8.83/9.15 % set(auto2) -> assign(sos_limit, -1).
% 8.83/9.15 % set(auto2) -> assign(lrs_ticks, 3000).
% 8.83/9.15 % set(auto2) -> assign(max_megs, 400).
% 8.83/9.15 % set(auto2) -> assign(stats, some).
% 8.83/9.15 % set(auto2) -> clear(echo_input).
% 8.83/9.15 % set(auto2) -> set(quiet).
% 8.83/9.15 % set(auto2) -> clear(print_initial_clauses).
% 8.83/9.15 % set(auto2) -> clear(print_given).
% 8.83/9.15 assign(lrs_ticks,-1).
% 8.83/9.15 assign(sos_limit,10000).
% 8.83/9.15 assign(order,kbo).
% 8.83/9.15 set(lex_order_vars).
% 8.83/9.15 clear(print_given).
% 8.83/9.15
% 8.83/9.15 % formulas(sos). % not echoed (18 formulas)
% 8.83/9.15
% 8.83/9.15 ============================== end of input ==========================
% 8.83/9.15
% 8.83/9.15 % From the command line: assign(max_seconds, 300).
% 8.83/9.15
% 8.83/9.15 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 8.83/9.15
% 8.83/9.15 % Formulas that are not ordinary clauses:
% 8.83/9.15
% 8.83/9.15 ============================== end of process non-clausal formulas ===
% 8.83/9.15
% 8.83/9.15 ============================== PROCESS INITIAL CLAUSES ===============
% 8.83/9.15
% 8.83/9.15 ============================== PREDICATE ELIMINATION =================
% 8.83/9.15 1 -sum(A,B,C) | -sum(A,B,D) | equalish(C,D) # label(addition_is_well_defined) # label(axiom). [assumption].
% 8.83/9.15 2 -equalish(A,B) | -sum(C,D,A) | sum(C,D,B) # label(sum_substitution3) # label(axiom). [assumption].
% 8.83/9.15 Derived: -sum(A,B,C) | -sum(A,B,D) | -sum(E,F,C) | sum(E,F,D). [resolve(1,c,2,a)].
% 8.83/9.15
% 8.83/9.15 ============================== end predicate elimination =============
% 8.83/9.15
% 8.83/9.15 Auto_denials:
% 8.83/9.15 % copying label theorem to answer in negative clause
% 8.83/9.15
% 8.83/9.15 Term ordering decisions:
% 8.83/9.15
% 8.83/9.15 % Assigning unary symbol additive_inverse kb_weight 0 and highest precedence (7).
% 8.83/9.15 Function symbol KB weights: additive_identity=1. a=1. add=1. multiply=1. additive_inverse=0.
% 8.83/9.15
% 8.83/9.15 ============================== end of process initial clauses ========
% 8.83/9.15
% 8.83/9.15 ============================== CLAUSES FOR SEARCH ====================
% 8.83/9.15
% 8.83/9.15 ============================== end of clauses for search =============
% 8.83/9.15
% 8.83/9.15 ============================== SEARCH ================================
% 8.83/9.15
% 8.83/9.15 % Starting search at 0.01 seconds.
% 8.83/9.15
% 8.83/9.15 Low Water (keep): wt=19.000, iters=3339
% 8.83/9.15
% 8.83/9.15 Low Water (keep): wt=18.000, iters=3339
% 8.83/9.15
% 8.83/9.15 Low Water (keep): wt=13.000, iters=3447
% 8.83/9.15
% 8.83/9.15 Low Water (keep): wt=12.000, iters=3607
% 8.83/9.15
% 8.83/9.15 Low Water (keep): wt=11.000, iters=3378
% 8.83/9.15
% 8.83/9.15 Low Water (displace): id=4271, wt=18.000
% 8.83/9.15
% 8.83/9.15 Low Water (displace): id=11404, wt=13.000
% 8.83/9.15
% 8.83/9.15 Low Water (displace): id=11450, wt=10.000
% 8.83/9.15
% 8.83/9.15 ============================== PROOF =================================
% 8.83/9.15 % SZS status Unsatisfiable
% 8.83/9.15 % SZS output start Refutation
% 8.83/9.15
% 8.83/9.15 % Proof 1 at 7.23 (+ 0.98) seconds: theorem.
% 8.83/9.15 % Length of proof is 26.
% 8.83/9.15 % Level of proof is 5.
% 8.83/9.15 % Maximum clause weight is 20.000.
% 8.83/9.15 % Given clauses 238.
% 8.83/9.15
% 8.83/9.15 1 -sum(A,B,C) | -sum(A,B,D) | equalish(C,D) # label(addition_is_well_defined) # label(axiom). [assumption].
% 8.83/9.15 2 -equalish(A,B) | -sum(C,D,A) | sum(C,D,B) # label(sum_substitution3) # label(axiom). [assumption].
% 8.83/9.15 3 sum(additive_identity,A,A) # label(additive_identity1) # label(axiom). [assumption].
% 8.83/9.15 4 sum(A,additive_identity,A) # label(additive_identity2) # label(axiom). [assumption].
% 8.83/9.15 5 sum(additive_inverse(A),A,additive_identity) # label(additive_inverse1) # label(axiom). [assumption].
% 8.83/9.15 6 sum(A,additive_inverse(A),additive_identity) # label(additive_inverse2) # label(axiom). [assumption].
% 8.83/9.15 7 product(A,B,multiply(A,B)) # label(closure_of_multiplication) # label(axiom). [assumption].
% 8.83/9.15 8 sum(A,B,add(A,B)) # label(closure_of_addition) # label(axiom). [assumption].
% 8.83/9.15 9 -product(a,additive_identity,additive_identity) # label(theorem) # label(negated_conjecture) # answer(theorem). [assumption].
% 8.83/9.15 11 -sum(A,B,C) | -sum(B,D,E) | -sum(C,D,F) | sum(A,E,F) # label(associativity_of_addition1) # label(axiom). [assumption].
% 8.83/9.15 13 -product(A,B,C) | -product(B,D,E) | -product(C,D,F) | product(A,E,F) # label(associativity_of_multiplication1) # label(axiom). [assumption].
% 8.83/9.15 15 -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].
% 8.83/9.15 16 -product(A,B,C) | -product(A,D,E) | -sum(B,D,F) | -sum(C,E,V6) | product(A,F,V6) # label(distributivity2) # label(axiom). [assumption].
% 8.83/9.15 19 -sum(A,B,C) | -sum(A,B,D) | -sum(E,F,C) | sum(E,F,D). [resolve(1,c,2,a)].
% 8.83/9.15 35 sum(A,additive_identity,additive_inverse(additive_inverse(A))). [ur(11,a,6,a,b,6,a,c,3,a)].
% 8.83/9.15 48 sum(additive_inverse(additive_identity),A,A). [ur(11,a,5,a,b,3,a,c,3,a)].
% 8.83/9.15 91 product(A,multiply(B,C),multiply(multiply(A,B),C)). [ur(13,a,7,a,b,7,a,c,7,a)].
% 8.83/9.15 94 sum(multiply(A,B),multiply(A,C),multiply(A,add(B,C))). [ur(15,a,7,a,b,7,a,c,8,a,d,7,a)].
% 8.83/9.15 110 -sum(multiply(a,additive_identity),multiply(a,additive_identity),additive_identity) # answer(theorem). [ur(16,a,7,a,b,7,a,c,4,a,e,9,a)].
% 8.83/9.15 287 sum(additive_inverse(additive_inverse(additive_identity)),A,A). [ur(11,a,5,a,b,48,a,c,3,a)].
% 8.83/9.15 475 sum(A,additive_inverse(additive_inverse(additive_inverse(A))),additive_identity). [ur(11,a,6,a,b,35,a,c,4,a)].
% 8.83/9.15 14354 product(A,additive_inverse(additive_inverse(B)),multiply(A,add(B,additive_identity))). [ur(16,a,7,a,b,7,a,c,35,a,d,94,a)].
% 8.83/9.15 14595 -sum(multiply(a,add(additive_identity,additive_identity)),additive_identity,additive_identity) # answer(theorem). [ur(19,a,4,a,c,94,a,d,110,a)].
% 8.83/9.15 14941 -sum(multiply(a,add(additive_identity,additive_identity)),A,A) # answer(theorem). [ur(11,b,475,a,c,475,a,d,14595,a)].
% 8.83/9.15 15503 -product(A,additive_inverse(additive_inverse(additive_identity)),multiply(a,add(additive_identity,additive_identity))) # answer(theorem). [ur(15,b,91,a,c,287,a,d,91,a,e,14941,a)].
% 8.83/9.15 15504 $F # answer(theorem). [resolve(15503,a,14354,a)].
% 8.83/9.15
% 8.83/9.15 % SZS output end Refutation
% 8.83/9.15 ============================== end of proof ==========================
% 8.83/9.15
% 8.83/9.15 ============================== STATISTICS ============================
% 8.83/9.15
% 8.83/9.15 Given=238. Generated=1917226. Kept=15501. proofs=1.
% 8.83/9.15 Usable=236. Sos=9999. Demods=0. Limbo=321, Disabled=4963. Hints=0.
% 8.83/9.15 Megabytes=9.59.
% 8.83/9.15 User_CPU=7.23, System_CPU=0.98, Wall_clock=9.
% 8.83/9.15
% 8.83/9.15 ============================== end of statistics =====================
% 8.83/9.15
% 8.83/9.15 ============================== end of search =========================
% 8.83/9.15
% 8.83/9.15 THEOREM PROVED
% 8.83/9.15 % SZS status Unsatisfiable
% 8.83/9.15
% 8.83/9.15 Exiting with 1 proof.
% 8.83/9.15
% 8.83/9.15 Process 16580 exit (max_proofs) Mon May 30 11:05:51 2022
% 8.83/9.15 Prover9 interrupted
%------------------------------------------------------------------------------