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