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