TSTP Solution File: SWV245-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV245-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n016.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:29 EDT 2022
% Result : Unsatisfiable 0.20s 0.40s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV245-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 00:28:18 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n016.cluster.edu,
% 0.12/0.36 Thu Jun 16 00:28:18 2022
% 0.12/0.36 The command was "./sos". The process ID is 7724.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.12/0.36
% 0.12/0.36 This is a non-Horn set without equality. The strategy
% 0.12/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 8
% 0.12/0.38 number of clauses initially in problem: 9
% 0.12/0.38 percentage of clauses intially in UL: 88
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 90
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 10
% 0.12/0.38 distinct predicate count: 1
% 0.12/0.38 distinct function count: 4
% 0.12/0.38 distinct constant count: 5
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 0.20/0.40
% 0.20/0.40 -------- PROOF --------
% 0.20/0.40 % SZS status Unsatisfiable
% 0.20/0.40 % SZS output start Refutation
% 0.20/0.40
% 0.20/0.40 ----> UNIT CONFLICT at 0.03 sec ----> 236 [binary,235.1,1.1] {-} $F.
% 0.20/0.40
% 0.20/0.40 Length of proof is 11. Level of proof is 11.
% 0.20/0.40
% 0.20/0.40 ---------------- PROOF ----------------
% 0.20/0.40 % SZS status Unsatisfiable
% 0.20/0.40 % SZS output start Refutation
% 0.20/0.40
% 0.20/0.40 1 [] {+} -c_in(v_X,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg).
% 0.20/0.40 2 [] {+} -c_in(c_Message_Omsg_OMPair(A,B),c_Message_Oanalz(C),tc_Message_Omsg)|c_in(A,c_Message_Oanalz(C),tc_Message_Omsg).
% 0.20/0.40 3 [] {+} -c_in(c_Message_Omsg_OMPair(A,B),c_Message_Osynth(C),tc_Message_Omsg)|c_in(A,c_Message_Osynth(C),tc_Message_Omsg)|c_in(c_Message_Omsg_OMPair(A,B),C,tc_Message_Omsg).
% 0.20/0.40 4 [] {+} -c_in(A,B,tc_Message_Omsg)|c_in(A,c_Message_Oanalz(B),tc_Message_Omsg).
% 0.20/0.40 5 [] {+} -c_in(A,B,C)|c_in(A,c_union(D,B,C),C).
% 0.20/0.40 6 [] {+} -c_in(A,B,C)|c_in(A,c_union(B,D,C),C).
% 0.20/0.40 7 [] {+} -c_in(A,c_union(B,C,D),D)|c_in(A,C,D)|c_in(A,B,D).
% 0.20/0.40 9 [] {-} c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg).
% 0.20/0.40 10 [hyper,9,7] {-} c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Message_Osynth(v_G),tc_Message_Omsg)|c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg).
% 0.20/0.40 21 [hyper,10,2] {-} c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Message_Osynth(v_G),tc_Message_Omsg)|c_in(v_X,c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg).
% 0.20/0.40 26 [hyper,21,6] {-} c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Message_Osynth(v_G),tc_Message_Omsg)|c_in(v_X,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),A,tc_Message_Omsg),tc_Message_Omsg).
% 0.20/0.40 59 [hyper,26,1] {-} c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Message_Osynth(v_G),tc_Message_Omsg).
% 0.20/0.40 70 [hyper,59,3] {-} c_in(v_X,c_Message_Osynth(v_G),tc_Message_Omsg)|c_in(c_Message_Omsg_OMPair(v_X,v_Y),v_G,tc_Message_Omsg).
% 0.20/0.40 88 [hyper,70,5] {-} c_in(c_Message_Omsg_OMPair(v_X,v_Y),v_G,tc_Message_Omsg)|c_in(v_X,c_union(A,c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg).
% 0.20/0.40 200 [hyper,88,1] {-} c_in(c_Message_Omsg_OMPair(v_X,v_Y),v_G,tc_Message_Omsg).
% 0.20/0.40 201 [hyper,200,6] {-} c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_union(v_G,A,tc_Message_Omsg),tc_Message_Omsg).
% 0.20/0.40 212 [hyper,201,4] {-} c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Message_Oanalz(c_union(v_G,A,tc_Message_Omsg)),tc_Message_Omsg).
% 0.20/0.40 234 [hyper,212,2] {-} c_in(v_X,c_Message_Oanalz(c_union(v_G,A,tc_Message_Omsg)),tc_Message_Omsg).
% 0.20/0.40 235 [hyper,234,6] {-} c_in(v_X,c_union(c_Message_Oanalz(c_union(v_G,A,tc_Message_Omsg)),B,tc_Message_Omsg),tc_Message_Omsg).
% 0.20/0.40 236 [binary,235.1,1.1] {-} $F.
% 0.20/0.40
% 0.20/0.40 % SZS output end Refutation
% 0.20/0.40 ------------ end of proof -------------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Search stopped by max_proofs option.
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Search stopped by max_proofs option.
% 0.20/0.40
% 0.20/0.40 ============ end of search ============
% 0.20/0.40
% 0.20/0.40 ----------- soft-scott stats ----------
% 0.20/0.40
% 0.20/0.40 true clauses given 17 (28.3%)
% 0.20/0.40 false clauses given 43
% 0.20/0.40
% 0.20/0.40 FALSE TRUE
% 0.20/0.40 8 0 1
% 0.20/0.40 9 0 8
% 0.20/0.40 10 1 5
% 0.20/0.40 11 0 10
% 0.20/0.40 12 4 7
% 0.20/0.40 13 6 0
% 0.20/0.40 14 8 6
% 0.20/0.40 15 0 1
% 0.20/0.40 16 8 0
% 0.20/0.40 17 0 5
% 0.20/0.40 19 0 8
% 0.20/0.40 21 0 6
% 0.20/0.40 23 4 0
% 0.20/0.40 tot: 31 57 (64.8% true)
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 That finishes the proof of the theorem.
% 0.20/0.40
% 0.20/0.40 Process 7724 finished Thu Jun 16 00:28:18 2022
%------------------------------------------------------------------------------