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