TSTP Solution File: LAT005-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT005-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:02 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.03/0.12 % Problem : LAT005-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n023.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 : Thu Jun 30 03:32:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.10/1.41 ============================== Prover9 ===============================
% 1.10/1.41 Prover9 (32) version 2009-11A, November 2009.
% 1.10/1.41 Process 24835 was started by sandbox on n023.cluster.edu,
% 1.10/1.41 Thu Jun 30 03:33:00 2022
% 1.10/1.41 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_24681_n023.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_24681_n023.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 (29 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.
% 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.40 (+ 0.01) seconds: meet_a2_and_b2.
% 1.10/1.41 % Length of proof is 36.
% 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 215.
% 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 5 meet(A,A,A) # label(meet_x_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(a2,b2,r1) # label(meet_a2_and_b2) # label(negated_conjecture) # answer(meet_a2_and_b2). [assumption].
% 1.10/1.41 18 -meet(A,B,C) | meet(B,A,C) # label(commutativity_of_meet) # label(axiom). [assumption].
% 1.10/1.41 19 -join(A,B,C) | join(B,A,C) # label(commutativity_of_join) # label(axiom). [assumption].
% 1.10/1.41 21 -join(A,B,C) | meet(A,C,A) # label(absorbtion2) # label(axiom). [assumption].
% 1.10/1.41 22 -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 23 -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 27 -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 31 meet(a,r2,d). [ur(18,a,14,a)].
% 1.10/1.41 32 meet(r1,c2,n0). [ur(18,a,13,a)].
% 1.10/1.41 33 meet(b,r2,e). [ur(18,a,10,a)].
% 1.10/1.41 39 join(e,r1,a2). [ur(19,a,15,a)].
% 1.10/1.41 41 join(b,a,c2). [ur(19,a,11,a)].
% 1.10/1.41 43 join(A,n0,A). [ur(19,a,3,a)].
% 1.10/1.41 49 meet(r1,a2,r1). [ur(21,a,15,a)].
% 1.10/1.41 50 meet(a,c2,a). [ur(21,a,11,a)].
% 1.10/1.41 53 meet(e,b,e). [ur(22,a,10,a,b,5,a,c,10,a)].
% 1.10/1.41 59 meet(r2,e,e). [ur(23,a,5,a,b,10,a,c,10,a)].
% 1.10/1.41 136 meet(a,e,n0). [ur(23,a,7,a,b,33,a,c,9,a)].
% 1.10/1.41 238 meet(b,c2,b). [ur(21,a,41,a)].
% 1.10/1.41 302 -meet(d,a2,n0) # answer(meet_a2_and_b2). [ur(27,a,49,a,b,16,a,d,43,a,e,17,a)].
% 1.10/1.41 312 meet(d,c2,d). [ur(22,a,14,a,b,50,a,c,14,a)].
% 1.10/1.41 641 meet(d,e,n0). [ur(22,a,31,a,b,59,a,c,136,a)].
% 1.10/1.41 1086 meet(e,c2,e). [ur(22,a,53,a,b,238,a,c,53,a)].
% 1.10/1.41 1931 -meet(c2,a2,e) # answer(meet_a2_and_b2). [ur(22,a,312,a,c,641,a,d,302,a)].
% 1.10/1.41 2281 meet(c2,a2,e). [ur(27,a,1086,a,b,39,a,c,32,a,d,43,a)].
% 1.10/1.41 2282 $F # answer(meet_a2_and_b2). [resolve(2281,a,1931,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=215. Generated=12728. Kept=2281. proofs=1.
% 1.10/1.41 Usable=200. Sos=1825. Demods=0. Limbo=6, Disabled=278. Hints=0.
% 1.10/1.41 Megabytes=1.34.
% 1.10/1.41 User_CPU=0.40, System_CPU=0.01, Wall_clock=0.
% 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 24835 exit (max_proofs) Thu Jun 30 03:33:00 2022
% 1.10/1.41 Prover9 interrupted
%------------------------------------------------------------------------------