TSTP Solution File: LAT045-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT045-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n009.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:17 EDT 2022
% Result : Unsatisfiable 0.72s 1.00s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT045-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 29 21:09:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.72/1.00 ============================== Prover9 ===============================
% 0.72/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.72/1.00 Process 22587 was started by sandbox on n009.cluster.edu,
% 0.72/1.00 Wed Jun 29 21:09:08 2022
% 0.72/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_22434_n009.cluster.edu".
% 0.72/1.00 ============================== end of head ===========================
% 0.72/1.00
% 0.72/1.00 ============================== INPUT =================================
% 0.72/1.00
% 0.72/1.00 % Reading from file /tmp/Prover9_22434_n009.cluster.edu
% 0.72/1.00
% 0.72/1.00 set(prolog_style_variables).
% 0.72/1.00 set(auto2).
% 0.72/1.00 % set(auto2) -> set(auto).
% 0.72/1.00 % set(auto) -> set(auto_inference).
% 0.72/1.00 % set(auto) -> set(auto_setup).
% 0.72/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.72/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/1.00 % set(auto) -> set(auto_limits).
% 0.72/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/1.00 % set(auto) -> set(auto_denials).
% 0.72/1.00 % set(auto) -> set(auto_process).
% 0.72/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.72/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.72/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.72/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.72/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.72/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.72/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.72/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.72/1.00 % set(auto2) -> assign(stats, some).
% 0.72/1.00 % set(auto2) -> clear(echo_input).
% 0.72/1.00 % set(auto2) -> set(quiet).
% 0.72/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.72/1.00 % set(auto2) -> clear(print_given).
% 0.72/1.00 assign(lrs_ticks,-1).
% 0.72/1.00 assign(sos_limit,10000).
% 0.72/1.00 assign(order,kbo).
% 0.72/1.00 set(lex_order_vars).
% 0.72/1.00 clear(print_given).
% 0.72/1.00
% 0.72/1.00 % formulas(sos). % not echoed (15 formulas)
% 0.72/1.00
% 0.72/1.00 ============================== end of input ==========================
% 0.72/1.00
% 0.72/1.00 % From the command line: assign(max_seconds, 300).
% 0.72/1.00
% 0.72/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/1.00
% 0.72/1.00 % Formulas that are not ordinary clauses:
% 0.72/1.00
% 0.72/1.00 ============================== end of process non-clausal formulas ===
% 0.72/1.00
% 0.72/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/1.00
% 0.72/1.00 ============================== PREDICATE ELIMINATION =================
% 0.72/1.00
% 0.72/1.00 ============================== end predicate elimination =============
% 0.72/1.00
% 0.72/1.00 Auto_denials:
% 0.72/1.00 % copying label prove_orthomodular_law to answer in negative clause
% 0.72/1.00
% 0.72/1.00 Term ordering decisions:
% 0.72/1.00
% 0.72/1.00 % Assigning unary symbol complement kb_weight 0 and highest precedence (8).
% 0.72/1.00 Function symbol KB weights: n0=1. n1=1. a=1. b=1. join=1. meet=1. complement=0.
% 0.72/1.00
% 0.72/1.00 ============================== end of process initial clauses ========
% 0.72/1.00
% 0.72/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.72/1.00
% 0.72/1.00 ============================== end of clauses for search =============
% 0.72/1.00
% 0.72/1.00 ============================== SEARCH ================================
% 0.72/1.00
% 0.72/1.00 % Starting search at 0.01 seconds.
% 0.72/1.00
% 0.72/1.00 ============================== PROOF =================================
% 0.72/1.00 % SZS status Unsatisfiable
% 0.72/1.00 % SZS output start Refutation
% 0.72/1.00
% 0.72/1.00 % Proof 1 at 0.02 (+ 0.00) seconds: prove_orthomodular_law.
% 0.72/1.00 % Length of proof is 12.
% 0.72/1.00 % Level of proof is 4.
% 0.72/1.00 % Maximum clause weight is 15.000.
% 0.72/1.00 % Given clauses 15.
% 0.72/1.00
% 0.72/1.00 4 join(complement(A),A) = n1 # label(invertability1) # label(axiom). [assumption].
% 0.72/1.00 6 meet(A,join(A,B)) = A # label(absorption1) # label(axiom). [assumption].
% 0.72/1.00 8 meet(A,B) = meet(B,A) # label(commutativity_of_meet) # label(axiom). [assumption].
% 0.72/1.00 9 join(A,B) = join(B,A) # label(commutativity_of_join) # label(axiom). [assumption].
% 0.72/1.00 16 join(A,meet(B,join(A,C))) = meet(join(A,B),join(A,C)) # label(modular_law) # label(axiom). [assumption].
% 0.72/1.00 17 meet(join(A,B),join(A,C)) = join(A,meet(B,join(A,C))). [copy(16),flip(a)].
% 0.72/1.00 18 join(a,meet(complement(a),join(a,b))) != join(a,b) # label(prove_orthomodular_law) # label(negated_conjecture) # answer(prove_orthomodular_law). [assumption].
% 0.72/1.00 20 join(A,complement(A)) = n1. [back_rewrite(4),rewrite([9(2)])].
% 0.72/1.00 42 meet(A,n1) = A. [para(20(a,1),6(a,1,2))].
% 0.72/1.00 46 join(A,meet(complement(A),join(A,B))) = meet(n1,join(A,B)). [para(20(a,1),17(a,1,1)),flip(a)].
% 0.72/1.00 47 meet(n1,join(A,B)) = join(A,B). [para(20(a,1),17(a,1,2)),rewrite([8(3),20(5),42(5)])].
% 0.72/1.00 48 $F # answer(prove_orthomodular_law). [back_rewrite(18),rewrite([46(8),47(5)]),xx(a)].
% 0.72/1.00
% 0.72/1.00 % SZS output end Refutation
% 0.72/1.00 ============================== end of proof ==========================
% 0.72/1.00
% 0.72/1.00 ============================== STATISTICS ============================
% 0.72/1.00
% 0.72/1.00 Given=15. Generated=190. Kept=44. proofs=1.
% 0.72/1.00 Usable=14. Sos=25. Demods=39. Limbo=2, Disabled=18. Hints=0.
% 0.72/1.00 Megabytes=0.07.
% 0.72/1.00 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.72/1.00
% 0.72/1.00 ============================== end of statistics =====================
% 0.72/1.00
% 0.72/1.00 ============================== end of search =========================
% 0.72/1.00
% 0.72/1.00 THEOREM PROVED
% 0.72/1.00 % SZS status Unsatisfiable
% 0.72/1.00
% 0.72/1.00 Exiting with 1 proof.
% 0.72/1.00
% 0.72/1.00 Process 22587 exit (max_proofs) Wed Jun 29 21:09:08 2022
% 0.72/1.00 Prover9 interrupted
%------------------------------------------------------------------------------