TSTP Solution File: LAT005-5 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT005-5 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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:03 EDT 2022
% Result : Unsatisfiable 1.10s 1.41s
% Output : Refutation 1.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT005-5 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n014.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 10:08:12 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.10/1.41 ============================== Prover9 ===============================
% 1.10/1.41 Prover9 (32) version 2009-11A, November 2009.
% 1.10/1.41 Process 31825 was started by sandbox on n014.cluster.edu,
% 1.10/1.41 Wed Jun 29 10:08:12 2022
% 1.10/1.41 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_31670_n014.cluster.edu".
% 1.10/1.41 ============================== end of head ===========================
% 1.10/1.41
% 1.10/1.41 ============================== INPUT =================================
% 1.10/1.41
% 1.10/1.41 % Reading from file /tmp/Prover9_31670_n014.cluster.edu
% 1.10/1.41
% 1.10/1.41 set(prolog_style_variables).
% 1.10/1.41 set(auto2).
% 1.10/1.41 % set(auto2) -> set(auto).
% 1.10/1.41 % set(auto) -> set(auto_inference).
% 1.10/1.41 % set(auto) -> set(auto_setup).
% 1.10/1.41 % set(auto_setup) -> set(predicate_elim).
% 1.10/1.41 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.10/1.41 % set(auto) -> set(auto_limits).
% 1.10/1.41 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.10/1.41 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.10/1.41 % set(auto) -> set(auto_denials).
% 1.10/1.41 % set(auto) -> set(auto_process).
% 1.10/1.41 % set(auto2) -> assign(new_constants, 1).
% 1.10/1.41 % set(auto2) -> assign(fold_denial_max, 3).
% 1.10/1.41 % set(auto2) -> assign(max_weight, "200.000").
% 1.10/1.41 % set(auto2) -> assign(max_hours, 1).
% 1.10/1.41 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.10/1.41 % set(auto2) -> assign(max_seconds, 0).
% 1.10/1.41 % set(auto2) -> assign(max_minutes, 5).
% 1.10/1.41 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.10/1.41 % set(auto2) -> set(sort_initial_sos).
% 1.10/1.41 % set(auto2) -> assign(sos_limit, -1).
% 1.10/1.41 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.10/1.41 % set(auto2) -> assign(max_megs, 400).
% 1.10/1.41 % set(auto2) -> assign(stats, some).
% 1.10/1.41 % set(auto2) -> clear(echo_input).
% 1.10/1.41 % set(auto2) -> set(quiet).
% 1.10/1.41 % set(auto2) -> clear(print_initial_clauses).
% 1.10/1.41 % set(auto2) -> clear(print_given).
% 1.10/1.41 assign(lrs_ticks,-1).
% 1.10/1.41 assign(sos_limit,10000).
% 1.10/1.41 assign(order,kbo).
% 1.10/1.41 set(lex_order_vars).
% 1.10/1.41 clear(print_given).
% 1.10/1.41
% 1.10/1.41 % formulas(sos). % not echoed (31 formulas)
% 1.10/1.41
% 1.10/1.41 ============================== end of input ==========================
% 1.10/1.41
% 1.10/1.41 % From the command line: assign(max_seconds, 300).
% 1.10/1.41
% 1.10/1.41 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.10/1.41
% 1.10/1.41 % Formulas that are not ordinary clauses:
% 1.10/1.41
% 1.10/1.41 ============================== end of process non-clausal formulas ===
% 1.10/1.41
% 1.10/1.41 ============================== PROCESS INITIAL CLAUSES ===============
% 1.10/1.41
% 1.10/1.41 ============================== PREDICATE ELIMINATION =================
% 1.10/1.41
% 1.10/1.41 ============================== end predicate elimination =============
% 1.10/1.41
% 1.10/1.41 Auto_denials:
% 1.10/1.41 % copying label meet_a2_and_b2 to answer in negative clause
% 1.10/1.41
% 1.10/1.41 Term ordering decisions:
% 1.10/1.41 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.10/1.41
% 1.10/1.41 ============================== end of process initial clauses ========
% 1.10/1.41
% 1.10/1.41 ============================== CLAUSES FOR SEARCH ====================
% 1.10/1.41
% 1.10/1.41 ============================== end of clauses for search =============
% 1.10/1.41
% 1.10/1.41 ============================== SEARCH ================================
% 1.10/1.41
% 1.10/1.41 % Starting search at 0.01 seconds.
% 1.10/1.41
% 1.10/1.41 ============================== PROOF =================================
% 1.10/1.41 % SZS status Unsatisfiable
% 1.10/1.41 % SZS output start Refutation
% 1.10/1.41
% 1.10/1.41 % Proof 1 at 0.49 (+ 0.02) seconds: meet_a2_and_b2.
% 1.10/1.41 % Length of proof is 41.
% 1.10/1.41 % Level of proof is 5.
% 1.10/1.41 % Maximum clause weight is 20.000.
% 1.10/1.41 % Given clauses 191.
% 1.10/1.41
% 1.10/1.41 3 join(n0,A,A) # label(join_0_and_x) # label(axiom). [assumption].
% 1.10/1.41 4 meet(n0,A,n0) # label(meet_0_and_x) # label(axiom). [assumption].
% 1.10/1.41 7 meet(a,b,c) # label(meet_a_and_b) # label(negated_conjecture). [assumption].
% 1.10/1.41 9 meet(c,r2,n0) # label(meet_c_and_r2) # label(negated_conjecture). [assumption].
% 1.10/1.41 10 meet(r2,b,e) # label(meet_r2_and_b) # label(negated_conjecture). [assumption].
% 1.10/1.41 11 join(a,b,c2) # label(join_a_and_b) # label(negated_conjecture). [assumption].
% 1.10/1.41 13 meet(c2,r1,n0) # label(meet_c2_and_r1) # label(negated_conjecture). [assumption].
% 1.10/1.41 14 meet(r2,a,d) # label(meet_r2_and_a) # label(negated_conjecture). [assumption].
% 1.10/1.41 15 join(r1,e,a2) # label(join_r1_and_e) # label(negated_conjecture). [assumption].
% 1.10/1.41 16 join(r1,d,b2) # label(join_r1_and_d) # label(negated_conjecture). [assumption].
% 1.10/1.41 17 meet(A,B,meet_of(A,B)) # label(meet_total_function_1) # label(axiom). [assumption].
% 1.10/1.41 19 -meet(a2,b2,r1) # label(meet_a2_and_b2) # label(negated_conjecture) # answer(meet_a2_and_b2). [assumption].
% 1.10/1.41 20 -meet(A,B,C) | meet(B,A,C) # label(commutativity_of_meet) # label(axiom). [assumption].
% 1.10/1.41 21 -join(A,B,C) | join(B,A,C) # label(commutativity_of_join) # label(axiom). [assumption].
% 1.10/1.41 23 -join(A,B,C) | meet(A,C,A) # label(absorbtion2) # label(axiom). [assumption].
% 1.10/1.41 24 -meet(A,B,C) | -meet(A,B,D) | C = D # label(meet_total_function_2) # label(axiom). [assumption].
% 1.10/1.41 26 -meet(A,B,C) | -meet(B,D,E) | -meet(A,E,F) | meet(C,D,F) # label(associativity_of_meet1) # label(axiom). [assumption].
% 1.10/1.41 27 -meet(A,B,C) | -meet(B,D,E) | -meet(C,D,F) | meet(A,E,F) # label(associativity_of_meet2) # label(axiom). [assumption].
% 1.10/1.41 31 -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.10/1.41 32 meet(A,B,meet_of(B,A)). [hyper(20,a,17,a)].
% 1.10/1.41 33 meet(a,r2,d). [hyper(20,a,14,a)].
% 1.10/1.41 34 meet(r1,c2,n0). [hyper(20,a,13,a)].
% 1.10/1.41 37 meet(b,a,c). [hyper(20,a,7,a)].
% 1.10/1.41 39 meet(A,n0,n0). [hyper(20,a,4,a)].
% 1.10/1.41 40 -meet(b2,a2,r1) # answer(meet_a2_and_b2). [ur(20,b,19,a)].
% 1.10/1.41 42 join(d,r1,b2). [hyper(21,a,16,a)].
% 1.10/1.41 45 join(b,a,c2). [hyper(21,a,11,a)].
% 1.10/1.41 47 join(A,n0,A). [hyper(21,a,3,a)].
% 1.10/1.41 54 meet(r1,b2,r1). [hyper(23,a,16,a)].
% 1.10/1.41 56 meet(a,c2,a). [hyper(23,a,11,a)].
% 1.10/1.41 57 meet_of(r2,a) = d. [hyper(24,a,17,a,b,14,a)].
% 1.10/1.41 441 meet_of(A,B) = meet_of(B,A). [hyper(24,a,17,a,b,32,a)].
% 1.10/1.41 443 meet_of(r2,c) = n0. [hyper(24,a,9,a,b,32,a),flip(a)].
% 1.10/1.41 543 meet(b,d,n0). [hyper(27,a,37,a,b,33,a,c,17,a),rewrite([441(5),443(5)])].
% 1.10/1.41 1049 meet(b,c2,b). [hyper(23,a,45,a)].
% 1.10/1.41 1270 -meet(e,b2,n0) # answer(meet_a2_and_b2). [ur(31,a,54,a,b,15,a,d,47,a,e,40,a)].
% 1.10/1.41 1429 -meet(b,b2,n0) # answer(meet_a2_and_b2). [ur(26,a,10,a,c,39,a,d,1270,a)].
% 1.10/1.41 1581 meet(d,c2,d). [hyper(26,a,17,a,b,56,a,c,14,a),rewrite([57(3)])].
% 1.10/1.41 4238 -meet(c2,b2,d) # answer(meet_a2_and_b2). [ur(26,a,1049,a,c,543,a,d,1429,a)].
% 1.10/1.41 5020 meet(c2,b2,d). [hyper(31,a,1581,a,b,42,a,c,34,a,d,47,a)].
% 1.10/1.41 5021 $F # answer(meet_a2_and_b2). [resolve(5020,a,4238,a)].
% 1.10/1.41
% 1.10/1.41 % SZS output end Refutation
% 1.10/1.41 ============================== end of proof ==========================
% 1.10/1.41
% 1.10/1.41 ============================== STATISTICS ============================
% 1.10/1.41
% 1.10/1.41 Given=191. Generated=22661. Kept=5020. proofs=1.
% 1.10/1.41 Usable=180. Sos=2927. Demods=56. Limbo=12, Disabled=1931. Hints=0.
% 1.10/1.41 Megabytes=2.46.
% 1.10/1.41 User_CPU=0.49, System_CPU=0.02, Wall_clock=1.
% 1.10/1.41
% 1.10/1.41 ============================== end of statistics =====================
% 1.10/1.41
% 1.10/1.41 ============================== end of search =========================
% 1.10/1.41
% 1.10/1.41 THEOREM PROVED
% 1.10/1.41 % SZS status Unsatisfiable
% 1.10/1.41
% 1.10/1.41 Exiting with 1 proof.
% 1.10/1.41
% 1.10/1.41 Process 31825 exit (max_proofs) Wed Jun 29 10:08:13 2022
% 1.10/1.41 Prover9 interrupted
%------------------------------------------------------------------------------