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