TSTP Solution File: SWV251-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV251-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n009.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 : Wed Jul 20 21:11:06 EDT 2022
% Result : Unsatisfiable 0.68s 1.01s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWV251-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n009.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 15 03:48:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.68/1.01 ============================== Prover9 ===============================
% 0.68/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.68/1.01 Process 18896 was started by sandbox on n009.cluster.edu,
% 0.68/1.01 Wed Jun 15 03:48:08 2022
% 0.68/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_18743_n009.cluster.edu".
% 0.68/1.01 ============================== end of head ===========================
% 0.68/1.01
% 0.68/1.01 ============================== INPUT =================================
% 0.68/1.01
% 0.68/1.01 % Reading from file /tmp/Prover9_18743_n009.cluster.edu
% 0.68/1.01
% 0.68/1.01 set(prolog_style_variables).
% 0.68/1.01 set(auto2).
% 0.68/1.01 % set(auto2) -> set(auto).
% 0.68/1.01 % set(auto) -> set(auto_inference).
% 0.68/1.01 % set(auto) -> set(auto_setup).
% 0.68/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.68/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.68/1.01 % set(auto) -> set(auto_limits).
% 0.68/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.68/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.68/1.01 % set(auto) -> set(auto_denials).
% 0.68/1.01 % set(auto) -> set(auto_process).
% 0.68/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.68/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.68/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.68/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.68/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.68/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.68/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.68/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.68/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.68/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.68/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.68/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.68/1.01 % set(auto2) -> assign(stats, some).
% 0.68/1.01 % set(auto2) -> clear(echo_input).
% 0.68/1.01 % set(auto2) -> set(quiet).
% 0.68/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.68/1.01 % set(auto2) -> clear(print_given).
% 0.68/1.01 assign(lrs_ticks,-1).
% 0.68/1.01 assign(sos_limit,10000).
% 0.68/1.01 assign(order,kbo).
% 0.68/1.01 set(lex_order_vars).
% 0.68/1.01 clear(print_given).
% 0.68/1.01
% 0.68/1.01 % formulas(sos). % not echoed (13 formulas)
% 0.68/1.01
% 0.68/1.01 ============================== end of input ==========================
% 0.68/1.01
% 0.68/1.01 % From the command line: assign(max_seconds, 300).
% 0.68/1.01
% 0.68/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.68/1.01
% 0.68/1.01 % Formulas that are not ordinary clauses:
% 0.68/1.01
% 0.68/1.01 ============================== end of process non-clausal formulas ===
% 0.68/1.01
% 0.68/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.68/1.01
% 0.68/1.01 ============================== PREDICATE ELIMINATION =================
% 0.68/1.01
% 0.68/1.01 ============================== end predicate elimination =============
% 0.68/1.01
% 0.68/1.01 Auto_denials:
% 0.68/1.01 % copying label cls_conjecture_2 to answer in negative clause
% 0.68/1.01
% 0.68/1.01 Term ordering decisions:
% 0.68/1.01 Function symbol KB weights: tc_Message_Omsg=1. v_X=1. v_G=1. v_H=1. v_x=1. tc_set=1. c_Message_Oanalz=1. c_Message_Osynth=1. c_union=1. c_minus=1. c_insert=1.
% 0.68/1.01
% 0.68/1.01 ============================== end of process initial clauses ========
% 0.68/1.01
% 0.68/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.68/1.01
% 0.68/1.01 ============================== end of clauses for search =============
% 0.68/1.01
% 0.68/1.01 ============================== SEARCH ================================
% 0.68/1.01
% 0.68/1.01 % Starting search at 0.01 seconds.
% 0.68/1.01
% 0.68/1.01 ============================== PROOF =================================
% 0.68/1.01 % SZS status Unsatisfiable
% 0.68/1.01 % SZS output start Refutation
% 0.68/1.01
% 0.68/1.01 % Proof 1 at 0.07 (+ 0.00) seconds: cls_conjecture_2.
% 0.68/1.01 % Length of proof is 23.
% 0.68/1.01 % Level of proof is 6.
% 0.68/1.01 % Maximum clause weight is 18.000.
% 0.68/1.01 % Given clauses 136.
% 0.68/1.01
% 0.68/1.01 1 c_lessequals(A,A,tc_set(B)) # label(cls_Set_Osubset__refl_0) # label(axiom). [assumption].
% 0.68/1.01 2 c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.68/1.01 3 c_in(v_x,c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg) # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 0.68/1.01 5 c_union(A,c_minus(B,A,tc_set(C)),C) = c_union(A,B,C) # label(cls_Set_OUn__Diff__cancel_0) # label(axiom). [assumption].
% 0.68/1.01 6 -c_in(v_x,c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),v_H,tc_Message_Omsg)),tc_Message_Omsg) # label(cls_conjecture_2) # label(negated_conjecture) # answer(cls_conjecture_2). [assumption].
% 0.68/1.01 7 -c_lessequals(A,B,tc_set(tc_Message_Omsg)) | c_lessequals(c_Message_Oanalz(A),c_Message_Oanalz(B),tc_set(tc_Message_Omsg)) # label(cls_Message_Oanalz__mono_0) # label(axiom). [assumption].
% 0.68/1.01 8 -c_lessequals(c_union(A,B,C),D,tc_set(C)) | c_lessequals(A,D,tc_set(C)) # label(cls_Set_OUn__subset__iff_0) # label(axiom). [assumption].
% 0.68/1.01 9 -c_lessequals(c_union(A,B,C),D,tc_set(C)) | c_lessequals(B,D,tc_set(C)) # label(cls_Set_OUn__subset__iff_1) # label(axiom). [assumption].
% 0.68/1.01 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.68/1.01 11 -c_lessequals(A,B,tc_set(C)) | -c_lessequals(B,A,tc_set(C)) | B = A # label(cls_Set_Osubset__antisym_0) # label(axiom). [assumption].
% 0.68/1.01 12 -c_lessequals(A,B,tc_set(C)) | -c_lessequals(D,B,tc_set(C)) | c_lessequals(c_union(D,A,C),B,tc_set(C)) # label(cls_Set_OUn__subset__iff_2) # label(axiom). [assumption].
% 0.68/1.01 13 -c_in(A,B,C) | c_minus(c_insert(A,D,C),B,tc_set(C)) = c_minus(D,B,tc_set(C)) # label(cls_Set_Oinsert__Diff1_0) # label(axiom). [assumption].
% 0.68/1.01 14 c_lessequals(A,c_union(A,B,C),tc_set(C)). [hyper(8,a,1,a)].
% 0.68/1.01 16 c_lessequals(A,c_union(B,A,C),tc_set(C)). [hyper(9,a,1,a)].
% 0.68/1.01 21 c_minus(c_insert(v_X,A,tc_Message_Omsg),c_Message_Osynth(c_Message_Oanalz(v_G)),tc_set(tc_Message_Omsg)) = c_minus(A,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_set(tc_Message_Omsg)). [hyper(13,a,2,a)].
% 0.68/1.01 41 c_lessequals(c_union(A,B,C),c_union(B,A,C),tc_set(C)). [hyper(12,a,14,a,b,16,a)].
% 0.68/1.01 48 c_lessequals(c_Message_Oanalz(A),c_Message_Oanalz(c_union(B,A,tc_Message_Omsg)),tc_set(tc_Message_Omsg)). [hyper(7,a,16,a)].
% 0.68/1.01 87 c_in(v_x,c_Message_Oanalz(c_union(A,c_insert(v_X,v_H,tc_Message_Omsg),tc_Message_Omsg)),tc_Message_Omsg). [hyper(10,a,3,a,b,48,a)].
% 0.68/1.01 146 c_union(A,B,C) = c_union(B,A,C). [hyper(11,a,41,a,b,41,a)].
% 0.68/1.01 169 -c_in(v_x,c_Message_Oanalz(c_union(v_H,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg)),tc_Message_Omsg) # answer(cls_conjecture_2). [back_rewrite(6),rewrite([146(7)])].
% 0.68/1.01 184 c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),c_insert(v_X,A,tc_Message_Omsg),tc_Message_Omsg) = c_union(A,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg). [para(21(a,1),5(a,1,2)),rewrite([5(11),146(5)]),flip(a)].
% 0.68/1.01 559 c_in(v_x,c_Message_Oanalz(c_union(v_H,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg)),tc_Message_Omsg). [para(184(a,1),87(a,2,1))].
% 0.68/1.01 560 $F # answer(cls_conjecture_2). [resolve(559,a,169,a)].
% 0.68/1.01
% 0.68/1.01 % SZS output end Refutation
% 0.68/1.01 ============================== end of proof ==========================
% 0.68/1.01
% 0.68/1.01 ============================== STATISTICS ============================
% 0.68/1.01
% 0.68/1.01 Given=136. Generated=1243. Kept=559. proofs=1.
% 0.68/1.01 Usable=117. Sos=332. Demods=20. Limbo=6, Disabled=116. Hints=0.
% 0.68/1.01 Megabytes=0.76.
% 0.68/1.01 User_CPU=0.07, System_CPU=0.00, Wall_clock=0.
% 0.68/1.01
% 0.68/1.01 ============================== end of statistics =====================
% 0.68/1.01
% 0.68/1.01 ============================== end of search =========================
% 0.68/1.01
% 0.68/1.01 THEOREM PROVED
% 0.68/1.01 % SZS status Unsatisfiable
% 0.68/1.01
% 0.68/1.01 Exiting with 1 proof.
% 0.68/1.01
% 0.68/1.01 Process 18896 exit (max_proofs) Wed Jun 15 03:48:08 2022
% 0.68/1.01 Prover9 interrupted
%------------------------------------------------------------------------------