TSTP Solution File: GRP068-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP068-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:17:01 EDT 2022
% Result : Unsatisfiable 0.47s 1.07s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP068-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 0.07/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 10:55:24 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.47/1.07 ============================== Prover9 ===============================
% 0.47/1.07 Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.07 Process 27550 was started by sandbox on n025.cluster.edu,
% 0.47/1.07 Tue Jun 14 10:55:25 2022
% 0.47/1.07 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_27397_n025.cluster.edu".
% 0.47/1.07 ============================== end of head ===========================
% 0.47/1.07
% 0.47/1.07 ============================== INPUT =================================
% 0.47/1.07
% 0.47/1.07 % Reading from file /tmp/Prover9_27397_n025.cluster.edu
% 0.47/1.07
% 0.47/1.07 set(prolog_style_variables).
% 0.47/1.07 set(auto2).
% 0.47/1.07 % set(auto2) -> set(auto).
% 0.47/1.07 % set(auto) -> set(auto_inference).
% 0.47/1.07 % set(auto) -> set(auto_setup).
% 0.47/1.07 % set(auto_setup) -> set(predicate_elim).
% 0.47/1.07 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.07 % set(auto) -> set(auto_limits).
% 0.47/1.07 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.07 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.07 % set(auto) -> set(auto_denials).
% 0.47/1.07 % set(auto) -> set(auto_process).
% 0.47/1.07 % set(auto2) -> assign(new_constants, 1).
% 0.47/1.07 % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.07 % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.07 % set(auto2) -> assign(max_hours, 1).
% 0.47/1.07 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.07 % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.07 % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.07 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.07 % set(auto2) -> set(sort_initial_sos).
% 0.47/1.07 % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.07 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.07 % set(auto2) -> assign(max_megs, 400).
% 0.47/1.07 % set(auto2) -> assign(stats, some).
% 0.47/1.07 % set(auto2) -> clear(echo_input).
% 0.47/1.07 % set(auto2) -> set(quiet).
% 0.47/1.07 % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.07 % set(auto2) -> clear(print_given).
% 0.47/1.07 assign(lrs_ticks,-1).
% 0.47/1.07 assign(sos_limit,10000).
% 0.47/1.07 assign(order,kbo).
% 0.47/1.07 set(lex_order_vars).
% 0.47/1.07 clear(print_given).
% 0.47/1.07
% 0.47/1.07 % formulas(sos). % not echoed (5 formulas)
% 0.47/1.07
% 0.47/1.07 ============================== end of input ==========================
% 0.47/1.07
% 0.47/1.07 % From the command line: assign(max_seconds, 300).
% 0.47/1.07
% 0.47/1.07 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.07
% 0.47/1.07 % Formulas that are not ordinary clauses:
% 0.47/1.07
% 0.47/1.07 ============================== end of process non-clausal formulas ===
% 0.47/1.07
% 0.47/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.07
% 0.47/1.07 ============================== PREDICATE ELIMINATION =================
% 0.47/1.07
% 0.47/1.07 ============================== end predicate elimination =============
% 0.47/1.07
% 0.47/1.07 Auto_denials:
% 0.47/1.07 % copying label prove_these_axioms to answer in negative clause
% 0.47/1.07
% 0.47/1.07 Term ordering decisions:
% 0.47/1.07
% 0.47/1.07 % Assigning unary symbol inverse kb_weight 0 and highest precedence (10).
% 0.47/1.07 Function symbol KB weights: identity=1. a1=1. a2=1. a3=1. b3=1. c3=1. divide=1. multiply=1. inverse=0.
% 0.47/1.07
% 0.47/1.07 ============================== end of process initial clauses ========
% 0.47/1.07
% 0.47/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.47/1.07
% 0.47/1.07 ============================== end of clauses for search =============
% 0.47/1.07
% 0.47/1.07 ============================== SEARCH ================================
% 0.47/1.07
% 0.47/1.07 % Starting search at 0.01 seconds.
% 0.47/1.07
% 0.47/1.07 ============================== PROOF =================================
% 0.47/1.07 % SZS status Unsatisfiable
% 0.47/1.07 % SZS output start Refutation
% 0.47/1.07
% 0.47/1.07 % Proof 1 at 0.03 (+ 0.01) seconds: prove_these_axioms.
% 0.47/1.07 % Length of proof is 31.
% 0.47/1.07 % Level of proof is 15.
% 0.47/1.07 % Maximum clause weight is 26.000.
% 0.47/1.07 % Given clauses 30.
% 0.47/1.07
% 0.47/1.07 1 identity = divide(A,A) # label(identity) # label(axiom). [assumption].
% 0.47/1.07 2 divide(A,A) = identity. [copy(1),flip(a)].
% 0.47/1.07 3 inverse(A) = divide(identity,A) # label(inverse) # label(axiom). [assumption].
% 0.47/1.07 4 multiply(A,B) = divide(A,divide(identity,B)) # label(multiply) # label(axiom). [assumption].
% 0.47/1.07 5 divide(A,divide(divide(divide(identity,B),C),divide(divide(divide(A,A),A),C))) = B # label(single_axiom) # label(axiom). [assumption].
% 0.47/1.07 6 divide(A,divide(divide(divide(identity,B),C),divide(divide(identity,A),C))) = B. [copy(5),rewrite([2(4)])].
% 0.47/1.07 7 multiply(inverse(a1),a1) != identity | multiply(identity,a2) != a2 | multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) # label(prove_these_axioms) # label(negated_conjecture) # answer(prove_these_axioms). [assumption].
% 0.47/1.07 8 divide(identity,divide(identity,a2)) != a2 | divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))) # answer(prove_these_axioms). [copy(7),rewrite([3(2),4(5),2(7),4(6),4(13),4(17),4(23),4(26)]),xx(a)].
% 0.47/1.07 9 divide(A,divide(divide(identity,B),divide(divide(identity,A),B))) = identity. [para(2(a,1),6(a,1,2,1,1))].
% 0.47/1.07 10 divide(A,divide(identity,divide(divide(identity,A),divide(identity,B)))) = B. [para(2(a,1),6(a,1,2,1))].
% 0.47/1.07 12 divide(A,divide(divide(divide(identity,B),divide(identity,A)),identity)) = B. [para(2(a,1),6(a,1,2,2))].
% 0.47/1.07 13 divide(A,identity) = A. [para(2(a,1),6(a,1,2))].
% 0.47/1.07 18 divide(A,divide(divide(identity,B),divide(identity,A))) = B. [back_rewrite(12),rewrite([13(7)])].
% 0.47/1.07 19 divide(A,divide(identity,divide(identity,A))) = identity. [para(2(a,1),9(a,1,2,1)),rewrite([13(5)])].
% 0.47/1.07 24 divide(A,divide(divide(identity,divide(divide(divide(identity,B),C),divide(divide(identity,divide(identity,A)),C))),B)) = identity. [para(6(a,1),9(a,1,2,2))].
% 0.47/1.07 26 divide(identity,divide(identity,A)) = A. [para(19(a,1),6(a,1,2,1)),rewrite([10(12)])].
% 0.47/1.07 29 divide(A,divide(divide(identity,divide(divide(divide(identity,B),C),divide(A,C))),B)) = identity. [back_rewrite(24),rewrite([26(8)])].
% 0.47/1.07 34 divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))) # answer(prove_these_axioms). [back_rewrite(8),rewrite([26(5)]),xx(a)].
% 0.47/1.07 39 divide(A,divide(B,divide(identity,A))) = divide(identity,B). [para(26(a,1),18(a,1,2,1))].
% 0.47/1.07 44 divide(divide(identity,A),divide(B,A)) = divide(identity,B). [para(26(a,1),39(a,1,2,2))].
% 0.47/1.07 46 divide(divide(identity,divide(A,B)),divide(identity,A)) = B. [para(44(a,1),44(a,1,2)),rewrite([26(10)])].
% 0.47/1.07 48 divide(A,divide(divide(A,divide(identity,B)),B)) = identity. [para(2(a,1),29(a,1,2,1,2,1)),rewrite([26(7)])].
% 0.47/1.07 56 divide(A,divide(divide(identity,divide(B,divide(A,divide(identity,C)))),divide(C,B))) = identity. [para(46(a,1),29(a,1,2,1,2,1))].
% 0.47/1.07 63 divide(divide(A,divide(identity,B)),B) = A. [para(48(a,1),46(a,1,1,2)),rewrite([2(3),26(4)]),flip(a)].
% 0.47/1.07 66 divide(identity,divide(A,B)) = divide(B,A). [para(63(a,1),39(a,1,2)),rewrite([26(6)]),flip(a)].
% 0.47/1.07 71 divide(A,divide(divide(divide(A,divide(identity,B)),C),divide(B,C))) = identity. [back_rewrite(56),rewrite([66(6)])].
% 0.47/1.07 77 divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(divide(identity,c3),b3)) # answer(prove_these_axioms). [back_rewrite(34),rewrite([66(17)])].
% 0.47/1.07 107 divide(divide(A,B),divide(divide(A,C),divide(B,C))) = identity. [para(63(a,1),71(a,1,2,1,1)),rewrite([66(4),13(2)])].
% 0.47/1.07 132 divide(divide(A,B),divide(C,B)) = divide(A,C). [para(107(a,1),44(a,1,2)),rewrite([66(5),13(5),66(6)])].
% 0.47/1.07 155 divide(divide(A,divide(identity,B)),C) = divide(A,divide(C,B)). [para(63(a,1),132(a,1,1)),flip(a)].
% 0.47/1.07 156 $F # answer(prove_these_axioms). [resolve(155,a,77,a)].
% 0.47/1.07
% 0.47/1.07 % SZS output end Refutation
% 0.47/1.07 ============================== end of proof ==========================
% 0.47/1.07
% 0.47/1.07 ============================== STATISTICS ============================
% 0.47/1.07
% 0.47/1.07 Given=30. Generated=803. Kept=152. proofs=1.
% 0.47/1.07 Usable=11. Sos=43. Demods=55. Limbo=2, Disabled=100. Hints=0.
% 0.47/1.07 Megabytes=0.17.
% 0.47/1.07 User_CPU=0.03, System_CPU=0.01, Wall_clock=0.
% 0.47/1.07
% 0.47/1.07 ============================== end of statistics =====================
% 0.47/1.07
% 0.47/1.07 ============================== end of search =========================
% 0.47/1.07
% 0.47/1.07 THEOREM PROVED
% 0.47/1.07 % SZS status Unsatisfiable
% 0.47/1.07
% 0.47/1.07 Exiting with 1 proof.
% 0.47/1.07
% 0.47/1.07 Process 27550 exit (max_proofs) Tue Jun 14 10:55:25 2022
% 0.47/1.07 Prover9 interrupted
%------------------------------------------------------------------------------