TSTP Solution File: CSR041-10 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : CSR041-10 : TPTP v8.1.0. Released v7.5.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 23:21:25 EDT 2022

% Result   : Unsatisfiable 0.76s 0.94s
% Output   : Refutation 0.76s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : CSR041-10 : TPTP v8.1.0. Released v7.5.0.
% 0.12/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n023.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 : Sat Jun 11 05:36:37 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.37  ----- Otter 3.2, August 2001 -----
% 0.20/0.37  The process was started by sandbox2 on n023.cluster.edu,
% 0.20/0.37  Sat Jun 11 05:36:37 2022
% 0.20/0.37  The command was "./sos".  The process ID is 28417.
% 0.20/0.37  
% 0.20/0.37  set(prolog_style_variables).
% 0.20/0.37  set(auto).
% 0.20/0.37     dependent: set(auto1).
% 0.20/0.37     dependent: set(process_input).
% 0.20/0.37     dependent: clear(print_kept).
% 0.20/0.37     dependent: clear(print_new_demod).
% 0.20/0.37     dependent: clear(print_back_demod).
% 0.20/0.37     dependent: clear(print_back_sub).
% 0.20/0.37     dependent: set(control_memory).
% 0.20/0.37     dependent: assign(max_mem, 12000).
% 0.20/0.37     dependent: assign(pick_given_ratio, 4).
% 0.20/0.37     dependent: assign(stats_level, 1).
% 0.20/0.37     dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.37     dependent: assign(sos_limit, 5000).
% 0.20/0.37     dependent: assign(max_weight, 60).
% 0.20/0.37  clear(print_given).
% 0.20/0.37  
% 0.20/0.37  list(usable).
% 0.20/0.37  
% 0.20/0.37  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.20/0.37  
% 0.20/0.37  All clauses are units, and equality is present; the
% 0.20/0.37  strategy will be Knuth-Bendix with positive clauses in sos.
% 0.20/0.37  
% 0.20/0.37     dependent: set(knuth_bendix).
% 0.20/0.37     dependent: set(para_from).
% 0.20/0.37     dependent: set(para_into).
% 0.20/0.37     dependent: clear(para_from_right).
% 0.20/0.37     dependent: clear(para_into_right).
% 0.20/0.37     dependent: set(para_from_vars).
% 0.20/0.37     dependent: set(eq_units_both_ways).
% 0.20/0.37     dependent: set(dynamic_demod_all).
% 0.20/0.37     dependent: set(dynamic_demod).
% 0.20/0.37     dependent: set(order_eq).
% 0.20/0.37     dependent: set(back_demod).
% 0.20/0.37     dependent: set(lrpo).
% 0.20/0.37  
% 0.20/0.37  ------------> process usable:
% 0.20/0.37  
% 0.20/0.37  ------------> process sos:
% 0.20/0.37    Following clause subsumed by 38 during input processing: 0 [demod,40] {-} true=true.
% 0.20/0.37    Following clause subsumed by 38 during input processing: 0 [demod,44] {-} true=true.
% 0.20/0.37    Following clause subsumed by 38 during input processing: 0 [demod,90] {-} true=true.
% 0.20/0.37    Following clause subsumed by 38 during input processing: 0 [demod,92] {-} true=true.
% 0.20/0.37    Following clause subsumed by 38 during input processing: 0 [demod,98] {-} true=true.
% 0.20/0.37    Following clause subsumed by 38 during input processing: 0 [demod,100] {-} true=true.
% 0.20/0.37    Following clause subsumed by 38 during input processing: 0 [demod,104] {-} true=true.
% 0.20/0.37    Following clause subsumed by 38 during input processing: 0 [demod,118] {-} true=true.
% 0.20/0.37    Following clause subsumed by 38 during input processing: 0 [demod,120] {-} true=true.
% 0.20/0.37    Following clause subsumed by 38 during input processing: 0 [demod,124] {-} true=true.
% 0.20/0.37    Following clause subsumed by 38 during input processing: 0 [demod,122] {-} true=true.
% 0.20/0.37    Following clause subsumed by 135 during input processing: 0 [copy,38,flip.1] {-} true=true.
% 0.20/0.37    Following clause subsumed by 135 during input processing: 0 [copy,135,flip.1] {-} A=A.
% 0.20/0.37  135 back subsumes 38.
% 0.20/0.37  
% 0.20/0.37  ======= end of input processing =======
% 0.20/0.42  
% 0.20/0.42  Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.42  
% 0.20/0.42  Stopped by limit on number of solutions
% 0.20/0.42  
% 0.20/0.42  
% 0.20/0.42  -------------- Softie stats --------------
% 0.20/0.42  
% 0.20/0.42  UPDATE_STOP: 300
% 0.20/0.42  SFINDER_TIME_LIMIT: 2
% 0.20/0.42  SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.42  number of clauses in intial UL: 1
% 0.20/0.42  number of clauses initially in problem: 130
% 0.20/0.42  percentage of clauses intially in UL: 0
% 0.20/0.42  percentage of distinct symbols occuring in initial UL: 6
% 0.20/0.42  percent of all initial clauses that are short: 100
% 0.20/0.42  absolute distinct symbol count: 49
% 0.20/0.42     distinct predicate count: 1
% 0.20/0.42     distinct function count: 26
% 0.20/0.42     distinct constant count: 22
% 0.20/0.42  
% 0.20/0.42  ---------- no more Softie stats ----------
% 0.20/0.42  
% 0.20/0.42  
% 0.20/0.42  
% 0.20/0.42  Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.42  
% 0.20/0.42  Stopped by limit on number of solutions
% 0.20/0.42  
% 0.20/0.42  =========== start of search ===========
% 0.76/0.94  
% 0.76/0.94  -------- PROOF -------- 
% 0.76/0.94  % SZS status Unsatisfiable
% 0.76/0.94  % SZS output start Refutation
% 0.76/0.94  
% 0.76/0.94  Model 3 (0.00 seconds, 0 Inserts)
% 0.76/0.94  
% 0.76/0.94  Stopped by limit on number of solutions
% 0.76/0.94  
% 0.76/0.94  Model 4 (0.00 seconds, 0 Inserts)
% 0.76/0.94  
% 0.76/0.94  Stopped by limit on number of solutions
% 0.76/0.94  
% 0.76/0.94  Model 5 (0.00 seconds, 0 Inserts)
% 0.76/0.94  
% 0.76/0.94  Stopped by limit on number of solutions
% 0.76/0.94  
% 0.76/0.94  Model 6 (0.00 seconds, 0 Inserts)
% 0.76/0.94  
% 0.76/0.94  Stopped by limit on number of solutions
% 0.76/0.94  
% 0.76/0.94  Model 7 (0.00 seconds, 0 Inserts)
% 0.76/0.94  
% 0.76/0.94  Stopped by limit on number of solutions
% 0.76/0.94  
% 0.76/0.94  Stopped by limit on insertions
% 0.76/0.94  
% 0.76/0.94  Model 8 [ 2 1 502 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.94  
% 0.76/0.94  Model 9 (0.00 seconds, 250000 Inserts)
% 0.76/0.94  
% 0.76/0.94  Stopped by limit on number of solutions
% 0.76/0.94  
% 0.76/0.94  Stopped by limit on insertions
% 0.76/0.94  
% 0.76/0.94  Model 10 [ 1 1 1462 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.94  
% 0.76/0.94  Stopped by limit on insertions
% 0.76/0.94  
% 0.76/0.94  Model 11 [ 7 1 2206 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.94  
% 0.76/0.94  ----> UNIT CONFLICT at   0.55 sec ----> 142 [binary,140.1,2.1] {-} $F.
% 0.76/0.94  
% 0.76/0.94  Length of proof is 4.  Level of proof is 3.
% 0.76/0.94  
% 0.76/0.94  ---------------- PROOF ----------------
% 0.76/0.94  % SZS status Unsatisfiable
% 0.76/0.94  % SZS output start Refutation
% 0.76/0.94  
% 0.76/0.94  1 [] {-} a!=b.
% 0.76/0.94  2 [copy,1,flip.1] {+} b!=a.
% 0.76/0.94  4,3 [] {+} ifeq3(A,A,B,C)=B.
% 0.76/0.94  6,5 [] {+} ifeq2(A,A,B,C)=B.
% 0.76/0.94  11 [] {-} ifeq3(aspatialinformationstore(A),true,aspatialthing(A),true)=true.
% 0.76/0.94  15 [] {-} ifeq3(microtheory(A),true,aspatialinformationstore(A),true)=true.
% 0.76/0.94  83 [] {+} microtheory(f_contentmtofcdafromeventfn(A,B))=true.
% 0.76/0.94  133 [] {-} ifeq2(aspatialthing(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_wwwinformationblastcomtechnical_university_of_munichhtml)),c_translation_3)),true,a,b)=b.
% 0.76/0.94  136 [para_into,15.1.1.1,83.1.1,demod,4] {+} aspatialinformationstore(f_contentmtofcdafromeventfn(A,B))=true.
% 0.76/0.94  139,138 [para_from,136.1.1,11.1.1.1,demod,4] {-} aspatialthing(f_contentmtofcdafromeventfn(A,B))=true.
% 0.76/0.94  140 [back_demod,133,demod,139,6,flip.1] {-} b=a.
% 0.76/0.94  142 [binary,140.1,2.1] {-} $F.
% 0.76/0.94  
% 0.76/0.94  % SZS output end Refutation
% 0.76/0.94  ------------ end of proof -------------
% 0.76/0.94  
% 0.76/0.94  
% 0.76/0.94  Search stopped by max_proofs option.
% 0.76/0.94  
% 0.76/0.94  
% 0.76/0.94  Search stopped by max_proofs option.
% 0.76/0.94  
% 0.76/0.94  ============ end of search ============
% 0.76/0.94  
% 0.76/0.94  ----------- soft-scott stats ----------
% 0.76/0.94  
% 0.76/0.94  true clauses given           3      (11.1%)
% 0.76/0.94  false clauses given         24
% 0.76/0.94  
% 0.76/0.94        FALSE     TRUE
% 0.76/0.94     8  2         0
% 0.76/0.94    10  23        0
% 0.76/0.94    11  1         0
% 0.76/0.94    12  1         0
% 0.76/0.94    15  1         0
% 0.76/0.94    17  10        0
% 0.76/0.94    19  1         0
% 0.76/0.94  tot:  39        0      (0.0% true)
% 0.76/0.94  
% 0.76/0.94  
% 0.76/0.94  Model 11 [ 7 1 2206 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.94  
% 0.76/0.94  That finishes the proof of the theorem.
% 0.76/0.94  
% 0.76/0.94  Process 28417 finished Sat Jun 11 05:36:37 2022
%------------------------------------------------------------------------------