TSTP Solution File: LAT031-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT031-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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:12 EDT 2022
% Result : Unsatisfiable 0.82s 1.08s
% Output : Refutation 0.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT031-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n029.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 : Wed Jun 29 01:12:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.82/1.08 ============================== Prover9 ===============================
% 0.82/1.08 Prover9 (32) version 2009-11A, November 2009.
% 0.82/1.08 Process 18142 was started by sandbox2 on n029.cluster.edu,
% 0.82/1.08 Wed Jun 29 01:12:38 2022
% 0.82/1.08 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_17989_n029.cluster.edu".
% 0.82/1.08 ============================== end of head ===========================
% 0.82/1.08
% 0.82/1.08 ============================== INPUT =================================
% 0.82/1.08
% 0.82/1.08 % Reading from file /tmp/Prover9_17989_n029.cluster.edu
% 0.82/1.08
% 0.82/1.08 set(prolog_style_variables).
% 0.82/1.08 set(auto2).
% 0.82/1.08 % set(auto2) -> set(auto).
% 0.82/1.08 % set(auto) -> set(auto_inference).
% 0.82/1.08 % set(auto) -> set(auto_setup).
% 0.82/1.08 % set(auto_setup) -> set(predicate_elim).
% 0.82/1.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.82/1.08 % set(auto) -> set(auto_limits).
% 0.82/1.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.82/1.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.82/1.08 % set(auto) -> set(auto_denials).
% 0.82/1.08 % set(auto) -> set(auto_process).
% 0.82/1.08 % set(auto2) -> assign(new_constants, 1).
% 0.82/1.08 % set(auto2) -> assign(fold_denial_max, 3).
% 0.82/1.08 % set(auto2) -> assign(max_weight, "200.000").
% 0.82/1.08 % set(auto2) -> assign(max_hours, 1).
% 0.82/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.82/1.08 % set(auto2) -> assign(max_seconds, 0).
% 0.82/1.08 % set(auto2) -> assign(max_minutes, 5).
% 0.82/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.82/1.08 % set(auto2) -> set(sort_initial_sos).
% 0.82/1.08 % set(auto2) -> assign(sos_limit, -1).
% 0.82/1.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.82/1.08 % set(auto2) -> assign(max_megs, 400).
% 0.82/1.08 % set(auto2) -> assign(stats, some).
% 0.82/1.08 % set(auto2) -> clear(echo_input).
% 0.82/1.08 % set(auto2) -> set(quiet).
% 0.82/1.08 % set(auto2) -> clear(print_initial_clauses).
% 0.82/1.08 % set(auto2) -> clear(print_given).
% 0.82/1.08 assign(lrs_ticks,-1).
% 0.82/1.08 assign(sos_limit,10000).
% 0.82/1.08 assign(order,kbo).
% 0.82/1.08 set(lex_order_vars).
% 0.82/1.08 clear(print_given).
% 0.82/1.08
% 0.82/1.08 % formulas(sos). % not echoed (10 formulas)
% 0.82/1.08
% 0.82/1.08 ============================== end of input ==========================
% 0.82/1.08
% 0.82/1.08 % From the command line: assign(max_seconds, 300).
% 0.82/1.08
% 0.82/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.82/1.08
% 0.82/1.08 % Formulas that are not ordinary clauses:
% 0.82/1.08
% 0.82/1.08 ============================== end of process non-clausal formulas ===
% 0.82/1.08
% 0.82/1.08 ============================== PROCESS INITIAL CLAUSES ===============
% 0.82/1.08
% 0.82/1.08 ============================== PREDICATE ELIMINATION =================
% 0.82/1.08
% 0.82/1.08 ============================== end predicate elimination =============
% 0.82/1.08
% 0.82/1.08 Auto_denials:
% 0.82/1.08 % copying label dist_join to answer in negative clause
% 0.82/1.08
% 0.82/1.08 Term ordering decisions:
% 0.82/1.08 Function symbol KB weights: xx=1. yy=1. zz=1. meet=1. join=1.
% 0.82/1.08
% 0.82/1.08 ============================== end of process initial clauses ========
% 0.82/1.08
% 0.82/1.08 ============================== CLAUSES FOR SEARCH ====================
% 0.82/1.08
% 0.82/1.08 ============================== end of clauses for search =============
% 0.82/1.08
% 0.82/1.08 ============================== SEARCH ================================
% 0.82/1.08
% 0.82/1.08 % Starting search at 0.01 seconds.
% 0.82/1.08
% 0.82/1.08 ============================== PROOF =================================
% 0.82/1.08 % SZS status Unsatisfiable
% 0.82/1.08 % SZS output start Refutation
% 0.82/1.08
% 0.82/1.08 % Proof 1 at 0.09 (+ 0.00) seconds: dist_join.
% 0.82/1.09 % Length of proof is 27.
% 0.82/1.09 % Level of proof is 9.
% 0.82/1.09 % Maximum clause weight is 17.000.
% 0.82/1.09 % Given clauses 36.
% 0.82/1.09
% 0.82/1.09 1 meet(A,A) = A # label(idempotence_of_meet) # label(axiom). [assumption].
% 0.82/1.09 3 meet(A,join(A,B)) = A # label(absorption1) # label(axiom). [assumption].
% 0.82/1.09 4 join(A,meet(A,B)) = A # label(absorption2) # label(axiom). [assumption].
% 0.82/1.09 5 meet(A,B) = meet(B,A) # label(commutativity_of_meet) # label(axiom). [assumption].
% 0.82/1.09 6 join(A,B) = join(B,A) # label(commutativity_of_join) # label(axiom). [assumption].
% 0.82/1.09 7 meet(meet(A,B),C) = meet(A,meet(B,C)) # label(associativity_of_meet) # label(axiom). [assumption].
% 0.82/1.09 8 meet(A,meet(B,C)) = meet(C,meet(A,B)). [copy(7),rewrite([5(2)]),flip(a)].
% 0.82/1.09 9 join(join(A,B),C) = join(A,join(B,C)) # label(associativity_of_join) # label(axiom). [assumption].
% 0.82/1.09 10 join(A,join(B,C)) = join(C,join(A,B)). [copy(9),rewrite([6(2)]),flip(a)].
% 0.82/1.09 11 meet(A,join(B,C)) = join(meet(A,B),meet(A,C)) # label(dist_meet) # label(hypothesis). [assumption].
% 0.82/1.09 12 join(meet(A,B),meet(A,C)) = meet(A,join(B,C)). [copy(11),flip(a)].
% 0.82/1.09 13 join(xx,meet(yy,zz)) != meet(join(xx,yy),join(xx,zz)) # label(dist_join) # label(negated_conjecture) # answer(dist_join). [assumption].
% 0.82/1.09 14 meet(join(xx,yy),join(xx,zz)) != join(xx,meet(yy,zz)) # answer(dist_join). [copy(13),flip(a)].
% 0.82/1.09 15 meet(A,meet(A,B)) = meet(A,B). [para(8(a,1),1(a,1)),rewrite([5(1),5(2),8(2,R),1(1),5(3)])].
% 0.82/1.09 18 join(A,join(B,meet(A,C))) = join(A,B). [para(4(a,1),10(a,2,2)),rewrite([6(2),6(4)])].
% 0.82/1.09 20 join(meet(A,B),meet(B,C)) = meet(B,join(A,C)). [para(5(a,1),12(a,1,1))].
% 0.82/1.09 21 join(meet(A,meet(B,C)),meet(B,D)) = meet(B,join(D,meet(A,C))). [para(8(a,1),12(a,1,1)),rewrite([5(5),6(6)])].
% 0.82/1.09 23 meet(A,join(B,meet(A,C))) = meet(A,join(C,B)). [para(15(a,1),12(a,1,1)),rewrite([12(3),6(4)]),flip(a)].
% 0.82/1.09 29 join(A,meet(B,A)) = meet(A,join(B,A)). [para(1(a,1),20(a,1,2)),rewrite([6(2)])].
% 0.82/1.09 30 join(A,meet(B,join(A,C))) = meet(join(A,C),join(A,B)). [para(3(a,1),20(a,1,1)),rewrite([5(2)])].
% 0.82/1.09 53 join(A,meet(B,meet(A,C))) = A. [para(1(a,1),21(a,1,2)),rewrite([6(3),3(6)])].
% 0.82/1.09 54 meet(A,join(join(A,B),meet(C,D))) = A. [para(3(a,1),21(a,1,2)),rewrite([6(3),53(3)]),flip(a)].
% 0.82/1.09 73 meet(A,join(B,join(join(A,C),meet(D,E)))) = A. [para(54(a,1),12(a,1,1)),rewrite([4(2),6(4)]),flip(a)].
% 0.82/1.09 75 meet(A,join(B,A)) = A. [para(54(a,1),20(a,1,2)),rewrite([6(2),29(2),73(7)])].
% 0.82/1.09 81 meet(join(A,B),join(A,meet(B,C))) = join(A,meet(B,C)). [para(18(a,1),75(a,1,2)),rewrite([6(3),5(4)])].
% 0.82/1.09 164 meet(join(A,B),join(A,C)) = join(A,meet(C,B)). [para(23(a,1),30(a,1,2)),rewrite([6(1),30(3),5(7),81(7)])].
% 0.82/1.09 183 $F # answer(dist_join). [back_rewrite(14),rewrite([164(7),5(4)]),xx(a)].
% 0.82/1.09
% 0.82/1.09 % SZS output end Refutation
% 0.82/1.09 ============================== end of proof ==========================
% 0.82/1.09
% 0.82/1.09 ============================== STATISTICS ============================
% 0.82/1.09
% 0.82/1.09 Given=36. Generated=1731. Kept=178. proofs=1.
% 0.82/1.09 Usable=30. Sos=94. Demods=143. Limbo=19, Disabled=45. Hints=0.
% 0.82/1.09 Megabytes=0.24.
% 0.82/1.09 User_CPU=0.09, System_CPU=0.00, Wall_clock=0.
% 0.82/1.09
% 0.82/1.09 ============================== end of statistics =====================
% 0.82/1.09
% 0.82/1.09 ============================== end of search =========================
% 0.82/1.09
% 0.82/1.09 THEOREM PROVED
% 0.82/1.09 % SZS status Unsatisfiable
% 0.82/1.09
% 0.82/1.09 Exiting with 1 proof.
% 0.82/1.09
% 0.82/1.09 Process 18142 exit (max_proofs) Wed Jun 29 01:12:38 2022
% 0.82/1.09 Prover9 interrupted
%------------------------------------------------------------------------------