TSTP Solution File: FLD006-3 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : FLD006-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n024.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 : Sat Jul 16 02:27:33 EDT 2022

% Result   : Unsatisfiable 2.12s 2.30s
% Output   : Refutation 2.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : FLD006-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n024.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jun  6 21:20:35 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.36  ----- Otter 3.2, August 2001 -----
% 0.13/0.36  The process was started by sandbox2 on n024.cluster.edu,
% 0.13/0.36  Mon Jun  6 21:20:35 2022
% 0.13/0.36  The command was "./sos".  The process ID is 12080.
% 0.13/0.36  
% 0.13/0.36  set(prolog_style_variables).
% 0.13/0.36  set(auto).
% 0.13/0.36     dependent: set(auto1).
% 0.13/0.36     dependent: set(process_input).
% 0.13/0.36     dependent: clear(print_kept).
% 0.13/0.36     dependent: clear(print_new_demod).
% 0.13/0.36     dependent: clear(print_back_demod).
% 0.13/0.36     dependent: clear(print_back_sub).
% 0.13/0.36     dependent: set(control_memory).
% 0.13/0.36     dependent: assign(max_mem, 12000).
% 0.13/0.36     dependent: assign(pick_given_ratio, 4).
% 0.13/0.36     dependent: assign(stats_level, 1).
% 0.13/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36     dependent: assign(sos_limit, 5000).
% 0.13/0.36     dependent: assign(max_weight, 60).
% 0.13/0.36  clear(print_given).
% 0.13/0.36  
% 0.13/0.36  list(usable).
% 0.13/0.36  
% 0.13/0.36  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 0.13/0.36  
% 0.13/0.36  This is a non-Horn set without equality.  The strategy
% 0.13/0.36  will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.36  factoring, with satellites in sos and nuclei in usable.
% 0.13/0.36  
% 0.13/0.36     dependent: set(hyper_res).
% 0.13/0.36     dependent: set(factor).
% 0.13/0.36     dependent: set(unit_deletion).
% 0.13/0.36  
% 0.13/0.36  ------------> process usable:
% 0.13/0.36  
% 0.13/0.36  ------------> process sos:
% 0.13/0.36  
% 0.13/0.36  ======= end of input processing =======
% 0.20/0.45  
% 0.20/0.45  Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.45  
% 0.20/0.45  Stopped by limit on number of solutions
% 0.20/0.45  
% 0.20/0.45  
% 0.20/0.45  -------------- Softie stats --------------
% 0.20/0.45  
% 0.20/0.45  UPDATE_STOP: 300
% 0.20/0.45  SFINDER_TIME_LIMIT: 2
% 0.20/0.45  SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.45  number of clauses in intial UL: 48
% 0.20/0.45  number of clauses initially in problem: 50
% 0.20/0.45  percentage of clauses intially in UL: 96
% 0.20/0.45  percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.45  percent of all initial clauses that are short: 100
% 0.20/0.45  absolute distinct symbol count: 10
% 0.20/0.45     distinct predicate count: 4
% 0.20/0.45     distinct function count: 4
% 0.20/0.45     distinct constant count: 2
% 0.20/0.45  
% 0.20/0.45  ---------- no more Softie stats ----------
% 0.20/0.45  
% 0.20/0.45  
% 0.20/0.45  
% 0.20/0.45  =========== start of search ===========
% 2.12/2.30  
% 2.12/2.30  -------- PROOF -------- 
% 2.12/2.30  % SZS status Unsatisfiable
% 2.12/2.30  % SZS output start Refutation
% 2.12/2.30  
% 2.12/2.30  Model 2 [ 2 2 233 ] (0.00 seconds, 109366 Inserts)
% 2.12/2.30  
% 2.12/2.30  Stopped by limit on insertions
% 2.12/2.30  
% 2.12/2.30  Model 3 [ 3 2 166 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30  
% 2.12/2.30  Stopped by limit on insertions
% 2.12/2.30  
% 2.12/2.30  Model 4 [ 4 1 319 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30  
% 2.12/2.30  Model 5 [ 3 1 1364 ] (0.00 seconds, 9814 Inserts)
% 2.12/2.30  
% 2.12/2.30  Stopped by limit on insertions
% 2.12/2.30  
% 2.12/2.30  Model 6 [ 5 2 180 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30  
% 2.12/2.30  Model 7 [ 3 1 1881 ] (0.00 seconds, 9035 Inserts)
% 2.12/2.30  
% 2.12/2.30  Stopped by limit on insertions
% 2.12/2.30  
% 2.12/2.30  Model 8 [ 8 1 168 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30  
% 2.12/2.30  Stopped by limit on insertions
% 2.12/2.30  
% 2.12/2.30  Model 9 [ 3 1 143 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30  
% 2.12/2.30  Stopped by limit on insertions
% 2.12/2.30  
% 2.12/2.30  Model 10 [ 3 2 2879 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30  
% 2.12/2.30  Model 11 [ 3 2 2276 ] (0.00 seconds, 8375 Inserts)
% 2.12/2.30  
% 2.12/2.30  Stopped by limit on insertions
% 2.12/2.30  
% 2.12/2.30  Model 12 [ 3 2 2854 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30  
% 2.12/2.30  Stopped by limit on insertions
% 2.12/2.30  
% 2.12/2.30  Model 13 [ 3 2 562 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30  
% 2.12/2.30  Model 14 [ 3 1 1877 ] (0.00 seconds, 14360 Inserts)
% 2.12/2.30  
% 2.12/2.30  Model 15 [ 3 2 3477 ] (0.00 seconds, 8933 Inserts)
% 2.12/2.30  
% 2.12/2.30  ----> UNIT CONFLICT at   1.91 sec ----> 780 [binary,779.1,25.1] {+} $F.
% 2.12/2.30  
% 2.12/2.30  Length of proof is 2.  Level of proof is 2.
% 2.12/2.30  
% 2.12/2.30  ---------------- PROOF ----------------
% 2.12/2.30  % SZS status Unsatisfiable
% 2.12/2.30  % SZS output start Refutation
% 2.12/2.30  
% 2.12/2.30  4 [] {+} sum(additive_inverse(A),A,additive_identity)| -defined(A).
% 2.12/2.30  5 [] {+} sum(A,B,C)| -sum(B,A,C).
% 2.12/2.30  25 [] {+} -sum(additive_identity,additive_inverse(additive_identity),additive_identity).
% 2.12/2.30  49 [] {-} defined(additive_identity).
% 2.12/2.30  60 [hyper,49,4] {-} sum(additive_inverse(additive_identity),additive_identity,additive_identity).
% 2.12/2.30  779 [hyper,60,5] {-} sum(additive_identity,additive_inverse(additive_identity),additive_identity).
% 2.12/2.30  780 [binary,779.1,25.1] {+} $F.
% 2.12/2.30  
% 2.12/2.30  % SZS output end Refutation
% 2.12/2.30  ------------ end of proof -------------
% 2.12/2.30  
% 2.12/2.30  
% 2.12/2.30  Search stopped by max_proofs option.
% 2.12/2.30  
% 2.12/2.30  
% 2.12/2.30  Search stopped by max_proofs option.
% 2.12/2.30  
% 2.12/2.30  ============ end of search ============
% 2.12/2.30  
% 2.12/2.30  ----------- soft-scott stats ----------
% 2.12/2.30  
% 2.12/2.30  true clauses given           1      (5.3%)
% 2.12/2.30  false clauses given         18
% 2.12/2.30  
% 2.12/2.30        FALSE     TRUE
% 2.12/2.30     4  0         6
% 2.12/2.30     5  5         23
% 2.12/2.30     6  37        46
% 2.12/2.30     7  10        66
% 2.12/2.30     8  9         155
% 2.12/2.30     9  1         9
% 2.12/2.30    10  28        60
% 2.12/2.30    11  0         8
% 2.12/2.30    12  16        65
% 2.12/2.30    14  0         156
% 2.12/2.30    15  0         8
% 2.12/2.30  tot:  106       602      (85.0% true)
% 2.12/2.30  
% 2.12/2.30  
% 2.12/2.30  Model 15 [ 3 -2 3477 ] (0.00 seconds, 8933 Inserts)
% 2.12/2.30  
% 2.12/2.30  That finishes the proof of the theorem.
% 2.12/2.30  
% 2.12/2.30  Process 12080 finished Mon Jun  6 21:20:37 2022
%------------------------------------------------------------------------------