TSTP Solution File: NLP122-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NLP122-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n007.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 : Mon Jul 18 05:23:53 EDT 2022
% Result : Unsatisfiable 0.85s 1.07s
% Output : Refutation 0.85s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NLP122-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.11 % Command : sos-script %s
% 0.10/0.32 % Computer : n007.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 600
% 0.10/0.32 % DateTime : Thu Jun 30 20:51:38 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.10/0.34 ----- Otter 3.2, August 2001 -----
% 0.10/0.34 The process was started by sandbox on n007.cluster.edu,
% 0.10/0.34 Thu Jun 30 20:51:38 2022
% 0.10/0.34 The command was "./sos". The process ID is 8488.
% 0.10/0.34
% 0.10/0.34 set(prolog_style_variables).
% 0.10/0.34 set(auto).
% 0.10/0.34 dependent: set(auto1).
% 0.10/0.34 dependent: set(process_input).
% 0.10/0.34 dependent: clear(print_kept).
% 0.10/0.34 dependent: clear(print_new_demod).
% 0.10/0.34 dependent: clear(print_back_demod).
% 0.10/0.34 dependent: clear(print_back_sub).
% 0.10/0.34 dependent: set(control_memory).
% 0.10/0.34 dependent: assign(max_mem, 12000).
% 0.10/0.34 dependent: assign(pick_given_ratio, 4).
% 0.10/0.34 dependent: assign(stats_level, 1).
% 0.10/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.10/0.34 dependent: assign(sos_limit, 5000).
% 0.10/0.34 dependent: assign(max_weight, 60).
% 0.10/0.34 clear(print_given).
% 0.10/0.34
% 0.10/0.34 list(usable).
% 0.10/0.34
% 0.10/0.34 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=18.
% 0.10/0.34
% 0.10/0.34 This is a non-Horn set without equality. The strategy
% 0.10/0.34 will be ordered hyper_res, ur_res, unit deletion, and
% 0.10/0.34 factoring, with satellites in sos and nuclei in usable.
% 0.10/0.34
% 0.10/0.34 dependent: set(hyper_res).
% 0.10/0.34 dependent: set(factor).
% 0.10/0.34 dependent: set(unit_deletion).
% 0.10/0.34
% 0.10/0.34 ------------> process usable:
% 0.10/0.34
% 0.10/0.34 ------------> process sos:
% 0.10/0.34
% 0.10/0.34 ======= end of input processing =======
% 0.18/0.36
% 0.18/0.36 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.36
% 0.18/0.36 Stopped by limit on number of solutions
% 0.18/0.36
% 0.18/0.36
% 0.18/0.36 -------------- Softie stats --------------
% 0.18/0.36
% 0.18/0.36 UPDATE_STOP: 300
% 0.18/0.36 SFINDER_TIME_LIMIT: 2
% 0.18/0.36 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.36 number of clauses in intial UL: 18
% 0.18/0.36 number of clauses initially in problem: 36
% 0.18/0.36 percentage of clauses intially in UL: 50
% 0.18/0.36 percentage of distinct symbols occuring in initial UL: 82
% 0.18/0.36 percent of all initial clauses that are short: 100
% 0.18/0.36 absolute distinct symbol count: 28
% 0.18/0.36 distinct predicate count: 17
% 0.18/0.36 distinct function count: 0
% 0.18/0.36 distinct constant count: 11
% 0.18/0.36
% 0.18/0.36 ---------- no more Softie stats ----------
% 0.18/0.36
% 0.18/0.36
% 0.18/0.36
% 0.18/0.36 =========== start of search ===========
% 0.85/1.07
% 0.85/1.07 -------- PROOF --------
% 0.85/1.07 % SZS status Unsatisfiable
% 0.85/1.07 % SZS output start Refutation
% 0.85/1.07
% 0.85/1.07 Model 2 (0.00 seconds, 0 Inserts)
% 0.85/1.07
% 0.85/1.07 Stopped by limit on number of solutions
% 0.85/1.07
% 0.85/1.07 Model 3 (0.00 seconds, 0 Inserts)
% 0.85/1.07
% 0.85/1.07 Stopped by limit on number of solutions
% 0.85/1.07
% 0.85/1.07 Model 4 (0.00 seconds, 0 Inserts)
% 0.85/1.07
% 0.85/1.07 Stopped by limit on number of solutions
% 0.85/1.07
% 0.85/1.07 Model 5 (0.00 seconds, 0 Inserts)
% 0.85/1.07
% 0.85/1.07 Stopped by limit on number of solutions
% 0.85/1.07
% 0.85/1.07 Stopped by limit on insertions
% 0.85/1.07
% 0.85/1.07 Model 6 [ 1 1 263 ] (0.00 seconds, 250000 Inserts)
% 0.85/1.07
% 0.85/1.07 Stopped by limit on insertions
% 0.85/1.07
% 0.85/1.07 Model 7 [ 1 0 247 ] (0.00 seconds, 250000 Inserts)
% 0.85/1.07
% 0.85/1.07 Stopped by limit on insertions
% 0.85/1.07
% 0.85/1.07 Model 8 [ 1 1 251 ] (0.00 seconds, 250000 Inserts)
% 0.85/1.07
% 0.85/1.07 Model 9 (0.00 seconds, 250000 Inserts)
% 0.85/1.07
% 0.85/1.07 Stopped by limit on number of solutions
% 0.85/1.07
% 0.85/1.07 Stopped by limit on insertions
% 0.85/1.07
% 0.85/1.07 Model 10 [ 2 0 253 ] (0.00 seconds, 250000 Inserts)
% 0.85/1.07
% 0.85/1.07 Stopped by limit on insertions
% 0.85/1.07
% 0.85/1.07 Model 11 [ 2 1 255 ] (0.00 seconds, 250000 Inserts)
% 0.85/1.07
% 0.85/1.07 Stopped by limit on insertions
% 0.85/1.07
% 0.85/1.07 Model 12 [ 2 1 252 ] (0.00 seconds, 250000 Inserts)
% 0.85/1.07
% 0.85/1.07 Stopped by limit on insertions
% 0.85/1.07
% 0.85/1.07 Model 13 [ 2 0 261 ] (0.00 seconds, 250000 Inserts)
% 0.85/1.07
% 0.85/1.07 Stopped by limit on insertions
% 0.85/1.07
% 0.85/1.07 Model 14 [ 1 1 483 ] (0.00 seconds, 250000 Inserts)
% 0.85/1.07
% 0.85/1.07 -----> EMPTY CLAUSE at 0.71 sec ----> 54 [hyper,41,18,44,45,46,47,48,39,40,42,43,38,53,52,51,50,49,20,37] {-} $F.
% 0.85/1.07
% 0.85/1.07 Length of proof is 17. Level of proof is 2.
% 0.85/1.07
% 0.85/1.07 ---------------- PROOF ----------------
% 0.85/1.07 % SZS status Unsatisfiable
% 0.85/1.07 % SZS output start Refutation
% 0.85/1.07
% 0.85/1.07 1 [] {+} -ssSkC0|event(skc10,skc11).
% 0.85/1.07 2 [] {+} -ssSkC0|present(skc10,skc11).
% 0.85/1.07 3 [] {+} -ssSkC0|barrel(skc10,skc11).
% 0.85/1.07 4 [] {+} -ssSkC0|lonely(skc10,skc14).
% 0.85/1.07 5 [] {+} -ssSkC0|street(skc10,skc14).
% 0.85/1.07 6 [] {+} -ssSkC0|old(skc10,skc12).
% 0.85/1.07 7 [] {+} -ssSkC0|dirty(skc10,skc12).
% 0.85/1.07 8 [] {+} -ssSkC0|white(skc10,skc12).
% 0.85/1.07 9 [] {+} -ssSkC0|chevy(skc10,skc12).
% 0.85/1.07 10 [] {+} -ssSkC0|city(skc10,skc12).
% 0.85/1.07 11 [] {+} -ssSkC0|hollywood_placename(skc10,skc13).
% 0.85/1.07 12 [] {+} -ssSkC0|placename(skc10,skc13).
% 0.85/1.07 13 [] {+} -ssSkC0|down(skc10,skc11,skc14).
% 0.85/1.07 14 [] {+} -ssSkC0|in(skc10,skc11,skc12).
% 0.85/1.07 15 [] {+} -ssSkC0|agent(skc10,skc11,skc12).
% 0.85/1.07 16 [] {+} -ssSkC0|of(skc10,skc13,skc12).
% 0.85/1.07 17 [] {+} -event(A,B)| -present(A,B)| -barrel(A,B)| -down(A,B,C)| -lonely(A,C)| -street(A,C)| -in(A,B,D)| -agent(A,B,D)| -old(A,D)| -dirty(A,D)| -white(A,D)| -chevy(A,D)| -city(A,D)| -of(A,E,D)| -hollywood_placename(A,E)| -placename(A,E)| -actual_world(A)|ssSkC0.
% 0.85/1.07 18 [] {+} -city(A,B)| -chevy(A,B)| -white(A,B)| -dirty(A,B)| -old(A,B)| -agent(A,C,B)| -in(A,C,B)| -placename(A,D)| -hollywood_placename(A,D)| -of(A,D,B)| -event(A,C)| -present(A,C)| -barrel(A,C)| -down(A,C,E)| -lonely(A,E)| -street(A,E)| -actual_world(A)| -ssSkC0.
% 0.85/1.07 19 [] {+} actual_world(skc15).
% 0.85/1.07 20 [] {+} actual_world(skc10).
% 0.85/1.07 21 [] {+} ssSkC0|city(skc15,skc18).
% 0.85/1.07 22 [] {+} ssSkC0|chevy(skc15,skc18).
% 0.85/1.07 23 [] {+} ssSkC0|white(skc15,skc18).
% 0.85/1.07 24 [] {+} ssSkC0|dirty(skc15,skc18).
% 0.85/1.07 25 [] {+} ssSkC0|old(skc15,skc18).
% 0.85/1.07 26 [] {+} ssSkC0|placename(skc15,skc19).
% 0.85/1.07 27 [] {+} ssSkC0|hollywood_placename(skc15,skc19).
% 0.85/1.07 28 [] {+} ssSkC0|event(skc15,skc16).
% 0.85/1.07 29 [] {+} ssSkC0|present(skc15,skc16).
% 0.85/1.07 30 [] {+} ssSkC0|barrel(skc15,skc16).
% 0.85/1.07 31 [] {+} ssSkC0|lonely(skc15,skc17).
% 0.85/1.07 32 [] {+} ssSkC0|street(skc15,skc17).
% 0.85/1.07 33 [] {+} ssSkC0|agent(skc15,skc16,skc18).
% 0.85/1.07 34 [] {-} ssSkC0|in(skc15,skc16,skc18).
% 0.85/1.07 35 [] {+} ssSkC0|of(skc15,skc19,skc18).
% 0.85/1.07 36 [] {-} ssSkC0|down(skc15,skc16,skc17).
% 0.85/1.07 37 [hyper,35,17,28,29,30,36,31,32,34,33,25,24,23,22,21,27,26,19,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp] {+} ssSkC0.
% 0.85/1.07 38 [hyper,37,16] {+} of(skc10,skc13,skc12).
% 0.85/1.07 39 [hyper,37,15] {+} agent(skc10,skc11,skc12).
% 0.85/1.07 40 [hyper,37,14] {+} in(skc10,skc11,skc12).
% 0.85/1.07 41 [hyper,37,13] {+} down(skc10,skc11,skc14).
% 0.85/1.07 42 [hyper,37,12] {+} placename(skc10,skc13).
% 0.85/1.07 43 [hyper,37,11] {+} hollywood_placename(skc10,skc13).
% 0.85/1.07 44 [hyper,37,10] {+} city(skc10,skc12).
% 0.85/1.07 45 [hyper,37,9] {+} chevy(skc10,skc12).
% 0.85/1.07 46 [hyper,37,8] {+} white(skc10,skc12).
% 0.85/1.07 47 [hyper,37,7] {+} dirty(skc10,skc12).
% 0.85/1.07 48 [hyper,37,6] {+} old(skc10,skc12).
% 0.85/1.07 49 [hyper,37,5] {+} street(skc10,skc14).
% 0.85/1.07 50 [hyper,37,4] {+} lonely(skc10,skc14).
% 0.85/1.07 51 [hyper,37,3] {+} barrel(skc10,skc11).
% 0.85/1.07 52 [hyper,37,2] {+} present(skc10,skc11).
% 0.85/1.07 53 [hyper,37,1] {+} event(skc10,skc11).
% 0.85/1.07 54 [hyper,41,18,44,45,46,47,48,39,40,42,43,38,53,52,51,50,49,20,37] {-} $F.
% 0.85/1.07
% 0.85/1.07 % SZS output end Refutation
% 0.85/1.07 ------------ end of proof -------------
% 0.85/1.07
% 0.85/1.07
% 0.85/1.07 Search stopped by max_proofs option.
% 0.85/1.07
% 0.85/1.07
% 0.85/1.07 Search stopped by max_proofs option.
% 0.85/1.07
% 0.85/1.07 ============ end of search ============
% 0.85/1.07
% 0.85/1.07 ----------- soft-scott stats ----------
% 0.85/1.07
% 0.85/1.07 true clauses given 20 (57.1%)
% 0.85/1.07 false clauses given 15
% 0.85/1.07
% 0.85/1.07 FALSE TRUE
% 0.85/1.07 tot: 0 0 (-nan% true)
% 0.85/1.07
% 0.85/1.07
% 0.85/1.07 Model 14 [ 1 1 483 ] (0.00 seconds, 250000 Inserts)
% 0.85/1.07
% 0.85/1.07 That finishes the proof of the theorem.
% 0.85/1.07
% 0.85/1.07 Process 8488 finished Thu Jun 30 20:51:39 2022
%------------------------------------------------------------------------------