TSTP Solution File: RNG006-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : RNG006-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:09 EDT 2022
% Result : Unsatisfiable 0.68s 0.99s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : RNG006-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.32 % Computer : n027.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Mon May 30 06:24:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.68/0.99 ============================== Prover9 ===============================
% 0.68/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.68/0.99 Process 22633 was started by sandbox on n027.cluster.edu,
% 0.68/0.99 Mon May 30 06:24:46 2022
% 0.68/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_22276_n027.cluster.edu".
% 0.68/0.99 ============================== end of head ===========================
% 0.68/0.99
% 0.68/0.99 ============================== INPUT =================================
% 0.68/0.99
% 0.68/0.99 % Reading from file /tmp/Prover9_22276_n027.cluster.edu
% 0.68/0.99
% 0.68/0.99 set(prolog_style_variables).
% 0.68/0.99 set(auto2).
% 0.68/0.99 % set(auto2) -> set(auto).
% 0.68/0.99 % set(auto) -> set(auto_inference).
% 0.68/0.99 % set(auto) -> set(auto_setup).
% 0.68/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.68/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.68/0.99 % set(auto) -> set(auto_limits).
% 0.68/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.68/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.68/0.99 % set(auto) -> set(auto_denials).
% 0.68/0.99 % set(auto) -> set(auto_process).
% 0.68/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.68/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.68/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.68/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.68/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.68/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.68/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.68/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.68/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.68/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.68/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.68/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.68/0.99 % set(auto2) -> assign(stats, some).
% 0.68/0.99 % set(auto2) -> clear(echo_input).
% 0.68/0.99 % set(auto2) -> set(quiet).
% 0.68/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.68/0.99 % set(auto2) -> clear(print_given).
% 0.68/0.99 assign(lrs_ticks,-1).
% 0.68/0.99 assign(sos_limit,10000).
% 0.68/0.99 assign(order,kbo).
% 0.68/0.99 set(lex_order_vars).
% 0.68/0.99 clear(print_given).
% 0.68/0.99
% 0.68/0.99 % formulas(sos). % not echoed (25 formulas)
% 0.68/0.99
% 0.68/0.99 ============================== end of input ==========================
% 0.68/0.99
% 0.68/0.99 % From the command line: assign(max_seconds, 300).
% 0.68/0.99
% 0.68/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.68/0.99
% 0.68/0.99 % Formulas that are not ordinary clauses:
% 0.68/0.99
% 0.68/0.99 ============================== end of process non-clausal formulas ===
% 0.68/0.99
% 0.68/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.68/0.99
% 0.68/0.99 ============================== PREDICATE ELIMINATION =================
% 0.68/0.99
% 0.68/0.99 ============================== end predicate elimination =============
% 0.68/0.99
% 0.68/0.99 Auto_denials:
% 0.68/0.99 % copying label prove_a_times_bS_Ic_is_aPb_S__IaPc to answer in negative clause
% 0.68/0.99
% 0.68/0.99 Term ordering decisions:
% 0.68/0.99
% 0.68/0.99 % Assigning unary symbol additive_inverse kb_weight 0 and highest precedence (14).
% 0.68/0.99 Function symbol KB weights: additive_identity=1. a=1. aPb=1. aPc=1. b=1. c=1. aPb_S_IaPc=1. bS_Ic=1. add=1. multiply=1. additive_inverse=0.
% 0.68/0.99
% 0.68/0.99 ============================== end of process initial clauses ========
% 0.68/0.99
% 0.68/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.68/0.99
% 0.68/0.99 ============================== end of clauses for search =============
% 0.68/0.99
% 0.68/0.99 ============================== SEARCH ================================
% 0.68/0.99
% 0.68/0.99 % Starting search at 0.01 seconds.
% 0.68/0.99
% 0.68/0.99 ============================== PROOF =================================
% 0.68/0.99 % SZS status Unsatisfiable
% 0.68/0.99 % SZS output start Refutation
% 0.68/0.99
% 0.68/0.99 % Proof 1 at 0.02 (+ 0.00) seconds: prove_a_times_bS_Ic_is_aPb_S__IaPc.
% 0.68/0.99 % Length of proof is 10.
% 0.68/0.99 % Level of proof is 2.
% 0.68/0.99 % Maximum clause weight is 20.000.
% 0.68/0.99 % Given clauses 23.
% 0.68/0.99
% 0.68/0.99 3 product(a,b,aPb) # label(a_times_b) # label(hypothesis). [assumption].
% 0.68/0.99 4 product(a,c,aPc) # label(a_times_c) # label(hypothesis). [assumption].
% 0.68/0.99 7 sum(b,additive_inverse(c),bS_Ic) # label(b_plus_inverse_c) # label(hypothesis). [assumption].
% 0.68/0.99 8 sum(aPb,additive_inverse(aPc),aPb_S_IaPc) # label(aPb_plus_IaPc) # label(hypothesis). [assumption].
% 0.68/0.99 11 -product(a,bS_Ic,aPb_S_IaPc) # label(prove_a_times_bS_Ic_is_aPb_S__IaPc) # label(negated_conjecture) # answer(prove_a_times_bS_Ic_is_aPb_S__IaPc). [assumption].
% 0.68/0.99 13 -product(A,B,C) | product(A,additive_inverse(B),additive_inverse(C)) # label(product_lemma1) # label(axiom). [assumption].
% 0.68/0.99 23 -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].
% 0.68/0.99 30 product(a,additive_inverse(c),additive_inverse(aPc)). [hyper(13,a,4,a)].
% 0.68/0.99 145 -product(a,additive_inverse(c),additive_inverse(aPc)) # answer(prove_a_times_bS_Ic_is_aPb_S__IaPc). [ur(23,a,3,a,c,7,a,d,8,a,e,11,a)].
% 0.68/0.99 146 $F # answer(prove_a_times_bS_Ic_is_aPb_S__IaPc). [resolve(145,a,30,a)].
% 0.68/0.99
% 0.68/0.99 % SZS output end Refutation
% 0.68/0.99 ============================== end of proof ==========================
% 0.68/0.99
% 0.68/0.99 ============================== STATISTICS ============================
% 0.68/0.99
% 0.68/0.99 Given=23. Generated=360. Kept=145. proofs=1.
% 0.68/0.99 Usable=23. Sos=97. Demods=9. Limbo=24, Disabled=25. Hints=0.
% 0.68/0.99 Megabytes=0.13.
% 0.68/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.68/0.99
% 0.68/0.99 ============================== end of statistics =====================
% 0.68/0.99
% 0.68/0.99 ============================== end of search =========================
% 0.68/0.99
% 0.68/0.99 THEOREM PROVED
% 0.68/0.99 % SZS status Unsatisfiable
% 0.68/0.99
% 0.68/0.99 Exiting with 1 proof.
% 0.68/0.99
% 0.68/0.99 Process 22633 exit (max_proofs) Mon May 30 06:24:46 2022
% 0.68/0.99 Prover9 interrupted
%------------------------------------------------------------------------------