TSTP Solution File: GRP488-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP488-1 : TPTP v8.1.0. Released v2.6.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:19:18 EDT 2022
% Result : Unsatisfiable 0.74s 1.03s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP488-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 08:48:20 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.74/1.02 ============================== Prover9 ===============================
% 0.74/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.02 Process 4875 was started by sandbox2 on n026.cluster.edu,
% 0.74/1.02 Mon Jun 13 08:48:21 2022
% 0.74/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_4721_n026.cluster.edu".
% 0.74/1.02 ============================== end of head ===========================
% 0.74/1.02
% 0.74/1.02 ============================== INPUT =================================
% 0.74/1.02
% 0.74/1.02 % Reading from file /tmp/Prover9_4721_n026.cluster.edu
% 0.74/1.02
% 0.74/1.02 set(prolog_style_variables).
% 0.74/1.02 set(auto2).
% 0.74/1.02 % set(auto2) -> set(auto).
% 0.74/1.02 % set(auto) -> set(auto_inference).
% 0.74/1.02 % set(auto) -> set(auto_setup).
% 0.74/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.02 % set(auto) -> set(auto_limits).
% 0.74/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.02 % set(auto) -> set(auto_denials).
% 0.74/1.02 % set(auto) -> set(auto_process).
% 0.74/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.02 % set(auto2) -> assign(stats, some).
% 0.74/1.02 % set(auto2) -> clear(echo_input).
% 0.74/1.02 % set(auto2) -> set(quiet).
% 0.74/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.02 % set(auto2) -> clear(print_given).
% 0.74/1.02 assign(lrs_ticks,-1).
% 0.74/1.02 assign(sos_limit,10000).
% 0.74/1.02 assign(order,kbo).
% 0.74/1.02 set(lex_order_vars).
% 0.74/1.02 clear(print_given).
% 0.74/1.02
% 0.74/1.02 % formulas(sos). % not echoed (5 formulas)
% 0.74/1.02
% 0.74/1.02 ============================== end of input ==========================
% 0.74/1.02
% 0.74/1.02 % From the command line: assign(max_seconds, 300).
% 0.74/1.02
% 0.74/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.03
% 0.74/1.03 % Formulas that are not ordinary clauses:
% 0.74/1.03
% 0.74/1.03 ============================== end of process non-clausal formulas ===
% 0.74/1.03
% 0.74/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.03
% 0.74/1.03 ============================== PREDICATE ELIMINATION =================
% 0.74/1.03
% 0.74/1.03 ============================== end predicate elimination =============
% 0.74/1.03
% 0.74/1.03 Auto_denials:
% 0.74/1.03 % copying label prove_these_axioms_2 to answer in negative clause
% 0.74/1.03
% 0.74/1.03 Term ordering decisions:
% 0.74/1.03
% 0.74/1.03 % Assigning unary symbol inverse kb_weight 0 and highest precedence (6).
% 0.74/1.03 Function symbol KB weights: identity=1. a2=1. double_divide=1. multiply=1. inverse=0.
% 0.74/1.03
% 0.74/1.03 ============================== end of process initial clauses ========
% 0.74/1.03
% 0.74/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.03
% 0.74/1.03 ============================== end of clauses for search =============
% 0.74/1.03
% 0.74/1.03 ============================== SEARCH ================================
% 0.74/1.03
% 0.74/1.03 % Starting search at 0.01 seconds.
% 0.74/1.03
% 0.74/1.03 ============================== PROOF =================================
% 0.74/1.03 % SZS status Unsatisfiable
% 0.74/1.03 % SZS output start Refutation
% 0.74/1.03
% 0.74/1.03 % Proof 1 at 0.03 (+ 0.00) seconds: prove_these_axioms_2.
% 0.74/1.03 % Length of proof is 32.
% 0.74/1.03 % Level of proof is 12.
% 0.74/1.03 % Maximum clause weight is 27.000.
% 0.74/1.03 % Given clauses 14.
% 0.74/1.03
% 0.74/1.03 1 inverse(A) = double_divide(A,identity) # label(inverse) # label(axiom). [assumption].
% 0.74/1.03 2 identity = double_divide(A,inverse(A)) # label(identity) # label(axiom). [assumption].
% 0.74/1.03 3 double_divide(A,double_divide(A,identity)) = identity. [copy(2),rewrite([1(2)]),flip(a)].
% 0.74/1.03 4 multiply(A,B) = double_divide(double_divide(B,A),identity) # label(multiply) # label(axiom). [assumption].
% 0.74/1.03 5 double_divide(A,double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),double_divide(B,C))),B),identity)) = C # label(single_axiom) # label(axiom). [assumption].
% 0.74/1.03 6 multiply(identity,a2) != a2 # label(prove_these_axioms_2) # label(negated_conjecture) # answer(prove_these_axioms_2). [assumption].
% 0.74/1.03 7 double_divide(double_divide(a2,identity),identity) != a2 # answer(prove_these_axioms_2). [copy(6),rewrite([4(3)])].
% 0.74/1.03 8 double_divide(A,double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),identity)),B),identity)) = double_divide(B,identity). [para(3(a,1),5(a,1,2,1,1,2,2))].
% 0.74/1.03 9 double_divide(A,double_divide(double_divide(double_divide(identity,identity),double_divide(A,identity)),identity)) = identity. [para(3(a,1),5(a,1,2,1,1,2))].
% 0.74/1.03 10 double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),double_divide(B,C))),B),identity) = double_divide(D,double_divide(double_divide(double_divide(identity,double_divide(double_divide(D,identity),C)),A),identity)). [para(5(a,1),5(a,1,2,1,1,2,2)),flip(a)].
% 0.74/1.03 13 double_divide(A,double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),double_divide(B,identity))),C),identity)) = double_divide(double_divide(double_divide(identity,double_divide(double_divide(C,identity),identity)),B),identity). [para(8(a,1),5(a,1,2,1,1,2,2))].
% 0.74/1.03 19 double_divide(double_divide(identity,identity),double_divide(identity,identity)) = identity. [para(3(a,1),9(a,1,2,1))].
% 0.74/1.03 20 double_divide(double_divide(double_divide(identity,identity),double_divide(A,identity)),identity) = double_divide(A,identity). [para(9(a,1),5(a,1,2,1,1,2,2)),rewrite([8(10)]),flip(a)].
% 0.74/1.03 24 double_divide(double_divide(identity,identity),identity) = double_divide(identity,identity). [para(19(a,1),5(a,1,2,1,1,2,2)),rewrite([8(13)])].
% 0.74/1.03 28 double_divide(double_divide(identity,identity),double_divide(double_divide(double_divide(identity,double_divide(double_divide(identity,identity),double_divide(A,B))),A),identity)) = B. [para(24(a,1),5(a,1,2,1,1,2,1))].
% 0.74/1.03 29 double_divide(identity,identity) = identity. [para(24(a,1),5(a,1,2,1,1,2,2)),rewrite([13(15),24(6),24(6),3(5),24(5)])].
% 0.74/1.03 30 double_divide(identity,double_divide(double_divide(identity,A),identity)) = double_divide(A,identity). [para(24(a,1),8(a,1,2,1,1,2,1)),rewrite([29(3),29(5),29(5),29(4)])].
% 0.74/1.03 31 double_divide(identity,double_divide(double_divide(double_divide(identity,double_divide(identity,double_divide(A,B))),A),identity)) = B. [back_rewrite(28),rewrite([29(3),29(5)])].
% 0.74/1.03 34 double_divide(double_divide(identity,double_divide(A,identity)),identity) = double_divide(A,identity). [back_rewrite(20),rewrite([29(3)])].
% 0.74/1.03 63 double_divide(double_divide(double_divide(identity,double_divide(identity,double_divide(A,B))),A),identity) = double_divide(C,double_divide(double_divide(double_divide(identity,double_divide(double_divide(C,identity),B)),identity),identity)). [para(29(a,1),10(a,1,1,1,2,1))].
% 0.74/1.03 64 double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),double_divide(B,C))),B),identity) = double_divide(identity,double_divide(double_divide(double_divide(identity,double_divide(identity,C)),A),identity)). [para(29(a,1),10(a,2,2,1,1,2,1))].
% 0.74/1.03 80 double_divide(A,double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),B)),C),identity)) = double_divide(identity,double_divide(double_divide(double_divide(identity,double_divide(identity,B)),C),identity)). [back_rewrite(10),rewrite([64(9)]),flip(a)].
% 0.74/1.03 91 double_divide(double_divide(double_divide(identity,double_divide(identity,double_divide(A,B))),A),identity) = double_divide(identity,double_divide(double_divide(double_divide(identity,double_divide(identity,B)),identity),identity)). [back_rewrite(63),rewrite([80(18)])].
% 0.74/1.03 100 double_divide(double_divide(double_divide(identity,A),identity),identity) = double_divide(identity,double_divide(double_divide(A,identity),identity)). [para(30(a,1),30(a,1,2,1)),flip(a)].
% 0.74/1.03 101 double_divide(double_divide(double_divide(identity,double_divide(identity,double_divide(A,B))),A),identity) = double_divide(identity,double_divide(identity,double_divide(identity,double_divide(double_divide(B,identity),identity)))). [back_rewrite(91),rewrite([100(17),100(16)])].
% 0.74/1.03 104 double_divide(double_divide(A,identity),identity) = double_divide(identity,double_divide(A,identity)). [para(34(a,1),30(a,1,2)),flip(a)].
% 0.74/1.03 105 double_divide(double_divide(identity,A),identity) = double_divide(identity,double_divide(A,identity)). [para(30(a,1),34(a,1,1)),rewrite([104(4)]),flip(a)].
% 0.74/1.03 106 double_divide(identity,double_divide(identity,double_divide(identity,double_divide(identity,double_divide(A,identity))))) = double_divide(A,identity). [para(34(a,1),34(a,2)),rewrite([105(7),104(6),105(10),105(9),105(8),104(7)])].
% 0.74/1.03 108 double_divide(double_divide(double_divide(identity,double_divide(identity,double_divide(A,B))),A),identity) = double_divide(B,identity). [back_rewrite(101),rewrite([104(15),106(18)])].
% 0.74/1.03 121 double_divide(identity,double_divide(a2,identity)) != a2 # answer(prove_these_axioms_2). [back_rewrite(7),rewrite([104(5)])].
% 0.74/1.03 125 double_divide(identity,double_divide(A,identity)) = A. [back_rewrite(31),rewrite([108(9)])].
% 0.74/1.03 126 $F # answer(prove_these_axioms_2). [resolve(125,a,121,a)].
% 0.74/1.03
% 0.74/1.03 % SZS output end Refutation
% 0.74/1.03 ============================== end of proof ==========================
% 0.74/1.03
% 0.74/1.03 ============================== STATISTICS ============================
% 0.74/1.03
% 0.74/1.03 Given=14. Generated=225. Kept=123. proofs=1.
% 0.74/1.03 Usable=4. Sos=22. Demods=41. Limbo=17, Disabled=84. Hints=0.
% 0.74/1.03 Megabytes=0.19.
% 0.74/1.03 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.74/1.03
% 0.74/1.03 ============================== end of statistics =====================
% 0.74/1.03
% 0.74/1.03 ============================== end of search =========================
% 0.74/1.03
% 0.74/1.03 THEOREM PROVED
% 0.74/1.03 % SZS status Unsatisfiable
% 0.74/1.03
% 0.74/1.03 Exiting with 1 proof.
% 0.74/1.03
% 0.74/1.03 Process 4875 exit (max_proofs) Mon Jun 13 08:48:21 2022
% 0.74/1.03 Prover9 interrupted
%------------------------------------------------------------------------------