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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SEU247+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n012.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 : Tue Jul 19 14:28:07 EDT 2022

% Result   : Theorem 0.19s 0.58s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU247+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n012.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 : Sun Jun 19 18:16:52 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 n012.cluster.edu,
% 0.12/0.35  Sun Jun 19 18:16:52 2022
% 0.12/0.35  The command was "./sos".  The process ID is 8437.
% 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  formula_list(usable).
% 0.12/0.35  
% 0.12/0.35  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 0.12/0.35  
% 0.12/0.35  This is a Horn set with equality.  The strategy will be
% 0.12/0.35  Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.35  sos and nonpositive clauses in usable.
% 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     dependent: set(hyper_res).
% 0.12/0.35     dependent: clear(order_hyper).
% 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 12 during input processing: 0 [copy,12,flip.1] {-} set_intersection2(A,B)=set_intersection2(B,A).
% 0.12/0.35    Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] {-} A=A.
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.12/0.39  
% 0.12/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39  
% 0.12/0.39  Stopped by limit on number of solutions
% 0.12/0.39  
% 0.12/0.39  
% 0.12/0.39  -------------- Softie stats --------------
% 0.12/0.39  
% 0.12/0.39  UPDATE_STOP: 300
% 0.12/0.39  SFINDER_TIME_LIMIT: 2
% 0.12/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39  number of clauses in intial UL: 7
% 0.12/0.39  number of clauses initially in problem: 12
% 0.12/0.39  percentage of clauses intially in UL: 58
% 0.12/0.39  percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.39  percent of all initial clauses that are short: 91
% 0.12/0.39  absolute distinct symbol count: 9
% 0.12/0.39     distinct predicate count: 2
% 0.12/0.39     distinct function count: 5
% 0.12/0.39     distinct constant count: 2
% 0.12/0.39  
% 0.12/0.39  ---------- no more Softie stats ----------
% 0.12/0.39  
% 0.12/0.39  
% 0.12/0.39  
% 0.12/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39  
% 0.12/0.39  Stopped by limit on number of solutions
% 0.12/0.39  
% 0.12/0.39  =========== start of search ===========
% 0.19/0.58  
% 0.19/0.58  -------- PROOF -------- 
% 0.19/0.58  % SZS status Theorem
% 0.19/0.58  % SZS output start Refutation
% 0.19/0.58  
% 0.19/0.58  Stopped by limit on insertions
% 0.19/0.58  
% 0.19/0.58  ----> UNIT CONFLICT at   0.21 sec ----> 28 [binary,27.1,16.1] {-} $F.
% 0.19/0.58  
% 0.19/0.58  Length of proof is 6.  Level of proof is 3.
% 0.19/0.58  
% 0.19/0.58  ---------------- PROOF ----------------
% 0.19/0.58  % SZS status Theorem
% 0.19/0.58  % SZS output start Refutation
% 0.19/0.58  
% 0.19/0.58  6 [] {-} -relation(A)|relation_dom_restriction(relation_rng_restriction(B,A),C)=relation_rng_restriction(B,relation_dom_restriction(A,C)).
% 0.19/0.58  7 [copy,6,flip.2] {+} -relation(A)|relation_rng_restriction(B,relation_dom_restriction(A,C))=relation_dom_restriction(relation_rng_restriction(B,A),C).
% 0.19/0.58  8 [] {-} -relation(A)|relation_restriction(A,B)=relation_dom_restriction(relation_rng_restriction(B,A),B).
% 0.19/0.58  9 [copy,8,flip.2] {+} -relation(A)|relation_dom_restriction(relation_rng_restriction(B,A),B)=relation_restriction(A,B).
% 0.19/0.58  10 [] {-} relation_restriction($c1,$c2)!=relation_rng_restriction($c2,relation_dom_restriction($c1,$c2)).
% 0.19/0.58  11 [copy,10,flip.1] {+} relation_rng_restriction($c2,relation_dom_restriction($c1,$c2))!=relation_restriction($c1,$c2).
% 0.19/0.58  15 [] {-} relation($c1).
% 0.19/0.58  16 [] {+} A=A.
% 0.19/0.58  19,18 [hyper,15,9] {-} relation_dom_restriction(relation_rng_restriction(A,$c1),A)=relation_restriction($c1,A).
% 0.19/0.58  21,20 [hyper,15,7] {-} relation_rng_restriction(A,relation_dom_restriction($c1,B))=relation_dom_restriction(relation_rng_restriction(A,$c1),B).
% 0.19/0.58  27 [back_demod,11,demod,21,19] {-} relation_restriction($c1,$c2)!=relation_restriction($c1,$c2).
% 0.19/0.58  28 [binary,27.1,16.1] {-} $F.
% 0.19/0.58  
% 0.19/0.58  % SZS output end Refutation
% 0.19/0.58  ------------ end of proof -------------
% 0.19/0.58  
% 0.19/0.58  
% 0.19/0.58  Search stopped by max_proofs option.
% 0.19/0.58  
% 0.19/0.58  
% 0.19/0.58  Search stopped by max_proofs option.
% 0.19/0.58  
% 0.19/0.58  ============ end of search ============
% 0.19/0.58  
% 0.19/0.58  ----------- soft-scott stats ----------
% 0.19/0.58  
% 0.19/0.58  true clauses given           0      (0.0%)
% 0.19/0.58  false clauses given          2
% 0.19/0.58  
% 0.19/0.58        FALSE     TRUE
% 0.19/0.58     3  0         1
% 0.19/0.58     5  1         0
% 0.19/0.58    11  0         1
% 0.19/0.58  tot:  1         2      (66.7% true)
% 0.19/0.58  
% 0.19/0.58  
% 0.19/0.58  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.58  
% 0.19/0.58  That finishes the proof of the theorem.
% 0.19/0.58  
% 0.19/0.58  Process 8437 finished Sun Jun 19 18:16:53 2022
%------------------------------------------------------------------------------