TSTP Solution File: LAT005-6 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT005-6 : TPTP v8.1.0. Released v1.1.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:04 EDT 2022
% Result : Unsatisfiable 1.27s 1.55s
% Output : Refutation 1.27s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LAT005-6 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jun 29 22:56:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.27/1.55 ============================== Prover9 ===============================
% 1.27/1.55 Prover9 (32) version 2009-11A, November 2009.
% 1.27/1.55 Process 18947 was started by sandbox on n021.cluster.edu,
% 1.27/1.55 Wed Jun 29 22:56:43 2022
% 1.27/1.55 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_18793_n021.cluster.edu".
% 1.27/1.55 ============================== end of head ===========================
% 1.27/1.55
% 1.27/1.55 ============================== INPUT =================================
% 1.27/1.55
% 1.27/1.55 % Reading from file /tmp/Prover9_18793_n021.cluster.edu
% 1.27/1.55
% 1.27/1.55 set(prolog_style_variables).
% 1.27/1.55 set(auto2).
% 1.27/1.55 % set(auto2) -> set(auto).
% 1.27/1.55 % set(auto) -> set(auto_inference).
% 1.27/1.55 % set(auto) -> set(auto_setup).
% 1.27/1.55 % set(auto_setup) -> set(predicate_elim).
% 1.27/1.55 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.27/1.55 % set(auto) -> set(auto_limits).
% 1.27/1.55 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.27/1.55 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.27/1.55 % set(auto) -> set(auto_denials).
% 1.27/1.55 % set(auto) -> set(auto_process).
% 1.27/1.55 % set(auto2) -> assign(new_constants, 1).
% 1.27/1.55 % set(auto2) -> assign(fold_denial_max, 3).
% 1.27/1.55 % set(auto2) -> assign(max_weight, "200.000").
% 1.27/1.55 % set(auto2) -> assign(max_hours, 1).
% 1.27/1.55 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.27/1.55 % set(auto2) -> assign(max_seconds, 0).
% 1.27/1.55 % set(auto2) -> assign(max_minutes, 5).
% 1.27/1.55 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.27/1.55 % set(auto2) -> set(sort_initial_sos).
% 1.27/1.55 % set(auto2) -> assign(sos_limit, -1).
% 1.27/1.55 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.27/1.55 % set(auto2) -> assign(max_megs, 400).
% 1.27/1.55 % set(auto2) -> assign(stats, some).
% 1.27/1.55 % set(auto2) -> clear(echo_input).
% 1.27/1.55 % set(auto2) -> set(quiet).
% 1.27/1.55 % set(auto2) -> clear(print_initial_clauses).
% 1.27/1.55 % set(auto2) -> clear(print_given).
% 1.27/1.55 assign(lrs_ticks,-1).
% 1.27/1.55 assign(sos_limit,10000).
% 1.27/1.55 assign(order,kbo).
% 1.27/1.55 set(lex_order_vars).
% 1.27/1.55 clear(print_given).
% 1.27/1.55
% 1.27/1.55 % formulas(sos). % not echoed (37 formulas)
% 1.27/1.55
% 1.27/1.55 ============================== end of input ==========================
% 1.27/1.55
% 1.27/1.55 % From the command line: assign(max_seconds, 300).
% 1.27/1.55
% 1.27/1.55 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.27/1.55
% 1.27/1.55 % Formulas that are not ordinary clauses:
% 1.27/1.55
% 1.27/1.55 ============================== end of process non-clausal formulas ===
% 1.27/1.55
% 1.27/1.55 ============================== PROCESS INITIAL CLAUSES ===============
% 1.27/1.55
% 1.27/1.55 ============================== PREDICATE ELIMINATION =================
% 1.27/1.55
% 1.27/1.55 ============================== end predicate elimination =============
% 1.27/1.55
% 1.27/1.55 Auto_denials:
% 1.27/1.55 % copying label meet_a2_and_b2 to answer in negative clause
% 1.27/1.55
% 1.27/1.55 Term ordering decisions:
% 1.27/1.55 Function symbol KB weights: n0=1. n1=1. r1=1. r2=1. a=1. b=1. c=1. c2=1. d=1. e=1. a2=1. b2=1. join_of=1. meet_of=1.
% 1.27/1.55
% 1.27/1.55 ============================== end of process initial clauses ========
% 1.27/1.55
% 1.27/1.55 ============================== CLAUSES FOR SEARCH ====================
% 1.27/1.55
% 1.27/1.55 ============================== end of clauses for search =============
% 1.27/1.55
% 1.27/1.55 ============================== SEARCH ================================
% 1.27/1.55
% 1.27/1.55 % Starting search at 0.01 seconds.
% 1.27/1.55
% 1.27/1.55 ============================== PROOF =================================
% 1.27/1.55 % SZS status Unsatisfiable
% 1.27/1.55 % SZS output start Refutation
% 1.27/1.55
% 1.27/1.55 % Proof 1 at 0.57 (+ 0.02) seconds: meet_a2_and_b2.
% 1.27/1.55 % Length of proof is 39.
% 1.27/1.55 % Level of proof is 5.
% 1.27/1.55 % Maximum clause weight is 20.000.
% 1.27/1.55 % Given clauses 204.
% 1.27/1.55
% 1.27/1.55 8 join(A,n0,A) # label(join_x_and_0) # label(axiom). [assumption].
% 1.27/1.55 9 meet(A,n0,n0) # label(meet_x_and_0) # label(axiom). [assumption].
% 1.27/1.55 11 meet(a,b,c) # label(meet_a_and_b) # label(negated_conjecture). [assumption].
% 1.27/1.55 13 meet(c,r2,n0) # label(meet_c_and_r2) # label(negated_conjecture). [assumption].
% 1.27/1.55 14 meet(r2,b,e) # label(meet_r2_and_b) # label(negated_conjecture). [assumption].
% 1.27/1.55 15 join(a,b,c2) # label(join_a_and_b) # label(negated_conjecture). [assumption].
% 1.27/1.55 17 meet(c2,r1,n0) # label(meet_c2_and_r1) # label(negated_conjecture). [assumption].
% 1.27/1.55 18 meet(r2,a,d) # label(meet_r2_and_a) # label(negated_conjecture). [assumption].
% 1.27/1.55 19 join(r1,e,a2) # label(join_r1_and_e) # label(negated_conjecture). [assumption].
% 1.27/1.55 20 join(r1,d,b2) # label(join_r1_and_d) # label(negated_conjecture). [assumption].
% 1.27/1.55 21 meet(A,B,meet_of(A,B)) # label(meet_total_function_1) # label(axiom). [assumption].
% 1.27/1.55 23 -meet(a2,b2,r1) # label(meet_a2_and_b2) # label(negated_conjecture) # answer(meet_a2_and_b2). [assumption].
% 1.27/1.55 24 -meet(A,B,C) | meet(B,A,C) # label(commutativity_of_meet) # label(axiom). [assumption].
% 1.27/1.55 25 -join(A,B,C) | join(B,A,C) # label(commutativity_of_join) # label(axiom). [assumption].
% 1.27/1.55 27 -join(A,B,C) | meet(A,C,A) # label(absorbtion2) # label(axiom). [assumption].
% 1.27/1.55 28 -meet(A,B,C) | -meet(A,B,D) | C = D # label(meet_total_function_2) # label(axiom). [assumption].
% 1.27/1.55 30 -meet(A,B,C) | -meet(B,D,E) | -meet(A,E,F) | meet(C,D,F) # label(associativity_of_meet1) # label(axiom). [assumption].
% 1.27/1.55 31 -meet(A,B,C) | -meet(B,D,E) | -meet(C,D,F) | meet(A,E,F) # label(associativity_of_meet2) # label(axiom). [assumption].
% 1.27/1.55 35 -meet(A,B,A) | -join(A,C,D) | -meet(C,B,E) | -join(A,E,F) | meet(B,D,F) # label(modularity2) # label(axiom). [assumption].
% 1.27/1.55 38 meet(A,B,meet_of(B,A)). [hyper(24,a,21,a)].
% 1.27/1.55 39 meet(a,r2,d). [hyper(24,a,18,a)].
% 1.27/1.55 40 meet(r1,c2,n0). [hyper(24,a,17,a)].
% 1.27/1.55 43 meet(b,a,c). [hyper(24,a,11,a)].
% 1.27/1.55 44 -meet(b2,a2,r1) # answer(meet_a2_and_b2). [ur(24,b,23,a)].
% 1.27/1.55 46 join(d,r1,b2). [hyper(25,a,20,a)].
% 1.27/1.55 49 join(b,a,c2). [hyper(25,a,15,a)].
% 1.27/1.55 56 meet(r1,b2,r1). [hyper(27,a,20,a)].
% 1.27/1.55 58 meet(a,c2,a). [hyper(27,a,15,a)].
% 1.27/1.55 59 meet_of(r2,a) = d. [hyper(28,a,21,a,b,18,a)].
% 1.27/1.55 432 meet_of(A,B) = meet_of(B,A). [hyper(28,a,21,a,b,38,a)].
% 1.27/1.55 434 meet_of(r2,c) = n0. [hyper(28,a,13,a,b,38,a),flip(a)].
% 1.27/1.55 559 meet(b,d,n0). [hyper(31,a,43,a,b,39,a,c,21,a),rewrite([432(5),434(5)])].
% 1.27/1.55 709 meet(b,c2,b). [hyper(27,a,49,a)].
% 1.27/1.55 1226 -meet(e,b2,n0) # answer(meet_a2_and_b2). [ur(35,a,56,a,b,19,a,d,8,a,e,44,a)].
% 1.27/1.55 1389 meet(d,c2,d). [hyper(30,a,21,a,b,58,a,c,18,a),rewrite([59(3)])].
% 1.27/1.55 1701 -meet(b,b2,n0) # answer(meet_a2_and_b2). [ur(30,a,14,a,c,9,a,d,1226,a)].
% 1.27/1.55 4359 meet(c2,b2,d). [hyper(35,a,1389,a,b,46,a,c,40,a,d,8,a)].
% 1.27/1.55 5389 -meet(c2,b2,d) # answer(meet_a2_and_b2). [ur(30,a,709,a,c,559,a,d,1701,a)].
% 1.27/1.55 5390 $F # answer(meet_a2_and_b2). [resolve(5389,a,4359,a)].
% 1.27/1.55
% 1.27/1.55 % SZS output end Refutation
% 1.27/1.55 ============================== end of proof ==========================
% 1.27/1.55
% 1.27/1.55 ============================== STATISTICS ============================
% 1.27/1.55
% 1.27/1.55 Given=204. Generated=30517. Kept=5389. proofs=1.
% 1.27/1.55 Usable=192. Sos=3176. Demods=59. Limbo=13, Disabled=2044. Hints=0.
% 1.27/1.55 Megabytes=2.65.
% 1.27/1.55 User_CPU=0.57, System_CPU=0.02, Wall_clock=0.
% 1.27/1.55
% 1.27/1.55 ============================== end of statistics =====================
% 1.27/1.55
% 1.27/1.55 ============================== end of search =========================
% 1.27/1.55
% 1.27/1.55 THEOREM PROVED
% 1.27/1.55 % SZS status Unsatisfiable
% 1.27/1.55
% 1.27/1.55 Exiting with 1 proof.
% 1.27/1.55
% 1.27/1.55 Process 18947 exit (max_proofs) Wed Jun 29 22:56:43 2022
% 1.27/1.55 Prover9 interrupted
%------------------------------------------------------------------------------