TSTP Solution File: LAT013-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT013-1 : TPTP v8.1.0. Released v2.2.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:06 EDT 2022
% Result : Unsatisfiable 1.36s 1.65s
% Output : Refutation 1.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT013-1 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 29 01:43:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.36/1.65 ============================== Prover9 ===============================
% 1.36/1.65 Prover9 (32) version 2009-11A, November 2009.
% 1.36/1.65 Process 9364 was started by sandbox on n025.cluster.edu,
% 1.36/1.65 Wed Jun 29 01:43:07 2022
% 1.36/1.65 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_9211_n025.cluster.edu".
% 1.36/1.65 ============================== end of head ===========================
% 1.36/1.65
% 1.36/1.65 ============================== INPUT =================================
% 1.36/1.65
% 1.36/1.65 % Reading from file /tmp/Prover9_9211_n025.cluster.edu
% 1.36/1.65
% 1.36/1.65 set(prolog_style_variables).
% 1.36/1.65 set(auto2).
% 1.36/1.65 % set(auto2) -> set(auto).
% 1.36/1.65 % set(auto) -> set(auto_inference).
% 1.36/1.65 % set(auto) -> set(auto_setup).
% 1.36/1.65 % set(auto_setup) -> set(predicate_elim).
% 1.36/1.65 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.36/1.65 % set(auto) -> set(auto_limits).
% 1.36/1.65 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.36/1.65 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.36/1.65 % set(auto) -> set(auto_denials).
% 1.36/1.65 % set(auto) -> set(auto_process).
% 1.36/1.65 % set(auto2) -> assign(new_constants, 1).
% 1.36/1.65 % set(auto2) -> assign(fold_denial_max, 3).
% 1.36/1.65 % set(auto2) -> assign(max_weight, "200.000").
% 1.36/1.65 % set(auto2) -> assign(max_hours, 1).
% 1.36/1.65 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.36/1.65 % set(auto2) -> assign(max_seconds, 0).
% 1.36/1.65 % set(auto2) -> assign(max_minutes, 5).
% 1.36/1.65 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.36/1.65 % set(auto2) -> set(sort_initial_sos).
% 1.36/1.65 % set(auto2) -> assign(sos_limit, -1).
% 1.36/1.65 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.36/1.65 % set(auto2) -> assign(max_megs, 400).
% 1.36/1.65 % set(auto2) -> assign(stats, some).
% 1.36/1.65 % set(auto2) -> clear(echo_input).
% 1.36/1.65 % set(auto2) -> set(quiet).
% 1.36/1.65 % set(auto2) -> clear(print_initial_clauses).
% 1.36/1.65 % set(auto2) -> clear(print_given).
% 1.36/1.65 assign(lrs_ticks,-1).
% 1.36/1.65 assign(sos_limit,10000).
% 1.36/1.65 assign(order,kbo).
% 1.36/1.65 set(lex_order_vars).
% 1.36/1.65 clear(print_given).
% 1.36/1.65
% 1.36/1.65 % formulas(sos). % not echoed (5 formulas)
% 1.36/1.65
% 1.36/1.65 ============================== end of input ==========================
% 1.36/1.65
% 1.36/1.65 % From the command line: assign(max_seconds, 300).
% 1.36/1.65
% 1.36/1.65 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.36/1.65
% 1.36/1.65 % Formulas that are not ordinary clauses:
% 1.36/1.65
% 1.36/1.65 ============================== end of process non-clausal formulas ===
% 1.36/1.65
% 1.36/1.65 ============================== PROCESS INITIAL CLAUSES ===============
% 1.36/1.65
% 1.36/1.65 ============================== PREDICATE ELIMINATION =================
% 1.36/1.65
% 1.36/1.65 ============================== end predicate elimination =============
% 1.36/1.65
% 1.36/1.65 Auto_denials:
% 1.36/1.65 % copying label prove_associativity_of_meet to answer in negative clause
% 1.36/1.65
% 1.36/1.65 Term ordering decisions:
% 1.36/1.65 Function symbol KB weights: a=1. b=1. c=1. join=1. meet=1.
% 1.36/1.65
% 1.36/1.65 ============================== end of process initial clauses ========
% 1.36/1.65
% 1.36/1.65 ============================== CLAUSES FOR SEARCH ====================
% 1.36/1.65
% 1.36/1.65 ============================== end of clauses for search =============
% 1.36/1.65
% 1.36/1.65 ============================== SEARCH ================================
% 1.36/1.65
% 1.36/1.65 % Starting search at 0.01 seconds.
% 1.36/1.65
% 1.36/1.65 ============================== PROOF =================================
% 1.36/1.65 % SZS status Unsatisfiable
% 1.36/1.65 % SZS output start Refutation
% 1.36/1.65
% 1.36/1.65 % Proof 1 at 0.63 (+ 0.03) seconds: prove_associativity_of_meet.
% 1.36/1.65 % Length of proof is 27.
% 1.36/1.65 % Level of proof is 11.
% 1.36/1.65 % Maximum clause weight is 21.000.
% 1.36/1.65 % Given clauses 175.
% 1.36/1.65
% 1.36/1.65 1 join(A,meet(B,meet(A,C))) = A # label(mckenzie1) # label(axiom). [assumption].
% 1.36/1.65 2 meet(A,join(B,join(A,C))) = A # label(mckenzie2) # label(axiom). [assumption].
% 1.36/1.65 3 join(join(meet(A,B),meet(B,C)),B) = B # label(mckenzie3) # label(axiom). [assumption].
% 1.36/1.65 4 meet(meet(join(A,B),join(B,C)),B) = B # label(mckenzie4) # label(axiom). [assumption].
% 1.36/1.65 5 meet(meet(a,b),c) != meet(a,meet(b,c)) # label(prove_associativity_of_meet) # label(negated_conjecture) # answer(prove_associativity_of_meet). [assumption].
% 1.36/1.65 6 join(A,meet(B,A)) = A. [para(2(a,1),1(a,1,2,2))].
% 1.36/1.65 7 meet(A,join(B,A)) = A. [para(1(a,1),2(a,1,2,2))].
% 1.36/1.65 8 join(meet(A,B),B) = B. [para(1(a,1),3(a,1,1))].
% 1.36/1.65 10 meet(A,join(A,B)) = A. [para(3(a,1),2(a,1,2))].
% 1.36/1.65 14 join(A,meet(A,B)) = A. [para(4(a,1),1(a,1,2))].
% 1.36/1.65 15 meet(meet(A,join(meet(B,meet(A,C)),D)),meet(B,meet(A,C))) = meet(B,meet(A,C)). [para(1(a,1),4(a,1,1,1))].
% 1.36/1.65 19 meet(A,A) = A. [para(3(a,1),4(a,1,1,1)),rewrite([10(2)])].
% 1.36/1.65 22 meet(meet(A,join(meet(B,A),C)),meet(B,A)) = meet(B,A). [para(6(a,1),4(a,1,1,1))].
% 1.36/1.65 29 meet(meet(join(A,meet(B,C)),C),meet(B,C)) = meet(B,C). [para(8(a,1),4(a,1,1,2))].
% 1.36/1.65 30 join(A,join(B,A)) = join(B,A). [para(7(a,1),8(a,1,1))].
% 1.36/1.65 62 join(meet(A,B),A) = A. [para(14(a,1),30(a,1,2)),rewrite([14(4)])].
% 1.36/1.65 117 meet(meet(A,B),meet(B,meet(A,C))) = meet(B,meet(A,C)). [para(62(a,1),15(a,1,1,2))].
% 1.36/1.65 337 meet(meet(A,B),meet(B,A)) = meet(B,A). [para(62(a,1),22(a,1,1,2))].
% 1.36/1.65 1242 join(meet(A,B),meet(B,A)) = meet(A,B). [para(337(a,1),14(a,1,2))].
% 1.36/1.65 1243 meet(A,B) = meet(B,A). [para(337(a,1),62(a,1,1)),rewrite([1242(3)])].
% 1.36/1.65 1245 meet(meet(A,B),meet(B,join(C,meet(A,B)))) = meet(A,B). [para(29(a,1),337(a,2)),rewrite([1243(4),1243(8),1243(10),19(11)])].
% 1.36/1.65 1652 meet(c,meet(a,b)) != meet(a,meet(b,c)) # answer(prove_associativity_of_meet). [back_rewrite(5),rewrite([1243(5)])].
% 1.36/1.65 2097 join(meet(A,B),meet(B,meet(A,C))) = meet(A,B). [para(117(a,1),14(a,1,2))].
% 1.36/1.65 3118 meet(meet(A,B),meet(C,A)) = meet(C,meet(A,B)). [para(2097(a,1),1245(a,1,2,2)),rewrite([1243(4),117(6)])].
% 1.36/1.65 3129 meet(meet(A,B),meet(B,C)) = meet(A,meet(B,C)). [para(3118(a,1),1243(a,1)),flip(a)].
% 1.36/1.65 3130 meet(A,meet(B,C)) = meet(C,meet(A,B)). [para(1243(a,1),3118(a,1,1)),rewrite([1243(2),3129(3),1243(3)])].
% 1.36/1.65 3131 $F # answer(prove_associativity_of_meet). [resolve(3130,a,1652,a(flip))].
% 1.36/1.65
% 1.36/1.65 % SZS output end Refutation
% 1.36/1.65 ============================== end of proof ==========================
% 1.36/1.65
% 1.36/1.65 ============================== STATISTICS ============================
% 1.36/1.65
% 1.36/1.65 Given=175. Generated=28789. Kept=3130. proofs=1.
% 1.36/1.65 Usable=104. Sos=1506. Demods=1613. Limbo=4, Disabled=1520. Hints=0.
% 1.36/1.65 Megabytes=3.29.
% 1.36/1.65 User_CPU=0.63, System_CPU=0.03, Wall_clock=1.
% 1.36/1.65
% 1.36/1.65 ============================== end of statistics =====================
% 1.36/1.65
% 1.36/1.65 ============================== end of search =========================
% 1.36/1.65
% 1.36/1.65 THEOREM PROVED
% 1.36/1.65 % SZS status Unsatisfiable
% 1.36/1.65
% 1.36/1.65 Exiting with 1 proof.
% 1.36/1.65
% 1.36/1.65 Process 9364 exit (max_proofs) Wed Jun 29 01:43:08 2022
% 1.36/1.65 Prover9 interrupted
%------------------------------------------------------------------------------