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