TSTP Solution File: LAT012-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT012-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n004.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.26s 1.53s
% Output : Refutation 1.26s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LAT012-1 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n004.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 13:29:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.26/1.53 ============================== Prover9 ===============================
% 1.26/1.53 Prover9 (32) version 2009-11A, November 2009.
% 1.26/1.53 Process 28636 was started by sandbox2 on n004.cluster.edu,
% 1.26/1.53 Wed Jun 29 13:29:24 2022
% 1.26/1.53 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_28483_n004.cluster.edu".
% 1.26/1.53 ============================== end of head ===========================
% 1.26/1.53
% 1.26/1.53 ============================== INPUT =================================
% 1.26/1.53
% 1.26/1.53 % Reading from file /tmp/Prover9_28483_n004.cluster.edu
% 1.26/1.53
% 1.26/1.53 set(prolog_style_variables).
% 1.26/1.53 set(auto2).
% 1.26/1.53 % set(auto2) -> set(auto).
% 1.26/1.53 % set(auto) -> set(auto_inference).
% 1.26/1.53 % set(auto) -> set(auto_setup).
% 1.26/1.53 % set(auto_setup) -> set(predicate_elim).
% 1.26/1.53 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.26/1.53 % set(auto) -> set(auto_limits).
% 1.26/1.53 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.26/1.53 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.26/1.53 % set(auto) -> set(auto_denials).
% 1.26/1.53 % set(auto) -> set(auto_process).
% 1.26/1.53 % set(auto2) -> assign(new_constants, 1).
% 1.26/1.53 % set(auto2) -> assign(fold_denial_max, 3).
% 1.26/1.53 % set(auto2) -> assign(max_weight, "200.000").
% 1.26/1.53 % set(auto2) -> assign(max_hours, 1).
% 1.26/1.53 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.26/1.53 % set(auto2) -> assign(max_seconds, 0).
% 1.26/1.53 % set(auto2) -> assign(max_minutes, 5).
% 1.26/1.53 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.26/1.53 % set(auto2) -> set(sort_initial_sos).
% 1.26/1.53 % set(auto2) -> assign(sos_limit, -1).
% 1.26/1.53 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.26/1.53 % set(auto2) -> assign(max_megs, 400).
% 1.26/1.53 % set(auto2) -> assign(stats, some).
% 1.26/1.53 % set(auto2) -> clear(echo_input).
% 1.26/1.53 % set(auto2) -> set(quiet).
% 1.26/1.53 % set(auto2) -> clear(print_initial_clauses).
% 1.26/1.53 % set(auto2) -> clear(print_given).
% 1.26/1.53 assign(lrs_ticks,-1).
% 1.26/1.53 assign(sos_limit,10000).
% 1.26/1.53 assign(order,kbo).
% 1.26/1.53 set(lex_order_vars).
% 1.26/1.53 clear(print_given).
% 1.26/1.53
% 1.26/1.53 % formulas(sos). % not echoed (5 formulas)
% 1.26/1.53
% 1.26/1.53 ============================== end of input ==========================
% 1.26/1.53
% 1.26/1.53 % From the command line: assign(max_seconds, 300).
% 1.26/1.53
% 1.26/1.53 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.26/1.53
% 1.26/1.53 % Formulas that are not ordinary clauses:
% 1.26/1.53
% 1.26/1.53 ============================== end of process non-clausal formulas ===
% 1.26/1.53
% 1.26/1.53 ============================== PROCESS INITIAL CLAUSES ===============
% 1.26/1.53
% 1.26/1.53 ============================== PREDICATE ELIMINATION =================
% 1.26/1.53
% 1.26/1.53 ============================== end predicate elimination =============
% 1.26/1.53
% 1.26/1.53 Auto_denials:
% 1.26/1.53 % copying label prove_commutativity_of_meet to answer in negative clause
% 1.26/1.53
% 1.26/1.53 Term ordering decisions:
% 1.26/1.53 Function symbol KB weights: a=1. b=1. join=1. meet=1.
% 1.26/1.53
% 1.26/1.53 ============================== end of process initial clauses ========
% 1.26/1.53
% 1.26/1.53 ============================== CLAUSES FOR SEARCH ====================
% 1.26/1.53
% 1.26/1.53 ============================== end of clauses for search =============
% 1.26/1.53
% 1.26/1.53 ============================== SEARCH ================================
% 1.26/1.53
% 1.26/1.53 % Starting search at 0.01 seconds.
% 1.26/1.53
% 1.26/1.53 ============================== PROOF =================================
% 1.26/1.53 % SZS status Unsatisfiable
% 1.26/1.53 % SZS output start Refutation
% 1.26/1.53
% 1.26/1.53 % Proof 1 at 0.55 (+ 0.02) seconds: prove_commutativity_of_meet.
% 1.26/1.53 % Length of proof is 25.
% 1.26/1.53 % Level of proof is 8.
% 1.26/1.53 % Maximum clause weight is 15.000.
% 1.26/1.53 % Given clauses 226.
% 1.26/1.53
% 1.26/1.53 1 join(A,meet(B,meet(A,C))) = A # label(mckenzie1) # label(axiom). [assumption].
% 1.26/1.53 2 meet(A,join(B,join(A,C))) = A # label(mckenzie2) # label(axiom). [assumption].
% 1.26/1.53 3 join(join(meet(A,B),meet(B,C)),B) = B # label(mckenzie3) # label(axiom). [assumption].
% 1.26/1.53 4 meet(meet(join(A,B),join(B,C)),B) = B # label(mckenzie4) # label(axiom). [assumption].
% 1.26/1.53 5 meet(b,a) != meet(a,b) # label(prove_commutativity_of_meet) # label(negated_conjecture) # answer(prove_commutativity_of_meet). [assumption].
% 1.26/1.53 6 meet(b,a) = c_0. [new_symbol(5)].
% 1.26/1.53 7 meet(a,b) != c_0 # answer(prove_commutativity_of_meet). [back_rewrite(5),rewrite([6(3)]),flip(a)].
% 1.26/1.53 8 join(A,meet(B,A)) = A. [para(2(a,1),1(a,1,2,2))].
% 1.26/1.53 9 meet(A,join(B,A)) = A. [para(1(a,1),2(a,1,2,2))].
% 1.26/1.53 10 join(meet(A,B),B) = B. [para(1(a,1),3(a,1,1))].
% 1.26/1.53 16 join(A,meet(A,B)) = A. [para(4(a,1),1(a,1,2))].
% 1.26/1.53 27 meet(meet(A,join(meet(B,A),C)),meet(B,A)) = meet(B,A). [para(8(a,1),4(a,1,1,1))].
% 1.26/1.53 28 join(a,c_0) = a. [para(6(a,1),8(a,1,2))].
% 1.26/1.53 29 meet(meet(a,join(c_0,A)),c_0) = c_0. [para(28(a,1),4(a,1,1,1))].
% 1.26/1.53 39 join(A,join(B,A)) = join(B,A). [para(9(a,1),10(a,1,1))].
% 1.26/1.53 48 join(b,c_0) = b. [para(6(a,1),16(a,1,2))].
% 1.26/1.53 49 meet(meet(A,B),A) = meet(A,B). [para(16(a,1),9(a,1,2))].
% 1.26/1.53 65 meet(c_0,b) = c_0. [para(48(a,1),9(a,1,2))].
% 1.26/1.53 68 join(c_0,b) = b. [para(65(a,1),10(a,1,1))].
% 1.26/1.53 144 meet(meet(a,b),c_0) = c_0. [para(68(a,1),29(a,1,1,2))].
% 1.26/1.53 172 join(meet(A,B),A) = A. [para(16(a,1),39(a,1,2)),rewrite([16(4)])].
% 1.26/1.53 293 meet(c_0,meet(a,b)) = c_0. [para(144(a,1),49(a,1,1)),rewrite([144(10)])].
% 1.26/1.53 314 meet(meet(A,B),meet(B,A)) = meet(B,A). [para(172(a,1),27(a,1,1,2))].
% 1.26/1.53 4355 meet(a,b) = c_0. [para(6(a,1),314(a,1,1)),rewrite([293(5)]),flip(a)].
% 1.26/1.53 4356 $F # answer(prove_commutativity_of_meet). [resolve(4355,a,7,a)].
% 1.26/1.53
% 1.26/1.53 % SZS output end Refutation
% 1.26/1.53 ============================== end of proof ==========================
% 1.26/1.53
% 1.26/1.53 ============================== STATISTICS ============================
% 1.26/1.53
% 1.26/1.53 Given=226. Generated=33305. Kept=4355. proofs=1.
% 1.26/1.53 Usable=226. Sos=4123. Demods=4350. Limbo=2, Disabled=8. Hints=0.
% 1.26/1.53 Megabytes=6.11.
% 1.26/1.53 User_CPU=0.55, System_CPU=0.02, Wall_clock=0.
% 1.26/1.53
% 1.26/1.53 ============================== end of statistics =====================
% 1.26/1.53
% 1.26/1.53 ============================== end of search =========================
% 1.26/1.53
% 1.26/1.53 THEOREM PROVED
% 1.26/1.53 % SZS status Unsatisfiable
% 1.26/1.53
% 1.26/1.53 Exiting with 1 proof.
% 1.26/1.53
% 1.26/1.53 Process 28636 exit (max_proofs) Wed Jun 29 13:29:24 2022
% 1.26/1.53 Prover9 interrupted
%------------------------------------------------------------------------------