TSTP Solution File: SWW421-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWW421-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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:49 EDT 2022
% Result : Unsatisfiable 0.20s 0.42s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWW421-1 : TPTP v8.1.0. Released v5.2.0.
% 0.12/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n018.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 21:38:34 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 sandbox on n018.cluster.edu,
% 0.12/0.36 Sun Jun 5 21:38:34 2022
% 0.12/0.36 The command was "./sos". The process ID is 16522.
% 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 17 during input processing: 0 [copy,17,flip.1] {-} sep(A,sep(B,C))=sep(B,sep(A,C)).
% 0.12/0.36 Following clause subsumed by 21 during input processing: 0 [copy,21,flip.1] {-} A=A.
% 0.12/0.36
% 0.12/0.36 ======= 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: 14
% 0.12/0.38 number of clauses initially in problem: 19
% 0.12/0.38 percentage of clauses intially in UL: 73
% 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: 10
% 0.12/0.38 distinct predicate count: 2
% 0.12/0.38 distinct function count: 3
% 0.12/0.38 distinct constant count: 5
% 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 ===========
% 0.20/0.42
% 0.20/0.42 -------- PROOF --------
% 0.20/0.42 % SZS status Unsatisfiable
% 0.20/0.42 % SZS output start Refutation
% 0.20/0.42
% 0.20/0.42 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 Stopped by limit on number of solutions
% 0.20/0.42
% 0.20/0.42 -----> EMPTY CLAUSE at 0.04 sec ----> 149 [hyper,138,6,unit_del,12,15] {-} $F.
% 0.20/0.42
% 0.20/0.42 Length of proof is 1. Level of proof is 1.
% 0.20/0.42
% 0.20/0.42 ---------------- PROOF ----------------
% 0.20/0.42 % SZS status Unsatisfiable
% 0.20/0.42 % SZS output start Refutation
% 0.20/0.42
% 0.20/0.42 6 [] {+} -heap(sep(next(A,B),sep(lseg(B,C),D)))|A=B|heap(sep(lseg(A,C),D)).
% 0.20/0.42 12 [] {+} x2!=x1.
% 0.20/0.42 15 [] {+} -heap(sep(lseg(x1,x3),emp)).
% 0.20/0.42 17 [] {-} sep(A,sep(B,C))=sep(B,sep(A,C)).
% 0.20/0.42 20 [] {-} heap(sep(lseg(x2,x3),sep(next(x1,x2),emp))).
% 0.20/0.42 138 [para_into,20.1.1,17.1.1] {-} heap(sep(next(x1,x2),sep(lseg(x2,x3),emp))).
% 0.20/0.42 149 [hyper,138,6,unit_del,12,15] {-} $F.
% 0.20/0.42
% 0.20/0.42 % SZS output end Refutation
% 0.20/0.42 ------------ end of proof -------------
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Search stopped by max_proofs option.
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Search stopped by max_proofs option.
% 0.20/0.42
% 0.20/0.42 ============ end of search ============
% 0.20/0.42
% 0.20/0.42 ----------- soft-scott stats ----------
% 0.20/0.42
% 0.20/0.42 true clauses given 0 (0.0%)
% 0.20/0.42 false clauses given 4
% 0.20/0.42
% 0.20/0.42 FALSE TRUE
% 0.20/0.42 3 0 1
% 0.20/0.42 6 0 1
% 0.20/0.42 8 0 1
% 0.20/0.42 9 0 1
% 0.20/0.42 11 0 1
% 0.20/0.42 12 0 2
% 0.20/0.42 13 0 4
% 0.20/0.42 15 2 4
% 0.20/0.42 16 3 8
% 0.20/0.42 17 2 0
% 0.20/0.42 18 0 1
% 0.20/0.42 19 0 4
% 0.20/0.42 20 5 8
% 0.20/0.42 22 2 2
% 0.20/0.42 23 1 14
% 0.20/0.42 24 1 7
% 0.20/0.42 25 1 2
% 0.20/0.42 26 0 5
% 0.20/0.42 27 0 10
% 0.20/0.42 28 1 7
% 0.20/0.42 29 0 1
% 0.20/0.42 30 0 1
% 0.20/0.42 31 0 5
% 0.20/0.42 32 0 2
% 0.20/0.42 34 0 6
% 0.20/0.42 36 0 1
% 0.20/0.42 37 0 1
% 0.20/0.42 39 0 2
% 0.20/0.42 40 0 2
% 0.20/0.42 41 0 1
% 0.20/0.42 46 0 1
% 0.20/0.42 47 0 1
% 0.20/0.42 56 0 1
% 0.20/0.42 58 0 1
% 0.20/0.42 tot: 18 109 (85.8% true)
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 That finishes the proof of the theorem.
% 0.20/0.42
% 0.20/0.42 Process 16522 finished Sun Jun 5 21:38:34 2022
%------------------------------------------------------------------------------