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

View Problem - Process Solution

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

% Computer : n019.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:33 EDT 2022

% Result   : Theorem 2.55s 2.75s
% Output   : Refutation 2.55s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUN081+1 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.13  % Command  : sos-script %s
% 0.12/0.34  % Computer : n019.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Thu Jun  2 03:48:10 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.36  ----- Otter 3.2, August 2001 -----
% 0.20/0.36  The process was started by sandbox on n019.cluster.edu,
% 0.20/0.36  Thu Jun  2 03:48:10 2022
% 0.20/0.36  The command was "./sos".  The process ID is 21292.
% 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=6.
% 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  45 back subsumes 36.
% 0.20/0.36  
% 0.20/0.36  ======= end of input processing =======
% 0.48/0.67  
% 0.48/0.67  Model 1 (0.00 seconds, 0 Inserts)
% 0.48/0.67  
% 0.48/0.67  Stopped by limit on number of solutions
% 0.48/0.67  
% 0.48/0.67  
% 0.48/0.67  -------------- Softie stats --------------
% 0.48/0.67  
% 0.48/0.67  UPDATE_STOP: 300
% 0.48/0.67  SFINDER_TIME_LIMIT: 2
% 0.48/0.67  SHORT_CLAUSE_CUTOFF: 4
% 0.48/0.67  number of clauses in intial UL: 43
% 0.48/0.67  number of clauses initially in problem: 65
% 0.48/0.67  percentage of clauses intially in UL: 66
% 0.48/0.67  percentage of distinct symbols occuring in initial UL: 36
% 0.48/0.67  percent of all initial clauses that are short: 100
% 0.48/0.67  absolute distinct symbol count: 25
% 0.48/0.67     distinct predicate count: 5
% 0.48/0.67     distinct function count: 19
% 0.48/0.67     distinct constant count: 1
% 0.48/0.67  
% 0.48/0.67  ---------- no more Softie stats ----------
% 0.48/0.67  
% 0.48/0.67  
% 0.48/0.67  
% 0.48/0.67  Stopped by limit on insertions
% 0.48/0.67  
% 0.48/0.67  =========== start of search ===========
% 2.55/2.75  
% 2.55/2.75  -------- PROOF -------- 
% 2.55/2.75  % SZS status Theorem
% 2.55/2.75  % SZS output start Refutation
% 2.55/2.75  
% 2.55/2.75  Model 2 [ 1 1 431 ] (0.00 seconds, 895 Inserts)
% 2.55/2.75  
% 2.55/2.75  Model 3 [ 1 1 492 ] (0.00 seconds, 1053 Inserts)
% 2.55/2.75  
% 2.55/2.75  Stopped by limit on insertions
% 2.55/2.75  
% 2.55/2.75  Model 4 [ 1 1 256 ] (0.00 seconds, 250000 Inserts)
% 2.55/2.75  
% 2.55/2.75  Model 5 [ 1 1 2728 ] (0.00 seconds, 3538 Inserts)
% 2.55/2.75  
% 2.55/2.75  Stopped by limit on insertions
% 2.55/2.75  
% 2.55/2.75  Model 6 [ 2 1 1267 ] (0.00 seconds, 250000 Inserts)
% 2.55/2.75  
% 2.55/2.75  Stopped by limit on insertions
% 2.55/2.75  
% 2.55/2.75  Stopped by limit on insertions
% 2.55/2.75  
% 2.55/2.75  Model 7 [ 26 0 2593 ] (0.00 seconds, 250000 Inserts)
% 2.55/2.75  
% 2.55/2.75  Stopped by limit on insertions
% 2.55/2.75  
% 2.55/2.75  Model 8 [ 32 1 417 ] (0.00 seconds, 250000 Inserts)
% 2.55/2.75  
% 2.55/2.75  Stopped by limit on insertions
% 2.55/2.75  
% 2.55/2.75  Model 9 [ 34 1 1296 ] (0.00 seconds, 250000 Inserts)
% 2.55/2.75  
% 2.55/2.75  Stopped by limit on insertions
% 2.55/2.75  
% 2.55/2.75  Model 10 [ 49 1 389 ] (0.00 seconds, 250000 Inserts)
% 2.55/2.75  
% 2.55/2.75  Stopped by limit on insertions
% 2.55/2.75  
% 2.55/2.75  Model 11 [ 44 1 309 ] (0.00 seconds, 250000 Inserts)
% 2.55/2.75  
% 2.55/2.75  Stopped by limit on insertions
% 2.55/2.75  
% 2.55/2.75  Model 12 [ 52 1 565 ] (0.00 seconds, 250000 Inserts)
% 2.55/2.75  
% 2.55/2.75  Stopped by limit on insertions
% 2.55/2.75  
% 2.55/2.75  Model 13 [ 38 1 1835 ] (0.00 seconds, 250000 Inserts)
% 2.55/2.75  
% 2.55/2.75  Stopped by limit on insertions
% 2.55/2.75  
% 2.55/2.75  Model 14 [ 44 1 1033 ] (0.00 seconds, 250000 Inserts)
% 2.55/2.75  
% 2.55/2.75  Stopped by limit on insertions
% 2.55/2.75  
% 2.55/2.75  Model 15 [ 59 1 1168 ] (0.00 seconds, 250000 Inserts)
% 2.55/2.75  
% 2.55/2.75  Stopped by limit on insertions
% 2.55/2.75  
% 2.55/2.75  Model 16 [ 40 1 1630 ] (0.00 seconds, 250000 Inserts)
% 2.55/2.75  
% 2.55/2.75  Stopped by limit on insertions
% 2.55/2.75  
% 2.55/2.75  Model 17 [ 70 1 2225 ] (0.00 seconds, 250000 Inserts)
% 2.55/2.75  
% 2.55/2.75  Stopped by limit on insertions
% 2.55/2.75  
% 2.55/2.75  Model 18 [ 52 1 296 ] (0.00 seconds, 250000 Inserts)
% 2.55/2.75  
% 2.55/2.75  Stopped by limit on insertions
% 2.55/2.75  
% 2.55/2.75  Model 19 [ 46 0 1021 ] (0.00 seconds, 250000 Inserts)
% 2.55/2.75  
% 2.55/2.75  Stopped by limit on insertions
% 2.55/2.75  
% 2.55/2.75  Model 20 [ 71 1 258 ] (0.00 seconds, 250000 Inserts)
% 2.55/2.75  
% 2.55/2.75  -----> EMPTY CLAUSE at   2.37 sec ----> 1982 [hyper,58,21,79,90,90,478,90] {-} $F.
% 2.55/2.75  
% 2.55/2.75  Length of proof is 4.  Level of proof is 2.
% 2.55/2.75  
% 2.55/2.75  ---------------- PROOF ----------------
% 2.55/2.75  % SZS status Theorem
% 2.55/2.75  % SZS output start Refutation
% 2.55/2.75  
% 2.55/2.75  4 [] {+} r2(A,B)| -id(B,$f1(A)).
% 2.55/2.75  10 [] {+} -id(A,B)|id(A,C)| -id(B,C).
% 2.55/2.75  12 [] {+} -id(A,B)| -r1(B)|r1(A).
% 2.55/2.75  13 [] {+} -id(A,B)| -id(C,D)| -r2(A,C)|r2(B,D).
% 2.55/2.75  21 [] {+} -r3(A,B,C)| -id(C,D)| -r2(E,D)| -r2(F,E)| -r1(G)| -r2(G,F).
% 2.55/2.75  45 [] {-} id(A,A).
% 2.55/2.75  56 [] {-} id($f13(A),A).
% 2.55/2.75  58 [] {+} r3(A,$f12(A),$f13(A)).
% 2.55/2.75  61 [] {+} id($f16(A),$f15(A)).
% 2.55/2.75  62 [] {+} r1($f15(A)).
% 2.55/2.75  69 [hyper,45,4] {-} r2(A,$f1(A)).
% 2.55/2.75  79 [hyper,56,10,56] {-} id($f13($f13(A)),A).
% 2.55/2.75  90 [hyper,69,13,56,45] {-} r2(A,$f1($f13(A))).
% 2.55/2.75  478 [hyper,61,12,62] {+} r1($f16(A)).
% 2.55/2.75  1982 [hyper,58,21,79,90,90,478,90] {-} $F.
% 2.55/2.75  
% 2.55/2.75  % SZS output end Refutation
% 2.55/2.75  ------------ end of proof -------------
% 2.55/2.75  
% 2.55/2.75  
% 2.55/2.75  Search stopped by max_proofs option.
% 2.55/2.75  
% 2.55/2.75  
% 2.55/2.75  Search stopped by max_proofs option.
% 2.55/2.75  
% 2.55/2.75  ============ end of search ============
% 2.55/2.75  
% 2.55/2.75  ----------- soft-scott stats ----------
% 2.55/2.75  
% 2.55/2.75  true clauses given           5      (14.3%)
% 2.55/2.75  false clauses given         30
% 2.55/2.75  
% 2.55/2.75        FALSE     TRUE
% 2.55/2.75     4  0         5
% 2.55/2.75     5  3         19
% 2.55/2.75     6  55        12
% 2.55/2.75     7  95        9
% 2.55/2.75     8  139       77
% 2.55/2.75     9  152       145
% 2.55/2.75    10  136       161
% 2.55/2.75    11  156       122
% 2.55/2.75    12  121       87
% 2.55/2.75    13  70        82
% 2.55/2.75    14  50        33
% 2.55/2.75    15  16        14
% 2.55/2.75    16  16        15
% 2.55/2.75    17  0         8
% 2.55/2.75    18  0         4
% 2.55/2.75  tot:  1009      793      (44.0% true)
% 2.55/2.75  
% 2.55/2.75  
% 2.55/2.75  Model 20 [ 71 1 258 ] (0.00 seconds, 250000 Inserts)
% 2.55/2.75  
% 2.55/2.75  That finishes the proof of the theorem.
% 2.55/2.75  
% 2.55/2.75  Process 21292 finished Thu Jun  2 03:48:13 2022
%------------------------------------------------------------------------------