TSTP Solution File: GRP559-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP559-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:37 EDT 2022
% Result : Unsatisfiable 0.49s 0.77s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : GRP559-1 : TPTP v8.1.0. Released v2.6.0.
% 0.02/0.09 % Command : tptp2X_and_run_prover9 %d %s
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 600
% 0.09/0.28 % DateTime : Tue Jun 14 03:41:57 EDT 2022
% 0.09/0.28 % CPUTime :
% 0.49/0.77 ============================== Prover9 ===============================
% 0.49/0.77 Prover9 (32) version 2009-11A, November 2009.
% 0.49/0.77 Process 27261 was started by sandbox on n032.cluster.edu,
% 0.49/0.77 Tue Jun 14 03:41:57 2022
% 0.49/0.77 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_26959_n032.cluster.edu".
% 0.49/0.77 ============================== end of head ===========================
% 0.49/0.77
% 0.49/0.77 ============================== INPUT =================================
% 0.49/0.77
% 0.49/0.77 % Reading from file /tmp/Prover9_26959_n032.cluster.edu
% 0.49/0.77
% 0.49/0.77 set(prolog_style_variables).
% 0.49/0.77 set(auto2).
% 0.49/0.77 % set(auto2) -> set(auto).
% 0.49/0.77 % set(auto) -> set(auto_inference).
% 0.49/0.77 % set(auto) -> set(auto_setup).
% 0.49/0.77 % set(auto_setup) -> set(predicate_elim).
% 0.49/0.77 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/0.77 % set(auto) -> set(auto_limits).
% 0.49/0.77 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/0.77 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/0.77 % set(auto) -> set(auto_denials).
% 0.49/0.77 % set(auto) -> set(auto_process).
% 0.49/0.77 % set(auto2) -> assign(new_constants, 1).
% 0.49/0.77 % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/0.77 % set(auto2) -> assign(max_weight, "200.000").
% 0.49/0.77 % set(auto2) -> assign(max_hours, 1).
% 0.49/0.77 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/0.77 % set(auto2) -> assign(max_seconds, 0).
% 0.49/0.77 % set(auto2) -> assign(max_minutes, 5).
% 0.49/0.77 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/0.77 % set(auto2) -> set(sort_initial_sos).
% 0.49/0.77 % set(auto2) -> assign(sos_limit, -1).
% 0.49/0.77 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/0.77 % set(auto2) -> assign(max_megs, 400).
% 0.49/0.77 % set(auto2) -> assign(stats, some).
% 0.49/0.77 % set(auto2) -> clear(echo_input).
% 0.49/0.77 % set(auto2) -> set(quiet).
% 0.49/0.77 % set(auto2) -> clear(print_initial_clauses).
% 0.49/0.77 % set(auto2) -> clear(print_given).
% 0.49/0.77 assign(lrs_ticks,-1).
% 0.49/0.77 assign(sos_limit,10000).
% 0.49/0.77 assign(order,kbo).
% 0.49/0.77 set(lex_order_vars).
% 0.49/0.77 clear(print_given).
% 0.49/0.77
% 0.49/0.77 % formulas(sos). % not echoed (3 formulas)
% 0.49/0.77
% 0.49/0.77 ============================== end of input ==========================
% 0.49/0.77
% 0.49/0.77 % From the command line: assign(max_seconds, 300).
% 0.49/0.77
% 0.49/0.77 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/0.77
% 0.49/0.77 % Formulas that are not ordinary clauses:
% 0.49/0.77
% 0.49/0.77 ============================== end of process non-clausal formulas ===
% 0.49/0.77
% 0.49/0.77 ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/0.77
% 0.49/0.77 ============================== PREDICATE ELIMINATION =================
% 0.49/0.77
% 0.49/0.77 ============================== end predicate elimination =============
% 0.49/0.77
% 0.49/0.77 Auto_denials:
% 0.49/0.77 % copying label prove_these_axioms_3 to answer in negative clause
% 0.49/0.77
% 0.49/0.77 Term ordering decisions:
% 0.49/0.77
% 0.49/0.77 % Assigning unary symbol inverse kb_weight 0 and highest precedence (7).
% 0.49/0.77 Function symbol KB weights: a3=1. b3=1. c3=1. divide=1. multiply=1. inverse=0.
% 0.49/0.77
% 0.49/0.77 ============================== end of process initial clauses ========
% 0.49/0.77
% 0.49/0.77 ============================== CLAUSES FOR SEARCH ====================
% 0.49/0.77
% 0.49/0.77 ============================== end of clauses for search =============
% 0.49/0.77
% 0.49/0.77 ============================== SEARCH ================================
% 0.49/0.77
% 0.49/0.77 % Starting search at 0.01 seconds.
% 0.49/0.77
% 0.49/0.77 ============================== PROOF =================================
% 0.49/0.77 % SZS status Unsatisfiable
% 0.49/0.77 % SZS output start Refutation
% 0.49/0.77
% 0.49/0.77 % Proof 1 at 0.02 (+ 0.00) seconds: prove_these_axioms_3.
% 0.49/0.77 % Length of proof is 36.
% 0.49/0.77 % Level of proof is 17.
% 0.49/0.77 % Maximum clause weight is 17.000.
% 0.49/0.77 % Given clauses 30.
% 0.49/0.77
% 0.49/0.77 1 multiply(A,B) = divide(A,inverse(B)) # label(multiply) # label(axiom). [assumption].
% 0.49/0.77 2 divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B # label(single_axiom) # label(axiom). [assumption].
% 0.49/0.77 3 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.49/0.77 4 divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))) # answer(prove_these_axioms_3). [copy(3),rewrite([1(3),1(6),1(11),1(13)])].
% 0.49/0.77 5 divide(A,inverse(divide(B,divide(A,inverse(divide(divide(B,C),divide(D,C))))))) = D. [para(2(a,1),2(a,1,2,1,1))].
% 0.49/0.77 6 divide(A,inverse(divide(divide(B,inverse(divide(divide(C,D),divide(A,D)))),C))) = B. [para(2(a,1),2(a,1,2,1,2))].
% 0.49/0.77 10 divide(A,inverse(divide(B,B))) = A. [para(2(a,1),5(a,1,2,1,2))].
% 0.49/0.77 13 divide(A,inverse(divide(B,A))) = B. [para(10(a,1),2(a,1,2,1,1)),rewrite([10(3)])].
% 0.49/0.77 14 divide(A,inverse(divide(B,divide(A,inverse(divide(B,C)))))) = C. [para(10(a,1),5(a,1,2,1,2,2,1,1)),rewrite([10(3)])].
% 0.49/0.77 20 divide(divide(A,B),inverse(divide(C,divide(C,B)))) = A. [para(13(a,1),5(a,1,2,1,2))].
% 0.49/0.77 22 divide(inverse(divide(A,A)),inverse(B)) = B. [para(10(a,1),13(a,1,2,1))].
% 0.49/0.77 28 divide(divide(A,inverse(B)),B) = A. [para(22(a,1),2(a,1,2,1,2)),rewrite([22(7)])].
% 0.49/0.77 32 inverse(divide(A,A)) = divide(B,B). [para(22(a,1),10(a,1)),flip(a)].
% 0.49/0.77 35 inverse(divide(A,A)) = c_0. [new_symbol(32)].
% 0.49/0.77 37 divide(A,A) = c_0. [back_rewrite(32),rewrite([35(2)]),flip(a)].
% 0.49/0.77 43 divide(inverse(c_0),inverse(A)) = A. [back_rewrite(22),rewrite([37(1)])].
% 0.49/0.77 46 inverse(c_0) = c_0. [back_rewrite(35),rewrite([37(1)])].
% 0.49/0.77 48 divide(c_0,inverse(A)) = A. [back_rewrite(43),rewrite([46(2)])].
% 0.49/0.77 66 inverse(divide(divide(A,B),divide(C,B))) = divide(C,inverse(divide(c_0,A))). [para(37(a,1),6(a,1,2,1,1)),flip(a)].
% 0.49/0.77 85 divide(A,divide(A,inverse(divide(c_0,B)))) = B. [back_rewrite(2),rewrite([66(4)])].
% 0.49/0.77 88 divide(A,divide(A,B)) = B. [para(14(a,1),48(a,1)),rewrite([48(4)]),flip(a)].
% 0.49/0.77 98 inverse(divide(c_0,A)) = A. [back_rewrite(85),rewrite([88(5)])].
% 0.49/0.77 99 divide(divide(A,B),inverse(B)) = A. [back_rewrite(20),rewrite([88(3)])].
% 0.49/0.77 116 inverse(divide(divide(A,B),divide(C,B))) = divide(C,A). [back_rewrite(66),rewrite([98(7)])].
% 0.49/0.77 117 inverse(divide(A,B)) = divide(B,A). [para(13(a,1),88(a,1,2)),flip(a)].
% 0.49/0.77 119 divide(divide(A,B),divide(C,B)) = divide(A,C). [back_rewrite(116),rewrite([117(4)])].
% 0.49/0.77 135 divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)) # answer(prove_these_axioms_3). [back_rewrite(4),rewrite([117(13)])].
% 0.49/0.77 137 divide(divide(A,B),A) = inverse(B). [para(99(a,1),88(a,1,2))].
% 0.49/0.77 139 divide(A,divide(B,inverse(A))) = inverse(B). [para(28(a,1),117(a,1,1)),flip(a)].
% 0.49/0.77 141 divide(inverse(A),B) = divide(inverse(B),A). [para(137(a,1),28(a,1,1))].
% 0.49/0.77 143 divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3)) # answer(prove_these_axioms_3). [back_rewrite(135),rewrite([141(12)])].
% 0.49/0.77 144 divide(A,inverse(B)) = divide(B,inverse(A)). [para(139(a,1),88(a,1,2))].
% 0.49/0.77 146 divide(c3,divide(inverse(a3),b3)) != divide(a3,divide(inverse(b3),c3)) # answer(prove_these_axioms_3). [back_rewrite(143),rewrite([144(7),117(6),141(5)])].
% 0.49/0.77 152 divide(A,divide(B,C)) = divide(C,divide(B,A)). [para(137(a,1),119(a,1,2)),rewrite([144(3),117(2)])].
% 0.49/0.77 155 divide(b3,divide(inverse(a3),c3)) != divide(a3,divide(inverse(b3),c3)) # answer(prove_these_axioms_3). [back_rewrite(146),rewrite([152(6)])].
% 0.49/0.77 156 $F # answer(prove_these_axioms_3). [para(152(a,1),155(a,2)),rewrite([141(11),152(12)]),xx(a)].
% 0.49/0.77
% 0.49/0.77 % SZS output end Refutation
% 0.49/0.77 ============================== end of proof ==========================
% 0.49/0.77
% 0.49/0.77 ============================== STATISTICS ============================
% 0.49/0.77
% 0.49/0.77 Given=30. Generated=494. Kept=154. proofs=1.
% 0.49/0.77 Usable=13. Sos=2. Demods=14. Limbo=0, Disabled=142. Hints=0.
% 0.49/0.77 Megabytes=0.14.
% 0.49/0.77 User_CPU=0.02, System_CPU=0.00, Wall_clock=1.
% 0.49/0.77
% 0.49/0.77 ============================== end of statistics =====================
% 0.49/0.77
% 0.49/0.77 ============================== end of search =========================
% 0.49/0.77
% 0.49/0.77 THEOREM PROVED
% 0.49/0.77 % SZS status Unsatisfiable
% 0.49/0.77
% 0.49/0.77 Exiting with 1 proof.
% 0.49/0.77
% 0.49/0.77 Process 27261 exit (max_proofs) Tue Jun 14 03:41:58 2022
% 0.49/0.77 Prover9 interrupted
%------------------------------------------------------------------------------