TSTP Solution File: SWW400-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWW400-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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 : Thu Jul 21 01:26:47 EDT 2022
% Result : Unsatisfiable 35.10s 35.33s
% Output : Refutation 35.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW400-1 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 5 10:28:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n020.cluster.edu,
% 0.12/0.35 Sun Jun 5 10:28:52 2022
% 0.12/0.35 The command was "./sos". The process ID is 24327.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] {-} sep(A,sep(B,C))=sep(B,sep(A,C)).
% 0.12/0.35 Following clause subsumed by 20 during input processing: 0 [copy,20,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= 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: 13
% 0.12/0.38 number of clauses initially in problem: 18
% 0.12/0.38 percentage of clauses intially in UL: 72
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 9
% 0.12/0.38 distinct predicate count: 2
% 0.12/0.38 distinct function count: 3
% 0.12/0.38 distinct constant count: 4
% 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 ===========
% 4.69/4.92
% 4.69/4.92
% 4.69/4.92 Changing weight limit from 60 to 57.
% 4.69/4.92
% 4.69/4.92 Model 2 (0.00 seconds, 0 Inserts)
% 4.69/4.92
% 4.69/4.92 Stopped by limit on number of solutions
% 4.69/4.92
% 4.69/4.92 Resetting weight limit to 57 after 35 givens.
% 4.69/4.92
% 20.84/21.04
% 20.84/21.04
% 20.84/21.04 Changing weight limit from 57 to 48.
% 20.84/21.04
% 20.84/21.04 Resetting weight limit to 48 after 60 givens.
% 20.84/21.04
% 23.33/23.56
% 23.33/23.56
% 23.33/23.56 Changing weight limit from 48 to 44.
% 23.33/23.56
% 23.33/23.56 Resetting weight limit to 44 after 65 givens.
% 23.33/23.56
% 24.25/24.43
% 24.25/24.43
% 24.25/24.43 Changing weight limit from 44 to 43.
% 24.25/24.43
% 24.25/24.43 Resetting weight limit to 43 after 70 givens.
% 24.25/24.43
% 24.91/25.07
% 24.91/25.07
% 24.91/25.07 Changing weight limit from 43 to 41.
% 24.91/25.07
% 24.91/25.07 Resetting weight limit to 41 after 75 givens.
% 24.91/25.07
% 26.56/26.74
% 26.56/26.74
% 26.56/26.74 Changing weight limit from 41 to 38.
% 26.56/26.74
% 26.56/26.74 Resetting weight limit to 38 after 80 givens.
% 26.56/26.74
% 27.14/27.31
% 27.14/27.31
% 27.14/27.31 Changing weight limit from 38 to 37.
% 27.14/27.31
% 27.14/27.31 Resetting weight limit to 37 after 85 givens.
% 27.14/27.31
% 27.56/27.72
% 27.56/27.72
% 27.56/27.72 Changing weight limit from 37 to 36.
% 27.56/27.72
% 27.56/27.72 Resetting weight limit to 36 after 90 givens.
% 27.56/27.72
% 28.01/28.22
% 28.01/28.22
% 28.01/28.22 Changing weight limit from 36 to 35.
% 28.01/28.22
% 28.01/28.22 Resetting weight limit to 35 after 95 givens.
% 28.01/28.22
% 28.47/28.70
% 28.47/28.70
% 28.47/28.70 Changing weight limit from 35 to 34.
% 28.47/28.70
% 28.47/28.70 Resetting weight limit to 34 after 100 givens.
% 28.47/28.70
% 29.16/29.36
% 29.16/29.36
% 29.16/29.36 Changing weight limit from 34 to 33.
% 29.16/29.36
% 29.16/29.36 Resetting weight limit to 33 after 110 givens.
% 29.16/29.36
% 29.53/29.71
% 29.53/29.71
% 29.53/29.71 Changing weight limit from 33 to 32.
% 29.53/29.71
% 29.53/29.71 Resetting weight limit to 32 after 115 givens.
% 29.53/29.71
% 31.27/31.45
% 31.27/31.45
% 31.27/31.45 Changing weight limit from 32 to 31.
% 31.27/31.45
% 31.27/31.45 Resetting weight limit to 31 after 140 givens.
% 31.27/31.45
% 35.10/35.33
% 35.10/35.33 -- HEY sandbox, WE HAVE A PROOF!! --
% 35.10/35.33
% 35.10/35.33 ----> UNIT CONFLICT at 34.93 sec ----> 23599 [binary,23598.1,14.1] {+} $F.
% 35.10/35.33
% 35.10/35.33 Length of proof is 7. Level of proof is 6.
% 35.10/35.33
% 35.10/35.33 ---------------- PROOF ----------------
% 35.10/35.33 % SZS status Unsatisfiable
% 35.10/35.33 % SZS output start Refutation
% 35.10/35.33
% 35.10/35.33 1 [] {+} -heap(sep(next(nil,A),B)).
% 35.10/35.33 2 [] {+} -heap(sep(lseg(nil,A),B))|A=nil.
% 35.10/35.33 6 [] {+} -heap(sep(next(A,B),sep(lseg(B,C),D)))|A=B|heap(sep(lseg(A,C),D)).
% 35.10/35.33 7 [] {+} -heap(sep(lseg(A,B),sep(lseg(B,nil),C)))|heap(sep(lseg(A,nil),C)).
% 35.10/35.33 14 [] {+} -heap(sep(lseg(x1,nil),emp)).
% 35.10/35.33 16 [] {-} sep(A,sep(B,C))=sep(B,sep(A,C)).
% 35.10/35.33 18,17 [] {+} sep(lseg(A,A),B)=B.
% 35.10/35.33 19 [] {-} heap(sep(next(x2,nil),sep(lseg(x1,x2),emp))).
% 35.10/35.33 51 [para_from,16.1.1,7.1.1] {+} -heap(sep(lseg(A,nil),sep(lseg(B,A),C)))|heap(sep(lseg(B,nil),C)).
% 35.10/35.33 87 [para_into,19.1.1.1.1,2.2.1,unit_del,1] {+} -heap(sep(lseg(nil,x2),A)).
% 35.10/35.33 381 [para_into,87.1.1,16.1.1] {+} -heap(sep(A,sep(lseg(nil,x2),B))).
% 35.10/35.33 1967 [para_into,381.1.1.2.1.2,6.2.1] {+} -heap(sep(A,sep(lseg(nil,B),C)))| -heap(sep(next(x2,B),sep(lseg(B,D),E)))|heap(sep(lseg(x2,D),E)).
% 35.10/35.33 1996 [factor,1967.1.2,demod,18] {+} -heap(sep(next(x2,nil),A))|heap(sep(lseg(x2,nil),A)).
% 35.10/35.33 23463 [hyper,1996,19] {-} heap(sep(lseg(x2,nil),sep(lseg(x1,x2),emp))).
% 35.10/35.33 23598 [hyper,23463,51] {-} heap(sep(lseg(x1,nil),emp)).
% 35.10/35.33 23599 [binary,23598.1,14.1] {+} $F.
% 35.10/35.33
% 35.10/35.33 % SZS output end Refutation
% 35.10/35.33 ------------ end of proof -------------
% 35.10/35.33
% 35.10/35.33
% 35.10/35.33 Search stopped by max_proofs option.
% 35.10/35.33
% 35.10/35.33
% 35.10/35.33 Search stopped by max_proofs option.
% 35.10/35.33
% 35.10/35.33 ============ end of search ============
% 35.10/35.33
% 35.10/35.33 ----------- soft-scott stats ----------
% 35.10/35.33
% 35.10/35.33 true clauses given 76 (38.4%)
% 35.10/35.33 false clauses given 122
% 35.10/35.33
% 35.10/35.33 FALSE TRUE
% 35.10/35.33 12 0 45
% 35.10/35.33 13 0 21
% 35.10/35.33 14 0 104
% 35.10/35.33 15 0 25
% 35.10/35.33 16 0 249
% 35.10/35.33 17 0 45
% 35.10/35.33 18 0 287
% 35.10/35.33 19 0 55
% 35.10/35.33 20 1 390
% 35.10/35.33 21 25 91
% 35.10/35.33 22 186 473
% 35.10/35.33 23 111 155
% 35.10/35.33 24 310 667
% 35.10/35.33 25 104 34
% 35.10/35.33 26 314 26
% 35.10/35.33 27 437 22
% 35.10/35.33 28 271 37
% 35.10/35.33 29 123 14
% 35.10/35.33 30 470 26
% 35.10/35.33 31 157 60
% 35.10/35.33 tot: 2509 2826 (53.0% true)
% 35.10/35.33
% 35.10/35.33
% 35.10/35.33 Model 2 (0.00 seconds, 0 Inserts)
% 35.10/35.33
% 35.10/35.33 That finishes the proof of the theorem.
% 35.10/35.33
% 35.10/35.33 Process 24327 finished Sun Jun 5 10:29:27 2022
%------------------------------------------------------------------------------