TSTP Solution File: SWW412-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWW412-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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 1.07s 1.27s
% Output : Refutation 1.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWW412-1 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.14 % Command : sos-script %s
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 4 09:52:44 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox on n017.cluster.edu,
% 0.13/0.37 Sat Jun 4 09:52:44 2022
% 0.13/0.37 The command was "./sos". The process ID is 5262.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.13/0.37
% 0.13/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.37 clauses in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(knuth_bendix).
% 0.13/0.37 dependent: set(para_from).
% 0.13/0.37 dependent: set(para_into).
% 0.13/0.37 dependent: clear(para_from_right).
% 0.13/0.37 dependent: clear(para_into_right).
% 0.13/0.37 dependent: set(para_from_vars).
% 0.13/0.37 dependent: set(eq_units_both_ways).
% 0.13/0.37 dependent: set(dynamic_demod_all).
% 0.13/0.37 dependent: set(dynamic_demod).
% 0.13/0.37 dependent: set(order_eq).
% 0.13/0.37 dependent: set(back_demod).
% 0.13/0.37 dependent: set(lrpo).
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: set(unit_deletion).
% 0.13/0.37 dependent: set(factor).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37 Following clause subsumed by 24 during input processing: 0 [copy,24,flip.1] {-} sep(A,sep(B,C))=sep(B,sep(A,C)).
% 0.13/0.37 Following clause subsumed by 28 during input processing: 0 [copy,28,flip.1] {-} A=A.
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.22/0.40
% 0.22/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.22/0.40
% 0.22/0.40 Stopped by limit on number of solutions
% 0.22/0.40
% 0.22/0.40
% 0.22/0.40 -------------- Softie stats --------------
% 0.22/0.40
% 0.22/0.40 UPDATE_STOP: 300
% 0.22/0.40 SFINDER_TIME_LIMIT: 2
% 0.22/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.22/0.40 number of clauses in intial UL: 18
% 0.22/0.40 number of clauses initially in problem: 23
% 0.22/0.40 percentage of clauses intially in UL: 78
% 0.22/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.22/0.40 percent of all initial clauses that are short: 100
% 0.22/0.40 absolute distinct symbol count: 11
% 0.22/0.40 distinct predicate count: 2
% 0.22/0.40 distinct function count: 3
% 0.22/0.40 distinct constant count: 6
% 0.22/0.40
% 0.22/0.40 ---------- no more Softie stats ----------
% 0.22/0.40
% 0.22/0.40
% 0.22/0.40
% 0.22/0.40 =========== start of search ===========
% 1.07/1.27
% 1.07/1.27 -------- PROOF --------
% 1.07/1.27 % SZS status Unsatisfiable
% 1.07/1.27 % SZS output start Refutation
% 1.07/1.27
% 1.07/1.27 Model 2 (0.00 seconds, 0 Inserts)
% 1.07/1.27
% 1.07/1.27 Stopped by limit on number of solutions
% 1.07/1.27
% 1.07/1.27 -----> EMPTY CLAUSE at 0.86 sec ----> 1778 [hyper,1495,6,unit_del,19,48] {-} $F.
% 1.07/1.27
% 1.07/1.27 Length of proof is 8. Level of proof is 5.
% 1.07/1.27
% 1.07/1.27 ---------------- PROOF ----------------
% 1.07/1.27 % SZS status Unsatisfiable
% 1.07/1.27 % SZS output start Refutation
% 1.07/1.27
% 1.07/1.27 6 [] {+} -heap(sep(next(A,B),sep(lseg(B,C),D)))|A=B|heap(sep(lseg(A,C),D)).
% 1.07/1.27 15 [] {+} x3!=x2.
% 1.07/1.27 18 [] {-} x1!=x4.
% 1.07/1.27 19 [copy,18,flip.1] {+} x4!=x1.
% 1.07/1.27 22 [] {+} -heap(sep(lseg(x2,nil),sep(lseg(x1,nil),emp))).
% 1.07/1.27 24 [] {-} sep(A,sep(B,C))=sep(B,sep(A,C)).
% 1.07/1.27 27 [] {-} heap(sep(lseg(x3,nil),sep(lseg(x4,nil),sep(next(x1,x4),sep(next(x2,x3),emp))))).
% 1.07/1.27 29 [para_into,24.1.1.2,24.1.1] {+} sep(A,sep(B,sep(C,D)))=sep(C,sep(A,sep(B,D))).
% 1.07/1.27 48 [para_from,24.1.1,22.1.1] {+} -heap(sep(lseg(x1,nil),sep(lseg(x2,nil),emp))).
% 1.07/1.27 178 [para_into,27.1.1.2.2,24.1.1] {-} heap(sep(lseg(x3,nil),sep(lseg(x4,nil),sep(next(x2,x3),sep(next(x1,x4),emp))))).
% 1.07/1.27 339 [para_from,29.1.1,178.1.1] {-} heap(sep(next(x2,x3),sep(lseg(x3,nil),sep(lseg(x4,nil),sep(next(x1,x4),emp))))).
% 1.07/1.27 964 [hyper,339,6,unit_del,15] {-} heap(sep(lseg(x2,nil),sep(lseg(x4,nil),sep(next(x1,x4),emp)))).
% 1.07/1.27 1148 [para_into,964.1.1,29.1.1] {-} heap(sep(next(x1,x4),sep(lseg(x2,nil),sep(lseg(x4,nil),emp)))).
% 1.07/1.27 1495 [para_into,1148.1.1.2,24.1.1] {-} heap(sep(next(x1,x4),sep(lseg(x4,nil),sep(lseg(x2,nil),emp)))).
% 1.07/1.27 1778 [hyper,1495,6,unit_del,19,48] {-} $F.
% 1.07/1.27
% 1.07/1.27 % SZS output end Refutation
% 1.07/1.27 ------------ end of proof -------------
% 1.07/1.27
% 1.07/1.27
% 1.07/1.27 Search stopped by max_proofs option.
% 1.07/1.27
% 1.07/1.27
% 1.07/1.27 Search stopped by max_proofs option.
% 1.07/1.27
% 1.07/1.27 ============ end of search ============
% 1.07/1.27
% 1.07/1.27 ----------- soft-scott stats ----------
% 1.07/1.27
% 1.07/1.27 true clauses given 8 (36.4%)
% 1.07/1.27 false clauses given 14
% 1.07/1.27
% 1.07/1.27 FALSE TRUE
% 1.07/1.27 8 0 2
% 1.07/1.27 9 0 1
% 1.07/1.27 10 0 4
% 1.07/1.27 11 0 1
% 1.07/1.27 12 0 7
% 1.07/1.27 13 0 4
% 1.07/1.27 14 1 5
% 1.07/1.27 15 0 8
% 1.07/1.27 16 2 9
% 1.07/1.27 17 0 3
% 1.07/1.27 18 9 9
% 1.07/1.27 19 0 16
% 1.07/1.27 20 16 35
% 1.07/1.27 21 0 5
% 1.07/1.27 22 0 4
% 1.07/1.27 23 0 15
% 1.07/1.27 24 64 73
% 1.07/1.27 25 0 11
% 1.07/1.27 26 16 12
% 1.07/1.27 27 24 41
% 1.07/1.27 28 83 45
% 1.07/1.27 29 0 18
% 1.07/1.27 30 32 53
% 1.07/1.27 31 58 88
% 1.07/1.27 32 11 33
% 1.07/1.27 33 0 11
% 1.07/1.27 34 11 55
% 1.07/1.27 35 36 57
% 1.07/1.27 36 11 53
% 1.07/1.27 37 0 10
% 1.07/1.27 38 11 35
% 1.07/1.27 39 14 19
% 1.07/1.27 40 7 35
% 1.07/1.27 41 0 23
% 1.07/1.27 42 7 64
% 1.07/1.27 43 6 17
% 1.07/1.27 44 7 42
% 1.07/1.27 45 0 29
% 1.07/1.27 46 7 19
% 1.07/1.27 47 14 27
% 1.07/1.27 48 0 45
% 1.07/1.27 49 0 12
% 1.07/1.27 50 0 23
% 1.07/1.27 51 8 18
% 1.07/1.27 52 0 25
% 1.07/1.27 53 0 26
% 1.07/1.27 54 0 13
% 1.07/1.27 55 14 15
% 1.07/1.27 56 0 11
% 1.07/1.27 57 0 27
% 1.07/1.27 58 0 14
% 1.07/1.27 59 0 12
% 1.07/1.27 60 0 9
% 1.07/1.27 tot: 469 1248 (72.7% true)
% 1.07/1.27
% 1.07/1.27
% 1.07/1.27 Model 2 (0.00 seconds, 0 Inserts)
% 1.07/1.27
% 1.07/1.27 That finishes the proof of the theorem.
% 1.07/1.27
% 1.07/1.27 Process 5262 finished Sat Jun 4 09:52:45 2022
%------------------------------------------------------------------------------