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