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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : KLE059+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n028.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:23 EDT 2022

% Result   : Theorem 0.19s 0.42s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : KLE059+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13  % Command  : sos-script %s
% 0.12/0.34  % Computer : n028.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 08:28:41 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.36  ----- Otter 3.2, August 2001 -----
% 0.19/0.36  The process was started by sandbox on n028.cluster.edu,
% 0.19/0.36  Thu Jun 16 08:28:41 2022
% 0.19/0.36  The command was "./sos".  The process ID is 5826.
% 0.19/0.36  
% 0.19/0.36  set(prolog_style_variables).
% 0.19/0.36  set(auto).
% 0.19/0.36     dependent: set(auto1).
% 0.19/0.36     dependent: set(process_input).
% 0.19/0.36     dependent: clear(print_kept).
% 0.19/0.36     dependent: clear(print_new_demod).
% 0.19/0.36     dependent: clear(print_back_demod).
% 0.19/0.36     dependent: clear(print_back_sub).
% 0.19/0.36     dependent: set(control_memory).
% 0.19/0.36     dependent: assign(max_mem, 12000).
% 0.19/0.36     dependent: assign(pick_given_ratio, 4).
% 0.19/0.36     dependent: assign(stats_level, 1).
% 0.19/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36     dependent: assign(sos_limit, 5000).
% 0.19/0.36     dependent: assign(max_weight, 60).
% 0.19/0.36  clear(print_given).
% 0.19/0.36  
% 0.19/0.36  formula_list(usable).
% 0.19/0.36  
% 0.19/0.36  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 0.19/0.36  
% 0.19/0.36  This is a Horn set with equality.  The strategy will be
% 0.19/0.36  Knuth-Bendix and hyper_res, with positive clauses in
% 0.19/0.36  sos and nonpositive clauses in usable.
% 0.19/0.36  
% 0.19/0.36     dependent: set(knuth_bendix).
% 0.19/0.36     dependent: set(para_from).
% 0.19/0.36     dependent: set(para_into).
% 0.19/0.36     dependent: clear(para_from_right).
% 0.19/0.36     dependent: clear(para_into_right).
% 0.19/0.36     dependent: set(para_from_vars).
% 0.19/0.36     dependent: set(eq_units_both_ways).
% 0.19/0.36     dependent: set(dynamic_demod_all).
% 0.19/0.36     dependent: set(dynamic_demod).
% 0.19/0.36     dependent: set(order_eq).
% 0.19/0.36     dependent: set(back_demod).
% 0.19/0.36     dependent: set(lrpo).
% 0.19/0.36     dependent: set(hyper_res).
% 0.19/0.36     dependent: clear(order_hyper).
% 0.19/0.36  
% 0.19/0.36  ------------> process usable:
% 0.19/0.36  
% 0.19/0.36  ------------> process sos:
% 0.19/0.36    Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] {-} addition(A,B)=addition(B,A).
% 0.19/0.36    Following clause subsumed by 40 during input processing: 0 [copy,40,flip.1] {-} A=A.
% 0.19/0.36  
% 0.19/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: 3
% 0.19/0.39  number of clauses initially in problem: 37
% 0.19/0.39  percentage of clauses intially in UL: 8
% 0.19/0.39  percentage of distinct symbols occuring in initial UL: 66
% 0.19/0.39  percent of all initial clauses that are short: 100
% 0.19/0.39  absolute distinct symbol count: 9
% 0.19/0.39     distinct predicate count: 2
% 0.19/0.39     distinct function count: 3
% 0.19/0.39     distinct constant count: 4
% 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.19/0.42  
% 0.19/0.42  -------- PROOF -------- 
% 0.19/0.42  % SZS status Theorem
% 0.19/0.42  % SZS output start Refutation
% 0.19/0.42  
% 0.19/0.42  Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.42  
% 0.19/0.42  Stopped by limit on number of solutions
% 0.19/0.42  
% 0.19/0.42  Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.42  
% 0.19/0.42  Stopped by limit on number of solutions
% 0.19/0.42  
% 0.19/0.42  Model 5 (0.00 seconds, 0 Inserts)
% 0.19/0.42  
% 0.19/0.42  Stopped by limit on number of solutions
% 0.19/0.42  
% 0.19/0.42  Model 6 (0.00 seconds, 0 Inserts)
% 0.19/0.42  
% 0.19/0.42  Stopped by limit on number of solutions
% 0.19/0.42  
% 0.19/0.42  Model 7 (0.00 seconds, 0 Inserts)
% 0.19/0.42  
% 0.19/0.42  Stopped by limit on number of solutions
% 0.19/0.42  
% 0.19/0.42  Model 8 (0.00 seconds, 0 Inserts)
% 0.19/0.42  
% 0.19/0.42  Stopped by limit on number of solutions
% 0.19/0.42  
% 0.19/0.42  Model 9 (0.00 seconds, 0 Inserts)
% 0.19/0.42  
% 0.19/0.42  Stopped by limit on number of solutions
% 0.19/0.42  
% 0.19/0.42  ----> UNIT CONFLICT at   0.04 sec ----> 72 [binary,70.1,3.1] {+} $F.
% 0.19/0.42  
% 0.19/0.42  Length of proof is 1.  Level of proof is 1.
% 0.19/0.42  
% 0.19/0.42  ---------------- PROOF ----------------
% 0.19/0.42  % SZS status Theorem
% 0.19/0.42  % SZS output start Refutation
% 0.19/0.42  
% 0.19/0.42  3 [] {+} addition(domain($c2),domain($c1))!=domain($c1).
% 0.19/0.42  36 [] {-} domain(addition(A,B))=addition(domain(A),domain(B)).
% 0.19/0.42  38 [] {+} addition($c2,$c1)=$c1.
% 0.19/0.42  70 [para_into,36.1.1.1,38.1.1,flip.1] {-} addition(domain($c2),domain($c1))=domain($c1).
% 0.19/0.42  72 [binary,70.1,3.1] {+} $F.
% 0.19/0.42  
% 0.19/0.42  % SZS output end Refutation
% 0.19/0.42  ------------ end of proof -------------
% 0.19/0.42  
% 0.19/0.42  
% 0.19/0.42  Search stopped by max_proofs option.
% 0.19/0.42  
% 0.19/0.42  
% 0.19/0.42  Search stopped by max_proofs option.
% 0.19/0.42  
% 0.19/0.42  ============ end of search ============
% 0.19/0.42  
% 0.19/0.42  ----------- soft-scott stats ----------
% 0.19/0.42  
% 0.19/0.42  true clauses given           3      (20.0%)
% 0.19/0.42  false clauses given         12
% 0.19/0.42  
% 0.19/0.42        FALSE     TRUE
% 0.19/0.42     3  0         1
% 0.19/0.42     5  0         2
% 0.19/0.42     6  0         5
% 0.19/0.42     8  0         3
% 0.19/0.42     9  0         2
% 0.19/0.42    11  1         4
% 0.19/0.42    12  0         3
% 0.19/0.42    13  2         0
% 0.19/0.42    14  1         0
% 0.19/0.42  tot:  4         20      (83.3% true)
% 0.19/0.42  
% 0.19/0.42  
% 0.19/0.42  Model 9 (0.00 seconds, 0 Inserts)
% 0.19/0.42  
% 0.19/0.42  That finishes the proof of the theorem.
% 0.19/0.42  
% 0.19/0.42  Process 5826 finished Thu Jun 16 08:28:41 2022
%------------------------------------------------------------------------------