TSTP Solution File: LAT088-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT088-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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 : Sun Jul 17 06:25:30 EDT 2022
% Result : Unsatisfiable 0.41s 1.00s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LAT088-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.33 % Computer : n025.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Thu Jun 30 00:09:22 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.41/1.00 ============================== Prover9 ===============================
% 0.41/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.41/1.00 Process 28916 was started by sandbox on n025.cluster.edu,
% 0.41/1.00 Thu Jun 30 00:09:23 2022
% 0.41/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_28762_n025.cluster.edu".
% 0.41/1.00 ============================== end of head ===========================
% 0.41/1.00
% 0.41/1.00 ============================== INPUT =================================
% 0.41/1.00
% 0.41/1.00 % Reading from file /tmp/Prover9_28762_n025.cluster.edu
% 0.41/1.00
% 0.41/1.00 set(prolog_style_variables).
% 0.41/1.00 set(auto2).
% 0.41/1.00 % set(auto2) -> set(auto).
% 0.41/1.00 % set(auto) -> set(auto_inference).
% 0.41/1.00 % set(auto) -> set(auto_setup).
% 0.41/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.41/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/1.00 % set(auto) -> set(auto_limits).
% 0.41/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/1.00 % set(auto) -> set(auto_denials).
% 0.41/1.00 % set(auto) -> set(auto_process).
% 0.41/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.41/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.41/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.41/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.41/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.41/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.41/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.41/1.00 % set(auto2) -> assign(stats, some).
% 0.41/1.00 % set(auto2) -> clear(echo_input).
% 0.41/1.00 % set(auto2) -> set(quiet).
% 0.41/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.41/1.00 % set(auto2) -> clear(print_given).
% 0.41/1.00 assign(lrs_ticks,-1).
% 0.41/1.00 assign(sos_limit,10000).
% 0.41/1.00 assign(order,kbo).
% 0.41/1.00 set(lex_order_vars).
% 0.41/1.00 clear(print_given).
% 0.41/1.00
% 0.41/1.00 % formulas(sos). % not echoed (6 formulas)
% 0.41/1.00
% 0.41/1.00 ============================== end of input ==========================
% 0.41/1.00
% 0.41/1.00 % From the command line: assign(max_seconds, 300).
% 0.41/1.00
% 0.41/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/1.00
% 0.41/1.00 % Formulas that are not ordinary clauses:
% 0.41/1.00
% 0.41/1.00 ============================== end of process non-clausal formulas ===
% 0.41/1.00
% 0.41/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/1.00
% 0.41/1.00 ============================== PREDICATE ELIMINATION =================
% 0.41/1.00
% 0.41/1.00 ============================== end predicate elimination =============
% 0.41/1.00
% 0.41/1.00 Auto_denials:
% 0.41/1.00 % copying label prove_normal_axioms_1 to answer in negative clause
% 0.41/1.00
% 0.41/1.00 Term ordering decisions:
% 0.41/1.00 Function symbol KB weights: a=1. join=1. meet=1.
% 0.41/1.00
% 0.41/1.00 ============================== end of process initial clauses ========
% 0.41/1.00
% 0.41/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.41/1.00
% 0.41/1.00 ============================== end of clauses for search =============
% 0.41/1.00
% 0.41/1.00 ============================== SEARCH ================================
% 0.41/1.00
% 0.41/1.00 % Starting search at 0.01 seconds.
% 0.41/1.00
% 0.41/1.00 ============================== PROOF =================================
% 0.41/1.00 % SZS status Unsatisfiable
% 0.41/1.00 % SZS output start Refutation
% 0.41/1.00
% 0.41/1.00 % Proof 1 at 0.01 (+ 0.00) seconds: prove_normal_axioms_1.
% 0.41/1.00 % Length of proof is 8.
% 0.41/1.00 % Level of proof is 4.
% 0.41/1.00 % Maximum clause weight is 13.000.
% 0.41/1.00 % Given clauses 11.
% 0.41/1.00
% 0.41/1.00 1 join(meet(A,B),meet(A,join(A,B))) = A # label(wal_absorbtion_1) # label(axiom). [assumption].
% 0.41/1.00 4 meet(meet(join(A,B),join(C,A)),A) = A # label(wal_absorbtion_4) # label(axiom). [assumption].
% 0.41/1.00 5 join(join(meet(A,B),meet(C,A)),A) = A # label(wal_absorbtion_5) # label(axiom). [assumption].
% 0.41/1.00 6 meet(a,a) != a # label(prove_normal_axioms_1) # label(negated_conjecture) # answer(prove_normal_axioms_1). [assumption].
% 0.41/1.00 24 meet(meet(join(A,B),A),A) = A. [para(5(a,1),4(a,1,1,2))].
% 0.41/1.00 40 meet(meet(A,meet(A,B)),meet(A,B)) = meet(A,B). [para(1(a,1),24(a,1,1,1))].
% 0.41/1.00 55 meet(A,A) = A. [para(4(a,1),40(a,1,1,2)),rewrite([4(4),4(4),4(5)])].
% 0.41/1.00 56 $F # answer(prove_normal_axioms_1). [resolve(55,a,6,a)].
% 0.41/1.00
% 0.41/1.00 % SZS output end Refutation
% 0.41/1.00 ============================== end of proof ==========================
% 0.41/1.00
% 0.41/1.00 ============================== STATISTICS ============================
% 0.41/1.00
% 0.41/1.00 Given=11. Generated=84. Kept=55. proofs=1.
% 0.41/1.00 Usable=11. Sos=41. Demods=53. Limbo=2, Disabled=6. Hints=0.
% 0.41/1.00 Megabytes=0.12.
% 0.41/1.00 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.41/1.00
% 0.41/1.00 ============================== end of statistics =====================
% 0.41/1.00
% 0.41/1.00 ============================== end of search =========================
% 0.41/1.00
% 0.41/1.00 THEOREM PROVED
% 0.41/1.00 % SZS status Unsatisfiable
% 0.41/1.00
% 0.41/1.00 Exiting with 1 proof.
% 0.41/1.00
% 0.41/1.00 Process 28916 exit (max_proofs) Thu Jun 30 00:09:23 2022
% 0.41/1.00 Prover9 interrupted
%------------------------------------------------------------------------------