↑ Up

SOS---2.0.UNS-Ref.s

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

% Computer : n032.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:08 EDT 2022

% Result   : Unsatisfiable 0.47s 0.68s
% Output   : Refutation 0.47s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : GRP033-4 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.11  % Command  : sos-script %s
% 0.11/0.31  % Computer : n032.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit : 300
% 0.11/0.31  % WCLimit  : 600
% 0.11/0.31  % DateTime : Mon Jun 13 23:38:27 EDT 2022
% 0.11/0.31  % CPUTime  : 
% 0.16/0.32  ----- Otter 3.2, August 2001 -----
% 0.16/0.32  The process was started by sandbox on n032.cluster.edu,
% 0.16/0.32  Mon Jun 13 23:38:27 2022
% 0.16/0.32  The command was "./sos".  The process ID is 10735.
% 0.16/0.32  
% 0.16/0.32  set(prolog_style_variables).
% 0.16/0.32  set(auto).
% 0.16/0.32     dependent: set(auto1).
% 0.16/0.32     dependent: set(process_input).
% 0.16/0.32     dependent: clear(print_kept).
% 0.16/0.32     dependent: clear(print_new_demod).
% 0.16/0.32     dependent: clear(print_back_demod).
% 0.16/0.32     dependent: clear(print_back_sub).
% 0.16/0.32     dependent: set(control_memory).
% 0.16/0.32     dependent: assign(max_mem, 12000).
% 0.16/0.32     dependent: assign(pick_given_ratio, 4).
% 0.16/0.32     dependent: assign(stats_level, 1).
% 0.16/0.32     dependent: assign(pick_semantic_ratio, 3).
% 0.16/0.32     dependent: assign(sos_limit, 5000).
% 0.16/0.32     dependent: assign(max_weight, 60).
% 0.16/0.32  clear(print_given).
% 0.16/0.32  
% 0.16/0.32  list(usable).
% 0.16/0.32  
% 0.16/0.32  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 0.16/0.32  
% 0.16/0.32  This is a Horn set with equality.  The strategy will be
% 0.16/0.32  Knuth-Bendix and hyper_res, with positive clauses in
% 0.16/0.32  sos and nonpositive clauses in usable.
% 0.16/0.32  
% 0.16/0.32     dependent: set(knuth_bendix).
% 0.16/0.32     dependent: set(para_from).
% 0.16/0.32     dependent: set(para_into).
% 0.16/0.32     dependent: clear(para_from_right).
% 0.16/0.32     dependent: clear(para_into_right).
% 0.16/0.32     dependent: set(para_from_vars).
% 0.16/0.32     dependent: set(eq_units_both_ways).
% 0.16/0.32     dependent: set(dynamic_demod_all).
% 0.16/0.32     dependent: set(dynamic_demod).
% 0.16/0.32     dependent: set(order_eq).
% 0.16/0.32     dependent: set(back_demod).
% 0.16/0.32     dependent: set(lrpo).
% 0.16/0.32     dependent: set(hyper_res).
% 0.16/0.32     dependent: clear(order_hyper).
% 0.16/0.32  
% 0.16/0.32  ------------> process usable:
% 0.16/0.32  
% 0.16/0.32  ------------> process sos:
% 0.16/0.32    Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] {-} A=A.
% 0.16/0.32  
% 0.16/0.32  ======= end of input processing =======
% 0.16/0.36  
% 0.16/0.36  Model 1 (0.00 seconds, 0 Inserts)
% 0.16/0.36  
% 0.16/0.36  Stopped by limit on number of solutions
% 0.16/0.36  
% 0.16/0.36  
% 0.16/0.36  -------------- Softie stats --------------
% 0.16/0.36  
% 0.16/0.36  UPDATE_STOP: 300
% 0.16/0.36  SFINDER_TIME_LIMIT: 2
% 0.16/0.36  SHORT_CLAUSE_CUTOFF: 4
% 0.16/0.36  number of clauses in intial UL: 6
% 0.16/0.36  number of clauses initially in problem: 13
% 0.16/0.36  percentage of clauses intially in UL: 46
% 0.16/0.36  percentage of distinct symbols occuring in initial UL: 62
% 0.16/0.36  percent of all initial clauses that are short: 100
% 0.16/0.36  absolute distinct symbol count: 8
% 0.16/0.36     distinct predicate count: 3
% 0.16/0.36     distinct function count: 3
% 0.16/0.36     distinct constant count: 2
% 0.16/0.36  
% 0.16/0.36  ---------- no more Softie stats ----------
% 0.16/0.36  
% 0.16/0.36  
% 0.16/0.36  
% 0.16/0.36  Model 2 (0.00 seconds, 0 Inserts)
% 0.16/0.36  
% 0.16/0.36  Stopped by limit on number of solutions
% 0.16/0.36  
% 0.16/0.36  =========== start of search ===========
% 0.47/0.68  
% 0.47/0.68  -------- PROOF -------- 
% 0.47/0.68  % SZS status Unsatisfiable
% 0.47/0.68  % SZS output start Refutation
% 0.47/0.68  
% 0.47/0.68  Model 3 (0.00 seconds, 0 Inserts)
% 0.47/0.68  
% 0.47/0.68  Stopped by limit on number of solutions
% 0.47/0.68  
% 0.47/0.68  Model 4 [ 1 1 353 ] (0.00 seconds, 3335 Inserts)
% 0.47/0.68  
% 0.47/0.68  Stopped by limit on insertions
% 0.47/0.68  
% 0.47/0.68  Model 5 [ 1 0 169 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.68  
% 0.47/0.68  Stopped by limit on insertions
% 0.47/0.68  
% 0.47/0.68  Model 6 [ 2 1 1192 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.68  
% 0.47/0.68  Stopped by limit on insertions
% 0.47/0.68  
% 0.47/0.68  Model 7 [ 4 1 397 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.68  
% 0.47/0.68  Stopped by limit on insertions
% 0.47/0.68  
% 0.47/0.68  Model 8 [ 5 1 2443 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.68  
% 0.47/0.68  -----> EMPTY CLAUSE at   0.34 sec ----> 34 [hyper,26,6,8,7] {-} $F.
% 0.47/0.68  
% 0.47/0.68  Length of proof is 1.  Level of proof is 1.
% 0.47/0.68  
% 0.47/0.68  ---------------- PROOF ----------------
% 0.47/0.68  % SZS status Unsatisfiable
% 0.47/0.68  % SZS output start Refutation
% 0.47/0.68  
% 0.47/0.68  4 [] {+} -subgroup_member(A)| -subgroup_member(B)| -product(A,inverse(B),C)|subgroup_member(C).
% 0.47/0.68  6 [] {+} -product(j(A),A,j(A))| -product(A,j(A),j(A))| -subgroup_member(A).
% 0.47/0.68  7 [] {+} product(identity,A,A).
% 0.47/0.68  8 [] {+} product(A,identity,A).
% 0.47/0.68  10 [] {+} product(A,inverse(A),identity).
% 0.47/0.68  12 [] {+} subgroup_member(a).
% 0.47/0.68  26 [hyper,10,4,12,12] {+} subgroup_member(identity).
% 0.47/0.68  34 [hyper,26,6,8,7] {-} $F.
% 0.47/0.68  
% 0.47/0.68  % SZS output end Refutation
% 0.47/0.68  ------------ end of proof -------------
% 0.47/0.68  
% 0.47/0.68  
% 0.47/0.68  Search stopped by max_proofs option.
% 0.47/0.68  
% 0.47/0.68  
% 0.47/0.68  Search stopped by max_proofs option.
% 0.47/0.68  
% 0.47/0.68  ============ end of search ============
% 0.47/0.68  
% 0.47/0.68  ----------- soft-scott stats ----------
% 0.47/0.68  
% 0.47/0.68  true clauses given           2      (22.2%)
% 0.47/0.68  false clauses given          7
% 0.47/0.68  
% 0.47/0.68        FALSE     TRUE
% 0.47/0.68     3  0         1
% 0.47/0.68     4  0         1
% 0.47/0.68     6  5         0
% 0.47/0.68    10  0         1
% 0.47/0.68    12  1         2
% 0.47/0.68    13  2         4
% 0.47/0.68  tot:  8         9      (52.9% true)
% 0.47/0.68  
% 0.47/0.68  
% 0.47/0.68  Model 8 [ 5 1 2443 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.68  
% 0.47/0.68  That finishes the proof of the theorem.
% 0.47/0.68  
% 0.47/0.68  Process 10735 finished Mon Jun 13 23:38:27 2022
%------------------------------------------------------------------------------