TSTP Solution File: LAT276-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT276-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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:26:44 EDT 2022
% Result : Unsatisfiable 0.44s 1.02s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT276-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n008.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 15:21:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.02 ============================== Prover9 ===============================
% 0.44/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.02 Process 16446 was started by sandbox2 on n008.cluster.edu,
% 0.44/1.02 Wed Jun 29 15:21:38 2022
% 0.44/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_16066_n008.cluster.edu".
% 0.44/1.02 ============================== end of head ===========================
% 0.44/1.02
% 0.44/1.02 ============================== INPUT =================================
% 0.44/1.02
% 0.44/1.02 % Reading from file /tmp/Prover9_16066_n008.cluster.edu
% 0.44/1.02
% 0.44/1.02 set(prolog_style_variables).
% 0.44/1.02 set(auto2).
% 0.44/1.02 % set(auto2) -> set(auto).
% 0.44/1.02 % set(auto) -> set(auto_inference).
% 0.44/1.02 % set(auto) -> set(auto_setup).
% 0.44/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.02 % set(auto) -> set(auto_limits).
% 0.44/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.02 % set(auto) -> set(auto_denials).
% 0.44/1.02 % set(auto) -> set(auto_process).
% 0.44/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.02 % set(auto2) -> assign(stats, some).
% 0.44/1.02 % set(auto2) -> clear(echo_input).
% 0.44/1.02 % set(auto2) -> set(quiet).
% 0.44/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.02 % set(auto2) -> clear(print_given).
% 0.44/1.02 assign(lrs_ticks,-1).
% 0.44/1.02 assign(sos_limit,10000).
% 0.44/1.02 assign(order,kbo).
% 0.44/1.02 set(lex_order_vars).
% 0.44/1.02 clear(print_given).
% 0.44/1.02
% 0.44/1.02 % formulas(sos). % not echoed (12 formulas)
% 0.44/1.02
% 0.44/1.02 ============================== end of input ==========================
% 0.44/1.02
% 0.44/1.02 % From the command line: assign(max_seconds, 300).
% 0.44/1.02
% 0.44/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.02
% 0.44/1.02 % Formulas that are not ordinary clauses:
% 0.44/1.02
% 0.44/1.02 ============================== end of process non-clausal formulas ===
% 0.44/1.02
% 0.44/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.02
% 0.44/1.02 ============================== PREDICATE ELIMINATION =================
% 0.44/1.02
% 0.44/1.02 ============================== end predicate elimination =============
% 0.44/1.02
% 0.44/1.02 Auto_denials: (non-Horn, no changes).
% 0.44/1.02
% 0.44/1.02 Term ordering decisions:
% 0.44/1.02
% 0.44/1.02 % Assigning unary symbol tc_set kb_weight 0 and highest precedence (17).
% 0.44/1.02 Function symbol KB weights: t_a=1. v_cl=1. v_S=1. v_xa=1. tc_Product__Type_Ounit=1. v_A=1. v_r=1. tc_prod=1. c_Tarski_Olub=1. c_Tarski_Opotype_Oorder=1. c_Tarski_Opotype_Opset=1. v_sko__4mP=1. c_Pair=1. tc_set=0.
% 0.44/1.02
% 0.44/1.02 ============================== end of process initial clauses ========
% 0.44/1.02
% 0.44/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.44/1.02
% 0.44/1.02 ============================== end of clauses for search =============
% 0.44/1.02
% 0.44/1.02 ============================== SEARCH ================================
% 0.44/1.02
% 0.44/1.02 % Starting search at 0.01 seconds.
% 0.44/1.02
% 0.44/1.02 ============================== PROOF =================================
% 0.44/1.02 % SZS status Unsatisfiable
% 0.44/1.02 % SZS output start Refutation
% 0.44/1.02
% 0.44/1.02 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.44/1.02 % Length of proof is 36.
% 0.44/1.02 % Level of proof is 12.
% 0.44/1.02 % Maximum clause weight is 35.000.
% 0.44/1.02 % Given clauses 33.
% 0.44/1.02
% 0.44/1.02 1 c_lessequals(v_S,v_A,tc_set(t_a)) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.44/1.02 2 v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit) # label(cls_Tarski_OA_A_61_61_Apset_Acl_0) # label(axiom). [assumption].
% 0.44/1.02 3 c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit) = v_A. [copy(2),flip(a)].
% 0.44/1.02 4 v_r = c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit) # label(cls_Tarski_Or_A_61_61_Aorder_Acl_0) # label(axiom). [assumption].
% 0.44/1.02 5 c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit) = v_r. [copy(4),flip(a)].
% 0.44/1.02 6 c_in(v_xa,c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),t_a) | c_in(v_xa,v_S,t_a) # label(cls_conjecture_3) # label(negated_conjecture). [assumption].
% 0.44/1.02 7 c_in(v_xa,v_A,t_a) | c_in(v_xa,v_S,t_a). [copy(6),rewrite([3(5)])].
% 0.44/1.02 8 -c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)) | -c_in(c_Pair(v_xa,c_Tarski_Olub(v_S,v_cl,t_a),t_a,t_a),c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)) # label(cls_conjecture_6) # label(negated_conjecture). [assumption].
% 0.44/1.02 9 -c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(c_Pair(v_xa,c_Tarski_Olub(v_S,v_cl,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a)). [copy(8),rewrite([5(12),5(25)])].
% 0.44/1.02 10 -c_in(A,B,C) | -c_lessequals(B,D,tc_set(C)) | c_in(A,D,C) # label(cls_Set_OsubsetD_0) # label(axiom). [assumption].
% 0.44/1.02 11 -c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)) | c_in(v_xa,v_S,t_a) # label(cls_conjecture_4) # label(negated_conjecture). [assumption].
% 0.44/1.02 12 -c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(v_xa,v_S,t_a). [copy(11),rewrite([5(12)])].
% 0.44/1.02 13 c_in(c_Pair(A,v_xa,t_a,t_a),c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)) | -c_in(A,v_S,t_a) | c_in(v_xa,v_S,t_a) # label(cls_conjecture_9) # label(negated_conjecture). [assumption].
% 0.44/1.02 14 c_in(c_Pair(A,v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(A,v_S,t_a) | c_in(v_xa,v_S,t_a). [copy(13),rewrite([5(8)])].
% 0.44/1.02 15 -c_in(A,B,t_a) | -c_lessequals(B,v_A,tc_set(t_a)) | c_in(c_Pair(A,c_Tarski_Olub(B,v_cl,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a)) # label(cls_Tarski_O_91_124_AS1_A_60_61_AA_59_Ax1_A_58_AS1_A_124_93_A_61_61_62_A_Ix1_M_Alub_AS1_Acl_J_A_58_Ar_A_61_61_ATrue_0) # label(axiom). [assumption].
% 0.44/1.02 16 -c_in(A,v_A,t_a) | -c_lessequals(B,v_A,tc_set(t_a)) | c_in(c_Pair(c_Tarski_Olub(B,v_cl,t_a),A,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(v_sko__4mP(A,B,v_r),B,t_a) # label(cls_Tarski_O_91_124_AS1_A_60_61_AA_59_AL1_A_58_AA_59_AALL_Ax_58S1_O_A_Ix_M_AL1_J_A_58_Ar_A_124_93_A_61_61_62_A_Ilub_AS1_Acl_M_AL1_J_A_58_Ar_A_61_61_ATrue_0) # label(axiom). [assumption].
% 0.44/1.02 17 c_in(c_Pair(A,v_xa,t_a,t_a),c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)) | -c_in(A,v_S,t_a) | -c_in(c_Pair(v_xa,c_Tarski_Olub(v_S,v_cl,t_a),t_a,t_a),c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)) # label(cls_conjecture_10) # label(negated_conjecture). [assumption].
% 0.44/1.02 18 c_in(c_Pair(A,v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(A,v_S,t_a) | -c_in(c_Pair(v_xa,c_Tarski_Olub(v_S,v_cl,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a)). [copy(17),rewrite([5(8),5(24)])].
% 0.44/1.02 19 -c_in(A,v_A,t_a) | -c_in(c_Pair(v_sko__4mP(A,B,v_r),A,t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_lessequals(B,v_A,tc_set(t_a)) | c_in(c_Pair(c_Tarski_Olub(B,v_cl,t_a),A,t_a,t_a),v_r,tc_prod(t_a,t_a)) # label(cls_Tarski_O_91_124_AS1_A_60_61_AA_59_AL1_A_58_AA_59_AALL_Ax_58S1_O_A_Ix_M_AL1_J_A_58_Ar_A_124_93_A_61_61_62_A_Ilub_AS1_Acl_M_AL1_J_A_58_Ar_A_61_61_ATrue_1) # label(axiom). [assumption].
% 0.44/1.02 20 -c_in(A,v_S,t_a) | c_in(A,v_A,t_a). [resolve(10,b,1,a)].
% 0.44/1.02 21 -c_in(A,v_S,t_a) | c_in(c_Pair(A,c_Tarski_Olub(v_S,v_cl,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a)). [resolve(15,b,1,a)].
% 0.44/1.02 22 -c_in(A,v_A,t_a) | c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),A,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(v_sko__4mP(A,v_S,v_r),v_S,t_a). [resolve(16,b,1,a)].
% 0.44/1.02 23 -c_in(A,v_A,t_a) | -c_in(c_Pair(v_sko__4mP(A,v_S,v_r),A,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),A,t_a,t_a),v_r,tc_prod(t_a,t_a)). [resolve(19,c,1,a)].
% 0.44/1.02 24 c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(v_sko__4mP(v_xa,v_S,v_r),v_S,t_a) | c_in(v_xa,v_S,t_a). [resolve(22,a,7,a)].
% 0.44/1.02 25 c_in(v_sko__4mP(v_xa,v_S,v_r),v_S,t_a) | c_in(v_xa,v_S,t_a). [resolve(24,a,12,a),merge(c)].
% 0.44/1.02 29 c_in(v_xa,v_S,t_a) | c_in(c_Pair(v_sko__4mP(v_xa,v_S,v_r),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a)). [resolve(25,a,14,b),merge(c)].
% 0.44/1.02 31 c_in(v_xa,v_S,t_a) | -c_in(v_xa,v_A,t_a) | c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a)). [resolve(29,b,23,b)].
% 0.44/1.02 32 c_in(v_xa,v_S,t_a) | c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a)). [resolve(31,b,7,a),merge(c)].
% 0.44/1.02 33 c_in(v_xa,v_S,t_a). [resolve(32,b,12,a),merge(b)].
% 0.44/1.02 34 c_in(c_Pair(v_xa,c_Tarski_Olub(v_S,v_cl,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a)). [resolve(33,a,21,a)].
% 0.44/1.02 35 c_in(v_xa,v_A,t_a). [resolve(33,a,20,a)].
% 0.44/1.02 37 c_in(c_Pair(A,v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(A,v_S,t_a). [back_unit_del(18),unit_del(c,34)].
% 0.44/1.02 38 -c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a)). [back_unit_del(9),unit_del(b,34)].
% 0.44/1.02 39 c_in(v_sko__4mP(v_xa,v_S,v_r),v_S,t_a). [resolve(35,a,22,a),unit_del(a,38)].
% 0.44/1.02 42 -c_in(c_Pair(v_sko__4mP(v_xa,v_S,v_r),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a)). [ur(23,a,35,a,c,38,a)].
% 0.44/1.02 44 $F. [resolve(37,b,39,a),unit_del(a,42)].
% 0.44/1.02
% 0.44/1.02 % SZS output end Refutation
% 0.44/1.02 ============================== end of proof ==========================
% 0.44/1.02
% 0.44/1.02 ============================== STATISTICS ============================
% 0.44/1.02
% 0.44/1.02 Given=33. Generated=42. Kept=36. proofs=1.
% 0.44/1.02 Usable=20. Sos=2. Demods=2. Limbo=0, Disabled=26. Hints=0.
% 0.44/1.02 Megabytes=0.09.
% 0.44/1.02 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/1.02
% 0.44/1.02 ============================== end of statistics =====================
% 0.44/1.02
% 0.44/1.02 ============================== end of search =========================
% 0.44/1.02
% 0.44/1.02 THEOREM PROVED
% 0.44/1.02 % SZS status Unsatisfiable
% 0.44/1.02
% 0.44/1.02 Exiting with 1 proof.
% 0.44/1.02
% 0.44/1.02 Process 16446 exit (max_proofs) Wed Jun 29 15:21:38 2022
% 0.44/1.02 Prover9 interrupted
%------------------------------------------------------------------------------