↑ Up

SOS---2.0.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : PUZ031+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n025.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 18:27:00 EDT 2022

% Result   : Theorem 0.70s 0.92s
% Output   : Refutation 0.70s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : PUZ031+2 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n025.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat May 28 21:58:55 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.35  ----- Otter 3.2, August 2001 -----
% 0.12/0.35  The process was started by sandbox2 on n025.cluster.edu,
% 0.12/0.35  Sat May 28 21:58:56 2022
% 0.12/0.35  The command was "./sos".  The process ID is 14008.
% 0.12/0.35  
% 0.12/0.35  set(prolog_style_variables).
% 0.12/0.35  set(auto).
% 0.12/0.35     dependent: set(auto1).
% 0.12/0.35     dependent: set(process_input).
% 0.12/0.35     dependent: clear(print_kept).
% 0.12/0.35     dependent: clear(print_new_demod).
% 0.12/0.35     dependent: clear(print_back_demod).
% 0.12/0.35     dependent: clear(print_back_sub).
% 0.12/0.35     dependent: set(control_memory).
% 0.12/0.35     dependent: assign(max_mem, 12000).
% 0.12/0.35     dependent: assign(pick_given_ratio, 4).
% 0.12/0.35     dependent: assign(stats_level, 1).
% 0.12/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35     dependent: assign(sos_limit, 5000).
% 0.12/0.35     dependent: assign(max_weight, 60).
% 0.12/0.35  clear(print_given).
% 0.12/0.35  
% 0.12/0.35  formula_list(usable).
% 0.12/0.35  
% 0.12/0.35  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=8.
% 0.12/0.35  
% 0.12/0.35  This is a non-Horn set without equality.  The strategy
% 0.12/0.35  will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35  factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35  
% 0.12/0.35     dependent: set(hyper_res).
% 0.12/0.35     dependent: set(factor).
% 0.12/0.35     dependent: set(unit_deletion).
% 0.12/0.35  
% 0.12/0.35  ------------> process usable:
% 0.12/0.35  
% 0.12/0.35  ------------> process sos:
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.20/0.38  
% 0.20/0.38  Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.38  
% 0.20/0.38  Stopped by limit on number of solutions
% 0.20/0.38  
% 0.20/0.38  
% 0.20/0.38  -------------- Softie stats --------------
% 0.20/0.38  
% 0.20/0.38  UPDATE_STOP: 300
% 0.20/0.38  SFINDER_TIME_LIMIT: 2
% 0.20/0.38  SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.38  number of clauses in intial UL: 27
% 0.20/0.38  number of clauses initially in problem: 33
% 0.20/0.38  percentage of clauses intially in UL: 81
% 0.20/0.38  percentage of distinct symbols occuring in initial UL: 66
% 0.20/0.38  percent of all initial clauses that are short: 100
% 0.20/0.38  absolute distinct symbol count: 18
% 0.20/0.38     distinct predicate count: 10
% 0.20/0.38     distinct function count: 2
% 0.20/0.38     distinct constant count: 6
% 0.20/0.38  
% 0.20/0.38  ---------- no more Softie stats ----------
% 0.20/0.38  
% 0.20/0.38  
% 0.20/0.38  
% 0.20/0.38  Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.38  
% 0.20/0.38  Stopped by limit on number of solutions
% 0.20/0.38  
% 0.20/0.38  =========== start of search ===========
% 0.70/0.92  
% 0.70/0.92  -------- PROOF -------- 
% 0.70/0.92  % SZS status Theorem
% 0.70/0.92  % SZS output start Refutation
% 0.70/0.92  
% 0.70/0.92  Model 3 (0.00 seconds, 0 Inserts)
% 0.70/0.92  
% 0.70/0.92  Stopped by limit on number of solutions
% 0.70/0.92  
% 0.70/0.92  Model 4 (0.00 seconds, 0 Inserts)
% 0.70/0.92  
% 0.70/0.92  Stopped by limit on number of solutions
% 0.70/0.92  
% 0.70/0.92  Model 5 (0.00 seconds, 0 Inserts)
% 0.70/0.92  
% 0.70/0.92  Stopped by limit on number of solutions
% 0.70/0.92  
% 0.70/0.92  Model 6 (0.00 seconds, 0 Inserts)
% 0.70/0.92  
% 0.70/0.92  Stopped by limit on number of solutions
% 0.70/0.92  
% 0.70/0.92  Stopped by limit on insertions
% 0.70/0.92  
% 0.70/0.92  Model 7 [ 1 1 855 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.92  
% 0.70/0.92  Stopped by limit on insertions
% 0.70/0.92  
% 0.70/0.92  Model 8 [ 1 2 67014 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.92  
% 0.70/0.92  Stopped by limit on insertions
% 0.70/0.92  
% 0.70/0.92  Model 9 [ 2 4 210328 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.92  
% 0.70/0.92  Stopped by limit on insertions
% 0.70/0.92  
% 0.70/0.92  Model 10 [ 1 1 669 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.92  
% 0.70/0.92  Stopped by limit on insertions
% 0.70/0.92  
% 0.70/0.92  Model 11 [ 1 1 473 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.92  
% 0.70/0.92  -----> EMPTY CLAUSE at   0.55 sec ----> 69 [hyper,67,20,34,36,33,62] {-} $F.
% 0.70/0.92  
% 0.70/0.92  Length of proof is 17.  Level of proof is 7.
% 0.70/0.92  
% 0.70/0.92  ---------------- PROOF ----------------
% 0.70/0.92  % SZS status Theorem
% 0.70/0.92  % SZS output start Refutation
% 0.70/0.92  
% 0.70/0.92  1 [] {+} -wolf(A)|animal(A).
% 0.70/0.92  2 [] {+} -fox(A)|animal(A).
% 0.70/0.92  3 [] {+} -bird(A)|animal(A).
% 0.70/0.92  5 [] {+} -snail(A)|animal(A).
% 0.70/0.92  6 [] {+} -grain(A)|plant(A).
% 0.70/0.92  7 [] {+} -animal(A)| -plant(B)|eats(A,B)| -animal(C)| -much_smaller(C,A)| -plant(D)| -eats(C,D)|eats(A,C).
% 0.70/0.92  8 [] {+} -bird(A)| -snail(B)|much_smaller(B,A).
% 0.70/0.92  10 [] {+} -bird(A)| -fox(B)|much_smaller(A,B).
% 0.70/0.92  11 [] {+} -fox(A)| -wolf(B)|much_smaller(A,B).
% 0.70/0.92  13 [] {+} -wolf(A)| -grain(B)| -eats(A,B).
% 0.70/0.92  15 [] {+} -bird(A)| -snail(B)| -eats(A,B).
% 0.70/0.92  18 [] {+} -snail(A)|plant($f2(A)).
% 0.70/0.92  19 [] {+} -snail(A)|eats(A,$f2(A)).
% 0.70/0.92  20 [] {+} -animal(A)| -animal(B)| -grain(C)| -eats(B,C)| -eats(A,B).
% 0.70/0.92  22 [factor,7.2.6] {+} -animal(A)| -plant(B)|eats(A,B)| -animal(C)| -much_smaller(C,A)| -eats(C,B)|eats(A,C).
% 0.70/0.92  28 [] {+} wolf($c1).
% 0.70/0.92  29 [] {+} fox($c2).
% 0.70/0.92  30 [] {+} bird($c3).
% 0.70/0.92  32 [] {+} snail($c5).
% 0.70/0.92  33 [] {+} grain($c6).
% 0.70/0.92  34 [hyper,28,1] {+} animal($c1).
% 0.70/0.92  35 [hyper,29,11,28] {+} much_smaller($c2,$c1).
% 0.70/0.92  36 [hyper,29,2] {+} animal($c2).
% 0.70/0.92  37 [hyper,30,10,29] {+} much_smaller($c3,$c2).
% 0.70/0.92  38 [hyper,30,3] {+} animal($c3).
% 0.70/0.92  39 [hyper,32,19] {+} eats($c5,$f2($c5)).
% 0.70/0.92  40 [hyper,32,18] {+} plant($f2($c5)).
% 0.70/0.92  41 [hyper,32,8,30] {+} much_smaller($c5,$c3).
% 0.70/0.92  42 [hyper,32,5] {+} animal($c5).
% 0.70/0.92  48 [hyper,33,6] {+} plant($c6).
% 0.70/0.92  50 [hyper,40,7,38,48,42,41,39] {+} eats($c3,$c6)|eats($c3,$c5).
% 0.70/0.92  55 [hyper,50,15,30,32] {+} eats($c3,$c6).
% 0.70/0.92  56 [hyper,55,22,36,48,38,37] {+} eats($c2,$c6)|eats($c2,$c3).
% 0.70/0.92  62 [hyper,56,20,36,38,33,55] {+} eats($c2,$c6).
% 0.70/0.92  63 [hyper,62,22,34,48,36,35] {+} eats($c1,$c6)|eats($c1,$c2).
% 0.70/0.92  67 [hyper,63,13,28,33] {+} eats($c1,$c2).
% 0.70/0.92  69 [hyper,67,20,34,36,33,62] {-} $F.
% 0.70/0.92  
% 0.70/0.92  % SZS output end Refutation
% 0.70/0.92  ------------ end of proof -------------
% 0.70/0.92  
% 0.70/0.92  
% 0.70/0.92  Search stopped by max_proofs option.
% 0.70/0.92  
% 0.70/0.92  
% 0.70/0.92  Search stopped by max_proofs option.
% 0.70/0.92  
% 0.70/0.92  ============ end of search ============
% 0.70/0.92  
% 0.70/0.92  ----------- soft-scott stats ----------
% 0.70/0.92  
% 0.70/0.92  true clauses given          19      (65.5%)
% 0.70/0.92  false clauses given         10
% 0.70/0.92  
% 0.70/0.92        FALSE     TRUE
% 0.70/0.92     3  1         0
% 0.70/0.92     7  0         3
% 0.70/0.92  tot:  1         3      (75.0% true)
% 0.70/0.92  
% 0.70/0.92  
% 0.70/0.92  Model 11 [ 1 1 473 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.92  
% 0.70/0.92  That finishes the proof of the theorem.
% 0.70/0.92  
% 0.70/0.92  Process 14008 finished Sat May 28 21:58:56 2022
%------------------------------------------------------------------------------