↑ Up

SOS---2.0.UNS-Ref.s

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

% Computer : n022.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 : Sun Jul 17 03:29:45 EDT 2022

% Result   : Unsatisfiable 0.18s 0.48s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : KRS096+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n022.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue Jun  7 15:52:20 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.35  ----- Otter 3.2, August 2001 -----
% 0.12/0.35  The process was started by sandbox2 on n022.cluster.edu,
% 0.12/0.35  Tue Jun  7 15:52:20 2022
% 0.12/0.35  The command was "./sos".  The process ID is 30654.
% 0.12/0.35  
% 0.12/0.35  set(prolog_style_variables).
% 0.12/0.35  set(auto).
% 0.12/0.35     dependent: set(auto1).
% 0.12/0.35     dependent: set(process_input).
% 0.12/0.35     dependent: clear(print_kept).
% 0.12/0.35     dependent: clear(print_new_demod).
% 0.12/0.35     dependent: clear(print_back_demod).
% 0.12/0.35     dependent: clear(print_back_sub).
% 0.12/0.35     dependent: set(control_memory).
% 0.12/0.35     dependent: assign(max_mem, 12000).
% 0.12/0.35     dependent: assign(pick_given_ratio, 4).
% 0.12/0.35     dependent: assign(stats_level, 1).
% 0.12/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35     dependent: assign(sos_limit, 5000).
% 0.12/0.35     dependent: assign(max_weight, 60).
% 0.12/0.35  clear(print_given).
% 0.12/0.35  
% 0.12/0.35  formula_list(usable).
% 0.12/0.35  
% 0.12/0.35  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.12/0.35  
% 0.12/0.35  This ia a non-Horn set with equality.  The strategy will be
% 0.12/0.35  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35  unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35  clauses in usable.
% 0.12/0.35  
% 0.12/0.35     dependent: set(knuth_bendix).
% 0.12/0.35     dependent: set(para_from).
% 0.12/0.35     dependent: set(para_into).
% 0.12/0.35     dependent: clear(para_from_right).
% 0.12/0.35     dependent: clear(para_into_right).
% 0.12/0.35     dependent: set(para_from_vars).
% 0.12/0.35     dependent: set(eq_units_both_ways).
% 0.12/0.35     dependent: set(dynamic_demod_all).
% 0.12/0.35     dependent: set(dynamic_demod).
% 0.12/0.35     dependent: set(order_eq).
% 0.12/0.35     dependent: set(back_demod).
% 0.12/0.35     dependent: set(lrpo).
% 0.12/0.35     dependent: set(hyper_res).
% 0.12/0.35     dependent: set(unit_deletion).
% 0.12/0.35     dependent: set(factor).
% 0.12/0.35  
% 0.12/0.35  ------------> process usable:
% 0.12/0.35  10 back subsumes 4.
% 0.12/0.35  
% 0.12/0.35  ------------> process sos:
% 0.12/0.35  22 back subsumes 5.
% 0.12/0.35    Following clause subsumed by 25 during input processing: 0 [copy,25,flip.1] {-} A=A.
% 0.12/0.35  25 back subsumes 21.
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.12/0.37  
% 0.12/0.37  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37  
% 0.12/0.37  Stopped by limit on number of solutions
% 0.12/0.37  
% 0.12/0.37  
% 0.12/0.37  -------------- Softie stats --------------
% 0.12/0.37  
% 0.12/0.37  UPDATE_STOP: 300
% 0.12/0.37  SFINDER_TIME_LIMIT: 2
% 0.12/0.37  SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.37  number of clauses in intial UL: 18
% 0.12/0.37  number of clauses initially in problem: 22
% 0.12/0.37  percentage of clauses intially in UL: 81
% 0.12/0.37  percentage of distinct symbols occuring in initial UL: 85
% 0.12/0.37  percent of all initial clauses that are short: 100
% 0.12/0.37  absolute distinct symbol count: 14
% 0.12/0.37     distinct predicate count: 9
% 0.12/0.37     distinct function count: 4
% 0.12/0.37     distinct constant count: 1
% 0.12/0.37  
% 0.12/0.37  ---------- no more Softie stats ----------
% 0.12/0.37  
% 0.12/0.37  
% 0.12/0.37  
% 0.12/0.37  =========== start of search ===========
% 0.18/0.48  
% 0.18/0.48  -------- PROOF -------- 
% 0.18/0.48  % SZS status Theorem
% 0.18/0.48  % SZS output start Refutation
% 0.18/0.48  
% 0.18/0.48  Model 2 [ 1 0 109 ] (0.00 seconds, 1762 Inserts)
% 0.18/0.48  
% 0.18/0.48  Model 3 [ 1 1 101 ] (0.00 seconds, 1588 Inserts)
% 0.18/0.48  
% 0.18/0.48  Model 4 [ 1 1 147 ] (0.00 seconds, 1815 Inserts)
% 0.18/0.48  
% 0.18/0.48  Stopped by limit on insertions
% 0.18/0.48  
% 0.18/0.48  Model 5 [ 2 0 122 ] (0.00 seconds, 250000 Inserts)
% 0.18/0.48  
% 0.18/0.48  -----> EMPTY CLAUSE at   0.11 sec ----> 42 [hyper,41,20,28] {-} $F.
% 0.18/0.48  
% 0.18/0.48  Length of proof is 6.  Level of proof is 3.
% 0.18/0.48  
% 0.18/0.48  ---------------- PROOF ----------------
% 0.18/0.48  % SZS status Theorem
% 0.18/0.48  % SZS output start Refutation
% 0.18/0.48  
% 0.18/0.48  12 [] {+} -cUnsatisfiable(A)|rr(A,$f1(A)).
% 0.18/0.48  13 [] {+} -cUnsatisfiable(A)|cc($f1(A)).
% 0.18/0.48  14 [] {+} -cUnsatisfiable(A)|rr(A,$f2(A)).
% 0.18/0.48  15 [] {+} -cUnsatisfiable(A)|cd($f2(A)).
% 0.18/0.48  16 [] {+} -cUnsatisfiable(A)| -rr(A,B)| -rr(A,C)|B=C.
% 0.18/0.48  20 [] {+} -cc(A)| -cd(A).
% 0.18/0.48  24 [] {-} cUnsatisfiable(i2003_11_14_17_20_18265).
% 0.18/0.48  26 [hyper,24,15] {+} cd($f2(i2003_11_14_17_20_18265)).
% 0.18/0.48  27 [hyper,24,14] {+} rr(i2003_11_14_17_20_18265,$f2(i2003_11_14_17_20_18265)).
% 0.18/0.48  28 [hyper,24,13] {+} cc($f1(i2003_11_14_17_20_18265)).
% 0.18/0.48  29 [hyper,24,12] {+} rr(i2003_11_14_17_20_18265,$f1(i2003_11_14_17_20_18265)).
% 0.18/0.48  39,38 [hyper,27,16,24,29,flip.1] {-} $f2(i2003_11_14_17_20_18265)=$f1(i2003_11_14_17_20_18265).
% 0.18/0.48  41 [back_demod,26,demod,39] {+} cd($f1(i2003_11_14_17_20_18265)).
% 0.18/0.48  42 [hyper,41,20,28] {-} $F.
% 0.18/0.48  
% 0.18/0.48  % SZS output end Refutation
% 0.18/0.48  ------------ end of proof -------------
% 0.18/0.48  
% 0.18/0.48  
% 0.18/0.48  Search stopped by max_proofs option.
% 0.18/0.48  
% 0.18/0.48  
% 0.18/0.48  Search stopped by max_proofs option.
% 0.18/0.48  
% 0.18/0.48  ============ end of search ============
% 0.18/0.48  
% 0.18/0.48  ----------- soft-scott stats ----------
% 0.18/0.48  
% 0.18/0.48  true clauses given           4      (44.4%)
% 0.18/0.48  false clauses given          5
% 0.18/0.48  
% 0.18/0.48        FALSE     TRUE
% 0.18/0.48     5  1         0
% 0.18/0.48    10  0         1
% 0.18/0.48    11  0         5
% 0.18/0.48    12  0         3
% 0.18/0.48  tot:  1         9      (90.0% true)
% 0.18/0.48  
% 0.18/0.48  
% 0.18/0.48  Model 5 [ 2 0 122 ] (0.00 seconds, 250000 Inserts)
% 0.18/0.48  
% 0.18/0.48  That finishes the proof of the theorem.
% 0.18/0.48  
% 0.18/0.48  Process 30654 finished Tue Jun  7 15:52:20 2022
%------------------------------------------------------------------------------