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