TSTP Solution File: SWV281-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV281-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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:42 EDT 2022
% Result : Unsatisfiable 109.83s 110.01s
% Output : Refutation 109.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV281-2 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14 % Command : sos-script %s
% 0.14/0.36 % Computer : n029.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Wed Jun 15 05:49:26 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox on n029.cluster.edu,
% 0.14/0.37 Wed Jun 15 05:49:26 2022
% 0.14/0.37 The command was "./sos". The process ID is 5223.
% 0.14/0.37
% 0.14/0.37 set(prolog_style_variables).
% 0.14/0.37 set(auto).
% 0.14/0.37 dependent: set(auto1).
% 0.14/0.37 dependent: set(process_input).
% 0.14/0.37 dependent: clear(print_kept).
% 0.14/0.37 dependent: clear(print_new_demod).
% 0.14/0.37 dependent: clear(print_back_demod).
% 0.14/0.37 dependent: clear(print_back_sub).
% 0.14/0.37 dependent: set(control_memory).
% 0.14/0.37 dependent: assign(max_mem, 12000).
% 0.14/0.37 dependent: assign(pick_given_ratio, 4).
% 0.14/0.37 dependent: assign(stats_level, 1).
% 0.14/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37 dependent: assign(sos_limit, 5000).
% 0.14/0.37 dependent: assign(max_weight, 60).
% 0.14/0.37 clear(print_given).
% 0.14/0.37
% 0.14/0.37 list(usable).
% 0.14/0.37
% 0.14/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.14/0.37
% 0.14/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.37 clauses in usable.
% 0.14/0.37
% 0.14/0.37 dependent: set(knuth_bendix).
% 0.14/0.37 dependent: set(para_from).
% 0.14/0.37 dependent: set(para_into).
% 0.14/0.37 dependent: clear(para_from_right).
% 0.14/0.37 dependent: clear(para_into_right).
% 0.14/0.37 dependent: set(para_from_vars).
% 0.14/0.37 dependent: set(eq_units_both_ways).
% 0.14/0.37 dependent: set(dynamic_demod_all).
% 0.14/0.37 dependent: set(dynamic_demod).
% 0.14/0.37 dependent: set(order_eq).
% 0.14/0.37 dependent: set(back_demod).
% 0.14/0.37 dependent: set(lrpo).
% 0.14/0.37 dependent: set(hyper_res).
% 0.14/0.37 dependent: set(unit_deletion).
% 0.14/0.37 dependent: set(factor).
% 0.14/0.37
% 0.14/0.37 ------------> process usable:
% 0.14/0.37
% 0.14/0.37 ------------> process sos:
% 0.14/0.37 Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] {-} A=A.
% 0.14/0.37
% 0.14/0.37 ======= end of input processing =======
% 0.14/0.40
% 0.14/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.40
% 0.14/0.40 Stopped by limit on number of solutions
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 -------------- Softie stats --------------
% 0.14/0.40
% 0.14/0.40 UPDATE_STOP: 300
% 0.14/0.40 SFINDER_TIME_LIMIT: 2
% 0.14/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.40 number of clauses in intial UL: 3
% 0.14/0.40 number of clauses initially in problem: 8
% 0.14/0.40 percentage of clauses intially in UL: 37
% 0.14/0.40 percentage of distinct symbols occuring in initial UL: 78
% 0.14/0.40 percent of all initial clauses that are short: 87
% 0.14/0.40 absolute distinct symbol count: 14
% 0.14/0.40 distinct predicate count: 3
% 0.14/0.40 distinct function count: 5
% 0.14/0.40 distinct constant count: 6
% 0.14/0.40
% 0.14/0.40 ---------- no more Softie stats ----------
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 =========== start of search ===========
% 16.54/16.73
% 16.54/16.73
% 16.54/16.73 Changing weight limit from 60 to 45.
% 16.54/16.73
% 16.54/16.73 Model 2 (0.00 seconds, 0 Inserts)
% 16.54/16.73
% 16.54/16.73 Stopped by limit on number of solutions
% 16.54/16.73
% 16.54/16.73 Model 3 (0.00 seconds, 0 Inserts)
% 16.54/16.73
% 16.54/16.73 Stopped by limit on number of solutions
% 16.54/16.73
% 16.54/16.73 Resetting weight limit to 45 after 25 givens.
% 16.54/16.73
% 84.00/84.24
% 84.00/84.24
% 84.00/84.24 Changing weight limit from 45 to 40.
% 84.00/84.24
% 84.00/84.24 Resetting weight limit to 40 after 55 givens.
% 84.00/84.24
% 98.45/98.63
% 98.45/98.63
% 98.45/98.63 Changing weight limit from 40 to 38.
% 98.45/98.63
% 98.45/98.63 Resetting weight limit to 38 after 60 givens.
% 98.45/98.63
% 104.46/104.65
% 104.46/104.65
% 104.46/104.65 Changing weight limit from 38 to 36.
% 104.46/104.65
% 104.46/104.65 Resetting weight limit to 36 after 65 givens.
% 104.46/104.65
% 106.83/107.00
% 106.83/107.00
% 106.83/107.00 Changing weight limit from 36 to 35.
% 106.83/107.00
% 106.83/107.00 Resetting weight limit to 35 after 70 givens.
% 106.83/107.00
% 108.40/108.62
% 108.40/108.62
% 108.40/108.62 Changing weight limit from 35 to 34.
% 108.40/108.62
% 108.40/108.62 Resetting weight limit to 34 after 75 givens.
% 108.40/108.62
% 109.83/110.01
% 109.83/110.01 -- HEY sandbox, WE HAVE A PROOF!! --
% 109.83/110.01
% 109.83/110.01 -----> EMPTY CLAUSE at 109.60 sec ----> 30122 [hyper,30121,4,59] {-} $F.
% 109.83/110.01
% 109.83/110.01 Length of proof is 7. Level of proof is 5.
% 109.83/110.01
% 109.83/110.01 ---------------- PROOF ----------------
% 109.83/110.01 % SZS status Unsatisfiable
% 109.83/110.01 % SZS output start Refutation
% 109.83/110.01
% 109.83/110.01 1 [] {-} c_List_Olist_ONil!=c_List_Olist_OCons(A,B,C).
% 109.83/110.01 2 [copy,1,flip.1] {+} c_List_Olist_OCons(A,B,C)!=c_List_Olist_ONil.
% 109.83/110.01 3 [] {+} c_plus(A,B,tc_nat)!=c_plus(C,B,tc_nat)|A=C.
% 109.83/110.01 4 [] {+} -c_in(c_Message_Omsg_ONonce(A),c_Event_Oused(B),tc_Message_Omsg)| -c_lessequals(v_sko__urX(B),A,tc_nat).
% 109.83/110.01 5 [] {-} A=B|c_in(c_Message_Omsg_ONonce(B),c_Event_Oused(v_evs_H),tc_Message_Omsg)|c_in(c_Message_Omsg_ONonce(A),c_Event_Oused(v_evs),tc_Message_Omsg).
% 109.83/110.01 6 [] {+} c_lessequals(A,c_plus(B,A,tc_nat),tc_nat).
% 109.83/110.01 7 [] {+} c_plus(c_0,A,tc_nat)=A.
% 109.83/110.01 10 [hyper,5,3] {-} c_in(c_Message_Omsg_ONonce(c_plus(A,B,tc_nat)),c_Event_Oused(v_evs_H),tc_Message_Omsg)|c_in(c_Message_Omsg_ONonce(c_plus(C,B,tc_nat)),c_Event_Oused(v_evs),tc_Message_Omsg)|C=A.
% 109.83/110.01 59 [para_into,6.1.2,7.1.1] {+} c_lessequals(A,A,tc_nat).
% 109.83/110.01 89 [hyper,10,2] {-} c_in(c_Message_Omsg_ONonce(c_plus(c_List_Olist_ONil,A,tc_nat)),c_Event_Oused(v_evs_H),tc_Message_Omsg)|c_in(c_Message_Omsg_ONonce(c_plus(c_List_Olist_OCons(B,C,D),A,tc_nat)),c_Event_Oused(v_evs),tc_Message_Omsg).
% 109.83/110.01 28970 [hyper,89,4,6] {-} c_in(c_Message_Omsg_ONonce(c_plus(c_List_Olist_ONil,v_sko__urX(v_evs),tc_nat)),c_Event_Oused(v_evs_H),tc_Message_Omsg).
% 109.83/110.01 29188 [para_into,28970.1.1.1,5.1.1,factor_simp] {-} c_in(c_Message_Omsg_ONonce(A),c_Event_Oused(v_evs_H),tc_Message_Omsg)|c_in(c_Message_Omsg_ONonce(c_plus(c_List_Olist_ONil,v_sko__urX(v_evs),tc_nat)),c_Event_Oused(v_evs),tc_Message_Omsg).
% 109.83/110.01 30121 [hyper,29188,4,6] {-} c_in(c_Message_Omsg_ONonce(A),c_Event_Oused(v_evs_H),tc_Message_Omsg).
% 109.83/110.01 30122 [hyper,30121,4,59] {-} $F.
% 109.83/110.01
% 109.83/110.01 % SZS output end Refutation
% 109.83/110.01 ------------ end of proof -------------
% 109.83/110.01
% 109.83/110.01
% 109.83/110.01 Search stopped by max_proofs option.
% 109.83/110.01
% 109.83/110.01
% 109.83/110.01 Search stopped by max_proofs option.
% 109.83/110.02
% 109.83/110.02 ============ end of search ============
% 109.83/110.02
% 109.83/110.02 ----------- soft-scott stats ----------
% 109.83/110.02
% 109.83/110.02 true clauses given 15 (19.0%)
% 109.83/110.02 false clauses given 64
% 109.83/110.02
% 109.83/110.02 FALSE TRUE
% 109.83/110.02 10 1 0
% 109.83/110.02 13 0 2
% 109.83/110.02 15 0 10
% 109.83/110.02 16 2 19
% 109.83/110.02 17 0 5
% 109.83/110.02 18 0 26
% 109.83/110.02 19 13 36
% 109.83/110.02 20 0 6
% 109.83/110.02 21 15 52
% 109.83/110.02 22 31 23
% 109.83/110.02 23 1 1
% 109.83/110.02 24 92 21
% 109.83/110.02 25 42 21
% 109.83/110.02 26 9 5
% 109.83/110.02 27 152 17
% 109.83/110.02 28 72 14
% 109.83/110.02 29 1 6
% 109.83/110.02 30 3 44
% 109.83/110.02 31 0 61
% 109.83/110.02 32 0 24
% 109.83/110.02 33 8 91
% 109.83/110.02 34 16 60
% 109.83/110.02 tot: 458 544 (54.3% true)
% 109.83/110.02
% 109.83/110.02
% 109.83/110.02 Model 3 (0.01 seconds, 0 Inserts)
% 109.83/110.02
% 109.83/110.02 That finishes the proof of the theorem.
% 109.83/110.02
% 109.83/110.02 Process 5223 finished Wed Jun 15 05:51:16 2022
%------------------------------------------------------------------------------