↑ Up

SOS---2.0.UNS-Ref.s

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

% Computer : n018.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 13:02:40 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : HEN003-3 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n018.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 : Fri Jul  1 14:22:02 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 sandbox on n018.cluster.edu,
% 0.12/0.35  Fri Jul  1 14:22:02 2022
% 0.12/0.35  The command was "./sos".  The process ID is 9294.
% 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  list(usable).
% 0.12/0.35  
% 0.12/0.35  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.12/0.35  
% 0.12/0.35  This is a Horn set with equality.  The strategy will be
% 0.12/0.35  Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.35  sos and nonpositive 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: clear(order_hyper).
% 0.12/0.35  
% 0.12/0.35  ------------> process usable:
% 0.12/0.35  
% 0.12/0.35  ------------> process sos:
% 0.12/0.35    Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] {-} A=A.
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.12/0.38  
% 0.12/0.38  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38  
% 0.12/0.38  Stopped by limit on number of solutions
% 0.12/0.38  
% 0.12/0.38  
% 0.12/0.38  -------------- Softie stats --------------
% 0.12/0.38  
% 0.12/0.38  UPDATE_STOP: 300
% 0.12/0.38  SFINDER_TIME_LIMIT: 2
% 0.12/0.38  SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38  number of clauses in intial UL: 4
% 0.12/0.38  number of clauses initially in problem: 9
% 0.12/0.38  percentage of clauses intially in UL: 44
% 0.12/0.38  percentage of distinct symbols occuring in initial UL: 83
% 0.12/0.38  percent of all initial clauses that are short: 100
% 0.12/0.38  absolute distinct symbol count: 6
% 0.12/0.38     distinct predicate count: 2
% 0.12/0.38     distinct function count: 1
% 0.12/0.38     distinct constant count: 3
% 0.12/0.38  
% 0.12/0.38  ---------- no more Softie stats ----------
% 0.12/0.38  
% 0.12/0.38  
% 0.12/0.38  
% 0.12/0.38  Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.38  
% 0.12/0.38  Stopped by limit on number of solutions
% 0.12/0.38  
% 0.12/0.38  =========== start of search ===========
% 0.18/0.40  
% 0.18/0.40  -------- PROOF -------- 
% 0.18/0.40  % SZS status Unsatisfiable
% 0.18/0.40  % SZS output start Refutation
% 0.18/0.40  
% 0.18/0.40  Model 3 [ 2 1 73 ] (0.00 seconds, 312 Inserts)
% 0.18/0.40  
% 0.18/0.40  Model 4 [ 1 0 104 ] (0.00 seconds, 259 Inserts)
% 0.18/0.40  
% 0.18/0.40  Model 5 [ 4 1 140 ] (0.00 seconds, 1245 Inserts)
% 0.18/0.40  
% 0.18/0.40  Model 6 [ 8 0 793 ] (0.00 seconds, 1631 Inserts)
% 0.18/0.40  
% 0.18/0.40  ----> UNIT CONFLICT at   0.03 sec ----> 52 [binary,50.1,4.1] {-} $F.
% 0.18/0.40  
% 0.18/0.40  Length of proof is 5.  Level of proof is 5.
% 0.18/0.40  
% 0.18/0.40  ---------------- PROOF ----------------
% 0.18/0.40  % SZS status Unsatisfiable
% 0.18/0.40  % SZS output start Refutation
% 0.18/0.40  
% 0.18/0.40  1 [] {+} -less_equal(A,B)|divide(A,B)=zero.
% 0.18/0.40  2 [] {+} divide(A,B)!=zero|less_equal(A,B).
% 0.18/0.40  3 [] {+} -less_equal(A,B)| -less_equal(B,A)|A=B.
% 0.18/0.40  4 [] {+} divide(a,a)!=zero.
% 0.18/0.40  5 [] {+} less_equal(divide(A,B),A).
% 0.18/0.40  6 [] {-} less_equal(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)).
% 0.18/0.40  7 [] {+} less_equal(zero,A).
% 0.18/0.40  11,10 [hyper,5,1] {+} divide(divide(A,B),A)=zero.
% 0.18/0.40  35 [para_into,6.1.2,10.1.1] {-} less_equal(divide(divide(A,A),divide(B,A)),zero).
% 0.18/0.40  38 [hyper,35,3,7,flip.1] {-} divide(divide(A,A),divide(B,A))=zero.
% 0.18/0.40  40 [hyper,38,2] {-} less_equal(divide(A,A),divide(B,A)).
% 0.18/0.40  50 [hyper,40,3,5,demod,11,flip.1] {-} divide(A,A)=zero.
% 0.18/0.40  52 [binary,50.1,4.1] {-} $F.
% 0.18/0.40  
% 0.18/0.40  % SZS output end Refutation
% 0.18/0.40  ------------ end of proof -------------
% 0.18/0.40  
% 0.18/0.40  
% 0.18/0.40  Search stopped by max_proofs option.
% 0.18/0.40  
% 0.18/0.40  
% 0.18/0.40  Search stopped by max_proofs option.
% 0.18/0.40  
% 0.18/0.40  ============ end of search ============
% 0.18/0.40  
% 0.18/0.40  ----------- soft-scott stats ----------
% 0.18/0.40  
% 0.18/0.40  true clauses given           2      (20.0%)
% 0.18/0.40  false clauses given          8
% 0.18/0.40  
% 0.18/0.40        FALSE     TRUE
% 0.18/0.40     5  0         1
% 0.18/0.40     7  1         1
% 0.18/0.40     8  1         0
% 0.18/0.40     9  0         3
% 0.18/0.40    11  2         1
% 0.18/0.40    12  0         1
% 0.18/0.40    13  4         0
% 0.18/0.40    14  1         1
% 0.18/0.40    15  2         0
% 0.18/0.40    17  3         0
% 0.18/0.40    21  1         2
% 0.18/0.40    23  0         1
% 0.18/0.40    25  0         1
% 0.18/0.40  tot:  15        12      (44.4% true)
% 0.18/0.40  
% 0.18/0.40  
% 0.18/0.40  Model 6 [ 8 0 793 ] (0.00 seconds, 1631 Inserts)
% 0.18/0.40  
% 0.18/0.40  That finishes the proof of the theorem.
% 0.18/0.40  
% 0.18/0.40  Process 9294 finished Fri Jul  1 14:22:02 2022
%------------------------------------------------------------------------------