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