↑ Up

SOS---2.0.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : COL070-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n023.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:11 EDT 2022

% Result   : Unsatisfiable 0.12s 0.37s
% Output   : Refutation 0.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : COL070-1 : TPTP v8.1.0. Released v1.2.0.
% 0.11/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n023.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue May 31 13:04:41 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.35  ----- Otter 3.2, August 2001 -----
% 0.12/0.35  The process was started by sandbox on n023.cluster.edu,
% 0.12/0.35  Tue May 31 13:04:41 2022
% 0.12/0.35  The command was "./sos".  The process ID is 16542.
% 0.12/0.35  
% 0.12/0.35  set(prolog_style_variables).
% 0.12/0.35  set(auto).
% 0.12/0.35     dependent: set(auto1).
% 0.12/0.35     dependent: set(process_input).
% 0.12/0.35     dependent: clear(print_kept).
% 0.12/0.35     dependent: clear(print_new_demod).
% 0.12/0.35     dependent: clear(print_back_demod).
% 0.12/0.35     dependent: clear(print_back_sub).
% 0.12/0.35     dependent: set(control_memory).
% 0.12/0.35     dependent: assign(max_mem, 12000).
% 0.12/0.35     dependent: assign(pick_given_ratio, 4).
% 0.12/0.35     dependent: assign(stats_level, 1).
% 0.12/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35     dependent: assign(sos_limit, 5000).
% 0.12/0.35     dependent: assign(max_weight, 60).
% 0.12/0.35  clear(print_given).
% 0.12/0.35  
% 0.12/0.35  list(usable).
% 0.12/0.35  
% 0.12/0.35  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.12/0.35  
% 0.12/0.35  All clauses are units, and equality is present; the
% 0.12/0.35  strategy will be Knuth-Bendix with positive clauses in sos.
% 0.12/0.35  
% 0.12/0.35     dependent: set(knuth_bendix).
% 0.12/0.35     dependent: set(para_from).
% 0.12/0.35     dependent: set(para_into).
% 0.12/0.35     dependent: clear(para_from_right).
% 0.12/0.35     dependent: clear(para_into_right).
% 0.12/0.35     dependent: set(para_from_vars).
% 0.12/0.35     dependent: set(eq_units_both_ways).
% 0.12/0.35     dependent: set(dynamic_demod_all).
% 0.12/0.35     dependent: set(dynamic_demod).
% 0.12/0.35     dependent: set(order_eq).
% 0.12/0.35     dependent: set(back_demod).
% 0.12/0.35     dependent: set(lrpo).
% 0.12/0.35  
% 0.12/0.35  ------------> process usable:
% 0.12/0.35  
% 0.12/0.35  ------------> process sos:
% 0.12/0.35    Following clause subsumed by 6 during input processing: 0 [copy,6,flip.1] {-} A=A.
% 0.12/0.35    Following clause subsumed by 3 during input processing: 0 [copy,7,flip.1] {-} apply(apply(apply(n1,A),B),C)=apply(apply(apply(A,B),B),C).
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.12/0.37  
% 0.12/0.37  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37  
% 0.12/0.37  Stopped by limit on number of solutions
% 0.12/0.37  
% 0.12/0.37  
% 0.12/0.37  -------------- Softie stats --------------
% 0.12/0.37  
% 0.12/0.37  UPDATE_STOP: 300
% 0.12/0.37  SFINDER_TIME_LIMIT: 2
% 0.12/0.37  SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.37  number of clauses in intial UL: 1
% 0.12/0.37  number of clauses initially in problem: 6
% 0.12/0.37  percentage of clauses intially in UL: 16
% 0.12/0.37  percentage of distinct symbols occuring in initial UL: 60
% 0.12/0.37  percent of all initial clauses that are short: 100
% 0.12/0.37  absolute distinct symbol count: 5
% 0.12/0.37     distinct predicate count: 1
% 0.12/0.37     distinct function count: 1
% 0.12/0.37     distinct constant count: 3
% 0.12/0.37  
% 0.12/0.37  ---------- no more Softie stats ----------
% 0.12/0.37  
% 0.12/0.37  
% 0.12/0.37  
% 0.12/0.37  =========== start of search ===========
% 0.12/0.37  
% 0.12/0.37  -------- PROOF -------- 
% 0.12/0.37  % SZS status Unsatisfiable
% 0.12/0.37  % SZS output start Refutation
% 0.12/0.37  
% 0.12/0.37  ----> UNIT CONFLICT at   0.01 sec ----> 97 [binary,96.1,2.1] {-} $F.
% 0.12/0.37  
% 0.12/0.37  Length of proof is 4.  Level of proof is 3.
% 0.12/0.37  
% 0.12/0.37  ---------------- PROOF ----------------
% 0.12/0.37  % SZS status Unsatisfiable
% 0.12/0.37  % SZS output start Refutation
% 0.12/0.37  
% 0.12/0.37  1 [] {-} A!=apply(combinator,A).
% 0.12/0.37  2 [copy,1,flip.1] {+} apply(combinator,A)!=A.
% 0.12/0.37  3 [] {-} apply(apply(apply(n1,A),B),C)=apply(apply(apply(A,B),B),C).
% 0.12/0.37  4 [] {-} apply(apply(apply(b,A),B),C)=apply(A,apply(B,C)).
% 0.12/0.37  7 [copy,3,flip.1] {-} apply(apply(apply(A,B),B),C)=apply(apply(apply(n1,A),B),C).
% 0.12/0.37  15 [para_into,7.1.1.1,4.1.1] {-} apply(apply(A,apply(B,B)),C)=apply(apply(apply(n1,apply(b,A)),B),C).
% 0.12/0.37  96 [para_into,15.1.1,4.1.1] {-} apply(A,apply(apply(B,B),C))=apply(apply(apply(n1,apply(b,apply(b,A))),B),C).
% 0.12/0.37  97 [binary,96.1,2.1] {-} $F.
% 0.12/0.37  
% 0.12/0.37  % SZS output end Refutation
% 0.12/0.37  ------------ end of proof -------------
% 0.12/0.37  
% 0.12/0.37  
% 0.12/0.37  Search stopped by max_proofs option.
% 0.12/0.37  
% 0.12/0.37  
% 0.12/0.37  Search stopped by max_proofs option.
% 0.12/0.37  
% 0.12/0.37  ============ end of search ============
% 0.12/0.37  
% 0.12/0.37  ----------- soft-scott stats ----------
% 0.12/0.37  
% 0.12/0.37  true clauses given           1      (10.0%)
% 0.12/0.37  false clauses given          9
% 0.12/0.37  
% 0.12/0.37        FALSE     TRUE
% 0.12/0.37    17  3         1
% 0.12/0.37    19  6         2
% 0.12/0.37    21  6         0
% 0.12/0.37    23  3         1
% 0.12/0.37    25  1         0
% 0.12/0.37    27  5         0
% 0.12/0.37    29  2         0
% 0.12/0.37    31  2         1
% 0.12/0.37    39  1         0
% 0.12/0.37  tot:  29        5      (14.7% true)
% 0.12/0.37  
% 0.12/0.37  
% 0.12/0.37  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37  
% 0.12/0.37  That finishes the proof of the theorem.
% 0.12/0.37  
% 0.12/0.37  Process 16542 finished Tue May 31 13:04:41 2022
%------------------------------------------------------------------------------