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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : NUN070+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:31 EDT 2022

% Result   : Theorem 3.01s 3.21s
% Output   : Refutation 3.01s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10  % Problem  : NUN070+1 : TPTP v8.1.0. Released v7.3.0.
% 0.06/0.11  % Command  : sos-script %s
% 0.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.29  % WCLimit  : 600
% 0.10/0.29  % DateTime : Thu Jun  2 09:05:45 EDT 2022
% 0.10/0.30  % CPUTime  : 
% 0.10/0.31  ----- Otter 3.2, August 2001 -----
% 0.10/0.31  The process was started by sandbox on n032.cluster.edu,
% 0.10/0.31  Thu Jun  2 09:05:45 2022
% 0.10/0.31  The command was "./sos".  The process ID is 2644.
% 0.10/0.31  
% 0.10/0.31  set(prolog_style_variables).
% 0.10/0.31  set(auto).
% 0.10/0.31     dependent: set(auto1).
% 0.10/0.31     dependent: set(process_input).
% 0.10/0.31     dependent: clear(print_kept).
% 0.10/0.31     dependent: clear(print_new_demod).
% 0.10/0.31     dependent: clear(print_back_demod).
% 0.10/0.31     dependent: clear(print_back_sub).
% 0.10/0.31     dependent: set(control_memory).
% 0.10/0.31     dependent: assign(max_mem, 12000).
% 0.10/0.31     dependent: assign(pick_given_ratio, 4).
% 0.10/0.31     dependent: assign(stats_level, 1).
% 0.10/0.31     dependent: assign(pick_semantic_ratio, 3).
% 0.10/0.31     dependent: assign(sos_limit, 5000).
% 0.10/0.31     dependent: assign(max_weight, 60).
% 0.10/0.31  clear(print_given).
% 0.10/0.31  
% 0.10/0.31  formula_list(usable).
% 0.10/0.31  
% 0.10/0.31  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=7.
% 0.10/0.31  
% 0.10/0.31  This is a non-Horn set without equality.  The strategy
% 0.10/0.31  will be ordered hyper_res, ur_res, unit deletion, and
% 0.10/0.31  factoring, with satellites in sos and nuclei in usable.
% 0.10/0.31  
% 0.10/0.31     dependent: set(hyper_res).
% 0.10/0.31     dependent: set(factor).
% 0.10/0.31     dependent: set(unit_deletion).
% 0.10/0.31  
% 0.10/0.31  ------------> process usable:
% 0.10/0.31  
% 0.10/0.31  ------------> process sos:
% 0.10/0.31  47 back subsumes 36.
% 0.10/0.31  
% 0.10/0.31  ======= end of input processing =======
% 0.14/0.35  
% 0.14/0.35  Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.35  
% 0.14/0.35  Stopped by limit on number of solutions
% 0.14/0.35  
% 0.14/0.35  
% 0.14/0.35  -------------- Softie stats --------------
% 0.14/0.35  
% 0.14/0.35  UPDATE_STOP: 300
% 0.14/0.35  SFINDER_TIME_LIMIT: 2
% 0.14/0.35  SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.35  number of clauses in intial UL: 45
% 0.14/0.35  number of clauses initially in problem: 67
% 0.14/0.35  percentage of clauses intially in UL: 67
% 0.14/0.35  percentage of distinct symbols occuring in initial UL: 36
% 0.14/0.35  percent of all initial clauses that are short: 100
% 0.14/0.35  absolute distinct symbol count: 25
% 0.14/0.35     distinct predicate count: 5
% 0.14/0.35     distinct function count: 19
% 0.14/0.35     distinct constant count: 1
% 0.14/0.35  
% 0.14/0.35  ---------- no more Softie stats ----------
% 0.14/0.35  
% 0.14/0.35  
% 0.14/0.35  
% 0.14/0.35  =========== start of search ===========
% 3.01/3.21  
% 3.01/3.21  -------- PROOF -------- 
% 3.01/3.21  % SZS status Theorem
% 3.01/3.21  % SZS output start Refutation
% 3.01/3.21  
% 3.01/3.21  Stopped by limit on insertions
% 3.01/3.21  
% 3.01/3.21  Model 2 [ 1 1 505 ] (0.00 seconds, 250000 Inserts)
% 3.01/3.21  
% 3.01/3.21  Model 3 [ 1 0 416 ] (0.00 seconds, 890 Inserts)
% 3.01/3.21  
% 3.01/3.21  Stopped by limit on insertions
% 3.01/3.21  
% 3.01/3.21  Model 4 [ 1 1 252 ] (0.00 seconds, 250000 Inserts)
% 3.01/3.21  
% 3.01/3.21  Stopped by limit on insertions
% 3.01/3.21  
% 3.01/3.21  Model 5 [ 1 0 2824 ] (0.00 seconds, 250000 Inserts)
% 3.01/3.21  
% 3.01/3.21  Model 6 [ 2 1 1278 ] (0.00 seconds, 1732 Inserts)
% 3.01/3.21  
% 3.01/3.21  Stopped by limit on insertions
% 3.01/3.21  
% 3.01/3.21  Stopped by limit on insertions
% 3.01/3.21  
% 3.01/3.21  Stopped by limit on insertions
% 3.01/3.21  
% 3.01/3.21  Model 7 [ 17 1 3492 ] (0.00 seconds, 250000 Inserts)
% 3.01/3.21  
% 3.01/3.21  Stopped by limit on insertions
% 3.01/3.21  
% 3.01/3.21  Model 8 [ 25 0 814 ] (0.00 seconds, 250000 Inserts)
% 3.01/3.21  
% 3.01/3.21  Stopped by limit on insertions
% 3.01/3.21  
% 3.01/3.21  Stopped by limit on insertions
% 3.01/3.21  
% 3.01/3.21  Model 9 [ 34 1 1400 ] (0.00 seconds, 250000 Inserts)
% 3.01/3.21  
% 3.01/3.21  Stopped by limit on insertions
% 3.01/3.21  
% 3.01/3.21  Model 10 [ 50 1 467 ] (0.00 seconds, 250000 Inserts)
% 3.01/3.21  
% 3.01/3.21  Stopped by limit on insertions
% 3.01/3.21  
% 3.01/3.21  Model 11 [ 50 1 336 ] (0.00 seconds, 250000 Inserts)
% 3.01/3.21  
% 3.01/3.21  Stopped by limit on insertions
% 3.01/3.21  
% 3.01/3.21  Stopped by limit on insertions
% 3.01/3.21  
% 3.01/3.21  Model 12 [ 46 1 1472 ] (0.00 seconds, 250000 Inserts)
% 3.01/3.21  
% 3.01/3.21  Stopped by limit on insertions
% 3.01/3.21  
% 3.01/3.21  Model 13 [ 38 0 586 ] (0.00 seconds, 250000 Inserts)
% 3.01/3.21  
% 3.01/3.21  Stopped by limit on insertions
% 3.01/3.21  
% 3.01/3.21  Model 14 [ 46 1 643 ] (0.00 seconds, 250000 Inserts)
% 3.01/3.21  
% 3.01/3.21  Stopped by limit on insertions
% 3.01/3.21  
% 3.01/3.21  Model 15 [ 64 1 653 ] (0.00 seconds, 250000 Inserts)
% 3.01/3.21  
% 3.01/3.21  Stopped by limit on insertions
% 3.01/3.21  
% 3.01/3.21  Model 16 [ 64 1 1932 ] (0.00 seconds, 250000 Inserts)
% 3.01/3.21  
% 3.01/3.21  Stopped by limit on insertions
% 3.01/3.21  
% 3.01/3.21  Model 17 [ 47 1 1641 ] (0.00 seconds, 250000 Inserts)
% 3.01/3.21  
% 3.01/3.21  Stopped by limit on insertions
% 3.01/3.21  
% 3.01/3.21  Model 18 [ 49 1 6758 ] (0.00 seconds, 250000 Inserts)
% 3.01/3.21  
% 3.01/3.21  -----> EMPTY CLAUSE at   2.88 sec ----> 2315 [hyper,60,46,59,121,58] {-} $F.
% 3.01/3.21  
% 3.01/3.21  Length of proof is 5.  Level of proof is 2.
% 3.01/3.21  
% 3.01/3.21  ---------------- PROOF ----------------
% 3.01/3.21  % SZS status Theorem
% 3.01/3.21  % SZS output start Refutation
% 3.01/3.21  
% 3.01/3.21  1 [] {+} id(A,$c1)| -r1(A).
% 3.01/3.21  4 [] {+} r2(A,B)| -id(B,$f1(A)).
% 3.01/3.21  14 [] {+} -id(A,B)| -id(C,D)| -r2(B,D)|r2(A,C).
% 3.01/3.21  21 [] {+} -r1(A)| -r3(B,A,C)| -r1(D)| -r2(D,B)| -id(C,E)| -r1(F)| -r2(F,E).
% 3.01/3.21  37 [factor,21.1.3] {+} -r1(A)| -r3(B,A,C)| -r2(A,B)| -id(C,D)| -r1(E)| -r2(E,D).
% 3.01/3.21  46 [factor,37.3.6,factor_simp] {+} -r1(A)| -r3(B,A,C)| -r2(A,B)| -id(C,B).
% 3.01/3.21  47 [] {-} id(A,A).
% 3.01/3.21  58 [] {-} id($f13(A),A).
% 3.01/3.21  59 [] {+} r1($f12(A)).
% 3.01/3.21  60 [] {+} r3(A,$f12(A),$f13(A)).
% 3.01/3.21  71 [hyper,47,4] {-} r2(A,$f1(A)).
% 3.01/3.21  73 [hyper,59,1] {+} id($f12(A),$c1).
% 3.01/3.21  121 [hyper,73,14,47,71] {+} r2($f12(A),$f1($c1)).
% 3.01/3.21  2315 [hyper,60,46,59,121,58] {-} $F.
% 3.01/3.21  
% 3.01/3.21  % SZS output end Refutation
% 3.01/3.21  ------------ end of proof -------------
% 3.01/3.21  
% 3.01/3.21  
% 3.01/3.21  Search stopped by max_proofs option.
% 3.01/3.21  
% 3.01/3.21  
% 3.01/3.21  Search stopped by max_proofs option.
% 3.01/3.21  
% 3.01/3.21  ============ end of search ============
% 3.01/3.21  
% 3.01/3.21  ----------- soft-scott stats ----------
% 3.01/3.21  
% 3.01/3.21  true clauses given           6      (17.6%)
% 3.01/3.21  false clauses given         28
% 3.01/3.21  
% 3.01/3.21        FALSE     TRUE
% 3.01/3.21     4  6         0
% 3.01/3.21     5  20        3
% 3.01/3.21     6  61        14
% 3.01/3.21     7  80        39
% 3.01/3.21     8  137       138
% 3.01/3.21     9  173       200
% 3.01/3.21    10  170       199
% 3.01/3.21    11  174       150
% 3.01/3.21    12  129       101
% 3.01/3.21    13  96        75
% 3.01/3.21    14  48        36
% 3.01/3.21    15  20        10
% 3.01/3.21    16  20        11
% 3.01/3.21    17  0         8
% 3.01/3.21    18  0         4
% 3.01/3.21  tot:  1134      988      (46.6% true)
% 3.01/3.21  
% 3.01/3.21  
% 3.01/3.21  Model 18 [ 49 1 6758 ] (0.00 seconds, 250000 Inserts)
% 3.01/3.21  
% 3.01/3.21  That finishes the proof of the theorem.
% 3.01/3.21  
% 3.01/3.21  Process 2644 finished Thu Jun  2 09:05:48 2022
%------------------------------------------------------------------------------