TSTP Solution File: COL051-1 by SOS---2.0

View Problem - Process Solution

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

% Computer : n019.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 : Fri Jul 15 00:42:06 EDT 2022

% Result   : Unsatisfiable 0.20s 0.41s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : COL051-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n019.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.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue May 31 11:12:10 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.37  ----- Otter 3.2, August 2001 -----
% 0.13/0.37  The process was started by sandbox on n019.cluster.edu,
% 0.13/0.37  Tue May 31 11:12:10 2022
% 0.13/0.37  The command was "./sos".  The process ID is 20194.
% 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  list(usable).
% 0.13/0.37  
% 0.13/0.37  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.13/0.37  
% 0.13/0.37  All clauses are units, and equality is present; the
% 0.13/0.37  strategy will be Knuth-Bendix with positive clauses in sos.
% 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  
% 0.13/0.37  ------------> process usable:
% 0.13/0.37  
% 0.13/0.37  ------------> process sos:
% 0.13/0.37    Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] {-} A=A.
% 0.13/0.37    Following clause subsumed by 2 during input processing: 0 [copy,6,flip.1] {-} response(mocking_bird,A)=response(A,A).
% 0.13/0.37  
% 0.13/0.37  ======= end of input processing =======
% 0.20/0.40  
% 0.20/0.40  Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40  
% 0.20/0.40  Stopped by limit on number of solutions
% 0.20/0.40  
% 0.20/0.40  
% 0.20/0.40  -------------- Softie stats --------------
% 0.20/0.40  
% 0.20/0.40  UPDATE_STOP: 300
% 0.20/0.40  SFINDER_TIME_LIMIT: 2
% 0.20/0.40  SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40  number of clauses in intial UL: 1
% 0.20/0.40  number of clauses initially in problem: 6
% 0.20/0.40  percentage of clauses intially in UL: 16
% 0.20/0.40  percentage of distinct symbols occuring in initial UL: 50
% 0.20/0.40  percent of all initial clauses that are short: 100
% 0.20/0.40  absolute distinct symbol count: 4
% 0.20/0.40     distinct predicate count: 1
% 0.20/0.40     distinct function count: 2
% 0.20/0.40     distinct constant count: 1
% 0.20/0.40  
% 0.20/0.40  ---------- no more Softie stats ----------
% 0.20/0.40  
% 0.20/0.40  
% 0.20/0.40  
% 0.20/0.40  Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40  
% 0.20/0.40  Stopped by limit on number of solutions
% 0.20/0.40  
% 0.20/0.40  =========== start of search ===========
% 0.20/0.41  
% 0.20/0.41  -------- PROOF -------- 
% 0.20/0.41  % SZS status Unsatisfiable
% 0.20/0.41  % SZS output start Refutation
% 0.20/0.41  
% 0.20/0.41  Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.41  
% 0.20/0.41  Stopped by limit on number of solutions
% 0.20/0.41  
% 0.20/0.41  ----> UNIT CONFLICT at   0.02 sec ----> 19 [binary,18.1,16.1] {+} $F.
% 0.20/0.41  
% 0.20/0.41  Length of proof is 3.  Level of proof is 2.
% 0.20/0.41  
% 0.20/0.41  ---------------- PROOF ----------------
% 0.20/0.41  % SZS status Unsatisfiable
% 0.20/0.41  % SZS output start Refutation
% 0.20/0.41  
% 0.20/0.41  1 [] {+} response(A,A)!=A.
% 0.20/0.41  2 [] {+} response(mocking_bird,A)=response(A,A).
% 0.20/0.41  3 [] {-} response(compose(A,B),C)=response(A,response(B,C)).
% 0.20/0.41  6 [copy,2,flip.1] {+} response(A,A)=response(mocking_bird,A).
% 0.20/0.41  16 [para_into,6.1.1,3.1.1] {-} response(A,response(B,compose(A,B)))=response(mocking_bird,compose(A,B)).
% 0.20/0.41  18 [para_from,6.1.1,1.1.1] {-} response(mocking_bird,A)!=A.
% 0.20/0.41  19 [binary,18.1,16.1] {+} $F.
% 0.20/0.41  
% 0.20/0.41  % SZS output end Refutation
% 0.20/0.41  ------------ end of proof -------------
% 0.20/0.41  
% 0.20/0.41  
% 0.20/0.41  Search stopped by max_proofs option.
% 0.20/0.41  
% 0.20/0.41  
% 0.20/0.41  Search stopped by max_proofs option.
% 0.20/0.41  
% 0.20/0.41  ============ end of search ============
% 0.20/0.41  
% 0.20/0.41  ----------- soft-scott stats ----------
% 0.20/0.41  
% 0.20/0.41  true clauses given           2      (33.3%)
% 0.20/0.41  false clauses given          4
% 0.20/0.41  
% 0.20/0.41        FALSE     TRUE
% 0.20/0.41    15  0         2
% 0.20/0.41    17  3         0
% 0.20/0.41    19  1         0
% 0.20/0.41    21  1         0
% 0.20/0.41  tot:  5         2      (28.6% true)
% 0.20/0.41  
% 0.20/0.41  
% 0.20/0.41  Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.41  
% 0.20/0.41  That finishes the proof of the theorem.
% 0.20/0.41  
% 0.20/0.41  Process 20194 finished Tue May 31 11:12:10 2022
%------------------------------------------------------------------------------