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