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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : KLE085+1 : TPTP v8.1.0. Released v4.0.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 : Sun Jul 17 02:27:29 EDT 2022

% Result   : Theorem 0.36s 0.55s
% Output   : Refutation 0.36s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KLE085+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/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 : Thu Jun 16 15:49:45 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.36  ----- Otter 3.2, August 2001 -----
% 0.12/0.36  The process was started by sandbox2 on n021.cluster.edu,
% 0.12/0.36  Thu Jun 16 15:49:45 2022
% 0.12/0.36  The command was "./sos".  The process ID is 14249.
% 0.12/0.36  
% 0.12/0.36  set(prolog_style_variables).
% 0.12/0.36  set(auto).
% 0.12/0.36     dependent: set(auto1).
% 0.12/0.36     dependent: set(process_input).
% 0.12/0.36     dependent: clear(print_kept).
% 0.12/0.36     dependent: clear(print_new_demod).
% 0.12/0.36     dependent: clear(print_back_demod).
% 0.12/0.36     dependent: clear(print_back_sub).
% 0.12/0.36     dependent: set(control_memory).
% 0.12/0.36     dependent: assign(max_mem, 12000).
% 0.12/0.36     dependent: assign(pick_given_ratio, 4).
% 0.12/0.36     dependent: assign(stats_level, 1).
% 0.12/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36     dependent: assign(sos_limit, 5000).
% 0.12/0.36     dependent: assign(max_weight, 60).
% 0.12/0.36  clear(print_given).
% 0.12/0.36  
% 0.12/0.36  formula_list(usable).
% 0.12/0.36  
% 0.12/0.36  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 0.12/0.36  
% 0.12/0.36  This is a Horn set with equality.  The strategy will be
% 0.12/0.36  Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.36  sos and nonpositive clauses in usable.
% 0.12/0.36  
% 0.12/0.36     dependent: set(knuth_bendix).
% 0.12/0.36     dependent: set(para_from).
% 0.12/0.36     dependent: set(para_into).
% 0.12/0.36     dependent: clear(para_from_right).
% 0.12/0.36     dependent: clear(para_into_right).
% 0.12/0.36     dependent: set(para_from_vars).
% 0.12/0.36     dependent: set(eq_units_both_ways).
% 0.12/0.36     dependent: set(dynamic_demod_all).
% 0.12/0.36     dependent: set(dynamic_demod).
% 0.12/0.36     dependent: set(order_eq).
% 0.12/0.36     dependent: set(back_demod).
% 0.12/0.36     dependent: set(lrpo).
% 0.12/0.36     dependent: set(hyper_res).
% 0.12/0.36     dependent: clear(order_hyper).
% 0.12/0.36  
% 0.12/0.36  ------------> process usable:
% 0.12/0.36  
% 0.12/0.36  ------------> process sos:
% 0.12/0.36    Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] {-} addition(A,B)=addition(B,A).
% 0.12/0.36    Following clause subsumed by 43 during input processing: 0 [copy,43,flip.1] {-} A=A.
% 0.12/0.36  
% 0.12/0.36  ======= end of input processing =======
% 0.19/0.39  
% 0.19/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39  
% 0.19/0.39  Stopped by limit on number of solutions
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  -------------- Softie stats --------------
% 0.19/0.39  
% 0.19/0.39  UPDATE_STOP: 300
% 0.19/0.39  SFINDER_TIME_LIMIT: 2
% 0.19/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39  number of clauses in intial UL: 2
% 0.19/0.39  number of clauses initially in problem: 41
% 0.19/0.39  percentage of clauses intially in UL: 4
% 0.19/0.39  percentage of distinct symbols occuring in initial UL: 27
% 0.19/0.39  percent of all initial clauses that are short: 100
% 0.19/0.39  absolute distinct symbol count: 11
% 0.19/0.39     distinct predicate count: 2
% 0.19/0.39     distinct function count: 6
% 0.19/0.39     distinct constant count: 3
% 0.19/0.39  
% 0.19/0.39  ---------- no more Softie stats ----------
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39  
% 0.19/0.39  Stopped by limit on number of solutions
% 0.19/0.39  
% 0.19/0.39  =========== start of search ===========
% 0.36/0.55  
% 0.36/0.55  -------- PROOF -------- 
% 0.36/0.55  % SZS status Theorem
% 0.36/0.55  % SZS output start Refutation
% 0.36/0.55  
% 0.36/0.55  Model 3 (0.00 seconds, 0 Inserts)
% 0.36/0.55  
% 0.36/0.55  Stopped by limit on number of solutions
% 0.36/0.55  
% 0.36/0.55  Model 4 (0.00 seconds, 0 Inserts)
% 0.36/0.55  
% 0.36/0.55  Stopped by limit on number of solutions
% 0.36/0.55  
% 0.36/0.55  Model 5 (0.00 seconds, 0 Inserts)
% 0.36/0.55  
% 0.36/0.55  Stopped by limit on number of solutions
% 0.36/0.55  
% 0.36/0.55  Model 6 (0.00 seconds, 0 Inserts)
% 0.36/0.55  
% 0.36/0.55  Stopped by limit on number of solutions
% 0.36/0.55  
% 0.36/0.55  Model 7 (0.00 seconds, 0 Inserts)
% 0.36/0.55  
% 0.36/0.55  Stopped by limit on number of solutions
% 0.36/0.55  
% 0.36/0.55  Stopped by limit on insertions
% 0.36/0.55  
% 0.36/0.55  Model 8 [ 9 0 82 ] (0.00 seconds, 250000 Inserts)
% 0.36/0.55  
% 0.36/0.55  Model 9 (0.00 seconds, 250000 Inserts)
% 0.36/0.55  
% 0.36/0.55  Stopped by limit on number of solutions
% 0.36/0.55  
% 0.36/0.55  Model 10 (0.00 seconds, 250000 Inserts)
% 0.36/0.55  
% 0.36/0.55  Stopped by limit on number of solutions
% 0.36/0.55  
% 0.36/0.55  Model 11 (0.00 seconds, 250000 Inserts)
% 0.36/0.55  
% 0.36/0.55  Stopped by limit on number of solutions
% 0.36/0.55  
% 0.36/0.55  Model 12 (0.00 seconds, 250000 Inserts)
% 0.36/0.55  
% 0.36/0.55  Stopped by limit on number of solutions
% 0.36/0.55  
% 0.36/0.55  Model 13 (0.00 seconds, 250000 Inserts)
% 0.36/0.55  
% 0.36/0.55  Stopped by limit on number of solutions
% 0.36/0.55  
% 0.36/0.55  Model 14 (0.00 seconds, 250000 Inserts)
% 0.36/0.55  
% 0.36/0.55  Stopped by limit on number of solutions
% 0.36/0.55  
% 0.36/0.55  ----> UNIT CONFLICT at   0.17 sec ----> 124 [binary,122.1,44.1] {-} $F.
% 0.36/0.55  
% 0.36/0.55  Length of proof is 4.  Level of proof is 3.
% 0.36/0.55  
% 0.36/0.55  ---------------- PROOF ----------------
% 0.36/0.55  % SZS status Theorem
% 0.36/0.55  % SZS output start Refutation
% 0.36/0.55  
% 0.36/0.55  3 [] {-} addition(domain($c1),one)!=one.
% 0.36/0.55  5 [] {-} addition(A,addition(B,C))=addition(addition(A,B),C).
% 0.36/0.55  6 [copy,5,flip.1] {+} addition(addition(A,B),C)=addition(A,addition(B,C)).
% 0.36/0.55  10 [] {+} addition(A,A)=A.
% 0.36/0.55  32,31 [] {-} addition(antidomain(antidomain(A)),antidomain(A))=one.
% 0.36/0.55  34,33 [] {+} domain(A)=antidomain(antidomain(A)).
% 0.36/0.55  44 [back_demod,3,demod,34] {-} addition(antidomain(antidomain($c1)),one)!=one.
% 0.36/0.55  54 [para_into,6.1.1.1,10.1.1,flip.1] {+} addition(A,addition(A,B))=addition(A,B).
% 0.36/0.55  122 [para_into,54.1.1.2,31.1.1,demod,32] {-} addition(antidomain(antidomain(A)),one)=one.
% 0.36/0.55  124 [binary,122.1,44.1] {-} $F.
% 0.36/0.55  
% 0.36/0.55  % SZS output end Refutation
% 0.36/0.55  ------------ end of proof -------------
% 0.36/0.55  
% 0.36/0.55  
% 0.36/0.55  Search stopped by max_proofs option.
% 0.36/0.55  
% 0.36/0.55  
% 0.36/0.55  Search stopped by max_proofs option.
% 0.36/0.55  
% 0.36/0.55  ============ end of search ============
% 0.36/0.55  
% 0.36/0.55  ----------- soft-scott stats ----------
% 0.36/0.55  
% 0.36/0.56  true clauses given           8      (29.6%)
% 0.36/0.56  false clauses given         19
% 0.36/0.56  
% 0.36/0.56        FALSE     TRUE
% 0.36/0.56     3  0         1
% 0.36/0.56     6  0         3
% 0.36/0.56     8  1         5
% 0.36/0.56    10  1         3
% 0.36/0.56    11  0         6
% 0.36/0.56    12  3         4
% 0.36/0.56    14  0         2
% 0.36/0.56    15  0         2
% 0.36/0.56    17  0         2
% 0.36/0.56    18  1         1
% 0.36/0.56    22  0         1
% 0.36/0.56    24  0         3
% 0.36/0.56    26  0         1
% 0.36/0.56    31  0         2
% 0.36/0.56    34  0         1
% 0.36/0.56  tot:  6         37      (86.0% true)
% 0.36/0.56  
% 0.36/0.56  
% 0.36/0.56  Model 14 (0.00 seconds, 250000 Inserts)
% 0.36/0.56  
% 0.36/0.56  That finishes the proof of the theorem.
% 0.36/0.56  
% 0.36/0.56  Process 14249 finished Thu Jun 16 15:49:45 2022
%------------------------------------------------------------------------------