TSTP Solution File: GRP595-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP595-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n005.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 : Sat Jul 16 11:19:46 EDT 2022
% Result : Unsatisfiable 0.75s 1.03s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP595-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n005.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 Jun 13 11:59:39 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.75/1.03 ============================== Prover9 ===============================
% 0.75/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.03 Process 5643 was started by sandbox on n005.cluster.edu,
% 0.75/1.03 Mon Jun 13 11:59:39 2022
% 0.75/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5286_n005.cluster.edu".
% 0.75/1.03 ============================== end of head ===========================
% 0.75/1.03
% 0.75/1.03 ============================== INPUT =================================
% 0.75/1.03
% 0.75/1.03 % Reading from file /tmp/Prover9_5286_n005.cluster.edu
% 0.75/1.03
% 0.75/1.03 set(prolog_style_variables).
% 0.75/1.03 set(auto2).
% 0.75/1.03 % set(auto2) -> set(auto).
% 0.75/1.03 % set(auto) -> set(auto_inference).
% 0.75/1.03 % set(auto) -> set(auto_setup).
% 0.75/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.03 % set(auto) -> set(auto_limits).
% 0.75/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.03 % set(auto) -> set(auto_denials).
% 0.75/1.03 % set(auto) -> set(auto_process).
% 0.75/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.03 % set(auto2) -> assign(stats, some).
% 0.75/1.03 % set(auto2) -> clear(echo_input).
% 0.75/1.03 % set(auto2) -> set(quiet).
% 0.75/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.03 % set(auto2) -> clear(print_given).
% 0.75/1.03 assign(lrs_ticks,-1).
% 0.75/1.03 assign(sos_limit,10000).
% 0.75/1.03 assign(order,kbo).
% 0.75/1.03 set(lex_order_vars).
% 0.75/1.03 clear(print_given).
% 0.75/1.03
% 0.75/1.03 % formulas(sos). % not echoed (3 formulas)
% 0.75/1.03
% 0.75/1.03 ============================== end of input ==========================
% 0.75/1.03
% 0.75/1.03 % From the command line: assign(max_seconds, 300).
% 0.75/1.03
% 0.75/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.03
% 0.75/1.03 % Formulas that are not ordinary clauses:
% 0.75/1.03
% 0.75/1.03 ============================== end of process non-clausal formulas ===
% 0.75/1.03
% 0.75/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.03
% 0.75/1.03 ============================== PREDICATE ELIMINATION =================
% 0.75/1.03
% 0.75/1.03 ============================== end predicate elimination =============
% 0.75/1.03
% 0.75/1.03 Auto_denials:
% 0.75/1.03 % copying label prove_these_axioms_3 to answer in negative clause
% 0.75/1.03
% 0.75/1.03 Term ordering decisions:
% 0.75/1.03
% 0.75/1.03 % Assigning unary symbol inverse kb_weight 0 and highest precedence (7).
% 0.75/1.03 Function symbol KB weights: a3=1. b3=1. c3=1. double_divide=1. multiply=1. inverse=0.
% 0.75/1.03
% 0.75/1.03 ============================== end of process initial clauses ========
% 0.75/1.03
% 0.75/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.03
% 0.75/1.03 ============================== end of clauses for search =============
% 0.75/1.03
% 0.75/1.03 ============================== SEARCH ================================
% 0.75/1.03
% 0.75/1.03 % Starting search at 0.01 seconds.
% 0.75/1.03
% 0.75/1.03 ============================== PROOF =================================
% 0.75/1.03 % SZS status Unsatisfiable
% 0.75/1.03 % SZS output start Refutation
% 0.75/1.03
% 0.75/1.03 % Proof 1 at 0.04 (+ 0.00) seconds: prove_these_axioms_3.
% 0.75/1.03 % Length of proof is 25.
% 0.75/1.03 % Level of proof is 11.
% 0.75/1.03 % Maximum clause weight is 29.000.
% 0.75/1.03 % Given clauses 11.
% 0.75/1.03
% 0.75/1.03 1 multiply(A,B) = inverse(double_divide(B,A)) # label(multiply) # label(axiom). [assumption].
% 0.75/1.03 2 inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(C,B)))))) = C # label(single_axiom) # label(axiom). [assumption].
% 0.75/1.03 3 multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) # label(prove_these_axioms_3) # label(negated_conjecture) # answer(prove_these_axioms_3). [assumption].
% 0.75/1.03 4 inverse(double_divide(inverse(double_divide(c3,b3)),a3)) != inverse(double_divide(c3,inverse(double_divide(b3,a3)))) # answer(prove_these_axioms_3). [copy(3),rewrite([1(3),1(6),1(11),1(13)]),flip(a)].
% 0.75/1.03 5 inverse(double_divide(double_divide(A,inverse(double_divide(B,inverse(double_divide(C,D))))),inverse(double_divide(A,C)))) = double_divide(B,D). [para(2(a,1),2(a,1,1,2,1,2))].
% 0.75/1.03 6 inverse(double_divide(double_divide(double_divide(A,B),inverse(double_divide(C,B))),C)) = A. [para(2(a,1),2(a,1,1,2))].
% 0.75/1.03 7 inverse(double_divide(double_divide(A,inverse(double_divide(B,C))),inverse(double_divide(A,double_divide(D,E))))) = double_divide(B,inverse(double_divide(D,inverse(double_divide(C,E))))). [para(5(a,1),2(a,1,1,2,1,2))].
% 0.75/1.03 16 double_divide(inverse(double_divide(double_divide(A,inverse(double_divide(B,C))),B)),C) = A. [para(6(a,1),5(a,1)),flip(a)].
% 0.75/1.03 21 inverse(double_divide(double_divide(inverse(double_divide(double_divide(A,inverse(double_divide(B,inverse(double_divide(C,D))))),B)),D),inverse(A))) = C. [para(16(a,1),2(a,1,1,2,1))].
% 0.75/1.03 28 double_divide(double_divide(inverse(double_divide(A,B)),C),inverse(double_divide(B,C))) = A. [para(5(a,1),16(a,1,1))].
% 0.75/1.03 33 inverse(double_divide(double_divide(A,inverse(double_divide(B,inverse(double_divide(C,D))))),B)) = double_divide(inverse(double_divide(A,C)),D). [para(16(a,1),16(a,1,1,1,1)),flip(a)].
% 0.75/1.03 36 inverse(double_divide(double_divide(double_divide(inverse(double_divide(A,B)),C),C),inverse(A))) = B. [back_rewrite(21),rewrite([33(7)])].
% 0.75/1.03 38 inverse(double_divide(double_divide(A,inverse(double_divide(B,C))),inverse(double_divide(A,inverse(D))))) = double_divide(inverse(double_divide(D,B)),C). [para(28(a,1),2(a,1,1,2,1,2,1))].
% 0.75/1.03 58 inverse(double_divide(double_divide(double_divide(double_divide(inverse(double_divide(A,B)),C),C),inverse(double_divide(D,inverse(double_divide(inverse(A),E))))),B)) = double_divide(D,E). [para(36(a,1),5(a,1,1,2))].
% 0.75/1.03 63 double_divide(inverse(double_divide(A,B)),inverse(double_divide(inverse(A),C))) = double_divide(B,C). [para(36(a,1),16(a,1,1)),flip(a)].
% 0.75/1.03 71 double_divide(A,inverse(double_divide(B,inverse(double_divide(inverse(double_divide(double_divide(B,C),D)),C))))) = double_divide(A,D). [para(7(a,1),5(a,1))].
% 0.75/1.03 85 inverse(double_divide(double_divide(A,B),inverse(double_divide(A,double_divide(C,D))))) = double_divide(double_divide(double_divide(inverse(double_divide(E,B)),F),F),inverse(double_divide(C,inverse(double_divide(inverse(E),D))))). [para(36(a,1),7(a,1,1,1,2))].
% 0.75/1.03 88 double_divide(inverse(double_divide(double_divide(A,B),inverse(C))),B) = inverse(double_divide(C,A)). [para(63(a,1),2(a,1,1,2,1,2,1)),rewrite([38(10)])].
% 0.75/1.03 89 double_divide(inverse(double_divide(A,inverse(double_divide(B,C)))),D) = double_divide(B,inverse(double_divide(inverse(double_divide(A,C)),D))). [para(2(a,1),63(a,1,1)),flip(a)].
% 0.75/1.03 133 inverse(double_divide(A,double_divide(B,C))) = double_divide(B,inverse(double_divide(inverse(A),C))). [para(6(a,1),88(a,1,1)),flip(a)].
% 0.75/1.03 134 double_divide(double_divide(A,B),B) = A. [para(6(a,1),88(a,2)),rewrite([89(9),89(7),71(9)])].
% 0.75/1.03 165 double_divide(inverse(double_divide(A,B)),inverse(double_divide(C,inverse(double_divide(inverse(A),D))))) = double_divide(C,inverse(double_divide(B,D))). [back_rewrite(85),rewrite([133(4),133(7),63(6),134(7)]),flip(a)].
% 0.75/1.03 199 inverse(double_divide(double_divide(A,inverse(double_divide(B,C))),B)) = double_divide(A,C). [back_rewrite(58),rewrite([134(4),165(8)])].
% 0.75/1.03 225 double_divide(inverse(double_divide(A,B)),C) = double_divide(A,inverse(double_divide(B,C))). [back_rewrite(33),rewrite([199(7)]),flip(a)].
% 0.75/1.03 282 $F # answer(prove_these_axioms_3). [back_rewrite(4),rewrite([225(6)]),xx(a)].
% 0.75/1.03
% 0.75/1.03 % SZS output end Refutation
% 0.75/1.03 ============================== end of proof ==========================
% 0.75/1.03
% 0.75/1.03 ============================== STATISTICS ============================
% 0.75/1.03
% 0.75/1.03 Given=11. Generated=447. Kept=280. proofs=1.
% 0.75/1.03 Usable=1. Sos=31. Demods=75. Limbo=57, Disabled=194. Hints=0.
% 0.75/1.03 Megabytes=0.33.
% 0.75/1.03 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.75/1.03
% 0.75/1.03 ============================== end of statistics =====================
% 0.75/1.03
% 0.75/1.03 ============================== end of search =========================
% 0.75/1.03
% 0.75/1.03 THEOREM PROVED
% 0.75/1.03 % SZS status Unsatisfiable
% 0.75/1.03
% 0.75/1.03 Exiting with 1 proof.
% 0.75/1.03
% 0.75/1.03 Process 5643 exit (max_proofs) Mon Jun 13 11:59:39 2022
% 0.75/1.03 Prover9 interrupted
%------------------------------------------------------------------------------