TSTP Solution File: GRP189-2 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GRP189-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n021.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 : Sat Jul 16 11:42:12 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP189-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n021.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 Jun 14 06:08:27 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.36  ----- Otter 3.2, August 2001 -----
% 0.13/0.36  The process was started by sandbox on n021.cluster.edu,
% 0.13/0.36  Tue Jun 14 06:08:27 2022
% 0.13/0.36  The command was "./sos".  The process ID is 14544.
% 0.13/0.36  
% 0.13/0.36  set(prolog_style_variables).
% 0.13/0.36  set(auto).
% 0.13/0.36     dependent: set(auto1).
% 0.13/0.36     dependent: set(process_input).
% 0.13/0.36     dependent: clear(print_kept).
% 0.13/0.36     dependent: clear(print_new_demod).
% 0.13/0.36     dependent: clear(print_back_demod).
% 0.13/0.36     dependent: clear(print_back_sub).
% 0.13/0.36     dependent: set(control_memory).
% 0.13/0.36     dependent: assign(max_mem, 12000).
% 0.13/0.36     dependent: assign(pick_given_ratio, 4).
% 0.13/0.36     dependent: assign(stats_level, 1).
% 0.13/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36     dependent: assign(sos_limit, 5000).
% 0.13/0.36     dependent: assign(max_weight, 60).
% 0.13/0.36  clear(print_given).
% 0.13/0.36  
% 0.13/0.36  list(usable).
% 0.13/0.36  
% 0.13/0.36  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.13/0.36  
% 0.13/0.36  All clauses are units, and equality is present; the
% 0.13/0.36  strategy will be Knuth-Bendix with positive clauses in sos.
% 0.13/0.36  
% 0.13/0.36     dependent: set(knuth_bendix).
% 0.13/0.36     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 8 during input processing: 0 [copy,8,flip.1] {-} greatest_lower_bound(A,B)=greatest_lower_bound(B,A).
% 0.13/0.37    Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] {-} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.13/0.37    Following clause subsumed by 38 during input processing: 0 [copy,38,flip.1] {-} 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: 36
% 0.20/0.40  percentage of clauses intially in UL: 2
% 0.20/0.40  percentage of distinct symbols occuring in initial UL: 62
% 0.20/0.40  percent of all initial clauses that are short: 100
% 0.20/0.40  absolute distinct symbol count: 8
% 0.20/0.40     distinct predicate count: 1
% 0.20/0.40     distinct function count: 4
% 0.20/0.40     distinct constant count: 3
% 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.44  
% 0.20/0.44  -------- PROOF -------- 
% 0.20/0.44  % SZS status Unsatisfiable
% 0.20/0.44  % SZS output start Refutation
% 0.20/0.44  
% 0.20/0.44  Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.44  
% 0.20/0.44  Stopped by limit on number of solutions
% 0.20/0.44  
% 0.20/0.44  Model 4 (0.00 seconds, 0 Inserts)
% 0.20/0.44  
% 0.20/0.44  Stopped by limit on number of solutions
% 0.20/0.44  
% 0.20/0.44  Model 5 (0.00 seconds, 0 Inserts)
% 0.20/0.44  
% 0.20/0.44  Stopped by limit on number of solutions
% 0.20/0.44  
% 0.20/0.44  Model 6 (0.00 seconds, 0 Inserts)
% 0.20/0.44  
% 0.20/0.44  Stopped by limit on number of solutions
% 0.20/0.44  
% 0.20/0.44  Model 7 (0.00 seconds, 0 Inserts)
% 0.20/0.44  
% 0.20/0.44  Stopped by limit on number of solutions
% 0.20/0.44  
% 0.20/0.44  Model 8 (0.00 seconds, 0 Inserts)
% 0.20/0.44  
% 0.20/0.44  Stopped by limit on number of solutions
% 0.20/0.44  
% 0.20/0.44  ----> UNIT CONFLICT at   0.05 sec ----> 41 [binary,40.1,38.1] {-} $F.
% 0.20/0.44  
% 0.20/0.44  Length of proof is 1.  Level of proof is 1.
% 0.20/0.44  
% 0.20/0.44  ---------------- PROOF ----------------
% 0.20/0.44  % SZS status Unsatisfiable
% 0.20/0.44  % SZS output start Refutation
% 0.20/0.44  
% 0.20/0.44  1 [] {+} greatest_lower_bound(b,least_upper_bound(a,b))!=b.
% 0.20/0.44  9 [] {+} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.20/0.44  23,22 [] {-} greatest_lower_bound(A,least_upper_bound(A,B))=A.
% 0.20/0.44  38 [] {+} A=A.
% 0.20/0.44  40 [para_from,9.1.1,1.1.1.2,demod,23] {-} b!=b.
% 0.20/0.44  41 [binary,40.1,38.1] {-} $F.
% 0.20/0.44  
% 0.20/0.44  % SZS output end Refutation
% 0.20/0.44  ------------ end of proof -------------
% 0.20/0.44  
% 0.20/0.44  
% 0.20/0.44  Search stopped by max_proofs option.
% 0.20/0.44  
% 0.20/0.44  
% 0.20/0.44  Search stopped by max_proofs option.
% 0.20/0.44  
% 0.20/0.44  ============ end of search ============
% 0.20/0.44  
% 0.20/0.44  ----------- soft-scott stats ----------
% 0.20/0.44  
% 0.20/0.44  true clauses given           1      (12.5%)
% 0.20/0.44  false clauses given          7
% 0.20/0.44  
% 0.20/0.44        FALSE     TRUE
% 0.20/0.44     5  0         1
% 0.20/0.44     7  2         1
% 0.20/0.44    10  1         0
% 0.20/0.44    11  3         0
% 0.20/0.44    13  4         0
% 0.20/0.44  tot:  10        2      (16.7% true)
% 0.20/0.44  
% 0.20/0.44  
% 0.20/0.44  Model 8 (0.00 seconds, 0 Inserts)
% 0.20/0.44  
% 0.20/0.44  That finishes the proof of the theorem.
% 0.20/0.44  
% 0.20/0.44  Process 14544 finished Tue Jun 14 06:08:27 2022
%------------------------------------------------------------------------------