TSTP Solution File: SWV251-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV251-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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:37:31 EDT 2022
% Result : Unsatisfiable 2.06s 2.26s
% Output : Refutation 2.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWV251-2 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jun 15 03:58:25 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.38 ----- Otter 3.2, August 2001 -----
% 0.21/0.38 The process was started by sandbox2 on n028.cluster.edu,
% 0.21/0.38 Wed Jun 15 03:58:25 2022
% 0.21/0.38 The command was "./sos". The process ID is 23692.
% 0.21/0.38
% 0.21/0.38 set(prolog_style_variables).
% 0.21/0.38 set(auto).
% 0.21/0.38 dependent: set(auto1).
% 0.21/0.38 dependent: set(process_input).
% 0.21/0.38 dependent: clear(print_kept).
% 0.21/0.38 dependent: clear(print_new_demod).
% 0.21/0.38 dependent: clear(print_back_demod).
% 0.21/0.38 dependent: clear(print_back_sub).
% 0.21/0.38 dependent: set(control_memory).
% 0.21/0.38 dependent: assign(max_mem, 12000).
% 0.21/0.38 dependent: assign(pick_given_ratio, 4).
% 0.21/0.38 dependent: assign(stats_level, 1).
% 0.21/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.21/0.38 dependent: assign(sos_limit, 5000).
% 0.21/0.38 dependent: assign(max_weight, 60).
% 0.21/0.38 clear(print_given).
% 0.21/0.38
% 0.21/0.38 list(usable).
% 0.21/0.38
% 0.21/0.38 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.21/0.38
% 0.21/0.38 This is a Horn set with equality. The strategy will be
% 0.21/0.38 Knuth-Bendix and hyper_res, with positive clauses in
% 0.21/0.38 sos and nonpositive clauses in usable.
% 0.21/0.38
% 0.21/0.38 dependent: set(knuth_bendix).
% 0.21/0.38 dependent: set(para_from).
% 0.21/0.38 dependent: set(para_into).
% 0.21/0.38 dependent: clear(para_from_right).
% 0.21/0.38 dependent: clear(para_into_right).
% 0.21/0.38 dependent: set(para_from_vars).
% 0.21/0.38 dependent: set(eq_units_both_ways).
% 0.21/0.38 dependent: set(dynamic_demod_all).
% 0.21/0.38 dependent: set(dynamic_demod).
% 0.21/0.38 dependent: set(order_eq).
% 0.21/0.38 dependent: set(back_demod).
% 0.21/0.38 dependent: set(lrpo).
% 0.21/0.38 dependent: set(hyper_res).
% 0.21/0.38 dependent: clear(order_hyper).
% 0.21/0.38
% 0.21/0.38 ------------> process usable:
% 0.21/0.38
% 0.21/0.38 ------------> process sos:
% 0.21/0.38 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] {-} A=A.
% 0.21/0.38
% 0.21/0.38 ======= end of input processing =======
% 0.21/0.40
% 0.21/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.40
% 0.21/0.40 Stopped by limit on number of solutions
% 0.21/0.40
% 0.21/0.40
% 0.21/0.40 -------------- Softie stats --------------
% 0.21/0.40
% 0.21/0.40 UPDATE_STOP: 300
% 0.21/0.40 SFINDER_TIME_LIMIT: 2
% 0.21/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.40 number of clauses in intial UL: 8
% 0.21/0.40 number of clauses initially in problem: 16
% 0.21/0.40 percentage of clauses intially in UL: 50
% 0.21/0.40 percentage of distinct symbols occuring in initial UL: 92
% 0.21/0.40 percent of all initial clauses that are short: 100
% 0.21/0.40 absolute distinct symbol count: 14
% 0.21/0.40 distinct predicate count: 3
% 0.21/0.40 distinct function count: 6
% 0.21/0.40 distinct constant count: 5
% 0.21/0.40
% 0.21/0.40 ---------- no more Softie stats ----------
% 0.21/0.40
% 0.21/0.40
% 0.21/0.40
% 0.21/0.40 =========== start of search ===========
% 2.06/2.26
% 2.06/2.26 -------- PROOF --------
% 2.06/2.26 % SZS status Unsatisfiable
% 2.06/2.26 % SZS output start Refutation
% 2.06/2.26
% 2.06/2.26 Stopped by limit on insertions
% 2.06/2.26
% 2.06/2.26 Model 2 (0.00 seconds, 0 Inserts)
% 2.06/2.26
% 2.06/2.26 Stopped by limit on number of solutions
% 2.06/2.26
% 2.06/2.26 Stopped by limit on insertions
% 2.06/2.26
% 2.06/2.26 Model 3 (0.00 seconds, 0 Inserts)
% 2.06/2.26
% 2.06/2.26 Stopped by limit on number of solutions
% 2.06/2.26
% 2.06/2.26 Stopped by limit on insertions
% 2.06/2.26
% 2.06/2.26 Model 4 (0.00 seconds, 0 Inserts)
% 2.06/2.26
% 2.06/2.26 Stopped by limit on number of solutions
% 2.06/2.26
% 2.06/2.26 Stopped by limit on insertions
% 2.06/2.26
% 2.06/2.26 Model 5 [ 26 1 3898 ] (0.00 seconds, 250000 Inserts)
% 2.06/2.26
% 2.06/2.26 Model 6 (0.00 seconds, 250000 Inserts)
% 2.06/2.26
% 2.06/2.26 Stopped by limit on number of solutions
% 2.06/2.26
% 2.06/2.26 ----> UNIT CONFLICT at 1.85 sec ----> 2919 [binary,2918.1,8.1] {-} $F.
% 2.06/2.26
% 2.06/2.26 Length of proof is 6. Level of proof is 5.
% 2.06/2.26
% 2.06/2.26 ---------------- PROOF ----------------
% 2.06/2.26 % SZS status Unsatisfiable
% 2.06/2.26 % SZS output start Refutation
% 2.06/2.26
% 2.06/2.26 1 [] {+} -c_lessequals(A,B,tc_set(tc_Message_Omsg))|c_lessequals(c_Message_Oanalz(A),c_Message_Oanalz(B),tc_set(tc_Message_Omsg)).
% 2.06/2.26 3 [] {+} -c_lessequals(c_union(A,B,C),D,tc_set(C))|c_lessequals(B,D,tc_set(C)).
% 2.06/2.26 5 [] {+} -c_in(A,B,C)|c_minus(c_insert(A,D,C),B,tc_set(C))=c_minus(D,B,tc_set(C)).
% 2.06/2.26 6 [] {+} -c_in(A,B,C)| -c_lessequals(B,D,tc_set(C))|c_in(A,D,C).
% 2.06/2.26 8 [] {+} -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).
% 2.06/2.26 12,11 [] {-} c_union(A,c_minus(B,A,tc_set(C)),C)=c_union(A,B,C).
% 2.06/2.26 13 [] {-} c_lessequals(A,A,tc_set(B)).
% 2.06/2.26 14 [] {-} c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg).
% 2.06/2.26 15 [] {-} c_in(v_x,c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg).
% 2.06/2.26 23 [hyper,13,3] {+} c_lessequals(A,c_union(B,A,C),tc_set(C)).
% 2.06/2.26 41 [para_into,11.1.1.2,5.2.1,demod,12,flip.1] {-} c_union(A,c_insert(B,C,D),D)=c_union(A,C,D)| -c_in(B,A,D).
% 2.06/2.26 72 [hyper,23,1] {+} c_lessequals(c_Message_Oanalz(A),c_Message_Oanalz(c_union(B,A,tc_Message_Omsg)),tc_set(tc_Message_Omsg)).
% 2.06/2.26 281 [hyper,72,6,15] {-} 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).
% 2.06/2.26 2875 [para_from,41.1.1,281.1.2.1] {-} c_in(v_x,c_Message_Oanalz(c_union(A,v_H,tc_Message_Omsg)),tc_Message_Omsg)| -c_in(v_X,A,tc_Message_Omsg).
% 2.06/2.26 2918 [hyper,2875,14] {-} 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).
% 2.06/2.26 2919 [binary,2918.1,8.1] {-} $F.
% 2.06/2.26
% 2.06/2.26 % SZS output end Refutation
% 2.06/2.26 ------------ end of proof -------------
% 2.06/2.26
% 2.06/2.26
% 2.06/2.26 Search stopped by max_proofs option.
% 2.06/2.26
% 2.06/2.26
% 2.06/2.26 Search stopped by max_proofs option.
% 2.06/2.26
% 2.06/2.26 ============ end of search ============
% 2.06/2.26
% 2.06/2.26 ----------- soft-scott stats ----------
% 2.06/2.26
% 2.06/2.26 true clauses given 29 (29.0%)
% 2.06/2.26 false clauses given 71
% 2.06/2.26
% 2.06/2.26 FALSE TRUE
% 2.06/2.26 12 0 1
% 2.06/2.26 13 0 7
% 2.06/2.26 14 0 34
% 2.06/2.26 15 4 22
% 2.06/2.26 16 6 27
% 2.06/2.26 17 35 40
% 2.06/2.26 18 39 63
% 2.06/2.26 19 26 40
% 2.06/2.26 20 59 45
% 2.06/2.26 21 61 113
% 2.06/2.26 22 72 97
% 2.06/2.26 23 13 36
% 2.06/2.26 24 100 60
% 2.06/2.26 25 8 113
% 2.06/2.26 26 24 71
% 2.06/2.26 27 31 63
% 2.06/2.26 28 27 75
% 2.06/2.26 29 28 51
% 2.06/2.26 30 55 68
% 2.06/2.26 31 49 46
% 2.06/2.26 32 27 89
% 2.06/2.26 33 107 61
% 2.06/2.26 34 25 130
% 2.06/2.26 35 28 64
% 2.06/2.26 36 24 59
% 2.06/2.26 37 26 23
% 2.06/2.26 38 15 20
% 2.06/2.26 39 22 31
% 2.06/2.26 40 22 8
% 2.06/2.26 41 8 16
% 2.06/2.26 42 10 21
% 2.06/2.26 43 12 4
% 2.06/2.26 44 10 3
% 2.06/2.26 45 10 13
% 2.06/2.26 46 2 0
% 2.06/2.26 47 11 0
% 2.06/2.26 48 8 1
% 2.06/2.26 49 3 0
% 2.06/2.26 50 5 1
% 2.06/2.26 51 3 0
% 2.06/2.26 52 0 5
% 2.06/2.26 53 0 1
% 2.06/2.26 54 0 3
% 2.06/2.26 55 2 1
% 2.06/2.26 56 2 1
% 2.06/2.26 57 9 1
% 2.06/2.26 59 1 0
% 2.06/2.26 60 2 0
% 2.06/2.26 tot: 1031 1628 (61.2% true)
% 2.06/2.26
% 2.06/2.26
% 2.06/2.26 Model 6 (0.00 seconds, 250000 Inserts)
% 2.06/2.26
% 2.06/2.26 That finishes the proof of the theorem.
% 2.06/2.26
% 2.06/2.26 Process 23692 finished Wed Jun 15 03:58:26 2022
%------------------------------------------------------------------------------