TSTP Solution File: RNG001-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : RNG001-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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 30.09s 30.37s
% Output : Refutation 30.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG001-10 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n017.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 10:23:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 30.09/30.36 ============================== Prover9 ===============================
% 30.09/30.36 Prover9 (32) version 2009-11A, November 2009.
% 30.09/30.36 Process 1317 was started by sandbox on n017.cluster.edu,
% 30.09/30.36 Mon May 30 10:23:40 2022
% 30.09/30.36 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_1160_n017.cluster.edu".
% 30.09/30.36 ============================== end of head ===========================
% 30.09/30.36
% 30.09/30.36 ============================== INPUT =================================
% 30.09/30.36
% 30.09/30.36 % Reading from file /tmp/Prover9_1160_n017.cluster.edu
% 30.09/30.36
% 30.09/30.36 set(prolog_style_variables).
% 30.09/30.36 set(auto2).
% 30.09/30.36 % set(auto2) -> set(auto).
% 30.09/30.36 % set(auto) -> set(auto_inference).
% 30.09/30.36 % set(auto) -> set(auto_setup).
% 30.09/30.36 % set(auto_setup) -> set(predicate_elim).
% 30.09/30.36 % set(auto_setup) -> assign(eq_defs, unfold).
% 30.09/30.36 % set(auto) -> set(auto_limits).
% 30.09/30.36 % set(auto_limits) -> assign(max_weight, "100.000").
% 30.09/30.36 % set(auto_limits) -> assign(sos_limit, 20000).
% 30.09/30.36 % set(auto) -> set(auto_denials).
% 30.09/30.36 % set(auto) -> set(auto_process).
% 30.09/30.36 % set(auto2) -> assign(new_constants, 1).
% 30.09/30.36 % set(auto2) -> assign(fold_denial_max, 3).
% 30.09/30.37 % set(auto2) -> assign(max_weight, "200.000").
% 30.09/30.37 % set(auto2) -> assign(max_hours, 1).
% 30.09/30.37 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 30.09/30.37 % set(auto2) -> assign(max_seconds, 0).
% 30.09/30.37 % set(auto2) -> assign(max_minutes, 5).
% 30.09/30.37 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 30.09/30.37 % set(auto2) -> set(sort_initial_sos).
% 30.09/30.37 % set(auto2) -> assign(sos_limit, -1).
% 30.09/30.37 % set(auto2) -> assign(lrs_ticks, 3000).
% 30.09/30.37 % set(auto2) -> assign(max_megs, 400).
% 30.09/30.37 % set(auto2) -> assign(stats, some).
% 30.09/30.37 % set(auto2) -> clear(echo_input).
% 30.09/30.37 % set(auto2) -> set(quiet).
% 30.09/30.37 % set(auto2) -> clear(print_initial_clauses).
% 30.09/30.37 % set(auto2) -> clear(print_given).
% 30.09/30.37 assign(lrs_ticks,-1).
% 30.09/30.37 assign(sos_limit,10000).
% 30.09/30.37 assign(order,kbo).
% 30.09/30.37 set(lex_order_vars).
% 30.09/30.37 clear(print_given).
% 30.09/30.37
% 30.09/30.37 % formulas(sos). % not echoed (22 formulas)
% 30.09/30.37
% 30.09/30.37 ============================== end of input ==========================
% 30.09/30.37
% 30.09/30.37 % From the command line: assign(max_seconds, 300).
% 30.09/30.37
% 30.09/30.37 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 30.09/30.37
% 30.09/30.37 % Formulas that are not ordinary clauses:
% 30.09/30.37
% 30.09/30.37 ============================== end of process non-clausal formulas ===
% 30.09/30.37
% 30.09/30.37 ============================== PROCESS INITIAL CLAUSES ===============
% 30.09/30.37
% 30.09/30.37 ============================== PREDICATE ELIMINATION =================
% 30.09/30.37
% 30.09/30.37 ============================== end predicate elimination =============
% 30.09/30.37
% 30.09/30.37 Auto_denials:
% 30.09/30.37 % copying label prove_a_times_additive_id_is_additive_id to answer in negative clause
% 30.09/30.37
% 30.09/30.37 Term ordering decisions:
% 30.09/30.37
% 30.09/30.37 % Assigning unary symbol additive_inverse kb_weight 0 and highest precedence (11).
% 30.09/30.37 Function symbol KB weights: true=1. additive_identity=1. a=1. add=1. multiply=1. sum=1. product=1. ifeq=1. ifeq2=1. additive_inverse=0.
% 30.09/30.37
% 30.09/30.37 ============================== end of process initial clauses ========
% 30.09/30.37
% 30.09/30.37 ============================== CLAUSES FOR SEARCH ====================
% 30.09/30.37
% 30.09/30.37 ============================== end of clauses for search =============
% 30.09/30.37
% 30.09/30.37 ============================== SEARCH ================================
% 30.09/30.37
% 30.09/30.37 % Starting search at 0.01 seconds.
% 30.09/30.37
% 30.09/30.37 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 29 (0.00 of 0.82 sec).
% 30.09/30.37
% 30.09/30.37 Low Water (keep): wt=42.000, iters=3333
% 30.09/30.37
% 30.09/30.37 Low Water (keep): wt=39.000, iters=3344
% 30.09/30.37
% 30.09/30.37 Low Water (keep): wt=38.000, iters=3334
% 30.09/30.37
% 30.09/30.37 Low Water (keep): wt=37.000, iters=3416
% 30.09/30.37
% 30.09/30.37 Low Water (keep): wt=35.000, iters=3363
% 30.09/30.37
% 30.09/30.37 Low Water (keep): wt=34.000, iters=3351
% 30.09/30.37
% 30.09/30.37 Low Water (keep): wt=32.000, iters=3356
% 30.09/30.37
% 30.09/30.37 Low Water (keep): wt=31.000, iters=3357
% 30.09/30.37
% 30.09/30.37 Low Water (keep): wt=30.000, iters=3343
% 30.09/30.37
% 30.09/30.37 Low Water (keep): wt=29.000, iters=3432
% 30.09/30.37
% 30.09/30.37 Low Water (keep): wt=28.000, iters=3360
% 30.09/30.37
% 30.09/30.37 Low Water (keep): wt=27.000, iters=3535
% 30.09/30.37
% 30.09/30.37 Low Water (keep): wt=26.000, iters=3355
% 30.09/30.37
% 30.09/30.37 Low Water (keep): wt=25.000, iters=3334
% 30.09/30.37
% 30.09/30.37 Low Water (keep): wt=24.000, iters=3335
% 30.09/30.37
% 30.09/30.37 Low Water (keep): wt=23.000, iters=3333
% 30.09/30.37
% 30.09/30.37 ============================== PROOF =================================
% 30.09/30.37 % SZS status Unsatisfiable
% 30.09/30.37 % SZS output start Refutation
% 30.09/30.37
% 30.09/30.37 % Proof 1 at 28.96 (+ 0.45) seconds: prove_a_times_additive_id_is_additive_id.
% 30.09/30.37 % Length of proof is 16.
% 30.09/30.37 % Level of proof is 7.
% 30.09/30.37 % Maximum clause weight is 34.000.
% 30.09/30.37 % Given clauses 3936.
% 30.09/30.37
% 30.09/30.37 1 sum(additive_identity,A,A) = true # label(additive_identity1) # label(axiom). [assumption].
% 30.09/30.37 2 sum(A,additive_identity,A) = true # label(additive_identity2) # label(axiom). [assumption].
% 30.09/30.37 3 ifeq2(A,A,B,C) = B # label(ifeq_axiom) # label(axiom). [assumption].
% 30.09/30.37 4 ifeq(A,A,B,C) = B # label(ifeq_axiom_001) # label(axiom). [assumption].
% 30.09/30.37 7 product(A,B,multiply(A,B)) = true # label(closure_of_multiplication) # label(axiom). [assumption].
% 30.09/30.37 12 ifeq2(sum(A,B,C),true,ifeq2(sum(A,D,C),true,D,B),B) = B # label(cancellation1) # label(axiom). [assumption].
% 30.09/30.37 18 ifeq(product(A,B,C),true,ifeq(product(A,D,E),true,ifeq(product(A,F,V6),true,ifeq(sum(F,D,B),true,sum(V6,E,C),true),true),true),true) = true # label(distributivity1) # label(axiom). [assumption].
% 30.09/30.37 22 product(a,additive_identity,additive_identity) != true # label(prove_a_times_additive_id_is_additive_id) # label(negated_conjecture) # answer(prove_a_times_additive_id_is_additive_id). [assumption].
% 30.09/30.37 36 ifeq2(sum(A,B,A),true,B,additive_identity) = additive_identity. [para(2(a,1),12(a,1,1)),rewrite([3(8)])].
% 30.09/30.37 102 ifeq(product(A,B,C),true,ifeq(product(A,B,D),true,ifeq(product(A,additive_identity,E),true,sum(E,D,C),true),true),true) = true. [para(1(a,1),18(a,1,3,3,3,1)),rewrite([4(12)])].
% 30.09/30.37 2174 ifeq(product(A,B,C),true,ifeq(product(A,additive_identity,D),true,sum(D,C,multiply(A,B)),true),true) = true. [para(7(a,1),102(a,1,1)),rewrite([4(15)])].
% 30.09/30.37 19185 ifeq(product(A,additive_identity,B),true,sum(B,multiply(A,C),multiply(A,C)),true) = true. [para(7(a,1),2174(a,1,1)),rewrite([4(12)])].
% 30.09/30.37 19187 sum(multiply(A,additive_identity),multiply(A,B),multiply(A,B)) = true. [para(7(a,1),19185(a,1,1)),rewrite([4(9)])].
% 30.09/30.37 19196 multiply(A,additive_identity) = additive_identity. [para(19187(a,1),36(a,1,1)),rewrite([3(6)])].
% 30.09/30.37 19214 product(A,additive_identity,additive_identity) = true. [para(19196(a,1),7(a,1,3))].
% 30.09/30.37 19215 $F # answer(prove_a_times_additive_id_is_additive_id). [resolve(19214,a,22,a)].
% 30.09/30.37
% 30.09/30.37 % SZS output end Refutation
% 30.09/30.37 ============================== end of proof ==========================
% 30.09/30.37
% 30.09/30.37 ============================== STATISTICS ============================
% 30.09/30.37
% 30.09/30.37 Given=3936. Generated=812337. Kept=19214. proofs=1.
% 30.09/30.37 Usable=3764. Sos=8757. Demods=12520. Limbo=0, Disabled=6714. Hints=0.
% 30.09/30.37 Megabytes=19.23.
% 30.09/30.37 User_CPU=28.96, System_CPU=0.45, Wall_clock=30.
% 30.09/30.37
% 30.09/30.37 ============================== end of statistics =====================
% 30.09/30.37
% 30.09/30.37 ============================== end of search =========================
% 30.09/30.37
% 30.09/30.37 THEOREM PROVED
% 30.09/30.37 % SZS status Unsatisfiable
% 30.09/30.37
% 30.09/30.37 Exiting with 1 proof.
% 30.09/30.37
% 30.09/30.37 Process 1317 exit (max_proofs) Mon May 30 10:24:10 2022
% 30.09/30.37 Prover9 interrupted
%------------------------------------------------------------------------------