TSTP Solution File: SWW409-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWW409-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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:48 EDT 2022
% Result : Unsatisfiable 0.38s 0.60s
% Output : Refutation 0.38s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW409-1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n027.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 : Sun Jun 5 16:43:38 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 sandbox2 on n027.cluster.edu,
% 0.12/0.36 Sun Jun 5 16:43:38 2022
% 0.12/0.36 The command was "./sos". The process ID is 14914.
% 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=1, symmetry=0, max_lits=3.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 20 during input processing: 0 [copy,20,flip.1] {-} sep(A,sep(B,C))=sep(B,sep(A,C)).
% 0.12/0.36 Following clause subsumed by 24 during input processing: 0 [copy,24,flip.1] {-} A=A.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.19/0.38
% 0.19/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 -------------- Softie stats --------------
% 0.19/0.38
% 0.19/0.38 UPDATE_STOP: 300
% 0.19/0.38 SFINDER_TIME_LIMIT: 2
% 0.19/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38 number of clauses in intial UL: 15
% 0.19/0.38 number of clauses initially in problem: 20
% 0.19/0.38 percentage of clauses intially in UL: 75
% 0.19/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.38 percent of all initial clauses that are short: 100
% 0.19/0.38 absolute distinct symbol count: 10
% 0.19/0.38 distinct predicate count: 2
% 0.19/0.38 distinct function count: 3
% 0.19/0.38 distinct constant count: 5
% 0.19/0.38
% 0.19/0.38 ---------- no more Softie stats ----------
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 =========== start of search ===========
% 0.38/0.60
% 0.38/0.60 -------- PROOF --------
% 0.38/0.60 % SZS status Unsatisfiable
% 0.38/0.60 % SZS output start Refutation
% 0.38/0.60
% 0.38/0.60 Model 2 (0.00 seconds, 0 Inserts)
% 0.38/0.60
% 0.38/0.60 Stopped by limit on number of solutions
% 0.38/0.60
% 0.38/0.60 ----> UNIT CONFLICT at 0.23 sec ----> 885 [binary,884.1,18.1] {-} $F.
% 0.38/0.60
% 0.38/0.60 Length of proof is 7. Level of proof is 5.
% 0.38/0.60
% 0.38/0.60 ---------------- PROOF ----------------
% 0.38/0.60 % SZS status Unsatisfiable
% 0.38/0.60 % SZS output start Refutation
% 0.38/0.60
% 0.38/0.60 6 [] {+} -heap(sep(next(A,B),sep(lseg(B,C),D)))|A=B|heap(sep(lseg(A,C),D)).
% 0.38/0.60 7 [] {+} -heap(sep(lseg(A,B),sep(lseg(B,nil),C)))|heap(sep(lseg(A,nil),C)).
% 0.38/0.60 14 [] {-} x1!=x3.
% 0.38/0.60 15 [copy,14,flip.1] {+} x3!=x1.
% 0.38/0.60 18 [] {+} -heap(sep(lseg(x2,nil),emp)).
% 0.38/0.60 20 [] {-} sep(A,sep(B,C))=sep(B,sep(A,C)).
% 0.38/0.60 23 [] {-} heap(sep(lseg(x2,x1),sep(lseg(x3,nil),sep(next(x1,x3),emp)))).
% 0.38/0.60 25 [para_into,20.1.1.2,20.1.1] {+} sep(A,sep(B,sep(C,D)))=sep(C,sep(A,sep(B,D))).
% 0.38/0.60 164 [para_into,23.1.1,20.1.1] {-} heap(sep(lseg(x3,nil),sep(lseg(x2,x1),sep(next(x1,x3),emp)))).
% 0.38/0.60 387 [para_into,164.1.1,25.1.1] {-} heap(sep(next(x1,x3),sep(lseg(x3,nil),sep(lseg(x2,x1),emp)))).
% 0.38/0.60 704 [hyper,387,6,unit_del,15] {-} heap(sep(lseg(x1,nil),sep(lseg(x2,x1),emp))).
% 0.38/0.60 873 [para_into,704.1.1,20.1.1] {-} heap(sep(lseg(x2,x1),sep(lseg(x1,nil),emp))).
% 0.38/0.60 884 [hyper,873,7] {-} heap(sep(lseg(x2,nil),emp)).
% 0.38/0.60 885 [binary,884.1,18.1] {-} $F.
% 0.38/0.60
% 0.38/0.60 % SZS output end Refutation
% 0.38/0.60 ------------ end of proof -------------
% 0.38/0.60
% 0.38/0.60
% 0.38/0.60 Search stopped by max_proofs option.
% 0.38/0.60
% 0.38/0.60
% 0.38/0.60 Search stopped by max_proofs option.
% 0.38/0.60
% 0.38/0.60 ============ end of search ============
% 0.38/0.60
% 0.38/0.60 ----------- soft-scott stats ----------
% 0.38/0.60
% 0.38/0.60 true clauses given 5 (33.3%)
% 0.38/0.60 false clauses given 10
% 0.38/0.60
% 0.38/0.60 FALSE TRUE
% 0.38/0.60 6 0 1
% 0.38/0.60 8 0 1
% 0.38/0.60 9 0 1
% 0.38/0.60 10 0 3
% 0.38/0.60 11 0 1
% 0.38/0.60 12 0 5
% 0.38/0.60 13 0 4
% 0.38/0.60 14 0 4
% 0.38/0.60 15 0 8
% 0.38/0.60 16 3 10
% 0.38/0.60 17 0 3
% 0.38/0.60 18 0 6
% 0.38/0.60 19 0 13
% 0.38/0.60 20 27 40
% 0.38/0.60 21 0 5
% 0.38/0.60 22 3 5
% 0.38/0.60 23 8 12
% 0.38/0.60 24 68 24
% 0.38/0.60 25 0 9
% 0.38/0.60 26 25 18
% 0.38/0.60 27 50 46
% 0.38/0.60 28 14 10
% 0.38/0.60 29 0 16
% 0.38/0.60 30 7 40
% 0.38/0.60 31 14 32
% 0.38/0.60 32 12 28
% 0.38/0.60 33 0 7
% 0.38/0.60 34 6 11
% 0.38/0.60 35 12 15
% 0.38/0.60 36 12 7
% 0.38/0.60 37 0 6
% 0.38/0.60 38 6 43
% 0.38/0.60 39 2 12
% 0.38/0.60 40 0 13
% 0.38/0.60 41 0 6
% 0.38/0.60 42 0 7
% 0.38/0.60 43 12 4
% 0.38/0.60 44 0 31
% 0.38/0.60 45 0 5
% 0.38/0.60 46 0 1
% 0.38/0.60 47 0 3
% 0.38/0.60 48 0 3
% 0.38/0.60 50 0 7
% 0.38/0.60 51 12 3
% 0.38/0.60 53 0 3
% 0.38/0.60 55 0 2
% 0.38/0.60 56 0 1
% 0.38/0.60 57 0 1
% 0.38/0.60 58 0 1
% 0.38/0.60 59 0 2
% 0.38/0.60 60 0 2
% 0.38/0.60 tot: 293 541 (64.9% true)
% 0.38/0.60
% 0.38/0.60
% 0.38/0.60 Model 2 (0.00 seconds, 0 Inserts)
% 0.38/0.60
% 0.38/0.60 That finishes the proof of the theorem.
% 0.38/0.60
% 0.38/0.60 Process 14914 finished Sun Jun 5 16:43:38 2022
%------------------------------------------------------------------------------