TSTP Solution File: RNG023-7 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : RNG023-7 : TPTP v8.1.0. Released v1.0.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:12 EDT 2022
% Result : Unsatisfiable 0.67s 0.98s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG023-7 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon May 30 21:46:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.67/0.98 ============================== Prover9 ===============================
% 0.67/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.67/0.98 Process 19205 was started by sandbox2 on n017.cluster.edu,
% 0.67/0.98 Mon May 30 21:46:26 2022
% 0.67/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_19052_n017.cluster.edu".
% 0.67/0.98 ============================== end of head ===========================
% 0.67/0.98
% 0.67/0.98 ============================== INPUT =================================
% 0.67/0.98
% 0.67/0.98 % Reading from file /tmp/Prover9_19052_n017.cluster.edu
% 0.67/0.98
% 0.67/0.98 set(prolog_style_variables).
% 0.67/0.98 set(auto2).
% 0.67/0.98 % set(auto2) -> set(auto).
% 0.67/0.98 % set(auto) -> set(auto_inference).
% 0.67/0.98 % set(auto) -> set(auto_setup).
% 0.67/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.67/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.67/0.98 % set(auto) -> set(auto_limits).
% 0.67/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.67/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.67/0.98 % set(auto) -> set(auto_denials).
% 0.67/0.98 % set(auto) -> set(auto_process).
% 0.67/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.67/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.67/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.67/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.67/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.67/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.67/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.67/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.67/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.67/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.67/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.67/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.67/0.98 % set(auto2) -> assign(stats, some).
% 0.67/0.98 % set(auto2) -> clear(echo_input).
% 0.67/0.98 % set(auto2) -> set(quiet).
% 0.67/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.67/0.98 % set(auto2) -> clear(print_given).
% 0.67/0.98 assign(lrs_ticks,-1).
% 0.67/0.98 assign(sos_limit,10000).
% 0.67/0.98 assign(order,kbo).
% 0.67/0.98 set(lex_order_vars).
% 0.67/0.98 clear(print_given).
% 0.67/0.98
% 0.67/0.98 % formulas(sos). % not echoed (23 formulas)
% 0.67/0.98
% 0.67/0.98 ============================== end of input ==========================
% 0.67/0.98
% 0.67/0.98 % From the command line: assign(max_seconds, 300).
% 0.67/0.98
% 0.67/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.67/0.98
% 0.67/0.98 % Formulas that are not ordinary clauses:
% 0.67/0.98
% 0.67/0.98 ============================== end of process non-clausal formulas ===
% 0.67/0.98
% 0.67/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.67/0.98
% 0.67/0.98 ============================== PREDICATE ELIMINATION =================
% 0.67/0.98
% 0.67/0.98 ============================== end predicate elimination =============
% 0.67/0.98
% 0.67/0.98 Auto_denials:
% 0.67/0.98 % copying label prove_left_alternative to answer in negative clause
% 0.67/0.98
% 0.67/0.98 Term ordering decisions:
% 0.67/0.98
% 0.67/0.98 % Assigning unary symbol additive_inverse kb_weight 0 and highest precedence (9).
% 0.67/0.98 Function symbol KB weights: additive_identity=1. x=1. y=1. multiply=1. add=1. commutator=1. associator=1. additive_inverse=0.
% 0.67/0.98
% 0.67/0.98 ============================== PROOF =================================
% 0.67/0.98 % SZS status Unsatisfiable
% 0.67/0.98 % SZS output start Refutation
% 0.67/0.98
% 0.67/0.98 % Proof 1 at 0.01 (+ 0.00) seconds: prove_left_alternative.
% 0.67/0.98 % Length of proof is 14.
% 0.67/0.98 % Level of proof is 4.
% 0.67/0.98 % Maximum clause weight is 17.000.
% 0.67/0.98 % Given clauses 0.
% 0.67/0.98
% 0.67/0.98 4 multiply(A,additive_identity) = additive_identity # label(right_multiplicative_zero) # label(axiom). [assumption].
% 0.67/0.98 7 add(A,additive_inverse(A)) = additive_identity # label(right_additive_inverse) # label(axiom). [assumption].
% 0.67/0.98 8 add(A,B) = add(B,A) # label(commutativity_for_addition) # label(axiom). [assumption].
% 0.67/0.98 10 multiply(additive_inverse(A),B) = additive_inverse(multiply(A,B)) # label(inverse_product1) # label(axiom). [assumption].
% 0.67/0.98 11 additive_inverse(multiply(A,B)) = multiply(additive_inverse(A),B). [copy(10),flip(a)].
% 0.67/0.98 12 multiply(A,additive_inverse(B)) = additive_inverse(multiply(A,B)) # label(inverse_product2) # label(axiom). [assumption].
% 0.67/0.98 13 multiply(additive_inverse(A),B) = multiply(A,additive_inverse(B)). [copy(12),rewrite([11(4)]),flip(a)].
% 0.67/0.98 17 multiply(multiply(A,A),B) = multiply(A,multiply(A,B)) # label(left_alternative) # label(axiom). [assumption].
% 0.67/0.98 20 multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)) # label(distribute1) # label(axiom). [assumption].
% 0.67/0.98 21 add(multiply(A,B),multiply(A,C)) = multiply(A,add(B,C)). [copy(20),flip(a)].
% 0.67/0.98 30 associator(A,B,C) = add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) # label(associator) # label(axiom). [assumption].
% 0.67/0.98 31 associator(A,B,C) = add(multiply(A,multiply(B,additive_inverse(C))),multiply(multiply(A,B),C)). [copy(30),rewrite([11(6),13(6),11(5),13(5),8(7)])].
% 0.67/0.98 32 associator(x,x,y) != additive_identity # label(prove_left_alternative) # label(negated_conjecture) # answer(prove_left_alternative). [assumption].
% 0.67/0.98 33 $F # answer(prove_left_alternative). [copy(32),rewrite([31(4),17(11),8(12),21(12),21(9),7(6),4(4),4(3)]),xx(a)].
% 0.67/0.98
% 0.67/0.98 % SZS output end Refutation
% 0.67/0.98 ============================== end of proof ==========================
% 0.67/0.98
% 0.67/0.98 ============================== STATISTICS ============================
% 0.67/0.98
% 0.67/0.98 Given=0. Generated=23. Kept=20. proofs=1.
% 0.67/0.98 Usable=0. Sos=0. Demods=20. Limbo=20, Disabled=23. Hints=0.
% 0.67/0.98 Megabytes=0.04.
% 0.67/0.98 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.67/0.98
% 0.67/0.98 ============================== end of statistics =====================
% 0.67/0.98
% 0.67/0.98 ============================== end of search =========================
% 0.67/0.98
% 0.67/0.98 THEOREM PROVED
% 0.67/0.98 % SZS status Unsatisfiable
% 0.67/0.98
% 0.67/0.98 Exiting with 1 proof.
% 0.67/0.98
% 0.67/0.98 Process 19205 exit (max_proofs) Mon May 30 21:46:26 2022
% 0.67/0.98 Prover9 interrupted
%------------------------------------------------------------------------------