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