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