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