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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : ALG174+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n018.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 : Thu Jul 14 18:01:12 EDT 2022

% Result   : Theorem 5.29s 5.51s
% Output   : Refutation 5.29s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : ALG174+1 : TPTP v8.1.0. Released v2.7.0.
% 0.04/0.13  % Command  : sos-script %s
% 0.12/0.34  % Computer : n018.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 : Wed Jun  8 02:15:06 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 5.29/5.51  
% 5.29/5.51  -------- PROOF -------- 
% 5.29/5.51  % SZS status Unsatisfiable
% 5.29/5.51  % SZS output start Refutation
% 5.29/5.51  ----- Otter 3.2, August 2001 -----
% 5.29/5.51  The process was started by sandbox2 on n018.cluster.edu,
% 5.29/5.51  Wed Jun  8 02:15:06 2022
% 5.29/5.51  The command was "./sos".  The process ID is 5071.
% 5.29/5.51  
% 5.29/5.51  set(prolog_style_variables).
% 5.29/5.51  set(auto).
% 5.29/5.51     dependent: set(auto1).
% 5.29/5.51     dependent: set(process_input).
% 5.29/5.51     dependent: clear(print_kept).
% 5.29/5.51     dependent: clear(print_new_demod).
% 5.29/5.51     dependent: clear(print_back_demod).
% 5.29/5.51     dependent: clear(print_back_sub).
% 5.29/5.51     dependent: set(control_memory).
% 5.29/5.51     dependent: assign(max_mem, 12000).
% 5.29/5.51     dependent: assign(pick_given_ratio, 4).
% 5.29/5.51     dependent: assign(stats_level, 1).
% 5.29/5.51     dependent: assign(pick_semantic_ratio, 3).
% 5.29/5.51     dependent: assign(sos_limit, 5000).
% 5.29/5.51     dependent: assign(max_weight, 60).
% 5.29/5.51  clear(print_given).
% 5.29/5.51  
% 5.29/5.51  formula_list(usable).
% 5.29/5.51  
% 5.29/5.51  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 5.29/5.51  
% 5.29/5.51  This ia a non-Horn set with equality.  The strategy will be
% 5.29/5.51  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 5.29/5.51  unit deletion, with positive clauses in sos and nonpositive
% 5.29/5.51  clauses in usable.
% 5.29/5.51  
% 5.29/5.51     dependent: set(knuth_bendix).
% 5.29/5.51     dependent: set(para_from).
% 5.29/5.51     dependent: set(para_into).
% 5.29/5.51     dependent: clear(para_from_right).
% 5.29/5.51     dependent: clear(para_into_right).
% 5.29/5.51     dependent: set(para_from_vars).
% 5.29/5.51     dependent: set(eq_units_both_ways).
% 5.29/5.51     dependent: set(dynamic_demod_all).
% 5.29/5.51     dependent: set(dynamic_demod).
% 5.29/5.51     dependent: set(order_eq).
% 5.29/5.51     dependent: set(back_demod).
% 5.29/5.51     dependent: set(lrpo).
% 5.29/5.51     dependent: set(hyper_res).
% 5.29/5.51     dependent: set(unit_deletion).
% 5.29/5.51     dependent: set(factor).
% 5.29/5.51  
% 5.29/5.51  ------------> process usable:
% 5.29/5.51  
% 5.29/5.51  ------------> process sos:
% 5.29/5.51  
% 5.29/5.51  ----> UNIT CONFLICT at   5.14 sec ----> 3554 [binary,3552.1,212.1] {-} $F.
% 5.29/5.51  
% 5.29/5.51  Length of proof is 7.  Level of proof is 4.
% 5.29/5.51  
% 5.29/5.51  ---------------- PROOF ----------------
% 5.29/5.51  % SZS status Theorem
% 5.29/5.51  % SZS output start Refutation
% 5.29/5.51  
% 5.29/5.51  211 [] {-} e1!=e3.
% 5.29/5.51  212 [copy,211,flip.1] {-} e3!=e1.
% 5.29/5.51  3455 [] {-} op(op(e2,e3),op(e3,e2))=e3.
% 5.29/5.51  3474 [] {-} e1=op(e3,op(e3,op(e3,e3))).
% 5.29/5.51  3475 [copy,3474,flip.1] {-} op(e3,op(e3,op(e3,e3)))=e1.
% 5.29/5.51  3477 [] {-} e2=op(e3,e3).
% 5.29/5.51  3479,3478 [copy,3477,flip.1] {-} op(e3,e3)=e2.
% 5.29/5.51  3480 [] {-} e4=op(e3,op(e3,e3)).
% 5.29/5.51  3482,3481 [copy,3480,demod,3479,flip.1] {-} op(e3,e2)=e4.
% 5.29/5.51  3520 [] {-} op(op(e3,e3),e3)=e3.
% 5.29/5.51  3522,3521 [copy,3520,demod,3479] {-} op(e2,e3)=e3.
% 5.29/5.51  3537,3536 [back_demod,3475,demod,3479,3482] {-} op(e3,e4)=e1.
% 5.29/5.51  3552 [back_demod,3455,demod,3522,3482,3537,flip.1] {-} e3=e1.
% 5.29/5.51  3554 [binary,3552.1,212.1] {-} $F.
% 5.29/5.51  
% 5.29/5.51  % SZS output end Refutation
% 5.29/5.51  ------------ end of proof -------------
% 5.29/5.51  
% 5.29/5.51  
% 5.29/5.51  Search stopped by max_proofs option.
% 5.29/5.51  
% 5.29/5.51  
% 5.29/5.51  Search stopped by max_proofs option.
% 5.29/5.51  
% 5.29/5.51  ============ end of search ============
% 5.29/5.51  
% 5.29/5.51  That finishes the proof of the theorem.
% 5.29/5.51  
% 5.29/5.51  Process 5071 finished Wed Jun  8 02:15:11 2022
%------------------------------------------------------------------------------