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

View Problem - Process Solution

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

% Computer : n032.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.14s 0.35s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem  : COL049-1 : TPTP v8.1.0. Released v1.0.0.
% 0.02/0.10  % Command  : sos-script %s
% 0.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.29  % WCLimit  : 600
% 0.10/0.29  % DateTime : Tue May 31 12:52:58 EDT 2022
% 0.10/0.30  % CPUTime  : 
% 0.14/0.31  ----- Otter 3.2, August 2001 -----
% 0.14/0.31  The process was started by sandbox on n032.cluster.edu,
% 0.14/0.31  Tue May 31 12:52:58 2022
% 0.14/0.31  The command was "./sos".  The process ID is 24203.
% 0.14/0.31  
% 0.14/0.31  set(prolog_style_variables).
% 0.14/0.31  set(auto).
% 0.14/0.31     dependent: set(auto1).
% 0.14/0.31     dependent: set(process_input).
% 0.14/0.31     dependent: clear(print_kept).
% 0.14/0.31     dependent: clear(print_new_demod).
% 0.14/0.31     dependent: clear(print_back_demod).
% 0.14/0.31     dependent: clear(print_back_sub).
% 0.14/0.31     dependent: set(control_memory).
% 0.14/0.31     dependent: assign(max_mem, 12000).
% 0.14/0.31     dependent: assign(pick_given_ratio, 4).
% 0.14/0.31     dependent: assign(stats_level, 1).
% 0.14/0.31     dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.31     dependent: assign(sos_limit, 5000).
% 0.14/0.31     dependent: assign(max_weight, 60).
% 0.14/0.31  clear(print_given).
% 0.14/0.31  
% 0.14/0.31  list(usable).
% 0.14/0.31  
% 0.14/0.31  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.14/0.31  
% 0.14/0.31  All clauses are units, and equality is present; the
% 0.14/0.31  strategy will be Knuth-Bendix with positive clauses in sos.
% 0.14/0.31  
% 0.14/0.31     dependent: set(knuth_bendix).
% 0.14/0.31     dependent: set(para_from).
% 0.14/0.31     dependent: set(para_into).
% 0.14/0.31     dependent: clear(para_from_right).
% 0.14/0.31     dependent: clear(para_into_right).
% 0.14/0.31     dependent: set(para_from_vars).
% 0.14/0.31     dependent: set(eq_units_both_ways).
% 0.14/0.31     dependent: set(dynamic_demod_all).
% 0.14/0.31     dependent: set(dynamic_demod).
% 0.14/0.31     dependent: set(order_eq).
% 0.14/0.31     dependent: set(back_demod).
% 0.14/0.31     dependent: set(lrpo).
% 0.14/0.31  
% 0.14/0.31  ------------> process usable:
% 0.14/0.31  
% 0.14/0.31  ------------> process sos:
% 0.14/0.31    Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] {-} A=A.
% 0.14/0.31    Following clause subsumed by 5 during input processing: 0 [copy,8,flip.1] {-} apply(apply(w,A),B)=apply(apply(A,B),B).
% 0.14/0.31    Following clause subsumed by 6 during input processing: 0 [copy,9,flip.1] {-} apply(m,A)=apply(A,A).
% 0.14/0.31  
% 0.14/0.31  ======= end of input processing =======
% 0.14/0.33  
% 0.14/0.33  Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.33  
% 0.14/0.33  Stopped by limit on number of solutions
% 0.14/0.33  
% 0.14/0.33  
% 0.14/0.33  -------------- Softie stats --------------
% 0.14/0.33  
% 0.14/0.33  UPDATE_STOP: 300
% 0.14/0.33  SFINDER_TIME_LIMIT: 2
% 0.14/0.33  SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.33  number of clauses in intial UL: 1
% 0.14/0.33  number of clauses initially in problem: 8
% 0.14/0.33  percentage of clauses intially in UL: 12
% 0.14/0.33  percentage of distinct symbols occuring in initial UL: 50
% 0.14/0.33  percent of all initial clauses that are short: 100
% 0.14/0.33  absolute distinct symbol count: 6
% 0.14/0.33     distinct predicate count: 1
% 0.14/0.33     distinct function count: 2
% 0.14/0.33     distinct constant count: 3
% 0.14/0.33  
% 0.14/0.33  ---------- no more Softie stats ----------
% 0.14/0.33  
% 0.14/0.33  
% 0.14/0.33  
% 0.14/0.33  =========== start of search ===========
% 0.14/0.35  
% 0.14/0.35  -------- PROOF -------- 
% 0.14/0.35  % SZS status Unsatisfiable
% 0.14/0.35  % SZS output start Refutation
% 0.14/0.35  
% 0.14/0.35  Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.35  
% 0.14/0.35  Stopped by limit on number of solutions
% 0.14/0.35  
% 0.14/0.35  ----> UNIT CONFLICT at   0.02 sec ----> 146 [binary,144.1,113.1] {-} $F.
% 0.14/0.35  
% 0.14/0.35  Length of proof is 8.  Level of proof is 4.
% 0.14/0.35  
% 0.14/0.35  ---------------- PROOF ----------------
% 0.14/0.35  % SZS status Unsatisfiable
% 0.14/0.35  % SZS output start Refutation
% 0.14/0.35  
% 0.14/0.35  1 [] {-} apply(A,f(A))!=apply(f(A),apply(A,f(A))).
% 0.14/0.35  2 [copy,1,flip.1] {+} apply(f(A),apply(A,f(A)))!=apply(A,f(A)).
% 0.14/0.35  4,3 [] {-} apply(apply(apply(b,A),B),C)=apply(A,apply(B,C)).
% 0.14/0.35  5 [] {-} apply(apply(w,A),B)=apply(apply(A,B),B).
% 0.14/0.35  6 [] {+} apply(m,A)=apply(A,A).
% 0.14/0.35  8 [copy,5,flip.1] {-} apply(apply(A,B),B)=apply(apply(w,A),B).
% 0.14/0.35  9 [copy,6,flip.1] {+} apply(A,A)=apply(m,A).
% 0.14/0.35  10 [para_from,3.1.1,2.1.1.2,demod,4] {-} apply(f(apply(apply(b,A),B)),apply(A,apply(B,f(apply(apply(b,A),B)))))!=apply(A,apply(B,f(apply(apply(b,A),B)))).
% 0.14/0.35  20 [para_into,8.1.1,3.1.1] {-} apply(A,apply(B,B))=apply(apply(w,apply(b,A)),B).
% 0.14/0.35  40 [para_into,20.1.1.2,9.1.1,flip.1] {-} apply(apply(w,apply(b,A)),B)=apply(A,apply(m,B)).
% 0.14/0.35  113 [para_into,10.1.1.2,3.1.1,demod,4] {-} apply(f(apply(apply(b,apply(apply(b,A),B)),C)),apply(A,apply(B,apply(C,f(apply(apply(b,apply(apply(b,A),B)),C))))))!=apply(A,apply(B,apply(C,f(apply(apply(b,apply(apply(b,A),B)),C))))).
% 0.14/0.35  144 [para_into,40.1.1,9.1.1,flip.1] {-} apply(A,apply(m,apply(w,apply(b,A))))=apply(m,apply(w,apply(b,A))).
% 0.14/0.35  146 [binary,144.1,113.1] {-} $F.
% 0.14/0.35  
% 0.14/0.35  % SZS output end Refutation
% 0.14/0.35  ------------ end of proof -------------
% 0.14/0.35  
% 0.14/0.35  
% 0.14/0.35  Search stopped by max_proofs option.
% 0.14/0.35  
% 0.14/0.35  
% 0.14/0.35  Search stopped by max_proofs option.
% 0.14/0.35  
% 0.14/0.35  ============ end of search ============
% 0.14/0.35  
% 0.14/0.35  ----------- soft-scott stats ----------
% 0.14/0.35  
% 0.14/0.35  true clauses given           4      (28.6%)
% 0.14/0.35  false clauses given         10
% 0.14/0.35  
% 0.14/0.35        FALSE     TRUE
% 0.14/0.35    11  0         9
% 0.14/0.35    13  6         3
% 0.14/0.35    15  6         8
% 0.14/0.35    17  27        0
% 0.14/0.35    19  1         5
% 0.14/0.35    21  3         0
% 0.14/0.35    25  3         1
% 0.14/0.35    28  1         7
% 0.14/0.35    33  2         0
% 0.14/0.35    35  1         0
% 0.14/0.35    36  0         2
% 0.14/0.35    44  6         0
% 0.14/0.35    45  1         0
% 0.14/0.35    47  1         0
% 0.14/0.35    53  1         0
% 0.14/0.35    55  1         0
% 0.14/0.35  tot:  60        35      (36.8% true)
% 0.14/0.35  
% 0.14/0.35  
% 0.14/0.35  Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.35  
% 0.14/0.35  That finishes the proof of the theorem.
% 0.14/0.35  
% 0.14/0.35  Process 24203 finished Tue May 31 12:52:58 2022
%------------------------------------------------------------------------------