TSTP Solution File: GRP467-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP467-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n016.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:13 EDT 2022
% Result : Unsatisfiable 0.69s 0.98s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP467-1 : TPTP v8.1.0. Released v2.6.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n016.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 : Tue Jun 14 02:25:30 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.69/0.98 ============================== Prover9 ===============================
% 0.69/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.69/0.98 Process 15454 was started by sandbox on n016.cluster.edu,
% 0.69/0.98 Tue Jun 14 02:25:31 2022
% 0.69/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_15301_n016.cluster.edu".
% 0.69/0.98 ============================== end of head ===========================
% 0.69/0.98
% 0.69/0.98 ============================== INPUT =================================
% 0.69/0.98
% 0.69/0.98 % Reading from file /tmp/Prover9_15301_n016.cluster.edu
% 0.69/0.98
% 0.69/0.98 set(prolog_style_variables).
% 0.69/0.98 set(auto2).
% 0.69/0.98 % set(auto2) -> set(auto).
% 0.69/0.98 % set(auto) -> set(auto_inference).
% 0.69/0.98 % set(auto) -> set(auto_setup).
% 0.69/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.69/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/0.98 % set(auto) -> set(auto_limits).
% 0.69/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/0.98 % set(auto) -> set(auto_denials).
% 0.69/0.98 % set(auto) -> set(auto_process).
% 0.69/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.69/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.69/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.69/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.69/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.69/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.69/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.69/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.69/0.98 % set(auto2) -> assign(stats, some).
% 0.69/0.98 % set(auto2) -> clear(echo_input).
% 0.69/0.98 % set(auto2) -> set(quiet).
% 0.69/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.69/0.98 % set(auto2) -> clear(print_given).
% 0.69/0.98 assign(lrs_ticks,-1).
% 0.69/0.98 assign(sos_limit,10000).
% 0.69/0.98 assign(order,kbo).
% 0.69/0.98 set(lex_order_vars).
% 0.69/0.98 clear(print_given).
% 0.69/0.98
% 0.69/0.98 % formulas(sos). % not echoed (3 formulas)
% 0.69/0.98
% 0.69/0.98 ============================== end of input ==========================
% 0.69/0.98
% 0.69/0.98 % From the command line: assign(max_seconds, 300).
% 0.69/0.98
% 0.69/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/0.98
% 0.69/0.98 % Formulas that are not ordinary clauses:
% 0.69/0.98
% 0.69/0.98 ============================== end of process non-clausal formulas ===
% 0.69/0.98
% 0.69/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/0.98
% 0.69/0.98 ============================== PREDICATE ELIMINATION =================
% 0.69/0.98
% 0.69/0.98 ============================== end predicate elimination =============
% 0.69/0.98
% 0.69/0.98 Auto_denials:
% 0.69/0.98 % copying label prove_these_axioms_2 to answer in negative clause
% 0.69/0.98
% 0.69/0.98 Term ordering decisions:
% 0.69/0.98
% 0.69/0.98 % Assigning unary symbol inverse kb_weight 0 and highest precedence (6).
% 0.69/0.98 Function symbol KB weights: a2=1. b2=1. divide=1. multiply=1. inverse=0.
% 0.69/0.98
% 0.69/0.98 ============================== end of process initial clauses ========
% 0.69/0.98
% 0.69/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.69/0.98
% 0.69/0.98 ============================== end of clauses for search =============
% 0.69/0.98
% 0.69/0.98 ============================== SEARCH ================================
% 0.69/0.98
% 0.69/0.98 % Starting search at 0.01 seconds.
% 0.69/0.98
% 0.69/0.98 ============================== PROOF =================================
% 0.69/0.98 % SZS status Unsatisfiable
% 0.69/0.98 % SZS output start Refutation
% 0.69/0.98
% 0.69/0.98 % Proof 1 at 0.02 (+ 0.00) seconds: prove_these_axioms_2.
% 0.69/0.98 % Length of proof is 17.
% 0.69/0.98 % Level of proof is 8.
% 0.69/0.98 % Maximum clause weight is 30.000.
% 0.69/0.98 % Given clauses 12.
% 0.69/0.98
% 0.69/0.98 1 multiply(A,B) = divide(A,inverse(B)) # label(multiply) # label(axiom). [assumption].
% 0.69/0.98 2 divide(divide(A,A),divide(B,divide(divide(C,divide(D,B)),inverse(D)))) = C # label(single_axiom) # label(axiom). [assumption].
% 0.69/0.98 3 multiply(multiply(inverse(b2),b2),a2) != a2 # label(prove_these_axioms_2) # label(negated_conjecture) # answer(prove_these_axioms_2). [assumption].
% 0.69/0.98 4 divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2 # answer(prove_these_axioms_2). [copy(3),rewrite([1(4),1(7)])].
% 0.69/0.98 6 divide(divide(A,A),divide(divide(divide(B,divide(C,D)),inverse(C)),divide(B,inverse(D)))) = divide(E,E). [para(2(a,1),2(a,1,2,2,1))].
% 0.69/0.98 14 divide(inverse(A),inverse(A)) = divide(divide(B,B),divide(divide(divide(C,divide(D,E)),inverse(D)),divide(C,inverse(E)))). [para(6(a,2),1(a,2)),rewrite([1(2)])].
% 0.69/0.98 18 divide(divide(A,A),divide(B,divide(divide(divide(C,C),divide(divide(divide(D,divide(E,F)),inverse(E)),divide(D,inverse(F)))),inverse(V6)))) = divide(V6,B). [para(6(a,2),2(a,1,2,2,1))].
% 0.69/0.98 31 divide(A,A) = divide(B,B). [para(6(a,1),6(a,1))].
% 0.69/0.98 37 divide(A,A) = c_0. [new_symbol(31)].
% 0.69/0.98 55 divide(c_0,divide(A,divide(divide(c_0,divide(divide(divide(B,divide(C,D)),inverse(C)),divide(B,inverse(D)))),inverse(E)))) = divide(E,A). [back_rewrite(18),rewrite([37(1),37(2)])].
% 0.69/0.98 59 divide(c_0,divide(divide(divide(A,divide(B,C)),inverse(B)),divide(A,inverse(C)))) = c_0. [back_rewrite(14),rewrite([37(3),37(2)]),flip(a)].
% 0.69/0.98 68 divide(c_0,inverse(a2)) != a2 # answer(prove_these_axioms_2). [back_rewrite(4),rewrite([37(5)])].
% 0.69/0.98 69 divide(c_0,divide(A,divide(divide(B,divide(C,A)),inverse(C)))) = B. [back_rewrite(2),rewrite([37(1)])].
% 0.69/0.98 71 divide(c_0,divide(A,divide(c_0,inverse(B)))) = divide(B,A). [back_rewrite(55),rewrite([59(10)])].
% 0.69/0.98 80 divide(A,divide(c_0,inverse(A))) = c_0. [para(37(a,1),71(a,1,2)),rewrite([37(3)]),flip(a)].
% 0.69/0.98 110 divide(c_0,inverse(A)) = A. [para(80(a,1),69(a,1,2,2,1)),rewrite([71(8)])].
% 0.69/0.98 111 $F # answer(prove_these_axioms_2). [resolve(110,a,68,a)].
% 0.69/0.98
% 0.69/0.98 % SZS output end Refutation
% 0.69/0.98 ============================== end of proof ==========================
% 0.69/0.98
% 0.69/0.98 ============================== STATISTICS ============================
% 0.69/0.98
% 0.69/0.98 Given=12. Generated=169. Kept=109. proofs=1.
% 0.69/0.98 Usable=8. Sos=35. Demods=49. Limbo=7, Disabled=61. Hints=0.
% 0.69/0.98 Megabytes=0.23.
% 0.69/0.98 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.69/0.98
% 0.69/0.98 ============================== end of statistics =====================
% 0.69/0.98
% 0.69/0.98 ============================== end of search =========================
% 0.69/0.98
% 0.69/0.98 THEOREM PROVED
% 0.69/0.98 % SZS status Unsatisfiable
% 0.69/0.98
% 0.69/0.98 Exiting with 1 proof.
% 0.69/0.98
% 0.69/0.98 Process 15454 exit (max_proofs) Tue Jun 14 02:25:31 2022
% 0.69/0.98 Prover9 interrupted
%------------------------------------------------------------------------------