TSTP Solution File: SWV007-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV007-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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:36:43 EDT 2022
% Result : Unsatisfiable 6.70s 6.87s
% Output : Refutation 6.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SWV007-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.14 % Command : sos-script %s
% 0.15/0.36 % Computer : n021.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Wed Jun 15 09:51:13 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.38 ----- Otter 3.2, August 2001 -----
% 0.22/0.38 The process was started by sandbox on n021.cluster.edu,
% 0.22/0.38 Wed Jun 15 09:51:13 2022
% 0.22/0.38 The command was "./sos". The process ID is 32435.
% 0.22/0.38
% 0.22/0.38 set(prolog_style_variables).
% 0.22/0.38 set(auto).
% 0.22/0.38 dependent: set(auto1).
% 0.22/0.38 dependent: set(process_input).
% 0.22/0.38 dependent: clear(print_kept).
% 0.22/0.38 dependent: clear(print_new_demod).
% 0.22/0.38 dependent: clear(print_back_demod).
% 0.22/0.38 dependent: clear(print_back_sub).
% 0.22/0.38 dependent: set(control_memory).
% 0.22/0.38 dependent: assign(max_mem, 12000).
% 0.22/0.38 dependent: assign(pick_given_ratio, 4).
% 0.22/0.38 dependent: assign(stats_level, 1).
% 0.22/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.22/0.38 dependent: assign(sos_limit, 5000).
% 0.22/0.38 dependent: assign(max_weight, 60).
% 0.22/0.38 clear(print_given).
% 0.22/0.38
% 0.22/0.38 list(usable).
% 0.22/0.38
% 0.22/0.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.22/0.38
% 0.22/0.38 This ia a non-Horn set with equality. The strategy will be
% 0.22/0.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.22/0.38 unit deletion, with positive clauses in sos and nonpositive
% 0.22/0.38 clauses in usable.
% 0.22/0.38
% 0.22/0.38 dependent: set(knuth_bendix).
% 0.22/0.38 dependent: set(para_from).
% 0.22/0.38 dependent: set(para_into).
% 0.22/0.38 dependent: clear(para_from_right).
% 0.22/0.38 dependent: clear(para_into_right).
% 0.22/0.38 dependent: set(para_from_vars).
% 0.22/0.38 dependent: set(eq_units_both_ways).
% 0.22/0.38 dependent: set(dynamic_demod_all).
% 0.22/0.38 dependent: set(dynamic_demod).
% 0.22/0.38 dependent: set(order_eq).
% 0.22/0.38 dependent: set(back_demod).
% 0.22/0.38 dependent: set(lrpo).
% 0.22/0.38 dependent: set(hyper_res).
% 0.22/0.38 dependent: set(unit_deletion).
% 0.22/0.38 dependent: set(factor).
% 0.22/0.38
% 0.22/0.38 ------------> process usable:
% 0.22/0.38
% 0.22/0.38 ------------> process sos:
% 0.22/0.38 Following clause subsumed by 27 during input processing: 0 [copy,27,flip.1] {-} A=A.
% 0.22/0.38
% 0.22/0.38 ======= end of input processing =======
% 0.22/0.42
% 0.22/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.22/0.42
% 0.22/0.42 Stopped by limit on number of solutions
% 0.22/0.42
% 0.22/0.42
% 0.22/0.42 -------------- Softie stats --------------
% 0.22/0.42
% 0.22/0.42 UPDATE_STOP: 300
% 0.22/0.42 SFINDER_TIME_LIMIT: 2
% 0.22/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.22/0.42 number of clauses in intial UL: 15
% 0.22/0.42 number of clauses initially in problem: 26
% 0.22/0.42 percentage of clauses intially in UL: 57
% 0.22/0.42 percentage of distinct symbols occuring in initial UL: 100
% 0.22/0.42 percent of all initial clauses that are short: 100
% 0.22/0.42 absolute distinct symbol count: 10
% 0.22/0.42 distinct predicate count: 2
% 0.22/0.42 distinct function count: 3
% 0.22/0.42 distinct constant count: 5
% 0.22/0.42
% 0.22/0.42 ---------- no more Softie stats ----------
% 0.22/0.42
% 0.22/0.42
% 0.22/0.42
% 0.22/0.42 Model 2 (0.00 seconds, 0 Inserts)
% 0.22/0.42
% 0.22/0.42 Stopped by limit on number of solutions
% 0.22/0.42
% 0.22/0.42 =========== start of search ===========
% 2.12/2.34
% 2.12/2.34
% 2.12/2.34 Changing weight limit from 60 to 35.
% 2.12/2.34
% 2.12/2.34 Model 3 (0.00 seconds, 0 Inserts)
% 2.12/2.34
% 2.12/2.34 Stopped by limit on number of solutions
% 2.12/2.34
% 2.12/2.34 Model 4 [ 2 1 63 ] (0.00 seconds, 95 Inserts)
% 2.12/2.34
% 2.12/2.34 Model 5 [ 3 1 2039 ] (0.00 seconds, 4680 Inserts)
% 2.12/2.34
% 2.12/2.34 Model 6 [ 3 1 1565 ] (0.00 seconds, 3767 Inserts)
% 2.12/2.34
% 2.12/2.34 Model 7 [ 4 1 501 ] (0.00 seconds, 2760 Inserts)
% 2.12/2.34
% 2.12/2.34 Resetting weight limit to 35 after 215 givens.
% 2.12/2.34
% 2.72/2.94
% 2.72/2.94
% 2.72/2.94 Changing weight limit from 35 to 28.
% 2.72/2.94
% 2.72/2.94 Resetting weight limit to 28 after 220 givens.
% 2.72/2.94
% 2.87/3.06
% 2.87/3.06
% 2.87/3.06 Changing weight limit from 28 to 27.
% 2.87/3.06
% 2.87/3.06 Resetting weight limit to 27 after 225 givens.
% 2.87/3.06
% 2.97/3.17
% 2.97/3.17
% 2.97/3.17 Changing weight limit from 27 to 26.
% 2.97/3.17
% 2.97/3.17 Resetting weight limit to 26 after 230 givens.
% 2.97/3.17
% 3.99/4.20
% 3.99/4.20
% 3.99/4.20 Changing weight limit from 26 to 25.
% 3.99/4.20
% 3.99/4.20 Resetting weight limit to 25 after 260 givens.
% 3.99/4.20
% 4.38/4.60
% 4.38/4.60
% 4.38/4.60 Changing weight limit from 25 to 24.
% 4.38/4.60
% 4.38/4.60 Resetting weight limit to 24 after 270 givens.
% 4.38/4.60
% 4.91/5.11
% 4.91/5.11
% 4.91/5.11 Changing weight limit from 24 to 23.
% 4.91/5.11
% 4.91/5.11 Resetting weight limit to 23 after 280 givens.
% 4.91/5.11
% 5.11/5.31
% 5.11/5.31
% 5.11/5.31 Changing weight limit from 23 to 22.
% 5.11/5.31
% 5.11/5.31 Resetting weight limit to 22 after 285 givens.
% 5.11/5.31
% 5.52/5.72
% 5.52/5.72
% 5.52/5.72 Changing weight limit from 22 to 21.
% 5.52/5.72
% 5.52/5.72 Model 8 [ 67 1 110 ] (0.00 seconds, 28781 Inserts)
% 5.52/5.72
% 5.52/5.72 Resetting weight limit to 21 after 290 givens.
% 5.52/5.72
% 6.70/6.87
% 6.70/6.87 -------- PROOF --------
% 6.70/6.87 % SZS status Unsatisfiable
% 6.70/6.87 % SZS output start Refutation
% 6.70/6.87
% 6.70/6.87 Model 9 [ 70 1 117 ] (0.00 seconds, 11230 Inserts)
% 6.70/6.87
% 6.70/6.87 Model 10 [ 57 1 15032 ] (0.00 seconds, 20500 Inserts)
% 6.70/6.87
% 6.70/6.87 ----> UNIT CONFLICT at 6.44 sec ----> 10329 [binary,10328.1,10022.1] {-} $F.
% 6.70/6.87
% 6.70/6.87 Length of proof is 9. Level of proof is 6.
% 6.70/6.87
% 6.70/6.87 ---------------- PROOF ----------------
% 6.70/6.87 % SZS status Unsatisfiable
% 6.70/6.87 % SZS output start Refutation
% 6.70/6.87
% 6.70/6.87 1 [] {+} A=B|predecessor(A)!=predecessor(B).
% 6.70/6.87 2 [] {+} A=B|successor(A)!=successor(B).
% 6.70/6.87 3 [] {+} less_than(A,B)| -less_than(A,C)| -less_than(C,B).
% 6.70/6.87 5 [] {+} -less_than(A,B)| -less_than(B,A).
% 6.70/6.87 10 [] {+} -less_than(n,m).
% 6.70/6.87 16 [] {+} less_than(A,i)| -less_than(A,successor(n))| -less_than(a(A),a(k)).
% 6.70/6.87 18,17 [] {+} predecessor(successor(A))=A.
% 6.70/6.87 22 [] {-} less_than(A,successor(A)).
% 6.70/6.87 23 [] {+} less_than(A,B)|less_than(B,A)|A=B.
% 6.70/6.87 25 [] {+} less_than(i,m).
% 6.70/6.87 26 [] {-} less_than(a(m),a(k)).
% 6.70/6.87 29 [para_into,17.1.1.1,1.1.1,demod,18] {+} predecessor(A)=B|B!=predecessor(A).
% 6.70/6.87 104 [hyper,23,3,22] {+} less_than(A,successor(B))|successor(B)=A|less_than(B,A).
% 6.70/6.87 355 [para_into,29.1.1,17.1.1,demod,18] {+} A=B|B!=A.
% 6.70/6.87 3153 [para_from,355.1.1,10.1.2] {+} -less_than(n,A)|A!=m.
% 6.70/6.87 6271 [para_into,3153.1.1,2.1.1] {+} -less_than(A,B)|B!=m|successor(n)!=successor(A).
% 6.70/6.87 8666 [hyper,104,16,26,unit_del,10] {-} successor(n)=m|less_than(m,i).
% 6.70/6.87 10023,10022 [hyper,8666,5,25] {-} successor(n)=m.
% 6.70/6.87 10138 [back_demod,6271,demod,10023,flip.3] {-} -less_than(A,B)|B!=m|successor(A)!=m.
% 6.70/6.87 10328 [factor,10138.2.3,unit_del,22] {-} successor(A)!=m.
% 6.70/6.87 10329 [binary,10328.1,10022.1] {-} $F.
% 6.70/6.87
% 6.70/6.87 % SZS output end Refutation
% 6.70/6.87 ------------ end of proof -------------
% 6.70/6.87
% 6.70/6.87
% 6.70/6.87 Search stopped by max_proofs option.
% 6.70/6.87
% 6.70/6.87
% 6.70/6.87 Search stopped by max_proofs option.
% 6.70/6.87
% 6.70/6.87 ============ end of search ============
% 6.70/6.87
% 6.70/6.87 ----------- soft-scott stats ----------
% 6.70/6.87
% 6.70/6.87 true clauses given 110 (36.7%)
% 6.70/6.87 false clauses given 190
% 6.70/6.87
% 6.70/6.87 FALSE TRUE
% 6.70/6.87 6 0 5
% 6.70/6.87 7 1 64
% 6.70/6.87 8 1 93
% 6.70/6.87 9 124 235
% 6.70/6.87 10 285 152
% 6.70/6.87 11 881 443
% 6.70/6.87 12 302 345
% 6.70/6.87 13 849 346
% 6.70/6.87 14 0 180
% 6.70/6.87 15 0 124
% 6.70/6.87 16 0 54
% 6.70/6.87 17 0 54
% 6.70/6.87 18 0 17
% 6.70/6.87 19 0 11
% 6.70/6.87 20 0 17
% 6.70/6.87 21 0 20
% 6.70/6.87 tot: 2443 2160 (46.9% true)
% 6.70/6.87
% 6.70/6.87
% 6.70/6.87 Model 10 [ 57 1 15032 ] (0.00 seconds, 20500 Inserts)
% 6.70/6.87
% 6.70/6.87 That finishes the proof of the theorem.
% 6.70/6.87
% 6.70/6.87 Process 32435 finished Wed Jun 15 09:51:20 2022
%------------------------------------------------------------------------------