TSTP Solution File: FLD030-4 by SOS---2.0

View Problem - Process Solution

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

% Computer : n021.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:43 EDT 2022

% Result   : Unsatisfiable 2.20s 2.40s
% Output   : Refutation 2.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : FLD030-4 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13  % Command  : sos-script %s
% 0.12/0.34  % Computer : n021.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 : Mon Jun  6 20:02:50 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 sandbox2 on n021.cluster.edu,
% 0.20/0.36  Mon Jun  6 20:02:51 2022
% 0.20/0.36  The command was "./sos".  The process ID is 24227.
% 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  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  
% 0.20/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: 56
% 0.20/0.45  percentage of clauses intially in UL: 85
% 0.20/0.45  percentage of distinct symbols occuring in initial UL: 92
% 0.20/0.45  percent of all initial clauses that are short: 100
% 0.20/0.45  absolute distinct symbol count: 14
% 0.20/0.45     distinct predicate count: 4
% 0.20/0.45     distinct function count: 4
% 0.20/0.45     distinct constant count: 6
% 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  Model 2 (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  =========== start of search ===========
% 2.20/2.40  
% 2.20/2.40  -------- PROOF -------- 
% 2.20/2.40  % SZS status Unsatisfiable
% 2.20/2.40  % SZS output start Refutation
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 3 [ 1 2 166 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 4 [ 1 2 287 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 5 [ 2 1 172 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 6 [ 2 2 319 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 7 [ 2 1 552 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 8 [ 3 1 124 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 9 [ 3 3 39365 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 10 [ 7 1 196 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 11 [ 5 2 165 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 12 [ 4 1 308 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 13 [ 3 1 361 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 14 [ 3 1 262 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 15 [ 5 1 402 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 16 [ 3 2 169 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 17 [ 3 2 169 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 18 [ 5 2 505 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 19 [ 16 1 167 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 20 [ 5 1 104 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 21 [ 6 1 600 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 22 [ 8 1 567 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 23 [ 5 1 125 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 24 [ 22 2 223 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 25 [ 7 2 342 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  Stopped by limit on insertions
% 2.20/2.40  
% 2.20/2.40  Model 26 [ 6 2 385 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  ----> UNIT CONFLICT at   2.00 sec ----> 1812 [binary,1811.1,25.1] {-} $F.
% 2.20/2.40  
% 2.20/2.40  Length of proof is 2.  Level of proof is 2.
% 2.20/2.40  
% 2.20/2.40  ---------------- PROOF ----------------
% 2.20/2.40  % SZS status Unsatisfiable
% 2.20/2.40  % SZS output start Refutation
% 2.20/2.40  
% 2.20/2.40  7 [] {+} product(A,B,C)| -product(D,E,A)| -product(E,B,F)| -product(D,F,C).
% 2.20/2.40  8 [] {+} product(multiplicative_identity,A,A)| -defined(A).
% 2.20/2.40  25 [] {+} -product(d,b,c).
% 2.20/2.40  53 [] {+} defined(c).
% 2.20/2.40  55 [] {+} product(a,b,c).
% 2.20/2.40  56 [] {+} product(multiplicative_identity,a,d).
% 2.20/2.40  152 [hyper,53,8] {+} product(multiplicative_identity,c,c).
% 2.20/2.40  1811 [hyper,152,7,56,55] {-} product(d,b,c).
% 2.20/2.40  1812 [binary,1811.1,25.1] {-} $F.
% 2.20/2.40  
% 2.20/2.40  % SZS output end Refutation
% 2.20/2.40  ------------ end of proof -------------
% 2.20/2.40  
% 2.20/2.40  
% 2.20/2.40  Search stopped by max_proofs option.
% 2.20/2.40  
% 2.20/2.40  
% 2.20/2.40  Search stopped by max_proofs option.
% 2.20/2.40  
% 2.20/2.40  ============ end of search ============
% 2.20/2.40  
% 2.20/2.40  ----------- soft-scott stats ----------
% 2.20/2.40  
% 2.20/2.40  true clauses given           6      (18.8%)
% 2.20/2.40  false clauses given         26
% 2.20/2.40  
% 2.20/2.40        FALSE     TRUE
% 2.20/2.40     3  0         1
% 2.20/2.40     4  3         78
% 2.20/2.40     5  0         140
% 2.20/2.40     6  10        328
% 2.20/2.40     7  0         179
% 2.20/2.40     8  0         294
% 2.20/2.40     9  0         18
% 2.20/2.40    10  0         299
% 2.20/2.40    11  0         8
% 2.20/2.40    12  0         205
% 2.20/2.40    14  0         156
% 2.20/2.40    15  0         8
% 2.20/2.40  tot:  13        1714      (99.2% true)
% 2.20/2.40  
% 2.20/2.40  
% 2.20/2.40  Model 26 [ 6 2 385 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.40  
% 2.20/2.40  That finishes the proof of the theorem.
% 2.20/2.40  
% 2.20/2.40  Process 24227 finished Mon Jun  6 20:02:53 2022
%------------------------------------------------------------------------------