TSTP Solution File: GRP527-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP527-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n004.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:28 EDT 2022
% Result : Unsatisfiable 0.74s 1.00s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP527-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n004.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 11:34:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.74/1.00 ============================== Prover9 ===============================
% 0.74/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.00 Process 23717 was started by sandbox on n004.cluster.edu,
% 0.74/1.00 Tue Jun 14 11:34:09 2022
% 0.74/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_23564_n004.cluster.edu".
% 0.74/1.00 ============================== end of head ===========================
% 0.74/1.00
% 0.74/1.00 ============================== INPUT =================================
% 0.74/1.00
% 0.74/1.00 % Reading from file /tmp/Prover9_23564_n004.cluster.edu
% 0.74/1.00
% 0.74/1.00 set(prolog_style_variables).
% 0.74/1.00 set(auto2).
% 0.74/1.00 % set(auto2) -> set(auto).
% 0.74/1.00 % set(auto) -> set(auto_inference).
% 0.74/1.00 % set(auto) -> set(auto_setup).
% 0.74/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.00 % set(auto) -> set(auto_limits).
% 0.74/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.00 % set(auto) -> set(auto_denials).
% 0.74/1.00 % set(auto) -> set(auto_process).
% 0.74/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.00 % set(auto2) -> assign(stats, some).
% 0.74/1.00 % set(auto2) -> clear(echo_input).
% 0.74/1.00 % set(auto2) -> set(quiet).
% 0.74/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.00 % set(auto2) -> clear(print_given).
% 0.74/1.00 assign(lrs_ticks,-1).
% 0.74/1.00 assign(sos_limit,10000).
% 0.74/1.00 assign(order,kbo).
% 0.74/1.00 set(lex_order_vars).
% 0.74/1.00 clear(print_given).
% 0.74/1.00
% 0.74/1.00 % formulas(sos). % not echoed (4 formulas)
% 0.74/1.00
% 0.74/1.00 ============================== end of input ==========================
% 0.74/1.00
% 0.74/1.00 % From the command line: assign(max_seconds, 300).
% 0.74/1.00
% 0.74/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.00
% 0.74/1.00 % Formulas that are not ordinary clauses:
% 0.74/1.00
% 0.74/1.00 ============================== end of process non-clausal formulas ===
% 0.74/1.00
% 0.74/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.00
% 0.74/1.00 ============================== PREDICATE ELIMINATION =================
% 0.74/1.00
% 0.74/1.00 ============================== end predicate elimination =============
% 0.74/1.00
% 0.74/1.00 Auto_denials:
% 0.74/1.00 % copying label prove_these_axioms_3 to answer in negative clause
% 0.74/1.00
% 0.74/1.00 Term ordering decisions:
% 0.74/1.00
% 0.74/1.00 % Assigning unary symbol inverse kb_weight 0 and highest precedence (7).
% 0.74/1.00 Function symbol KB weights: a3=1. b3=1. c3=1. divide=1. multiply=1. inverse=0.
% 0.74/1.00
% 0.74/1.00 ============================== end of process initial clauses ========
% 0.74/1.00
% 0.74/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.00
% 0.74/1.00 ============================== end of clauses for search =============
% 0.74/1.00
% 0.74/1.00 ============================== SEARCH ================================
% 0.74/1.00
% 0.74/1.00 % Starting search at 0.01 seconds.
% 0.74/1.00
% 0.74/1.00 ============================== PROOF =================================
% 0.74/1.00 % SZS status Unsatisfiable
% 0.74/1.00 % SZS output start Refutation
% 0.74/1.00
% 0.74/1.00 % Proof 1 at 0.01 (+ 0.00) seconds: prove_these_axioms_3.
% 0.74/1.00 % Length of proof is 21.
% 0.74/1.00 % Level of proof is 10.
% 0.74/1.00 % Maximum clause weight is 15.000.
% 0.74/1.00 % Given clauses 15.
% 0.74/1.00
% 0.74/1.00 1 inverse(A) = divide(divide(B,B),A) # label(inverse) # label(axiom). [assumption].
% 0.74/1.00 2 divide(divide(A,A),B) = inverse(B). [copy(1),flip(a)].
% 0.74/1.00 3 divide(A,divide(divide(A,B),divide(C,B))) = C # label(single_axiom) # label(axiom). [assumption].
% 0.74/1.00 4 multiply(A,B) = divide(A,divide(divide(C,C),B)) # label(multiply) # label(axiom). [assumption].
% 0.74/1.00 5 multiply(A,B) = divide(A,inverse(B)). [copy(4),rewrite([2(3)])].
% 0.74/1.00 6 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.74/1.00 7 divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))) # answer(prove_these_axioms_3). [copy(6),rewrite([5(3),5(6),5(11),5(13)])].
% 0.74/1.00 9 inverse(divide(inverse(A),divide(B,A))) = B. [para(3(a,1),2(a,1)),rewrite([2(2)]),flip(a)].
% 0.74/1.00 11 divide(A,inverse(divide(B,A))) = B. [para(2(a,1),3(a,1,2))].
% 0.74/1.00 14 divide(divide(A,divide(B,C)),C) = divide(A,B). [para(3(a,1),3(a,1,2)),flip(a)].
% 0.74/1.00 19 divide(A,inverse(inverse(A))) = divide(B,B). [para(2(a,1),11(a,1,2,1))].
% 0.74/1.00 26 divide(A,inverse(inverse(A))) = c_0. [new_symbol(19)].
% 0.74/1.00 28 divide(A,A) = c_0. [back_rewrite(19),rewrite([26(3)]),flip(a)].
% 0.74/1.00 38 divide(A,divide(divide(A,B),c_0)) = B. [para(28(a,1),3(a,1,2,2))].
% 0.74/1.00 39 divide(A,c_0) = A. [para(28(a,1),3(a,1,2))].
% 0.74/1.00 40 divide(A,divide(A,B)) = B. [back_rewrite(38),rewrite([39(3)])].
% 0.74/1.00 44 divide(divide(A,B),A) = inverse(B). [para(9(a,1),11(a,1,2))].
% 0.74/1.00 51 inverse(divide(A,B)) = divide(B,A). [para(11(a,1),40(a,1,2)),flip(a)].
% 0.74/1.00 53 divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)) # answer(prove_these_axioms_3). [back_rewrite(7),rewrite([51(13)])].
% 0.74/1.00 56 divide(divide(A,inverse(B)),C) = divide(A,divide(C,B)). [para(44(a,1),14(a,1,1,2))].
% 0.74/1.00 57 $F # answer(prove_these_axioms_3). [resolve(56,a,53,a)].
% 0.74/1.00
% 0.74/1.00 % SZS output end Refutation
% 0.74/1.00 ============================== end of proof ==========================
% 0.74/1.00
% 0.74/1.00 ============================== STATISTICS ============================
% 0.74/1.00
% 0.74/1.00 Given=15. Generated=159. Kept=53. proofs=1.
% 0.74/1.00 Usable=9. Sos=7. Demods=17. Limbo=2, Disabled=38. Hints=0.
% 0.74/1.00 Megabytes=0.06.
% 0.74/1.00 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.74/1.00
% 0.74/1.00 ============================== end of statistics =====================
% 0.74/1.00
% 0.74/1.00 ============================== end of search =========================
% 0.74/1.00
% 0.74/1.00 THEOREM PROVED
% 0.74/1.00 % SZS status Unsatisfiable
% 0.74/1.00
% 0.74/1.00 Exiting with 1 proof.
% 0.74/1.00
% 0.74/1.00 Process 23717 exit (max_proofs) Tue Jun 14 11:34:09 2022
% 0.74/1.00 Prover9 interrupted
%------------------------------------------------------------------------------