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