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

View Problem - Process Solution

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

% Computer : n017.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:40:58 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP007-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12  % Command  : sos-script %s
% 0.12/0.34  % Computer : n017.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jun 13 22:22:23 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.36  ----- Otter 3.2, August 2001 -----
% 0.12/0.36  The process was started by sandbox2 on n017.cluster.edu,
% 0.12/0.36  Mon Jun 13 22:22:23 2022
% 0.12/0.36  The command was "./sos".  The process ID is 30919.
% 0.12/0.36  
% 0.12/0.36  set(prolog_style_variables).
% 0.12/0.36  set(auto).
% 0.12/0.36     dependent: set(auto1).
% 0.12/0.36     dependent: set(process_input).
% 0.12/0.36     dependent: clear(print_kept).
% 0.12/0.36     dependent: clear(print_new_demod).
% 0.12/0.36     dependent: clear(print_back_demod).
% 0.12/0.36     dependent: clear(print_back_sub).
% 0.12/0.36     dependent: set(control_memory).
% 0.12/0.36     dependent: assign(max_mem, 12000).
% 0.12/0.36     dependent: assign(pick_given_ratio, 4).
% 0.12/0.36     dependent: assign(stats_level, 1).
% 0.12/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36     dependent: assign(sos_limit, 5000).
% 0.12/0.36     dependent: assign(max_weight, 60).
% 0.12/0.36  clear(print_given).
% 0.12/0.36  
% 0.12/0.36  list(usable).
% 0.12/0.36  
% 0.12/0.36  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 0.12/0.36  
% 0.12/0.36  This is a Horn set with equality.  The strategy will be
% 0.12/0.36  Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.36  sos and nonpositive clauses in usable.
% 0.12/0.36  
% 0.12/0.36     dependent: set(knuth_bendix).
% 0.12/0.36     dependent: set(para_from).
% 0.12/0.36     dependent: set(para_into).
% 0.12/0.36     dependent: clear(para_from_right).
% 0.12/0.36     dependent: clear(para_into_right).
% 0.12/0.36     dependent: set(para_from_vars).
% 0.12/0.36     dependent: set(eq_units_both_ways).
% 0.12/0.36     dependent: set(dynamic_demod_all).
% 0.12/0.36     dependent: set(dynamic_demod).
% 0.12/0.36     dependent: set(order_eq).
% 0.12/0.36     dependent: set(back_demod).
% 0.12/0.36     dependent: set(lrpo).
% 0.12/0.36     dependent: set(hyper_res).
% 0.12/0.36     dependent: clear(order_hyper).
% 0.12/0.36  
% 0.12/0.36  ------------> process usable:
% 0.12/0.36  
% 0.12/0.36  ------------> process sos:
% 0.12/0.36    Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.12/0.36  
% 0.12/0.36  ======= 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: 4
% 0.20/0.40  number of clauses initially in problem: 12
% 0.20/0.40  percentage of clauses intially in UL: 33
% 0.20/0.40  percentage of distinct symbols occuring in initial UL: 66
% 0.20/0.40  percent of all initial clauses that are short: 100
% 0.20/0.40  absolute distinct symbol count: 6
% 0.20/0.40     distinct predicate count: 2
% 0.20/0.40     distinct function count: 2
% 0.20/0.40     distinct constant count: 2
% 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.43  
% 0.20/0.43  -------- PROOF -------- 
% 0.20/0.43  % SZS status Unsatisfiable
% 0.20/0.43  % SZS output start Refutation
% 0.20/0.43  
% 0.20/0.43  Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.43  
% 0.20/0.43  Stopped by limit on number of solutions
% 0.20/0.43  
% 0.20/0.43  Model 4 [ 1 1 199 ] (0.00 seconds, 1538 Inserts)
% 0.20/0.43  
% 0.20/0.43  ----> UNIT CONFLICT at   0.05 sec ----> 19 [binary,17.1,4.1] {-} $F.
% 0.20/0.43  
% 0.20/0.43  Length of proof is 1.  Level of proof is 1.
% 0.20/0.43  
% 0.20/0.43  ---------------- PROOF ----------------
% 0.20/0.43  % SZS status Unsatisfiable
% 0.20/0.43  % SZS output start Refutation
% 0.20/0.43  
% 0.20/0.43  1 [] {+} -product(A,B,C)| -product(A,B,D)|C=D.
% 0.20/0.43  4 [] {+} identity!=c.
% 0.20/0.43  6 [] {+} product(A,identity,A).
% 0.20/0.43  10 [] {+} product(c,A,A).
% 0.20/0.43  17 [hyper,6,1,10] {-} identity=c.
% 0.20/0.43  19 [binary,17.1,4.1] {-} $F.
% 0.20/0.43  
% 0.20/0.43  % SZS output end Refutation
% 0.20/0.43  ------------ end of proof -------------
% 0.20/0.43  
% 0.20/0.43  
% 0.20/0.43  Search stopped by max_proofs option.
% 0.20/0.43  
% 0.20/0.43  
% 0.20/0.43  Search stopped by max_proofs option.
% 0.20/0.43  
% 0.20/0.43  ============ end of search ============
% 0.20/0.43  
% 0.20/0.43  ----------- soft-scott stats ----------
% 0.20/0.43  
% 0.20/0.43  true clauses given           0      (0.0%)
% 0.20/0.43  false clauses given          3
% 0.20/0.43  
% 0.20/0.43        FALSE     TRUE
% 0.20/0.43     3  0         1
% 0.20/0.43     4  1         0
% 0.20/0.43     5  2         0
% 0.20/0.43     6  1         0
% 0.20/0.43    12  1         1
% 0.20/0.43  tot:  5         2      (28.6% true)
% 0.20/0.43  
% 0.20/0.43  
% 0.20/0.43  Model 4 [ 1 1 199 ] (0.00 seconds, 1538 Inserts)
% 0.20/0.43  
% 0.20/0.43  That finishes the proof of the theorem.
% 0.20/0.43  
% 0.20/0.43  Process 30919 finished Mon Jun 13 22:22:23 2022
%------------------------------------------------------------------------------