TSTP Solution File: GRP095-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP095-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:17:08 EDT 2022
% Result : Unsatisfiable 0.45s 1.04s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP095-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n026.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 : Tue Jun 14 12:21:36 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.45/1.04 ============================== Prover9 ===============================
% 0.45/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.04 Process 17193 was started by sandbox on n026.cluster.edu,
% 0.45/1.04 Tue Jun 14 12:21:37 2022
% 0.45/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17038_n026.cluster.edu".
% 0.45/1.04 ============================== end of head ===========================
% 0.45/1.04
% 0.45/1.04 ============================== INPUT =================================
% 0.45/1.04
% 0.45/1.04 % Reading from file /tmp/Prover9_17038_n026.cluster.edu
% 0.45/1.04
% 0.45/1.04 set(prolog_style_variables).
% 0.45/1.04 set(auto2).
% 0.45/1.04 % set(auto2) -> set(auto).
% 0.45/1.04 % set(auto) -> set(auto_inference).
% 0.45/1.04 % set(auto) -> set(auto_setup).
% 0.45/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.04 % set(auto) -> set(auto_limits).
% 0.45/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.04 % set(auto) -> set(auto_denials).
% 0.45/1.04 % set(auto) -> set(auto_process).
% 0.45/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.04 % set(auto2) -> assign(stats, some).
% 0.45/1.04 % set(auto2) -> clear(echo_input).
% 0.45/1.04 % set(auto2) -> set(quiet).
% 0.45/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.04 % set(auto2) -> clear(print_given).
% 0.45/1.04 assign(lrs_ticks,-1).
% 0.45/1.04 assign(sos_limit,10000).
% 0.45/1.04 assign(order,kbo).
% 0.45/1.04 set(lex_order_vars).
% 0.45/1.04 clear(print_given).
% 0.45/1.04
% 0.45/1.04 % formulas(sos). % not echoed (5 formulas)
% 0.45/1.04
% 0.45/1.04 ============================== end of input ==========================
% 0.45/1.04
% 0.45/1.04 % From the command line: assign(max_seconds, 300).
% 0.45/1.04
% 0.45/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.04
% 0.45/1.04 % Formulas that are not ordinary clauses:
% 0.45/1.04
% 0.45/1.04 ============================== end of process non-clausal formulas ===
% 0.45/1.04
% 0.45/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.04
% 0.45/1.04 ============================== PREDICATE ELIMINATION =================
% 0.45/1.04
% 0.45/1.04 ============================== end predicate elimination =============
% 0.45/1.04
% 0.45/1.04 Auto_denials:
% 0.45/1.04 % copying label prove_these_axioms to answer in negative clause
% 0.45/1.04
% 0.45/1.04 Term ordering decisions:
% 0.45/1.04
% 0.45/1.04 % Assigning unary symbol inverse kb_weight 0 and highest precedence (14).
% 0.45/1.04 Function symbol KB weights: identity=1. a1=1. a2=1. a3=1. a4=1. b1=1. b2=1. b3=1. b4=1. c3=1. divide=1. multiply=1. inverse=0.
% 0.45/1.04
% 0.45/1.04 ============================== end of process initial clauses ========
% 0.45/1.04
% 0.45/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.04
% 0.45/1.04 ============================== end of clauses for search =============
% 0.45/1.04
% 0.45/1.04 ============================== SEARCH ================================
% 0.45/1.04
% 0.45/1.04 % Starting search at 0.01 seconds.
% 0.45/1.04
% 0.45/1.04 ============================== PROOF =================================
% 0.45/1.04 % SZS status Unsatisfiable
% 0.45/1.04 % SZS output start Refutation
% 0.45/1.04
% 0.45/1.04 % Proof 1 at 0.02 (+ 0.00) seconds: prove_these_axioms.
% 0.45/1.04 % Length of proof is 30.
% 0.45/1.04 % Level of proof is 10.
% 0.45/1.04 % Maximum clause weight is 37.000.
% 0.45/1.04 % Given clauses 22.
% 0.45/1.04
% 0.45/1.04 1 identity = divide(A,A) # label(identity) # label(axiom). [assumption].
% 0.45/1.04 2 divide(A,A) = identity. [copy(1),flip(a)].
% 0.45/1.04 3 inverse(A) = divide(identity,A) # label(inverse) # label(axiom). [assumption].
% 0.45/1.04 4 multiply(A,B) = divide(A,divide(identity,B)) # label(multiply) # label(axiom). [assumption].
% 0.45/1.04 5 divide(divide(identity,A),divide(divide(divide(B,A),C),B)) = C # label(single_axiom) # label(axiom). [assumption].
% 0.45/1.04 6 multiply(inverse(a1),a1) != multiply(inverse(b1),b1) | multiply(multiply(inverse(b2),b2),a2) != a2 | multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) | multiply(a4,b4) != multiply(b4,a4) # label(prove_these_axioms) # label(negated_conjecture) # answer(prove_these_axioms). [assumption].
% 0.45/1.04 7 divide(identity,divide(identity,a2)) != a2 | divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))) | divide(b4,divide(identity,a4)) != divide(a4,divide(identity,b4)) # answer(prove_these_axioms). [copy(6),rewrite([3(2),4(5),2(7),3(3),4(6),2(8),3(5),4(8),2(10),4(6),4(13),4(17),4(23),4(26),4(32),4(37)]),flip(d),xx(a)].
% 0.45/1.04 8 divide(identity,divide(divide(divide(A,identity),B),A)) = B. [para(2(a,1),5(a,1,1))].
% 0.45/1.04 14 divide(identity,divide(identity,A)) = divide(A,identity). [para(2(a,1),8(a,1,2,1))].
% 0.45/1.04 16 divide(A,divide(divide(A,B),identity)) = B. [para(8(a,1),5(a,1,2,1,1)),rewrite([8(6)])].
% 0.45/1.04 17 divide(divide(divide(A,identity),B),A) = divide(identity,divide(B,identity)). [para(5(a,1),8(a,1,2,1)),flip(a)].
% 0.45/1.04 18 divide(a2,identity) != a2 | divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))) | divide(b4,divide(identity,a4)) != divide(a4,divide(identity,b4)) # answer(prove_these_axioms). [back_rewrite(7),rewrite([14(5)])].
% 0.45/1.04 22 divide(divide(A,identity),divide(divide(divide(B,divide(identity,A)),C),B)) = C. [para(14(a,1),5(a,1,1))].
% 0.45/1.04 24 divide(A,identity) = A. [para(2(a,1),16(a,1,2,1)),rewrite([2(3)])].
% 0.45/1.04 27 divide(divide(identity,A),divide(B,C)) = divide(divide(C,A),B). [para(16(a,1),5(a,1,2,1)),rewrite([24(8)])].
% 0.45/1.04 28 divide(divide(divide(A,B),C),A) = divide(divide(identity,B),C). [para(5(a,1),16(a,1,2,1)),rewrite([24(4)]),flip(a)].
% 0.45/1.04 29 divide(A,divide(A,B)) = B. [back_rewrite(22),rewrite([24(2),28(5),14(4),24(2)])].
% 0.45/1.04 31 divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))) | divide(b4,divide(identity,a4)) != divide(a4,divide(identity,b4)) # answer(prove_these_axioms). [back_rewrite(18),rewrite([24(3)]),xx(a)].
% 0.45/1.04 32 divide(divide(A,B),A) = divide(identity,B). [back_rewrite(17),rewrite([24(2),24(5)])].
% 0.45/1.04 33 divide(identity,divide(A,B)) = divide(B,A). [para(2(a,1),27(a,1,1)),rewrite([24(5)])].
% 0.45/1.04 36 divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(divide(identity,c3),b3)) | divide(b4,divide(identity,a4)) != divide(a4,divide(identity,b4)) # answer(prove_these_axioms). [back_rewrite(31),rewrite([33(17)])].
% 0.45/1.04 37 divide(divide(A,divide(identity,B)),C) = divide(B,divide(C,A)). [para(29(a,1),27(a,1,1)),flip(a)].
% 0.45/1.04 38 divide(divide(identity,A),B) = divide(divide(identity,B),A). [para(29(a,1),27(a,1,2)),rewrite([28(6)])].
% 0.45/1.04 41 divide(b3,divide(divide(identity,a3),c3)) != divide(a3,divide(divide(identity,b3),c3)) | divide(b4,divide(identity,a4)) != divide(a4,divide(identity,b4)) # answer(prove_these_axioms). [back_rewrite(36),rewrite([37(9),38(6),38(13)])].
% 0.45/1.04 42 divide(divide(A,B),divide(A,C)) = divide(C,B). [para(32(a,1),27(a,1,2)),rewrite([27(5),24(3)]),flip(a)].
% 0.45/1.04 44 divide(divide(A,B),C) = divide(divide(A,C),B). [para(33(a,1),27(a,1,2)),rewrite([27(4),24(6)])].
% 0.45/1.04 59 divide(A,divide(B,C)) = divide(C,divide(B,A)). [para(29(a,1),42(a,1,1))].
% 0.45/1.04 65 divide(b3,divide(divide(identity,a3),c3)) != divide(a3,divide(divide(identity,b3),c3)) # answer(prove_these_axioms). [back_rewrite(41),rewrite([59(20)]),xx(b)].
% 0.45/1.04 75 divide(A,divide(divide(B,C),D)) = divide(C,divide(divide(B,A),D)). [para(44(a,1),59(a,2,2)),rewrite([59(6)])].
% 0.45/1.04 76 $F # answer(prove_these_axioms). [resolve(75,a,65,a)].
% 0.45/1.04
% 0.45/1.04 % SZS output end Refutation
% 0.45/1.04 ============================== end of proof ==========================
% 0.45/1.04
% 0.45/1.04 ============================== STATISTICS ============================
% 0.45/1.04
% 0.45/1.04 Given=22. Generated=374. Kept=73. proofs=1.
% 0.45/1.04 Usable=9. Sos=10. Demods=20. Limbo=6, Disabled=52. Hints=0.
% 0.45/1.04 Megabytes=0.08.
% 0.45/1.04 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.45/1.04
% 0.45/1.04 ============================== end of statistics =====================
% 0.45/1.04
% 0.45/1.04 ============================== end of search =========================
% 0.45/1.04
% 0.45/1.04 THEOREM PROVED
% 0.45/1.04 % SZS status Unsatisfiable
% 0.45/1.04
% 0.45/1.04 Exiting with 1 proof.
% 0.45/1.04
% 0.45/1.04 Process 17193 exit (max_proofs) Tue Jun 14 12:21:37 2022
% 0.45/1.04 Prover9 interrupted
%------------------------------------------------------------------------------