TSTP Solution File: LAT008-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT008-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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:05 EDT 2022
% Result : Unsatisfiable 0.42s 1.00s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LAT008-1 : TPTP v8.1.0. Released v2.2.0.
% 0.10/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 30 06:16:57 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.42/1.00 ============================== Prover9 ===============================
% 0.42/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.00 Process 15547 was started by sandbox2 on n021.cluster.edu,
% 0.42/1.00 Thu Jun 30 06:16:58 2022
% 0.42/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_15393_n021.cluster.edu".
% 0.42/1.00 ============================== end of head ===========================
% 0.42/1.00
% 0.42/1.00 ============================== INPUT =================================
% 0.42/1.00
% 0.42/1.00 % Reading from file /tmp/Prover9_15393_n021.cluster.edu
% 0.42/1.00
% 0.42/1.00 set(prolog_style_variables).
% 0.42/1.00 set(auto2).
% 0.42/1.00 % set(auto2) -> set(auto).
% 0.42/1.00 % set(auto) -> set(auto_inference).
% 0.42/1.00 % set(auto) -> set(auto_setup).
% 0.42/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.00 % set(auto) -> set(auto_limits).
% 0.42/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.00 % set(auto) -> set(auto_denials).
% 0.42/1.00 % set(auto) -> set(auto_process).
% 0.42/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.00 % set(auto2) -> assign(stats, some).
% 0.42/1.00 % set(auto2) -> clear(echo_input).
% 0.42/1.00 % set(auto2) -> set(quiet).
% 0.42/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.00 % set(auto2) -> clear(print_given).
% 0.42/1.00 assign(lrs_ticks,-1).
% 0.42/1.00 assign(sos_limit,10000).
% 0.42/1.00 assign(order,kbo).
% 0.42/1.00 set(lex_order_vars).
% 0.42/1.00 clear(print_given).
% 0.42/1.00
% 0.42/1.00 % formulas(sos). % not echoed (3 formulas)
% 0.42/1.00
% 0.42/1.00 ============================== end of input ==========================
% 0.42/1.00
% 0.42/1.00 % From the command line: assign(max_seconds, 300).
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.00
% 0.42/1.00 % Formulas that are not ordinary clauses:
% 0.42/1.00
% 0.42/1.00 ============================== end of process non-clausal formulas ===
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/1.00
% 0.42/1.00 ============================== PREDICATE ELIMINATION =================
% 0.42/1.00
% 0.42/1.00 ============================== end predicate elimination =============
% 0.42/1.00
% 0.42/1.00 Auto_denials:
% 0.42/1.00 % copying label prove_absorbtion_dual to answer in negative clause
% 0.42/1.00
% 0.42/1.00 Term ordering decisions:
% 0.42/1.00 Function symbol KB weights: a=1. b=1. meet=1. join=1.
% 0.42/1.00
% 0.42/1.00 ============================== end of process initial clauses ========
% 0.42/1.00
% 0.42/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.42/1.00
% 0.42/1.00 ============================== end of clauses for search =============
% 0.42/1.00
% 0.42/1.00 ============================== SEARCH ================================
% 0.42/1.00
% 0.42/1.00 % Starting search at 0.01 seconds.
% 0.42/1.00
% 0.42/1.00 ============================== PROOF =================================
% 0.42/1.00 % SZS status Unsatisfiable
% 0.42/1.00 % SZS output start Refutation
% 0.42/1.00
% 0.42/1.00 % Proof 1 at 0.02 (+ 0.00) seconds: prove_absorbtion_dual.
% 0.42/1.00 % Length of proof is 23.
% 0.42/1.00 % Level of proof is 14.
% 0.42/1.00 % Maximum clause weight is 15.000.
% 0.42/1.00 % Given clauses 22.
% 0.42/1.00
% 0.42/1.00 1 meet(A,join(A,B)) = A # label(absorption) # label(axiom). [assumption].
% 0.42/1.00 2 meet(A,join(B,C)) = join(meet(C,A),meet(B,A)) # label(distribution) # label(axiom). [assumption].
% 0.42/1.00 3 join(meet(A,B),meet(C,B)) = meet(B,join(C,A)). [copy(2),flip(a)].
% 0.42/1.00 4 join(a,meet(a,b)) != a # label(prove_absorbtion_dual) # label(negated_conjecture) # answer(prove_absorbtion_dual). [assumption].
% 0.42/1.00 5 meet(meet(A,B),meet(B,join(C,A))) = meet(A,B). [para(3(a,1),1(a,1,2))].
% 0.42/1.00 6 join(A,meet(B,join(A,C))) = meet(join(A,C),join(B,A)). [para(1(a,1),3(a,1,1))].
% 0.42/1.00 7 join(meet(A,join(B,C)),B) = meet(join(B,C),join(B,A)). [para(1(a,1),3(a,1,2))].
% 0.42/1.00 9 meet(meet(A,B),B) = meet(A,B). [para(1(a,1),5(a,1,2))].
% 0.42/1.00 14 meet(A,join(B,meet(C,A))) = meet(A,join(B,C)). [para(9(a,1),3(a,1,1)),rewrite([3(3)]),flip(a)].
% 0.42/1.00 15 meet(A,join(meet(B,A),C)) = meet(A,join(B,C)). [para(9(a,1),3(a,1,2)),rewrite([3(3)]),flip(a)].
% 0.42/1.00 22 meet(A,meet(A,join(B,C))) = meet(A,join(C,B)). [para(3(a,1),14(a,1,2)),rewrite([15(6)])].
% 0.42/1.00 33 meet(join(A,B),join(A,A)) = join(A,A). [para(1(a,1),6(a,1,2)),flip(a)].
% 0.42/1.00 50 meet(A,join(B,A)) = meet(A,A). [para(1(a,1),22(a,1,2)),flip(a)].
% 0.42/1.00 73 meet(A,A) = A. [para(50(a,1),1(a,1))].
% 0.42/1.00 76 join(A,meet(B,A)) = A. [para(50(a,1),3(a,2)),rewrite([73(1),73(3)])].
% 0.42/1.00 79 join(A,B) = join(B,A). [para(50(a,1),7(a,1,1)),rewrite([73(1),73(4)])].
% 0.42/1.00 109 join(A,A) = A. [para(76(a,1),33(a,1,1)),rewrite([1(2)]),flip(a)].
% 0.42/1.00 118 meet(join(A,B),A) = A. [back_rewrite(33),rewrite([109(2),109(3)])].
% 0.42/1.00 119 meet(A,meet(B,A)) = meet(A,B). [para(109(a,1),14(a,1,2)),rewrite([79(4),14(5),109(3)])].
% 0.42/1.00 130 meet(join(A,B),B) = B. [para(79(a,1),118(a,1,1))].
% 0.42/1.00 131 meet(A,B) = meet(B,A). [para(76(a,1),130(a,1,1)),rewrite([119(2)])].
% 0.42/1.00 150 join(A,meet(A,B)) = A. [back_rewrite(76),rewrite([131(1)])].
% 0.42/1.00 151 $F # answer(prove_absorbtion_dual). [resolve(150,a,4,a)].
% 0.42/1.00
% 0.42/1.00 % SZS output end Refutation
% 0.42/1.00 ============================== end of proof ==========================
% 0.42/1.00
% 0.42/1.00 ============================== STATISTICS ============================
% 0.42/1.00
% 0.42/1.00 Given=22. Generated=445. Kept=149. proofs=1.
% 0.42/1.00 Usable=8. Sos=23. Demods=49. Limbo=19, Disabled=101. Hints=0.
% 0.42/1.00 Megabytes=0.14.
% 0.42/1.00 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.42/1.00
% 0.42/1.00 ============================== end of statistics =====================
% 0.42/1.00
% 0.42/1.00 ============================== end of search =========================
% 0.42/1.00
% 0.42/1.00 THEOREM PROVED
% 0.42/1.00 % SZS status Unsatisfiable
% 0.42/1.00
% 0.42/1.00 Exiting with 1 proof.
% 0.42/1.00
% 0.42/1.00 Process 15547 exit (max_proofs) Thu Jun 30 06:16:58 2022
% 0.42/1.00 Prover9 interrupted
%------------------------------------------------------------------------------