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