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

View Problem - Process Solution

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

% Computer : n022.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:03 EDT 2022

% Result   : Theorem 0.13s 0.37s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : KLE003+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n022.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.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Thu Jun 16 12:38:32 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.37  
% 0.13/0.37  -------- PROOF -------- 
% 0.13/0.37  % SZS status Unsatisfiable
% 0.13/0.37  % SZS output start Refutation
% 0.13/0.37  ----- Otter 3.2, August 2001 -----
% 0.13/0.37  The process was started by sandbox2 on n022.cluster.edu,
% 0.13/0.37  Thu Jun 16 12:38:32 2022
% 0.13/0.37  The command was "./sos".  The process ID is 23496.
% 0.13/0.37  
% 0.13/0.37  set(prolog_style_variables).
% 0.13/0.37  set(auto).
% 0.13/0.37     dependent: set(auto1).
% 0.13/0.37     dependent: set(process_input).
% 0.13/0.37     dependent: clear(print_kept).
% 0.13/0.37     dependent: clear(print_new_demod).
% 0.13/0.37     dependent: clear(print_back_demod).
% 0.13/0.37     dependent: clear(print_back_sub).
% 0.13/0.37     dependent: set(control_memory).
% 0.13/0.37     dependent: assign(max_mem, 12000).
% 0.13/0.37     dependent: assign(pick_given_ratio, 4).
% 0.13/0.37     dependent: assign(stats_level, 1).
% 0.13/0.37     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37     dependent: assign(sos_limit, 5000).
% 0.13/0.37     dependent: assign(max_weight, 60).
% 0.13/0.37  clear(print_given).
% 0.13/0.37  
% 0.13/0.37  formula_list(usable).
% 0.13/0.37  
% 0.13/0.37  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=2.
% 0.13/0.37  
% 0.13/0.37  This ia a non-Horn set with equality.  The strategy will be
% 0.13/0.37  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.37  unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.37  clauses in usable.
% 0.13/0.37  
% 0.13/0.37     dependent: set(knuth_bendix).
% 0.13/0.37     dependent: set(para_from).
% 0.13/0.37     dependent: set(para_into).
% 0.13/0.37     dependent: clear(para_from_right).
% 0.13/0.37     dependent: clear(para_into_right).
% 0.13/0.37     dependent: set(para_from_vars).
% 0.13/0.37     dependent: set(eq_units_both_ways).
% 0.13/0.37     dependent: set(dynamic_demod_all).
% 0.13/0.37     dependent: set(dynamic_demod).
% 0.13/0.37     dependent: set(order_eq).
% 0.13/0.37     dependent: set(back_demod).
% 0.13/0.37     dependent: set(lrpo).
% 0.13/0.37     dependent: set(hyper_res).
% 0.13/0.37     dependent: set(unit_deletion).
% 0.13/0.37     dependent: set(factor).
% 0.13/0.37  
% 0.13/0.37  ------------> process usable:
% 0.13/0.37  
% 0.13/0.37  ------------> process sos:
% 0.13/0.37    Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] {-} addition(A,B)=addition(B,A).
% 0.13/0.37  
% 0.13/0.37  -----> EMPTY CLAUSE at   0.00 sec ----> 30 [back_demod,3,demod,11,11,unit_del,29,29] {-} $F.
% 0.13/0.37  
% 0.13/0.37  Length of proof is 0.  Level of proof is 0.
% 0.13/0.37  
% 0.13/0.37  ---------------- PROOF ----------------
% 0.13/0.37  % SZS status Theorem
% 0.13/0.37  % SZS output start Refutation
% 0.13/0.37  
% 0.13/0.37  3 [] {-} addition($c1,$c1)!=$c1|addition(one,one)!=one.
% 0.13/0.37  11,10 [] {-} addition(A,A)=A.
% 0.13/0.37  29 [] {-} A=A.
% 0.13/0.37  30 [back_demod,3,demod,11,11,unit_del,29,29] {-} $F.
% 0.13/0.37  
% 0.13/0.37  % SZS output end Refutation
% 0.13/0.37  ------------ end of proof -------------
% 0.13/0.37  
% 0.13/0.37  
% 0.13/0.37  Search stopped by max_proofs option.
% 0.13/0.37  
% 0.13/0.37  
% 0.13/0.37  Search stopped by max_proofs option.
% 0.13/0.37  
% 0.13/0.37  ============ end of search ============
% 0.13/0.37  
% 0.13/0.37  That finishes the proof of the theorem.
% 0.13/0.37  
% 0.13/0.37  Process 23496 finished Thu Jun 16 12:38:32 2022
%------------------------------------------------------------------------------