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