TSTP Solution File: SWV249-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV249-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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:05 EDT 2022
% Result : Unsatisfiable 0.71s 1.03s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV249-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n019.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 : Tue Jun 14 22:30:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.71/1.03 ============================== Prover9 ===============================
% 0.71/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.71/1.03 Process 1527 was started by sandbox2 on n019.cluster.edu,
% 0.71/1.03 Tue Jun 14 22:30:10 2022
% 0.71/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_1373_n019.cluster.edu".
% 0.71/1.03 ============================== end of head ===========================
% 0.71/1.03
% 0.71/1.03 ============================== INPUT =================================
% 0.71/1.03
% 0.71/1.03 % Reading from file /tmp/Prover9_1373_n019.cluster.edu
% 0.71/1.03
% 0.71/1.03 set(prolog_style_variables).
% 0.71/1.03 set(auto2).
% 0.71/1.03 % set(auto2) -> set(auto).
% 0.71/1.03 % set(auto) -> set(auto_inference).
% 0.71/1.03 % set(auto) -> set(auto_setup).
% 0.71/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.71/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/1.03 % set(auto) -> set(auto_limits).
% 0.71/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/1.03 % set(auto) -> set(auto_denials).
% 0.71/1.03 % set(auto) -> set(auto_process).
% 0.71/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.71/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.71/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.71/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.71/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.71/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.71/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.71/1.03 % set(auto2) -> assign(stats, some).
% 0.71/1.03 % set(auto2) -> clear(echo_input).
% 0.71/1.03 % set(auto2) -> set(quiet).
% 0.71/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.71/1.03 % set(auto2) -> clear(print_given).
% 0.71/1.03 assign(lrs_ticks,-1).
% 0.71/1.03 assign(sos_limit,10000).
% 0.71/1.03 assign(order,kbo).
% 0.71/1.03 set(lex_order_vars).
% 0.71/1.03 clear(print_given).
% 0.71/1.03
% 0.71/1.03 % formulas(sos). % not echoed (17 formulas)
% 0.71/1.03
% 0.71/1.03 ============================== end of input ==========================
% 0.71/1.03
% 0.71/1.03 % From the command line: assign(max_seconds, 300).
% 0.71/1.03
% 0.71/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/1.03
% 0.71/1.03 % Formulas that are not ordinary clauses:
% 0.71/1.03
% 0.71/1.03 ============================== end of process non-clausal formulas ===
% 0.71/1.03
% 0.71/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/1.03
% 0.71/1.03 ============================== PREDICATE ELIMINATION =================
% 0.71/1.03 1 -class_Orderings_Oorder(A) | c_lessequals(B,B,A) # label(cls_Orderings_Oorder__class_Oaxioms__1_0) # label(axiom). [assumption].
% 0.71/1.03 2 class_Orderings_Oorder(tc_set(A)) # label(clsarity_set_2) # label(axiom). [assumption].
% 0.71/1.03 Derived: c_lessequals(A,A,tc_set(B)). [resolve(1,a,2,a)].
% 0.71/1.03 3 -c_in(A,B,C) | -c_lessequals(D,B,tc_set(C)) | c_lessequals(c_insert(A,D,C),B,tc_set(C)) # label(cls_Set_Oinsert__subset_2) # label(axiom). [assumption].
% 0.71/1.03 4 c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.71/1.03 Derived: -c_lessequals(A,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_set(tc_Message_Omsg)) | c_lessequals(c_insert(v_X,A,tc_Message_Omsg),c_Message_Osynth(c_Message_Oanalz(v_G)),tc_set(tc_Message_Omsg)). [resolve(3,a,4,a)].
% 0.71/1.03
% 0.71/1.03 ============================== end predicate elimination =============
% 0.71/1.03
% 0.71/1.03 Auto_denials:
% 0.71/1.03 % copying label cls_conjecture_1 to answer in negative clause
% 0.71/1.03
% 0.71/1.03 Term ordering decisions:
% 0.71/1.03 Function symbol KB weights: tc_Message_Omsg=1. v_G=1. v_X=1. v_H=1. tc_set=1. c_Message_Oanalz=1. c_Message_Osynth=1. c_union=1. c_insert=1. c_minus=1.
% 0.71/1.03
% 0.71/1.03 ============================== end of process initial clauses ========
% 0.71/1.03
% 0.71/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.71/1.03
% 0.71/1.03 ============================== end of clauses for search =============
% 0.71/1.03
% 0.71/1.03 ============================== SEARCH ================================
% 0.71/1.03
% 0.71/1.03 % Starting search at 0.01 seconds.
% 0.71/1.03
% 0.71/1.03 ============================== PROOF =================================
% 0.71/1.03 % SZS status Unsatisfiable
% 0.71/1.03 % SZS output start Refutation
% 0.71/1.03
% 0.71/1.03 % Proof 1 at 0.06 (+ 0.01) seconds: cls_conjecture_1.
% 0.71/1.03 % Length of proof is 35.
% 0.71/1.03 % Level of proof is 10.
% 0.71/1.03 % Maximum clause weight is 19.000.
% 0.71/1.03 % Given clauses 71.
% 0.71/1.03
% 0.71/1.03 1 -class_Orderings_Oorder(A) | c_lessequals(B,B,A) # label(cls_Orderings_Oorder__class_Oaxioms__1_0) # label(axiom). [assumption].
% 0.71/1.03 2 class_Orderings_Oorder(tc_set(A)) # label(clsarity_set_2) # label(axiom). [assumption].
% 0.71/1.03 3 -c_in(A,B,C) | -c_lessequals(D,B,tc_set(C)) | c_lessequals(c_insert(A,D,C),B,tc_set(C)) # label(cls_Set_Oinsert__subset_2) # label(axiom). [assumption].
% 0.71/1.03 4 c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.71/1.03 5 c_Message_Oanalz(c_union(c_Message_Oanalz(A),B,tc_Message_Omsg)) = c_Message_Oanalz(c_union(A,B,tc_Message_Omsg)) # label(cls_Message_Oanalz__analz__Un_0) # label(axiom). [assumption].
% 0.71/1.03 8 c_union(c_insert(A,B,C),D,C) = c_insert(A,c_union(B,D,C),C) # label(cls_Set_OUn__insert__left_0) # label(axiom). [assumption].
% 0.71/1.03 9 c_insert(A,c_union(B,C,D),D) = c_union(c_insert(A,B,D),C,D). [copy(8),flip(a)].
% 0.71/1.03 10 c_union(A,c_insert(B,C,D),D) = c_insert(B,c_union(A,C,D),D) # label(cls_Set_OUn__insert__right_0) # label(axiom). [assumption].
% 0.71/1.03 11 c_union(c_insert(A,B,C),D,C) = c_union(B,c_insert(A,D,C),C). [copy(10),rewrite([9(4)]),flip(a)].
% 0.71/1.03 12 c_Message_Oanalz(c_union(c_Message_Osynth(A),B,tc_Message_Omsg)) = c_union(c_Message_Oanalz(c_union(A,B,tc_Message_Omsg)),c_Message_Osynth(A),tc_Message_Omsg) # label(cls_Message_Oanalz__synth__Un_0) # label(axiom). [assumption].
% 0.71/1.03 13 c_union(c_Message_Oanalz(c_union(A,B,tc_Message_Omsg)),c_Message_Osynth(A),tc_Message_Omsg) = c_Message_Oanalz(c_union(c_Message_Osynth(A),B,tc_Message_Omsg)). [copy(12),flip(a)].
% 0.71/1.03 14 -c_lessequals(c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),tc_set(tc_Message_Omsg)) # label(cls_conjecture_1) # label(negated_conjecture) # answer(cls_conjecture_1). [assumption].
% 0.71/1.03 15 -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.71/1.03 16 -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.71/1.03 17 -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.71/1.03 18 -c_lessequals(c_insert(A,B,C),D,tc_set(C)) | c_lessequals(B,D,tc_set(C)) # label(cls_Set_Oinsert__subset_1) # label(axiom). [assumption].
% 0.71/1.03 19 -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.71/1.03 20 -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.71/1.03 21 c_lessequals(A,A,tc_set(B)). [resolve(1,a,2,a)].
% 0.71/1.03 22 -c_lessequals(A,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_set(tc_Message_Omsg)) | c_lessequals(c_insert(v_X,A,tc_Message_Omsg),c_Message_Osynth(c_Message_Oanalz(v_G)),tc_set(tc_Message_Omsg)). [resolve(3,a,4,a)].
% 0.71/1.03 28 c_union(c_Message_Oanalz(c_union(A,B,tc_Message_Omsg)),c_Message_Osynth(c_Message_Oanalz(A)),tc_Message_Omsg) = c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(A)),B,tc_Message_Omsg)). [para(5(a,1),13(a,1,1))].
% 0.71/1.03 35 -c_lessequals(c_union(A,c_insert(B,C,D),D),E,tc_set(D)) | c_lessequals(c_insert(B,A,D),E,tc_set(D)). [para(11(a,1),16(a,1))].
% 0.71/1.03 43 c_lessequals(A,c_insert(B,A,C),tc_set(C)). [hyper(18,a,21,a)].
% 0.71/1.03 44 c_lessequals(A,c_union(B,A,C),tc_set(C)). [hyper(17,a,21,a)].
% 0.71/1.03 45 c_lessequals(A,c_union(A,B,C),tc_set(C)). [hyper(16,a,21,a)].
% 0.71/1.03 46 c_lessequals(c_insert(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),c_Message_Osynth(c_Message_Oanalz(v_G)),tc_set(tc_Message_Omsg)). [hyper(22,a,21,a)].
% 0.71/1.03 112 c_lessequals(c_union(A,B,C),c_union(B,A,C),tc_set(C)). [hyper(20,a,45,a,b,44,a)].
% 0.71/1.03 277 c_union(A,B,C) = c_union(B,A,C). [hyper(19,a,112,a,b,112,a)].
% 0.71/1.03 342 c_union(c_Message_Osynth(c_Message_Oanalz(A)),c_Message_Oanalz(c_union(A,B,tc_Message_Omsg)),tc_Message_Omsg) = c_Message_Oanalz(c_union(B,c_Message_Osynth(c_Message_Oanalz(A)),tc_Message_Omsg)). [back_rewrite(28),rewrite([277(7),277(11)])].
% 0.71/1.03 366 -c_lessequals(c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(v_H,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg)),tc_set(tc_Message_Omsg)) # answer(cls_conjecture_1). [back_rewrite(14),rewrite([342(15)])].
% 0.71/1.03 393 -c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_H,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),tc_set(tc_Message_Omsg)) # answer(cls_conjecture_1). [ur(15,b,366,a)].
% 0.71/1.03 399 c_insert(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg) = c_Message_Osynth(c_Message_Oanalz(v_G)). [hyper(19,a,43,a,b,46,a)].
% 0.71/1.03 406 -c_lessequals(c_union(v_H,c_insert(v_X,A,tc_Message_Omsg),tc_Message_Omsg),c_union(v_H,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),tc_set(tc_Message_Omsg)) # answer(cls_conjecture_1). [ur(35,b,393,a)].
% 0.71/1.03 412 -c_lessequals(c_union(v_H,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),c_union(v_H,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),tc_set(tc_Message_Omsg)) # answer(cls_conjecture_1). [para(399(a,1),406(a,1,2))].
% 0.71/1.03 413 $F # answer(cls_conjecture_1). [resolve(412,a,21,a)].
% 0.71/1.03
% 0.71/1.03 % SZS output end Refutation
% 0.71/1.03 ============================== end of proof ==========================
% 0.71/1.03
% 0.71/1.03 ============================== STATISTICS ============================
% 0.71/1.03
% 0.71/1.03 Given=71. Generated=1080. Kept=405. proofs=1.
% 0.71/1.03 Usable=32. Sos=148. Demods=58. Limbo=3, Disabled=240. Hints=0.
% 0.71/1.03 Megabytes=0.49.
% 0.71/1.03 User_CPU=0.06, System_CPU=0.01, Wall_clock=0.
% 0.71/1.03
% 0.71/1.03 ============================== end of statistics =====================
% 0.71/1.03
% 0.71/1.03 ============================== end of search =========================
% 0.71/1.03
% 0.71/1.03 THEOREM PROVED
% 0.71/1.03 % SZS status Unsatisfiable
% 0.71/1.03
% 0.71/1.03 Exiting with 1 proof.
% 0.71/1.03
% 0.71/1.03 Process 1527 exit (max_proofs) Tue Jun 14 22:30:10 2022
% 0.71/1.03 Prover9 interrupted
%------------------------------------------------------------------------------