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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : NUN089+1 : TPTP v8.1.0. Released v7.3.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 16:38:35 EDT 2022

% Result   : Theorem 1.07s 1.29s
% Output   : Refutation 1.07s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUN089+1 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.13  % Command  : sos-script %s
% 0.14/0.34  % Computer : n025.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Thu Jun  2 02:59:44 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.36  ----- Otter 3.2, August 2001 -----
% 0.20/0.36  The process was started by sandbox2 on n025.cluster.edu,
% 0.20/0.36  Thu Jun  2 02:59:44 2022
% 0.20/0.36  The command was "./sos".  The process ID is 30618.
% 0.20/0.36  
% 0.20/0.36  set(prolog_style_variables).
% 0.20/0.36  set(auto).
% 0.20/0.36     dependent: set(auto1).
% 0.20/0.36     dependent: set(process_input).
% 0.20/0.36     dependent: clear(print_kept).
% 0.20/0.36     dependent: clear(print_new_demod).
% 0.20/0.36     dependent: clear(print_back_demod).
% 0.20/0.36     dependent: clear(print_back_sub).
% 0.20/0.36     dependent: set(control_memory).
% 0.20/0.36     dependent: assign(max_mem, 12000).
% 0.20/0.36     dependent: assign(pick_given_ratio, 4).
% 0.20/0.36     dependent: assign(stats_level, 1).
% 0.20/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.36     dependent: assign(sos_limit, 5000).
% 0.20/0.36     dependent: assign(max_weight, 60).
% 0.20/0.36  clear(print_given).
% 0.20/0.36  
% 0.20/0.36  formula_list(usable).
% 0.20/0.36  
% 0.20/0.36  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 0.20/0.36  
% 0.20/0.36  This is a non-Horn set without equality.  The strategy
% 0.20/0.36  will be ordered hyper_res, ur_res, unit deletion, and
% 0.20/0.36  factoring, with satellites in sos and nuclei in usable.
% 0.20/0.36  
% 0.20/0.36     dependent: set(hyper_res).
% 0.20/0.36     dependent: set(factor).
% 0.20/0.36     dependent: set(unit_deletion).
% 0.20/0.36  
% 0.20/0.36  ------------> process usable:
% 0.20/0.36  
% 0.20/0.36  ------------> process sos:
% 0.20/0.36  40 back subsumes 35.
% 0.20/0.36  
% 0.20/0.36  ======= end of input processing =======
% 0.20/0.42  
% 0.20/0.42  Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.42  
% 0.20/0.42  Stopped by limit on number of solutions
% 0.20/0.42  
% 0.20/0.42  
% 0.20/0.42  -------------- Softie stats --------------
% 0.20/0.42  
% 0.20/0.42  UPDATE_STOP: 300
% 0.20/0.42  SFINDER_TIME_LIMIT: 2
% 0.20/0.42  SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.42  number of clauses in intial UL: 38
% 0.20/0.42  number of clauses initially in problem: 65
% 0.20/0.42  percentage of clauses intially in UL: 58
% 0.20/0.42  percentage of distinct symbols occuring in initial UL: 31
% 0.20/0.42  percent of all initial clauses that are short: 100
% 0.20/0.42  absolute distinct symbol count: 29
% 0.20/0.42     distinct predicate count: 5
% 0.20/0.42     distinct function count: 19
% 0.20/0.42     distinct constant count: 5
% 0.20/0.42  
% 0.20/0.42  ---------- no more Softie stats ----------
% 0.20/0.42  
% 0.20/0.42  
% 0.20/0.42  
% 0.20/0.42  =========== start of search ===========
% 1.07/1.29  
% 1.07/1.29  -------- PROOF -------- 
% 1.07/1.29  % SZS status Theorem
% 1.07/1.29  % SZS output start Refutation
% 1.07/1.29  
% 1.07/1.29  Stopped by limit on insertions
% 1.07/1.29  
% 1.07/1.29  Model 2 [ 1 1 249 ] (0.00 seconds, 250000 Inserts)
% 1.07/1.29  
% 1.07/1.29  Model 3 [ 1 1 383 ] (0.00 seconds, 942 Inserts)
% 1.07/1.29  
% 1.07/1.29  Model 4 [ 1 1 271 ] (0.00 seconds, 150676 Inserts)
% 1.07/1.29  
% 1.07/1.29  Model 5 [ 1 0 2970 ] (0.00 seconds, 3363 Inserts)
% 1.07/1.29  
% 1.07/1.29  Model 6 [ 1 0 1150 ] (0.00 seconds, 1768 Inserts)
% 1.07/1.29  
% 1.07/1.29  Stopped by limit on insertions
% 1.07/1.29  
% 1.07/1.29  Model 7 [ 1 0 889 ] (0.00 seconds, 250000 Inserts)
% 1.07/1.29  
% 1.07/1.29  Model 8 [ 1 0 2387 ] (0.00 seconds, 2669 Inserts)
% 1.07/1.29  
% 1.07/1.29  Stopped by limit on insertions
% 1.07/1.29  
% 1.07/1.29  Model 9 [ 2 0 1775 ] (0.00 seconds, 250000 Inserts)
% 1.07/1.29  
% 1.07/1.29  Stopped by limit on insertions
% 1.07/1.29  
% 1.07/1.29  Model 10 [ 15 0 305 ] (0.00 seconds, 250000 Inserts)
% 1.07/1.29  
% 1.07/1.29  -----> EMPTY CLAUSE at   0.91 sec ----> 82 [hyper,65,20,66,64] {-} $F.
% 1.07/1.29  
% 1.07/1.29  Length of proof is 0.  Level of proof is 0.
% 1.07/1.29  
% 1.07/1.29  ---------------- PROOF ----------------
% 1.07/1.29  % SZS status Theorem
% 1.07/1.29  % SZS output start Refutation
% 1.07/1.29  
% 1.07/1.29  20 [] {+} -id(A,B)| -r1(A)| -r2(C,B).
% 1.07/1.29  64 [] {+} r2($c3,$c5).
% 1.07/1.29  65 [] {+} id($c4,$c5).
% 1.07/1.29  66 [] {+} r1($c4).
% 1.07/1.29  82 [hyper,65,20,66,64] {-} $F.
% 1.07/1.29  
% 1.07/1.29  % SZS output end Refutation
% 1.07/1.29  ------------ end of proof -------------
% 1.07/1.29  
% 1.07/1.29  
% 1.07/1.29  Search stopped by max_proofs option.
% 1.07/1.29  
% 1.07/1.29  
% 1.07/1.29  Search stopped by max_proofs option.
% 1.07/1.29  
% 1.07/1.29  ============ end of search ============
% 1.07/1.29  
% 1.07/1.29  ----------- soft-scott stats ----------
% 1.07/1.29  
% 1.07/1.29  true clauses given           1      (8.3%)
% 1.07/1.29  false clauses given         11
% 1.07/1.29  
% 1.07/1.29        FALSE     TRUE
% 1.07/1.29     3  0         2
% 1.07/1.29     4  4         3
% 1.07/1.29     5  2         0
% 1.07/1.29     6  7         0
% 1.07/1.29     7  4         0
% 1.07/1.29     8  5         0
% 1.07/1.29     9  3         0
% 1.07/1.29  tot:  25        5      (16.7% true)
% 1.07/1.29  
% 1.07/1.29  
% 1.07/1.29  Model 10 [ 15 0 305 ] (0.00 seconds, 250000 Inserts)
% 1.07/1.29  
% 1.07/1.29  That finishes the proof of the theorem.
% 1.07/1.29  
% 1.07/1.29  Process 30618 finished Thu Jun  2 02:59:45 2022
%------------------------------------------------------------------------------