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