TSTP Solution File: NUN088+1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : NUN088+1 : TPTP v8.1.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n032.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 16:38:34 EDT 2022

% Result   : Theorem 1.44s 1.66s
% Output   : Refutation 1.44s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : NUN088+1 : TPTP v8.1.0. Released v7.3.0.
% 0.00/0.09  % Command  : sos-script %s
% 0.09/0.28  % Computer : n032.cluster.edu
% 0.09/0.28  % Model    : x86_64 x86_64
% 0.09/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28  % Memory   : 8042.1875MB
% 0.09/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28  % CPULimit : 300
% 0.09/0.28  % WCLimit  : 600
% 0.09/0.28  % DateTime : Thu Jun  2 03:23:00 EDT 2022
% 0.09/0.28  % CPUTime  : 
% 0.09/0.30  ----- Otter 3.2, August 2001 -----
% 0.09/0.30  The process was started by sandbox2 on n032.cluster.edu,
% 0.09/0.30  Thu Jun  2 03:23:00 2022
% 0.09/0.30  The command was "./sos".  The process ID is 25188.
% 0.09/0.30  
% 0.09/0.30  set(prolog_style_variables).
% 0.09/0.30  set(auto).
% 0.09/0.30     dependent: set(auto1).
% 0.09/0.30     dependent: set(process_input).
% 0.09/0.30     dependent: clear(print_kept).
% 0.09/0.30     dependent: clear(print_new_demod).
% 0.09/0.30     dependent: clear(print_back_demod).
% 0.09/0.30     dependent: clear(print_back_sub).
% 0.09/0.30     dependent: set(control_memory).
% 0.09/0.30     dependent: assign(max_mem, 12000).
% 0.09/0.30     dependent: assign(pick_given_ratio, 4).
% 0.09/0.30     dependent: assign(stats_level, 1).
% 0.09/0.30     dependent: assign(pick_semantic_ratio, 3).
% 0.09/0.30     dependent: assign(sos_limit, 5000).
% 0.09/0.30     dependent: assign(max_weight, 60).
% 0.09/0.30  clear(print_given).
% 0.09/0.30  
% 0.09/0.30  formula_list(usable).
% 0.09/0.30  
% 0.09/0.30  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 0.09/0.30  
% 0.09/0.30  This is a non-Horn set without equality.  The strategy
% 0.09/0.30  will be ordered hyper_res, ur_res, unit deletion, and
% 0.09/0.30  factoring, with satellites in sos and nuclei in usable.
% 0.09/0.30  
% 0.09/0.30     dependent: set(hyper_res).
% 0.09/0.30     dependent: set(factor).
% 0.09/0.30     dependent: set(unit_deletion).
% 0.09/0.30  
% 0.09/0.30  ------------> process usable:
% 0.09/0.30  
% 0.09/0.30  ------------> process sos:
% 0.09/0.30  40 back subsumes 35.
% 0.09/0.30  
% 0.09/0.30  ======= end of input processing =======
% 0.13/0.55  
% 0.13/0.55  Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.55  
% 0.13/0.55  Stopped by limit on number of solutions
% 0.13/0.55  
% 0.13/0.55  
% 0.13/0.55  -------------- Softie stats --------------
% 0.13/0.55  
% 0.13/0.55  UPDATE_STOP: 300
% 0.13/0.55  SFINDER_TIME_LIMIT: 2
% 0.13/0.55  SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.55  number of clauses in intial UL: 38
% 0.13/0.55  number of clauses initially in problem: 64
% 0.13/0.55  percentage of clauses intially in UL: 59
% 0.13/0.55  percentage of distinct symbols occuring in initial UL: 32
% 0.13/0.55  percent of all initial clauses that are short: 100
% 0.13/0.55  absolute distinct symbol count: 28
% 0.13/0.55     distinct predicate count: 5
% 0.13/0.55     distinct function count: 19
% 0.13/0.55     distinct constant count: 4
% 0.13/0.55  
% 0.13/0.55  ---------- no more Softie stats ----------
% 0.13/0.55  
% 0.13/0.55  
% 0.13/0.55  
% 0.13/0.55  Stopped by limit on insertions
% 0.13/0.55  
% 0.13/0.55  =========== start of search ===========
% 1.44/1.66  
% 1.44/1.66  -------- PROOF -------- 
% 1.44/1.66  % SZS status Theorem
% 1.44/1.66  % SZS output start Refutation
% 1.44/1.66  
% 1.44/1.66  Stopped by limit on insertions
% 1.44/1.66  
% 1.44/1.66  Model 2 [ 1 0 256 ] (0.00 seconds, 250000 Inserts)
% 1.44/1.66  
% 1.44/1.66  Model 3 [ 1 0 509 ] (0.00 seconds, 1000 Inserts)
% 1.44/1.66  
% 1.44/1.66  Model 4 [ 1 0 505 ] (0.00 seconds, 1047 Inserts)
% 1.44/1.66  
% 1.44/1.66  Model 5 [ 1 1 4127 ] (0.00 seconds, 4680 Inserts)
% 1.44/1.66  
% 1.44/1.66  Stopped by limit on insertions
% 1.44/1.66  
% 1.44/1.66  Model 6 [ 1 1 702 ] (0.00 seconds, 250000 Inserts)
% 1.44/1.66  
% 1.44/1.66  Stopped by limit on insertions
% 1.44/1.66  
% 1.44/1.66  Model 7 [ 11 1 1556 ] (0.00 seconds, 250000 Inserts)
% 1.44/1.66  
% 1.44/1.66  Stopped by limit on insertions
% 1.44/1.66  
% 1.44/1.66  Model 8 [ 3 1 449 ] (0.00 seconds, 250000 Inserts)
% 1.44/1.66  
% 1.44/1.66  Stopped by limit on insertions
% 1.44/1.66  
% 1.44/1.66  Stopped by limit on insertions
% 1.44/1.66  
% 1.44/1.66  Model 9 [ 10 0 552 ] (0.00 seconds, 250000 Inserts)
% 1.44/1.66  
% 1.44/1.66  -----> EMPTY CLAUSE at   1.35 sec ----> 102 [hyper,62,20,63,65] {-} $F.
% 1.44/1.66  
% 1.44/1.66  Length of proof is 0.  Level of proof is 0.
% 1.44/1.66  
% 1.44/1.66  ---------------- PROOF ----------------
% 1.44/1.66  % SZS status Theorem
% 1.44/1.66  % SZS output start Refutation
% 1.44/1.66  
% 1.44/1.66  20 [] {+} -id(A,B)| -r1(A)| -r2(C,B).
% 1.44/1.66  62 [] {+} id($c2,$c4).
% 1.44/1.66  63 [] {+} r1($c2).
% 1.44/1.66  65 [] {+} r2($c3,$c4).
% 1.44/1.66  102 [hyper,62,20,63,65] {-} $F.
% 1.44/1.66  
% 1.44/1.66  % SZS output end Refutation
% 1.44/1.66  ------------ end of proof -------------
% 1.44/1.66  
% 1.44/1.66  
% 1.44/1.66  Search stopped by max_proofs option.
% 1.44/1.66  
% 1.44/1.66  
% 1.44/1.66  Search stopped by max_proofs option.
% 1.44/1.66  
% 1.44/1.66  ============ end of search ============
% 1.44/1.66  
% 1.44/1.66  ----------- soft-scott stats ----------
% 1.44/1.66  
% 1.44/1.66  true clauses given           2      (15.4%)
% 1.44/1.66  false clauses given         11
% 1.44/1.66  
% 1.44/1.66        FALSE     TRUE
% 1.44/1.66     3  0         4
% 1.44/1.66     4  5         8
% 1.44/1.66     5  5         0
% 1.44/1.66     6  10        0
% 1.44/1.66     7  7         0
% 1.44/1.66     8  6         0
% 1.44/1.66     9  3         0
% 1.44/1.66    10  1         0
% 1.44/1.66  tot:  37        12      (24.5% true)
% 1.44/1.66  
% 1.44/1.66  
% 1.44/1.66  Model 9 [ 10 0 552 ] (0.00 seconds, 250000 Inserts)
% 1.44/1.66  
% 1.44/1.66  That finishes the proof of the theorem.
% 1.44/1.66  
% 1.44/1.66  Process 25188 finished Thu Jun  2 03:23:01 2022
%------------------------------------------------------------------------------