TSTP Solution File: GRP462-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP462-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n010.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:11 EDT 2022
% Result : Unsatisfiable 0.44s 1.01s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP462-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 : n010.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 19:40:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.01 ============================== Prover9 ===============================
% 0.44/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.01 Process 7110 was started by sandbox on n010.cluster.edu,
% 0.44/1.01 Mon Jun 13 19:40:10 2022
% 0.44/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_6737_n010.cluster.edu".
% 0.44/1.01 ============================== end of head ===========================
% 0.44/1.01
% 0.44/1.01 ============================== INPUT =================================
% 0.44/1.01
% 0.44/1.01 % Reading from file /tmp/Prover9_6737_n010.cluster.edu
% 0.44/1.01
% 0.44/1.01 set(prolog_style_variables).
% 0.44/1.01 set(auto2).
% 0.44/1.01 % set(auto2) -> set(auto).
% 0.44/1.01 % set(auto) -> set(auto_inference).
% 0.44/1.01 % set(auto) -> set(auto_setup).
% 0.44/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.01 % set(auto) -> set(auto_limits).
% 0.44/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.01 % set(auto) -> set(auto_denials).
% 0.44/1.01 % set(auto) -> set(auto_process).
% 0.44/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.01 % set(auto2) -> assign(stats, some).
% 0.44/1.01 % set(auto2) -> clear(echo_input).
% 0.44/1.01 % set(auto2) -> set(quiet).
% 0.44/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.01 % set(auto2) -> clear(print_given).
% 0.44/1.01 assign(lrs_ticks,-1).
% 0.44/1.01 assign(sos_limit,10000).
% 0.44/1.01 assign(order,kbo).
% 0.44/1.01 set(lex_order_vars).
% 0.44/1.01 clear(print_given).
% 0.44/1.01
% 0.44/1.01 % formulas(sos). % not echoed (5 formulas)
% 0.44/1.01
% 0.44/1.01 ============================== end of input ==========================
% 0.44/1.01
% 0.44/1.01 % From the command line: assign(max_seconds, 300).
% 0.44/1.01
% 0.44/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.01
% 0.44/1.01 % Formulas that are not ordinary clauses:
% 0.44/1.01
% 0.44/1.01 ============================== end of process non-clausal formulas ===
% 0.44/1.01
% 0.44/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.01
% 0.44/1.01 ============================== PREDICATE ELIMINATION =================
% 0.44/1.01
% 0.44/1.01 ============================== end predicate elimination =============
% 0.44/1.01
% 0.44/1.01 Auto_denials:
% 0.44/1.01 % copying label prove_these_axioms_3 to answer in negative clause
% 0.44/1.01
% 0.44/1.01 Term ordering decisions:
% 0.44/1.01
% 0.44/1.01 % Assigning unary symbol inverse kb_weight 0 and highest precedence (8).
% 0.44/1.01 Function symbol KB weights: identity=1. a3=1. b3=1. c3=1. divide=1. multiply=1. inverse=0.
% 0.44/1.01
% 0.44/1.01 ============================== end of process initial clauses ========
% 0.44/1.01
% 0.44/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.44/1.01
% 0.44/1.01 ============================== end of clauses for search =============
% 0.44/1.01
% 0.44/1.01 ============================== SEARCH ================================
% 0.44/1.01
% 0.44/1.01 % Starting search at 0.01 seconds.
% 0.44/1.01
% 0.44/1.01 ============================== PROOF =================================
% 0.44/1.01 % SZS status Unsatisfiable
% 0.44/1.01 % SZS output start Refutation
% 0.44/1.01
% 0.44/1.01 % Proof 1 at 0.03 (+ 0.00) seconds: prove_these_axioms_3.
% 0.44/1.01 % Length of proof is 29.
% 0.44/1.01 % Level of proof is 15.
% 0.44/1.01 % Maximum clause weight is 21.000.
% 0.44/1.01 % Given clauses 29.
% 0.44/1.01
% 0.44/1.01 1 identity = divide(A,A) # label(identity) # label(axiom). [assumption].
% 0.44/1.01 2 divide(A,A) = identity. [copy(1),flip(a)].
% 0.44/1.01 4 multiply(A,B) = divide(A,divide(identity,B)) # label(multiply) # label(axiom). [assumption].
% 0.44/1.01 5 divide(A,divide(divide(divide(identity,B),C),divide(divide(divide(A,A),A),C))) = B # label(single_axiom) # label(axiom). [assumption].
% 0.44/1.01 6 divide(A,divide(divide(divide(identity,B),C),divide(divide(identity,A),C))) = B. [copy(5),rewrite([2(4)])].
% 0.44/1.01 7 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.44/1.01 8 divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))) # answer(prove_these_axioms_3). [copy(7),rewrite([4(3),4(7),4(13),4(16)])].
% 0.44/1.01 9 divide(A,divide(divide(identity,B),divide(divide(identity,A),B))) = identity. [para(2(a,1),6(a,1,2,1,1))].
% 0.44/1.01 10 divide(A,divide(identity,divide(divide(identity,A),divide(identity,B)))) = B. [para(2(a,1),6(a,1,2,1))].
% 0.44/1.01 12 divide(A,divide(divide(divide(identity,B),divide(identity,A)),identity)) = B. [para(2(a,1),6(a,1,2,2))].
% 0.44/1.01 13 divide(A,identity) = A. [para(2(a,1),6(a,1,2))].
% 0.44/1.01 18 divide(A,divide(divide(identity,B),divide(identity,A))) = B. [back_rewrite(12),rewrite([13(7)])].
% 0.44/1.01 19 divide(A,divide(identity,divide(identity,A))) = identity. [para(2(a,1),9(a,1,2,1)),rewrite([13(5)])].
% 0.44/1.01 24 divide(A,divide(divide(identity,divide(divide(divide(identity,B),C),divide(divide(identity,divide(identity,A)),C))),B)) = identity. [para(6(a,1),9(a,1,2,2))].
% 0.44/1.01 26 divide(identity,divide(identity,A)) = A. [para(19(a,1),6(a,1,2,1)),rewrite([10(12)])].
% 0.44/1.01 29 divide(A,divide(divide(identity,divide(divide(divide(identity,B),C),divide(A,C))),B)) = identity. [back_rewrite(24),rewrite([26(8)])].
% 0.44/1.01 38 divide(A,divide(B,divide(identity,A))) = divide(identity,B). [para(26(a,1),18(a,1,2,1))].
% 0.44/1.01 43 divide(divide(identity,A),divide(B,A)) = divide(identity,B). [para(26(a,1),38(a,1,2,2))].
% 0.44/1.01 45 divide(divide(identity,divide(A,B)),divide(identity,A)) = B. [para(43(a,1),43(a,1,2)),rewrite([26(10)])].
% 0.44/1.01 47 divide(A,divide(divide(A,divide(identity,B)),B)) = identity. [para(2(a,1),29(a,1,2,1,2,1)),rewrite([26(7)])].
% 0.44/1.01 55 divide(A,divide(divide(identity,divide(B,divide(A,divide(identity,C)))),divide(C,B))) = identity. [para(45(a,1),29(a,1,2,1,2,1))].
% 0.44/1.01 62 divide(divide(A,divide(identity,B)),B) = A. [para(47(a,1),45(a,1,1,2)),rewrite([2(3),26(4)]),flip(a)].
% 0.44/1.01 65 divide(identity,divide(A,B)) = divide(B,A). [para(62(a,1),38(a,1,2)),rewrite([26(6)]),flip(a)].
% 0.44/1.01 70 divide(A,divide(divide(divide(A,divide(identity,B)),C),divide(B,C))) = identity. [back_rewrite(55),rewrite([65(6)])].
% 0.44/1.01 76 divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(divide(identity,c3),b3)) # answer(prove_these_axioms_3). [back_rewrite(8),rewrite([65(17)])].
% 0.44/1.01 106 divide(divide(A,B),divide(divide(A,C),divide(B,C))) = identity. [para(62(a,1),70(a,1,2,1,1)),rewrite([65(4),13(2)])].
% 0.44/1.01 131 divide(divide(A,B),divide(C,B)) = divide(A,C). [para(106(a,1),43(a,1,2)),rewrite([65(5),13(5),65(6)])].
% 0.44/1.01 154 divide(divide(A,divide(identity,B)),C) = divide(A,divide(C,B)). [para(62(a,1),131(a,1,1)),flip(a)].
% 0.44/1.01 155 $F # answer(prove_these_axioms_3). [resolve(154,a,76,a)].
% 0.44/1.01
% 0.44/1.01 % SZS output end Refutation
% 0.44/1.01 ============================== end of proof ==========================
% 0.44/1.01
% 0.44/1.01 ============================== STATISTICS ============================
% 0.44/1.01
% 0.44/1.01 Given=29. Generated=802. Kept=151. proofs=1.
% 0.44/1.01 Usable=11. Sos=43. Demods=55. Limbo=2, Disabled=99. Hints=0.
% 0.44/1.01 Megabytes=0.16.
% 0.44/1.01 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.44/1.01
% 0.44/1.01 ============================== end of statistics =====================
% 0.44/1.01
% 0.44/1.01 ============================== end of search =========================
% 0.44/1.01
% 0.44/1.01 THEOREM PROVED
% 0.44/1.01 % SZS status Unsatisfiable
% 0.44/1.01
% 0.44/1.01 Exiting with 1 proof.
% 0.44/1.01
% 0.44/1.01 Process 7110 exit (max_proofs) Mon Jun 13 19:40:10 2022
% 0.44/1.01 Prover9 interrupted
%------------------------------------------------------------------------------