TSTP Solution File: LAT040-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT040-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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:15 EDT 2022
% Result : Unsatisfiable 0.64s 0.93s
% Output : Refutation 0.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LAT040-1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n024.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 17:38:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.64/0.93 ============================== Prover9 ===============================
% 0.64/0.93 Prover9 (32) version 2009-11A, November 2009.
% 0.64/0.93 Process 5177 was started by sandbox on n024.cluster.edu,
% 0.64/0.93 Wed Jun 29 17:38:46 2022
% 0.64/0.93 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5023_n024.cluster.edu".
% 0.64/0.93 ============================== end of head ===========================
% 0.64/0.93
% 0.64/0.93 ============================== INPUT =================================
% 0.64/0.93
% 0.64/0.93 % Reading from file /tmp/Prover9_5023_n024.cluster.edu
% 0.64/0.93
% 0.64/0.93 set(prolog_style_variables).
% 0.64/0.93 set(auto2).
% 0.64/0.93 % set(auto2) -> set(auto).
% 0.64/0.93 % set(auto) -> set(auto_inference).
% 0.64/0.93 % set(auto) -> set(auto_setup).
% 0.64/0.93 % set(auto_setup) -> set(predicate_elim).
% 0.64/0.93 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.64/0.93 % set(auto) -> set(auto_limits).
% 0.64/0.93 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.64/0.93 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.64/0.93 % set(auto) -> set(auto_denials).
% 0.64/0.93 % set(auto) -> set(auto_process).
% 0.64/0.93 % set(auto2) -> assign(new_constants, 1).
% 0.64/0.93 % set(auto2) -> assign(fold_denial_max, 3).
% 0.64/0.93 % set(auto2) -> assign(max_weight, "200.000").
% 0.64/0.93 % set(auto2) -> assign(max_hours, 1).
% 0.64/0.93 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.64/0.93 % set(auto2) -> assign(max_seconds, 0).
% 0.64/0.93 % set(auto2) -> assign(max_minutes, 5).
% 0.64/0.93 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.64/0.93 % set(auto2) -> set(sort_initial_sos).
% 0.64/0.93 % set(auto2) -> assign(sos_limit, -1).
% 0.64/0.93 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.64/0.93 % set(auto2) -> assign(max_megs, 400).
% 0.64/0.93 % set(auto2) -> assign(stats, some).
% 0.64/0.93 % set(auto2) -> clear(echo_input).
% 0.64/0.93 % set(auto2) -> set(quiet).
% 0.64/0.93 % set(auto2) -> clear(print_initial_clauses).
% 0.64/0.93 % set(auto2) -> clear(print_given).
% 0.64/0.93 assign(lrs_ticks,-1).
% 0.64/0.93 assign(sos_limit,10000).
% 0.64/0.93 assign(order,kbo).
% 0.64/0.93 set(lex_order_vars).
% 0.64/0.93 clear(print_given).
% 0.64/0.93
% 0.64/0.93 % formulas(sos). % not echoed (13 formulas)
% 0.64/0.93
% 0.64/0.93 ============================== end of input ==========================
% 0.64/0.93
% 0.64/0.93 % From the command line: assign(max_seconds, 300).
% 0.64/0.93
% 0.64/0.93 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.64/0.93
% 0.64/0.93 % Formulas that are not ordinary clauses:
% 0.64/0.93
% 0.64/0.93 ============================== end of process non-clausal formulas ===
% 0.64/0.93
% 0.64/0.93 ============================== PROCESS INITIAL CLAUSES ===============
% 0.64/0.93
% 0.64/0.93 ============================== PREDICATE ELIMINATION =================
% 0.64/0.93
% 0.64/0.93 ============================== end predicate elimination =============
% 0.64/0.93
% 0.64/0.93 Auto_denials:
% 0.64/0.93 % copying label rhs to answer in negative clause
% 0.64/0.93
% 0.64/0.93 Term ordering decisions:
% 0.64/0.93 Function symbol KB weights: xx=1. yy=1. zz=1. join=1. meet=1.
% 0.64/0.93
% 0.64/0.93 ============================== end of process initial clauses ========
% 0.64/0.93
% 0.64/0.93 ============================== CLAUSES FOR SEARCH ====================
% 0.64/0.93
% 0.64/0.93 ============================== end of clauses for search =============
% 0.64/0.93
% 0.64/0.93 ============================== SEARCH ================================
% 0.64/0.93
% 0.64/0.93 % Starting search at 0.01 seconds.
% 0.64/0.93
% 0.64/0.93 ============================== PROOF =================================
% 0.64/0.93 % SZS status Unsatisfiable
% 0.64/0.93 % SZS output start Refutation
% 0.64/0.93
% 0.64/0.93 % Proof 1 at 0.04 (+ 0.00) seconds: rhs.
% 0.64/0.93 % Length of proof is 31.
% 0.64/0.93 % Level of proof is 10.
% 0.64/0.93 % Maximum clause weight is 17.000.
% 0.64/0.93 % Given clauses 30.
% 0.64/0.93
% 0.64/0.93 2 join(A,A) = A # label(idempotence_of_join) # label(axiom). [assumption].
% 0.64/0.93 3 meet(A,join(A,B)) = A # label(absorption1) # label(axiom). [assumption].
% 0.64/0.93 4 join(A,meet(A,B)) = A # label(absorption2) # label(axiom). [assumption].
% 0.64/0.93 5 meet(A,B) = meet(B,A) # label(commutativity_of_meet) # label(axiom). [assumption].
% 0.64/0.93 6 join(A,B) = join(B,A) # label(commutativity_of_join) # label(axiom). [assumption].
% 0.64/0.93 7 join(xx,yy) = join(xx,zz) # label(lhs1) # label(hypothesis). [assumption].
% 0.64/0.93 8 join(xx,zz) = join(xx,yy). [copy(7),flip(a)].
% 0.64/0.93 9 meet(xx,yy) = meet(xx,zz) # label(lhs2) # label(hypothesis). [assumption].
% 0.64/0.93 10 meet(xx,zz) = meet(xx,yy). [copy(9),flip(a)].
% 0.64/0.93 13 join(join(A,B),C) = join(A,join(B,C)) # label(associativity_of_join) # label(axiom). [assumption].
% 0.64/0.93 14 join(A,join(B,C)) = join(C,join(A,B)). [copy(13),rewrite([6(2)]),flip(a)].
% 0.64/0.93 15 join(A,meet(B,C)) = meet(join(A,B),join(A,C)) # label(dist_join) # label(hypothesis). [assumption].
% 0.64/0.93 16 meet(join(A,B),join(A,C)) = join(A,meet(B,C)). [copy(15),flip(a)].
% 0.64/0.93 17 meet(A,join(B,C)) = join(meet(A,B),meet(A,C)) # label(dist_meet) # label(hypothesis). [assumption].
% 0.64/0.93 18 join(meet(A,B),meet(A,C)) = meet(A,join(B,C)). [copy(17),flip(a)].
% 0.64/0.93 19 yy != zz # label(rhs) # label(negated_conjecture) # answer(rhs). [assumption].
% 0.64/0.93 20 zz != yy # answer(rhs). [copy(19),flip(a)].
% 0.64/0.93 24 join(A,join(B,meet(A,C))) = join(A,B). [para(4(a,1),14(a,2,2)),rewrite([6(2),6(4)])].
% 0.64/0.93 26 meet(join(A,B),join(B,C)) = join(B,meet(A,C)). [para(6(a,1),16(a,1,1))].
% 0.64/0.93 29 meet(join(A,join(B,C)),join(B,D)) = join(B,meet(D,join(A,C))). [para(14(a,1),16(a,1,1)),rewrite([6(5),5(6)])].
% 0.64/0.93 48 join(xx,join(zz,meet(A,xx))) = join(xx,yy). [para(8(a,1),24(a,2)),rewrite([5(4)])].
% 0.64/0.93 55 meet(A,join(B,A)) = join(A,meet(B,A)). [para(2(a,1),26(a,1,2)),rewrite([5(2)])].
% 0.64/0.93 78 meet(zz,join(xx,yy)) = join(zz,meet(xx,yy)). [para(8(a,1),55(a,1,2)),rewrite([10(9)])].
% 0.64/0.93 84 meet(A,join(B,join(A,C))) = A. [para(2(a,1),29(a,1,2)),rewrite([5(3),4(6)])].
% 0.64/0.93 110 join(zz,meet(xx,yy)) = zz. [para(48(a,1),84(a,1,2)),rewrite([78(5)])].
% 0.64/0.93 116 join(yy,meet(xx,yy)) = zz. [para(110(a,1),16(a,2)),rewrite([6(3),8(3),6(6),26(7),10(4)])].
% 0.64/0.93 124 meet(yy,zz) = yy. [para(116(a,1),3(a,1,2))].
% 0.64/0.93 131 meet(yy,join(A,zz)) = yy. [para(116(a,1),84(a,1,2,2))].
% 0.64/0.93 163 join(yy,meet(A,yy)) = yy. [para(124(a,1),18(a,1,1)),rewrite([5(3),6(7),131(8)])].
% 0.64/0.93 165 zz = yy. [back_rewrite(116),rewrite([163(5)]),flip(a)].
% 0.64/0.93 166 $F # answer(rhs). [resolve(165,a,20,a)].
% 0.64/0.93
% 0.64/0.93 % SZS output end Refutation
% 0.64/0.93 ============================== end of proof ==========================
% 0.64/0.93
% 0.64/0.93 ============================== STATISTICS ============================
% 0.64/0.93
% 0.64/0.93 Given=30. Generated=804. Kept=158. proofs=1.
% 0.64/0.93 Usable=26. Sos=95. Demods=122. Limbo=2, Disabled=47. Hints=0.
% 0.64/0.93 Megabytes=0.19.
% 0.64/0.93 User_CPU=0.05, System_CPU=0.00, Wall_clock=0.
% 0.64/0.93
% 0.64/0.93 ============================== end of statistics =====================
% 0.64/0.93
% 0.64/0.93 ============================== end of search =========================
% 0.64/0.93
% 0.64/0.93 THEOREM PROVED
% 0.64/0.93 % SZS status Unsatisfiable
% 0.64/0.93
% 0.64/0.93 Exiting with 1 proof.
% 0.64/0.93
% 0.64/0.93 Process 5177 exit (max_proofs) Wed Jun 29 17:38:46 2022
% 0.64/0.93 Prover9 interrupted
%------------------------------------------------------------------------------