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