↑ Up

SOS---2.0.UNS-Ref.s

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

% Computer : n015.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:41:53 EDT 2022

% Result   : Unsatisfiable 1.05s 1.25s
% Output   : Refutation 1.05s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GRP135-2.002 : TPTP v8.1.0. Released v1.2.0.
% 0.12/0.13  % Command  : sos-script %s
% 0.12/0.34  % Computer : n015.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 : Tue Jun 14 12:37:24 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.35  ----- Otter 3.2, August 2001 -----
% 0.19/0.35  The process was started by sandbox2 on n015.cluster.edu,
% 0.19/0.35  Tue Jun 14 12:37:24 2022
% 0.19/0.35  The command was "./sos".  The process ID is 17836.
% 0.19/0.35  
% 0.19/0.35  set(prolog_style_variables).
% 0.19/0.35  set(auto).
% 0.19/0.35     dependent: set(auto1).
% 0.19/0.35     dependent: set(process_input).
% 0.19/0.35     dependent: clear(print_kept).
% 0.19/0.35     dependent: clear(print_new_demod).
% 0.19/0.35     dependent: clear(print_back_demod).
% 0.19/0.35     dependent: clear(print_back_sub).
% 0.19/0.35     dependent: set(control_memory).
% 0.19/0.35     dependent: assign(max_mem, 12000).
% 0.19/0.35     dependent: assign(pick_given_ratio, 4).
% 0.19/0.35     dependent: assign(stats_level, 1).
% 0.19/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35     dependent: assign(sos_limit, 5000).
% 0.19/0.35     dependent: assign(max_weight, 60).
% 0.19/0.35  clear(print_given).
% 0.19/0.35  
% 0.19/0.35  list(usable).
% 0.19/0.35  
% 0.19/0.35  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.19/0.35  
% 0.19/0.35  This ia a non-Horn set with equality.  The strategy will be
% 0.19/0.35  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.35  unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.35  clauses in usable.
% 0.19/0.35  
% 0.19/0.35     dependent: set(knuth_bendix).
% 0.19/0.35     dependent: set(para_from).
% 0.19/0.35     dependent: set(para_into).
% 0.19/0.35     dependent: clear(para_from_right).
% 0.19/0.35     dependent: clear(para_into_right).
% 0.19/0.35     dependent: set(para_from_vars).
% 0.19/0.35     dependent: set(eq_units_both_ways).
% 0.19/0.35     dependent: set(dynamic_demod_all).
% 0.19/0.35     dependent: set(dynamic_demod).
% 0.19/0.35     dependent: set(order_eq).
% 0.19/0.35     dependent: set(back_demod).
% 0.19/0.35     dependent: set(lrpo).
% 0.19/0.35     dependent: set(hyper_res).
% 0.19/0.35     dependent: set(unit_deletion).
% 0.19/0.35     dependent: set(factor).
% 0.19/0.35  
% 0.19/0.35  ------------> process usable:
% 0.19/0.35    Following clause subsumed by 3 during input processing: 0 [] {-} -equalish(e_2,e_1).
% 0.19/0.35  
% 0.19/0.35  ------------> process sos:
% 0.19/0.35  
% 0.19/0.35  ======= end of input processing =======
% 0.19/0.38  
% 0.19/0.38  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38  
% 0.19/0.38  Stopped by limit on number of solutions
% 0.19/0.38  
% 0.19/0.38  
% 0.19/0.38  -------------- Softie stats --------------
% 0.19/0.38  
% 0.19/0.38  UPDATE_STOP: 300
% 0.19/0.38  SFINDER_TIME_LIMIT: 2
% 0.19/0.38  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38  number of clauses in intial UL: 11
% 0.19/0.38  number of clauses initially in problem: 15
% 0.19/0.38  percentage of clauses intially in UL: 73
% 0.19/0.38  percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.38  percent of all initial clauses that are short: 100
% 0.19/0.38  absolute distinct symbol count: 7
% 0.19/0.38     distinct predicate count: 5
% 0.19/0.38     distinct function count: 0
% 0.19/0.38     distinct constant count: 2
% 0.19/0.38  
% 0.19/0.38  ---------- no more Softie stats ----------
% 0.19/0.38  
% 0.19/0.38  
% 0.19/0.38  
% 0.19/0.38  =========== start of search ===========
% 1.05/1.25  
% 1.05/1.25  -------- PROOF -------- 
% 1.05/1.25  % SZS status Unsatisfiable
% 1.05/1.25  % SZS output start Refutation
% 1.05/1.25  
% 1.05/1.25  Model 2 (0.00 seconds, 0 Inserts)
% 1.05/1.25  
% 1.05/1.25  Stopped by limit on number of solutions
% 1.05/1.25  
% 1.05/1.25  Stopped by limit on insertions
% 1.05/1.25  
% 1.05/1.25  Model 3 [ 1 0 275 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.25  
% 1.05/1.25  Stopped by limit on insertions
% 1.05/1.25  
% 1.05/1.25  Model 4 [ 1 1 89 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.25  
% 1.05/1.25  Stopped by limit on insertions
% 1.05/1.25  
% 1.05/1.25  Model 5 [ 1 0 213 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.25  
% 1.05/1.25  Stopped by limit on insertions
% 1.05/1.25  
% 1.05/1.25  Model 6 [ 2 1 180 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.25  
% 1.05/1.25  Stopped by limit on insertions
% 1.05/1.25  
% 1.05/1.25  Model 7 [ 2 0 262 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.25  
% 1.05/1.25  Stopped by limit on insertions
% 1.05/1.25  
% 1.05/1.25  Model 8 [ 2 0 140 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.25  
% 1.05/1.25  Stopped by limit on insertions
% 1.05/1.25  
% 1.05/1.25  Model 9 [ 3 3 204911 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.25  
% 1.05/1.25  Stopped by limit on insertions
% 1.05/1.25  
% 1.05/1.25  Model 10 [ 2 0 274 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.25  
% 1.05/1.25  Stopped by limit on insertions
% 1.05/1.25  
% 1.05/1.25  Model 11 [ 4 1 870 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.25  
% 1.05/1.25  Stopped by limit on insertions
% 1.05/1.25  
% 1.05/1.25  Model 12 [ 5 0 375 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.25  
% 1.05/1.25  ----> UNIT CONFLICT at   0.88 sec ----> 258 [binary,256.1,3.1] {-} $F.
% 1.05/1.25  
% 1.05/1.25  Length of proof is 10.  Level of proof is 7.
% 1.05/1.25  
% 1.05/1.25  ---------------- PROOF ----------------
% 1.05/1.25  % SZS status Unsatisfiable
% 1.05/1.25  % SZS output start Refutation
% 1.05/1.25  
% 1.05/1.25  2 [] {-} -equalish(e_1,e_2).
% 1.05/1.25  3 [copy,2,flip.1] {+} -equalish(e_2,e_1).
% 1.05/1.25  4 [] {+} -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2).
% 1.05/1.25  7 [] {+} -product(A,B,C)| -product(D,B,C)|equalish(A,D).
% 1.05/1.25  8 [] {+} -product(A,B,C)| -product(C,A,D)|product(D,A,B).
% 1.05/1.25  9 [factor,4.1.2] {+} -group_element(A)|product(A,A,e_1)|product(A,A,e_2).
% 1.05/1.25  15 [] {+} group_element(e_1).
% 1.05/1.25  16 [] {+} group_element(e_2).
% 1.05/1.25  23 [hyper,15,9] {+} product(e_1,e_1,e_1)|product(e_1,e_1,e_2).
% 1.05/1.25  27 [hyper,16,9] {+} product(e_2,e_2,e_1)|product(e_2,e_2,e_2).
% 1.05/1.25  28 [hyper,16,4,15] {+} product(e_1,e_2,e_1)|product(e_1,e_2,e_2).
% 1.05/1.25  96 [hyper,27,8,28,factor_simp] {+} product(e_2,e_2,e_2)|product(e_1,e_2,e_1).
% 1.05/1.25  225 [hyper,96,7,28,unit_del,3,factor_simp] {+} product(e_1,e_2,e_1).
% 1.05/1.25  233 [hyper,225,8,23,factor_simp] {+} product(e_1,e_1,e_2).
% 1.05/1.25  244 [hyper,233,8,225] {+} product(e_2,e_1,e_2).
% 1.05/1.25  256 [hyper,244,7,233,flip.1] {-} equalish(e_2,e_1).
% 1.05/1.25  258 [binary,256.1,3.1] {-} $F.
% 1.05/1.25  
% 1.05/1.25  % SZS output end Refutation
% 1.05/1.25  ------------ end of proof -------------
% 1.05/1.25  
% 1.05/1.25  
% 1.05/1.25  Search stopped by max_proofs option.
% 1.05/1.25  
% 1.05/1.25  
% 1.05/1.25  Search stopped by max_proofs option.
% 1.05/1.25  
% 1.05/1.25  ============ end of search ============
% 1.05/1.25  
% 1.05/1.25  ----------- soft-scott stats ----------
% 1.05/1.25  
% 1.05/1.25  true clauses given           2      (13.3%)
% 1.05/1.25  false clauses given         13
% 1.05/1.25  
% 1.05/1.25        FALSE     TRUE
% 1.05/1.25     3  0         2
% 1.05/1.25     4  2         0
% 1.05/1.25    10  4         2
% 1.05/1.25    11  2         10
% 1.05/1.25    12  18        0
% 1.05/1.25    15  9         29
% 1.05/1.25    16  9         0
% 1.05/1.25    19  7         5
% 1.05/1.25  tot:  51        48      (48.5% true)
% 1.05/1.25  
% 1.05/1.25  
% 1.05/1.25  Model 12 [ 5 0 375 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.25  
% 1.05/1.25  That finishes the proof of the theorem.
% 1.05/1.25  
% 1.05/1.25  Process 17836 finished Tue Jun 14 12:37:25 2022
%------------------------------------------------------------------------------