TSTP Solution File: GRP168-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP168-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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:17:51 EDT 2022
% Result : Unsatisfiable 0.45s 1.09s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP168-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n006.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 18:42:26 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.45/1.09 ============================== Prover9 ===============================
% 0.45/1.09 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.09 Process 16234 was started by sandbox2 on n006.cluster.edu,
% 0.45/1.09 Mon Jun 13 18:42:27 2022
% 0.45/1.09 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_16081_n006.cluster.edu".
% 0.45/1.09 ============================== end of head ===========================
% 0.45/1.09
% 0.45/1.09 ============================== INPUT =================================
% 0.45/1.09
% 0.45/1.09 % Reading from file /tmp/Prover9_16081_n006.cluster.edu
% 0.45/1.09
% 0.45/1.09 set(prolog_style_variables).
% 0.45/1.09 set(auto2).
% 0.45/1.09 % set(auto2) -> set(auto).
% 0.45/1.09 % set(auto) -> set(auto_inference).
% 0.45/1.09 % set(auto) -> set(auto_setup).
% 0.45/1.09 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.09 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.09 % set(auto) -> set(auto_limits).
% 0.45/1.09 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.09 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.09 % set(auto) -> set(auto_denials).
% 0.45/1.09 % set(auto) -> set(auto_process).
% 0.45/1.09 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.09 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.09 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.09 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.09 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.09 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.09 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.09 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.09 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.09 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.09 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.09 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.09 % set(auto2) -> assign(stats, some).
% 0.45/1.09 % set(auto2) -> clear(echo_input).
% 0.45/1.09 % set(auto2) -> set(quiet).
% 0.45/1.09 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.09 % set(auto2) -> clear(print_given).
% 0.45/1.09 assign(lrs_ticks,-1).
% 0.45/1.09 assign(sos_limit,10000).
% 0.45/1.09 assign(order,kbo).
% 0.45/1.09 set(lex_order_vars).
% 0.45/1.09 clear(print_given).
% 0.45/1.09
% 0.45/1.09 % formulas(sos). % not echoed (17 formulas)
% 0.45/1.09
% 0.45/1.09 ============================== end of input ==========================
% 0.45/1.09
% 0.45/1.09 % From the command line: assign(max_seconds, 300).
% 0.45/1.09
% 0.45/1.09 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.09
% 0.45/1.09 % Formulas that are not ordinary clauses:
% 0.45/1.09
% 0.45/1.09 ============================== end of process non-clausal formulas ===
% 0.45/1.09
% 0.45/1.09 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.09
% 0.45/1.09 ============================== PREDICATE ELIMINATION =================
% 0.45/1.09
% 0.45/1.09 ============================== end predicate elimination =============
% 0.45/1.09
% 0.45/1.09 Auto_denials:
% 0.45/1.09 % copying label prove_p01b to answer in negative clause
% 0.45/1.09
% 0.45/1.09 Term ordering decisions:
% 0.45/1.09
% 0.45/1.09 % Assigning unary symbol inverse kb_weight 0 and highest precedence (9).
% 0.45/1.09 Function symbol KB weights: a=1. identity=1. b=1. c=1. multiply=1. greatest_lower_bound=1. least_upper_bound=1. inverse=0.
% 0.45/1.09
% 0.45/1.09 ============================== PROOF =================================
% 0.45/1.09 % SZS status Unsatisfiable
% 0.45/1.09 % SZS output start Refutation
% 0.45/1.09
% 0.45/1.09 % Proof 1 at 0.01 (+ 0.00) seconds: prove_p01b.
% 0.45/1.09 % Length of proof is 7.
% 0.45/1.09 % Level of proof is 2.
% 0.45/1.09 % Maximum clause weight is 13.000.
% 0.45/1.09 % Given clauses 0.
% 0.45/1.09
% 0.45/1.09 4 greatest_lower_bound(a,b) = a # label(p01b_1) # label(hypothesis). [assumption].
% 0.45/1.09 17 multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)) # label(monotony_glb1) # label(axiom). [assumption].
% 0.45/1.09 18 greatest_lower_bound(multiply(A,B),multiply(A,C)) = multiply(A,greatest_lower_bound(B,C)). [copy(17),flip(a)].
% 0.45/1.09 21 multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)) # label(monotony_glb2) # label(axiom). [assumption].
% 0.45/1.09 22 greatest_lower_bound(multiply(A,B),multiply(C,B)) = multiply(greatest_lower_bound(A,C),B). [copy(21),flip(a)].
% 0.45/1.09 23 greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) != multiply(inverse(c),multiply(a,c)) # label(prove_p01b) # label(negated_conjecture) # answer(prove_p01b). [assumption].
% 0.45/1.09 24 $F # answer(prove_p01b). [copy(23),rewrite([18(13),22(9),4(5)]),xx(a)].
% 0.45/1.09
% 0.45/1.09 % SZS output end Refutation
% 0.45/1.09 ============================== end of proof ==========================
% 0.45/1.09
% 0.45/1.09 ============================== STATISTICS ============================
% 0.45/1.09
% 0.45/1.09 Given=0. Generated=17. Kept=16. proofs=1.
% 0.45/1.09 Usable=0. Sos=0. Demods=16. Limbo=16, Disabled=17. Hints=0.
% 0.45/1.09 Megabytes=0.03.
% 0.45/1.09 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.45/1.09
% 0.45/1.09 ============================== end of statistics =====================
% 0.45/1.09
% 0.45/1.09 ============================== end of search =========================
% 0.45/1.09
% 0.45/1.09 THEOREM PROVED
% 0.45/1.09 % SZS status Unsatisfiable
% 0.45/1.09
% 0.45/1.09 Exiting with 1 proof.
% 0.45/1.09
% 0.45/1.09 Process 16234 exit (max_proofs) Mon Jun 13 18:42:27 2022
% 0.45/1.09 Prover9 interrupted
%------------------------------------------------------------------------------