↑ Up

SOS---2.0.UNS-Ref.s

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

% Computer : n009.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 : Mon Jul 18 14:15:50 EDT 2022

% Result   : Unsatisfiable 0.46s 0.65s
% Output   : Refutation 0.46s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM022-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : sos-script %s
% 0.13/0.33  % Computer : n009.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Wed Jul  6 00:07:22 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.13/0.35  ----- Otter 3.2, August 2001 -----
% 0.13/0.35  The process was started by sandbox on n009.cluster.edu,
% 0.13/0.35  Wed Jul  6 00:07:22 2022
% 0.13/0.35  The command was "./sos".  The process ID is 9530.
% 0.13/0.35  
% 0.13/0.35  set(prolog_style_variables).
% 0.13/0.35  set(auto).
% 0.13/0.35     dependent: set(auto1).
% 0.13/0.35     dependent: set(process_input).
% 0.13/0.35     dependent: clear(print_kept).
% 0.13/0.35     dependent: clear(print_new_demod).
% 0.13/0.35     dependent: clear(print_back_demod).
% 0.13/0.35     dependent: clear(print_back_sub).
% 0.13/0.35     dependent: set(control_memory).
% 0.13/0.35     dependent: assign(max_mem, 12000).
% 0.13/0.35     dependent: assign(pick_given_ratio, 4).
% 0.13/0.35     dependent: assign(stats_level, 1).
% 0.13/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35     dependent: assign(sos_limit, 5000).
% 0.13/0.35     dependent: assign(max_weight, 60).
% 0.13/0.35  clear(print_given).
% 0.13/0.35  
% 0.13/0.35  list(usable).
% 0.13/0.35  
% 0.13/0.35  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.13/0.35  
% 0.13/0.35  This ia a non-Horn set with equality.  The strategy will be
% 0.13/0.35  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.35  unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.35  clauses in usable.
% 0.13/0.35  
% 0.13/0.35     dependent: set(knuth_bendix).
% 0.13/0.35     dependent: set(para_from).
% 0.13/0.35     dependent: set(para_into).
% 0.13/0.35     dependent: clear(para_from_right).
% 0.13/0.35     dependent: clear(para_into_right).
% 0.13/0.35     dependent: set(para_from_vars).
% 0.13/0.35     dependent: set(eq_units_both_ways).
% 0.13/0.35     dependent: set(dynamic_demod_all).
% 0.13/0.35     dependent: set(dynamic_demod).
% 0.13/0.35     dependent: set(order_eq).
% 0.13/0.35     dependent: set(back_demod).
% 0.13/0.35     dependent: set(lrpo).
% 0.13/0.35     dependent: set(hyper_res).
% 0.13/0.35     dependent: set(unit_deletion).
% 0.13/0.35     dependent: set(factor).
% 0.13/0.35  
% 0.13/0.35  ------------> process usable:
% 0.13/0.35  
% 0.13/0.35  ------------> process sos:
% 0.13/0.35  
% 0.13/0.35  ======= end of input processing =======
% 0.46/0.65  
% 0.46/0.65  Stopped by limit on insertions
% 0.46/0.65  
% 0.46/0.65  
% 0.46/0.65  Failed to model usable list: disabling FINDER
% 0.46/0.65  
% 0.46/0.65  
% 0.46/0.65  
% 0.46/0.65  -------------- Softie stats --------------
% 0.46/0.65  
% 0.46/0.65  UPDATE_STOP: 300
% 0.46/0.65  SFINDER_TIME_LIMIT: 2
% 0.46/0.65  SHORT_CLAUSE_CUTOFF: 4
% 0.46/0.65  number of clauses in intial UL: 8
% 0.46/0.65  number of clauses initially in problem: 10
% 0.46/0.65  percentage of clauses intially in UL: 80
% 0.46/0.65  percentage of distinct symbols occuring in initial UL: 88
% 0.46/0.65  percent of all initial clauses that are short: 100
% 0.46/0.65  absolute distinct symbol count: 9
% 0.46/0.65     distinct predicate count: 3
% 0.46/0.65     distinct function count: 3
% 0.46/0.65     distinct constant count: 3
% 0.46/0.65  
% 0.46/0.65  ---------- no more Softie stats ----------
% 0.46/0.65  
% 0.46/0.65  
% 0.46/0.65  
% 0.46/0.65  =========== start of search ===========
% 0.46/0.65  
% 0.46/0.65  -------- PROOF -------- 
% 0.46/0.65  % SZS status Unsatisfiable
% 0.46/0.65  % SZS output start Refutation
% 0.46/0.65  
% 0.46/0.65  ----> UNIT CONFLICT at   0.27 sec ----> 37 [binary,36.1,9.1] {-} $F.
% 0.46/0.65  
% 0.46/0.65  Length of proof is 3.  Level of proof is 3.
% 0.46/0.65  
% 0.46/0.65  ---------------- PROOF ----------------
% 0.46/0.65  % SZS status Unsatisfiable
% 0.46/0.65  % SZS output start Refutation
% 0.46/0.65  
% 0.46/0.65  1 [] {+} -less(A,B)| -less(C,A)|less(C,B).
% 0.46/0.65  4 [] {+} -divides(A,B)|less(A,B)|equalish(A,B).
% 0.46/0.65  8 [] {+} -less(a,d).
% 0.46/0.65  9 [] {-} less(a,b).
% 0.46/0.65  10 [] {-} divides(b,d).
% 0.46/0.65  18 [hyper,10,4,flip.2] {-} less(b,d)|equalish(d,b).
% 0.46/0.65  29,28 [hyper,18,1,9,unit_del,8] {-} equalish(d,b).
% 0.46/0.65  36 [back_demod,8,demod,29] {-} -less(a,b).
% 0.46/0.65  37 [binary,36.1,9.1] {-} $F.
% 0.46/0.65  
% 0.46/0.65  % SZS output end Refutation
% 0.46/0.65  ------------ end of proof -------------
% 0.46/0.65  
% 0.46/0.65  
% 0.46/0.65  Search stopped by max_proofs option.
% 0.46/0.65  
% 0.46/0.65  
% 0.46/0.65  Search stopped by max_proofs option.
% 0.46/0.65  
% 0.46/0.65  ============ end of search ============
% 0.46/0.65  
% 0.46/0.65  That finishes the proof of the theorem.
% 0.46/0.65  
% 0.46/0.65  Process 9530 finished Wed Jul  6 00:07:22 2022
%------------------------------------------------------------------------------