TSTP Solution File: SWV252-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV252-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:07 EDT 2022
% Result : Unsatisfiable 0.96s 1.23s
% Output : Refutation 0.96s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV252-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n026.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.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 15 01:59:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.96/1.23 ============================== Prover9 ===============================
% 0.96/1.23 Prover9 (32) version 2009-11A, November 2009.
% 0.96/1.23 Process 4120 was started by sandbox2 on n026.cluster.edu,
% 0.96/1.23 Wed Jun 15 01:59:37 2022
% 0.96/1.23 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_3967_n026.cluster.edu".
% 0.96/1.23 ============================== end of head ===========================
% 0.96/1.23
% 0.96/1.23 ============================== INPUT =================================
% 0.96/1.23
% 0.96/1.23 % Reading from file /tmp/Prover9_3967_n026.cluster.edu
% 0.96/1.23
% 0.96/1.23 set(prolog_style_variables).
% 0.96/1.23 set(auto2).
% 0.96/1.23 % set(auto2) -> set(auto).
% 0.96/1.23 % set(auto) -> set(auto_inference).
% 0.96/1.23 % set(auto) -> set(auto_setup).
% 0.96/1.23 % set(auto_setup) -> set(predicate_elim).
% 0.96/1.23 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.96/1.23 % set(auto) -> set(auto_limits).
% 0.96/1.23 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.96/1.23 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.96/1.23 % set(auto) -> set(auto_denials).
% 0.96/1.23 % set(auto) -> set(auto_process).
% 0.96/1.23 % set(auto2) -> assign(new_constants, 1).
% 0.96/1.23 % set(auto2) -> assign(fold_denial_max, 3).
% 0.96/1.23 % set(auto2) -> assign(max_weight, "200.000").
% 0.96/1.23 % set(auto2) -> assign(max_hours, 1).
% 0.96/1.23 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.96/1.23 % set(auto2) -> assign(max_seconds, 0).
% 0.96/1.23 % set(auto2) -> assign(max_minutes, 5).
% 0.96/1.23 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.96/1.23 % set(auto2) -> set(sort_initial_sos).
% 0.96/1.23 % set(auto2) -> assign(sos_limit, -1).
% 0.96/1.23 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.96/1.23 % set(auto2) -> assign(max_megs, 400).
% 0.96/1.23 % set(auto2) -> assign(stats, some).
% 0.96/1.23 % set(auto2) -> clear(echo_input).
% 0.96/1.23 % set(auto2) -> set(quiet).
% 0.96/1.23 % set(auto2) -> clear(print_initial_clauses).
% 0.96/1.23 % set(auto2) -> clear(print_given).
% 0.96/1.23 assign(lrs_ticks,-1).
% 0.96/1.23 assign(sos_limit,10000).
% 0.96/1.23 assign(order,kbo).
% 0.96/1.23 set(lex_order_vars).
% 0.96/1.23 clear(print_given).
% 0.96/1.23
% 0.96/1.23 % formulas(sos). % not echoed (19 formulas)
% 0.96/1.23
% 0.96/1.23 ============================== end of input ==========================
% 0.96/1.23
% 0.96/1.23 % From the command line: assign(max_seconds, 300).
% 0.96/1.23
% 0.96/1.23 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.96/1.23
% 0.96/1.23 % Formulas that are not ordinary clauses:
% 0.96/1.23
% 0.96/1.23 ============================== end of process non-clausal formulas ===
% 0.96/1.23
% 0.96/1.23 ============================== PROCESS INITIAL CLAUSES ===============
% 0.96/1.23
% 0.96/1.23 ============================== PREDICATE ELIMINATION =================
% 0.96/1.23 1 -class_Orderings_Oorder(A) | c_lessequals(B,B,A) # label(cls_Orderings_Oorder__class_Oaxioms__1_0) # label(axiom). [assumption].
% 0.96/1.23 2 class_Orderings_Oorder(tc_set(A)) # label(clsarity_set_2) # label(axiom). [assumption].
% 0.96/1.23 Derived: c_lessequals(A,A,tc_set(B)). [resolve(1,a,2,a)].
% 0.96/1.23 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.96/1.23 4 c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.96/1.23 5 -c_lessequals(c_insert(A,B,C),D,tc_set(C)) | c_in(A,D,C) # label(cls_Set_Oinsert__subset_0) # label(axiom). [assumption].
% 0.96/1.23 Derived: -c_lessequals(A,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_set(tc_Message_Omsg)) | c_lessequals(c_insert(v_X,A,tc_Message_Omsg),c_Message_Osynth(c_Message_Oanalz(v_H)),tc_set(tc_Message_Omsg)). [resolve(3,a,4,a)].
% 0.96/1.23 Derived: -c_lessequals(A,B,tc_set(C)) | c_lessequals(c_insert(D,A,C),B,tc_set(C)) | -c_lessequals(c_insert(D,E,C),B,tc_set(C)). [resolve(3,a,5,b)].
% 0.96/1.23
% 0.96/1.23 ============================== end predicate elimination =============
% 0.96/1.23
% 0.96/1.23 Auto_denials:
% 0.96/1.23 % copying label cls_conjecture_1 to answer in negative clause
% 0.96/1.23
% 0.96/1.23 Term ordering decisions:
% 0.96/1.23 Function symbol KB weights: tc_Message_Omsg=1. v_H=1. v_X=1. tc_set=1. c_Message_Oparts=1. c_Message_Oanalz=1. c_Message_Osynth=1. c_union=1. c_insert=1. c_minus=1.
% 0.96/1.23
% 0.96/1.23 ============================== end of process initial clauses ========
% 0.96/1.23
% 0.96/1.23 ============================== CLAUSES FOR SEARCH ====================
% 0.96/1.23
% 0.96/1.23 ============================== end of clauses for search =============
% 0.96/1.23
% 0.96/1.23 ============================== SEARCH ================================
% 0.96/1.23
% 0.96/1.23 % Starting search at 0.01 seconds.
% 0.96/1.23
% 0.96/1.23 ============================== PROOF =================================
% 0.96/1.23 % SZS status Unsatisfiable
% 0.96/1.23 % SZS output start Refutation
% 0.96/1.23
% 0.96/1.23 % Proof 1 at 0.23 (+ 0.01) seconds: cls_conjecture_1.
% 0.96/1.23 % Length of proof is 40.
% 0.96/1.23 % Level of proof is 9.
% 0.96/1.23 % Maximum clause weight is 21.000.
% 0.96/1.23 % Given clauses 228.
% 0.96/1.23
% 0.96/1.23 1 -class_Orderings_Oorder(A) | c_lessequals(B,B,A) # label(cls_Orderings_Oorder__class_Oaxioms__1_0) # label(axiom). [assumption].
% 0.96/1.23 2 class_Orderings_Oorder(tc_set(A)) # label(clsarity_set_2) # label(axiom). [assumption].
% 0.96/1.23 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.96/1.23 4 c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.96/1.23 5 -c_lessequals(c_insert(A,B,C),D,tc_set(C)) | c_in(A,D,C) # label(cls_Set_Oinsert__subset_0) # label(axiom). [assumption].
% 0.96/1.23 6 c_Message_Oanalz(c_Message_Oparts(A)) = c_Message_Oparts(A) # label(cls_Message_Oanalz__parts_0) # label(axiom). [assumption].
% 0.96/1.23 7 c_Message_Oparts(c_Message_Oanalz(A)) = c_Message_Oparts(A) # label(cls_Message_Oparts__analz_0) # label(axiom). [assumption].
% 0.96/1.23 8 c_Message_Oparts(c_Message_Osynth(A)) = c_union(c_Message_Oparts(A),c_Message_Osynth(A),tc_Message_Omsg) # label(cls_Message_Oparts__synth_0) # label(axiom). [assumption].
% 0.96/1.23 9 c_union(c_Message_Oparts(A),c_Message_Osynth(A),tc_Message_Omsg) = c_Message_Oparts(c_Message_Osynth(A)). [copy(8),flip(a)].
% 0.96/1.23 12 -c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Osynth(c_Message_Oanalz(v_H)),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)) # label(cls_conjecture_1) # label(negated_conjecture) # answer(cls_conjecture_1). [assumption].
% 0.96/1.23 13 -c_lessequals(c_Message_Oanalz(A),c_Message_Oanalz(B),tc_set(tc_Message_Omsg)) | c_lessequals(A,c_Message_Oanalz(B),tc_set(tc_Message_Omsg)) # label(cls_Message_Oanalz__subset__iff_0) # label(axiom). [assumption].
% 0.96/1.23 14 -c_lessequals(c_Message_Oparts(A),c_Message_Oparts(B),tc_set(tc_Message_Omsg)) | c_lessequals(A,c_Message_Oparts(B),tc_set(tc_Message_Omsg)) # label(cls_Message_Oparts__subset__iff_0) # label(axiom). [assumption].
% 0.96/1.23 15 -c_lessequals(A,c_Message_Oparts(B),tc_set(tc_Message_Omsg)) | c_lessequals(c_Message_Oparts(A),c_Message_Oparts(B),tc_set(tc_Message_Omsg)) # label(cls_Message_Oparts__subset__iff_1) # label(axiom). [assumption].
% 0.96/1.23 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.96/1.23 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.96/1.23 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.96/1.23 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.96/1.23 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.96/1.23 21 c_lessequals(A,A,tc_set(B)). [resolve(1,a,2,a)].
% 0.96/1.23 22 -c_lessequals(A,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_set(tc_Message_Omsg)) | c_lessequals(c_insert(v_X,A,tc_Message_Omsg),c_Message_Osynth(c_Message_Oanalz(v_H)),tc_set(tc_Message_Omsg)). [resolve(3,a,4,a)].
% 0.96/1.23 23 -c_lessequals(A,B,tc_set(C)) | c_lessequals(c_insert(D,A,C),B,tc_set(C)) | -c_lessequals(c_insert(D,E,C),B,tc_set(C)). [resolve(3,a,5,b)].
% 0.96/1.23 24 c_union(c_Message_Oparts(A),c_Message_Osynth(c_Message_Oanalz(A)),tc_Message_Omsg) = c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(A))). [para(7(a,1),9(a,1,1))].
% 0.96/1.23 25 -c_lessequals(c_Message_Oanalz(A),c_Message_Oparts(B),tc_set(tc_Message_Omsg)) | c_lessequals(A,c_Message_Oparts(B),tc_set(tc_Message_Omsg)). [para(6(a,1),13(a,2)),rewrite([6(7)])].
% 0.96/1.23 30 -c_lessequals(c_union(A,c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),c_union(c_Message_Osynth(c_Message_Oanalz(v_H)),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)) # answer(cls_conjecture_1). [ur(17,b,12,a)].
% 0.96/1.23 35 c_lessequals(A,c_insert(B,A,C),tc_set(C)). [hyper(18,a,21,a)].
% 0.96/1.23 36 c_lessequals(A,c_union(B,A,C),tc_set(C)). [hyper(17,a,21,a)].
% 0.96/1.23 37 c_lessequals(A,c_union(A,B,C),tc_set(C)). [hyper(16,a,21,a)].
% 0.96/1.23 39 c_lessequals(A,c_Message_Oparts(A),tc_set(tc_Message_Omsg)). [hyper(14,a,21,a)].
% 0.96/1.23 41 c_lessequals(c_insert(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg),c_Message_Osynth(c_Message_Oanalz(v_H)),tc_set(tc_Message_Omsg)). [hyper(22,a,21,a)].
% 0.96/1.23 187 c_lessequals(c_union(A,B,C),c_union(B,A,C),tc_set(C)). [hyper(20,a,37,a,b,36,a)].
% 0.96/1.23 192 c_lessequals(c_Message_Oparts(A),c_Message_Oparts(c_Message_Osynth(A)),tc_set(tc_Message_Omsg)). [para(9(a,1),37(a,2))].
% 0.96/1.23 260 c_lessequals(A,c_Message_Oparts(c_Message_Osynth(A)),tc_set(tc_Message_Omsg)). [hyper(14,a,192,a)].
% 0.96/1.23 263 c_lessequals(A,c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(A))),tc_set(tc_Message_Omsg)). [hyper(25,a,260,a)].
% 0.96/1.23 611 c_insert(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg) = c_Message_Osynth(c_Message_Oanalz(v_H)). [hyper(19,a,35,a,b,41,a)].
% 0.96/1.23 2283 c_union(A,B,C) = c_union(B,A,C). [hyper(19,a,187,a,b,187,a)].
% 0.96/1.23 2295 -c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_set(tc_Message_Omsg)) # answer(cls_conjecture_1). [ur(20,b,187,a,c,30,a),rewrite([2283(12),24(12)])].
% 0.96/1.23 2582 -c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_set(tc_Message_Omsg)) # answer(cls_conjecture_1). [ur(15,b,2295,a)].
% 0.96/1.23 2583 -c_lessequals(c_insert(v_X,A,tc_Message_Omsg),c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_set(tc_Message_Omsg)) # answer(cls_conjecture_1). [ur(23,a,263,a,b,2582,a)].
% 0.96/1.23 2588 -c_lessequals(c_Message_Osynth(c_Message_Oanalz(v_H)),c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_set(tc_Message_Omsg)) # answer(cls_conjecture_1). [para(611(a,1),2583(a,1))].
% 0.96/1.23 2589 $F # answer(cls_conjecture_1). [resolve(2588,a,39,a)].
% 0.96/1.23
% 0.96/1.23 % SZS output end Refutation
% 0.96/1.23 ============================== end of proof ==========================
% 0.96/1.23
% 0.96/1.23 ============================== STATISTICS ============================
% 0.96/1.23
% 0.96/1.23 Given=228. Generated=5508. Kept=2582. proofs=1.
% 0.96/1.23 Usable=89. Sos=1023. Demods=21. Limbo=2, Disabled=1489. Hints=0.
% 0.96/1.23 Megabytes=2.69.
% 0.96/1.23 User_CPU=0.23, System_CPU=0.01, Wall_clock=1.
% 0.96/1.23
% 0.96/1.23 ============================== end of statistics =====================
% 0.96/1.23
% 0.96/1.23 ============================== end of search =========================
% 0.96/1.23
% 0.96/1.23 THEOREM PROVED
% 0.96/1.23 % SZS status Unsatisfiable
% 0.96/1.23
% 0.96/1.23 Exiting with 1 proof.
% 0.96/1.23
% 0.96/1.23 Process 4120 exit (max_proofs) Wed Jun 15 01:59:38 2022
% 0.96/1.23 Prover9 interrupted
%------------------------------------------------------------------------------