↑ Up

SOS---2.0.UNS-Ref.s

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

% Computer : n023.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 22:25:46 EDT 2022

% Result   : Unsatisfiable 0.59s 0.85s
% Output   : Refutation 0.59s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : MGT008-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % Command  : sos-script %s
% 0.12/0.33  % Computer : n023.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 : Thu Jun  9 11:48:23 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  ----- Otter 3.2, August 2001 -----
% 0.12/0.35  The process was started by sandbox2 on n023.cluster.edu,
% 0.12/0.35  Thu Jun  9 11:48:23 2022
% 0.12/0.35  The command was "./sos".  The process ID is 6402.
% 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=0, symmetry=0, max_lits=10.
% 0.12/0.35  
% 0.12/0.35  This is a Horn set without equality.  The strategy will
% 0.12/0.35  be hyperresolution, with satellites in sos and nuclei
% 0.12/0.35  in usable.
% 0.12/0.35  
% 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  
% 0.12/0.35  ======= end of input processing =======
% 0.19/0.52  
% 0.19/0.52  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.52  
% 0.19/0.52  Stopped by limit on number of solutions
% 0.19/0.52  
% 0.19/0.52  
% 0.19/0.52  -------------- Softie stats --------------
% 0.19/0.52  
% 0.19/0.52  UPDATE_STOP: 300
% 0.19/0.52  SFINDER_TIME_LIMIT: 2
% 0.19/0.52  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.52  number of clauses in intial UL: 4
% 0.19/0.52  number of clauses initially in problem: 15
% 0.19/0.52  percentage of clauses intially in UL: 26
% 0.19/0.52  percentage of distinct symbols occuring in initial UL: 58
% 0.19/0.52  percent of all initial clauses that are short: 100
% 0.19/0.52  absolute distinct symbol count: 17
% 0.19/0.52     distinct predicate count: 7
% 0.19/0.52     distinct function count: 1
% 0.19/0.52     distinct constant count: 9
% 0.19/0.52  
% 0.19/0.52  ---------- no more Softie stats ----------
% 0.19/0.52  
% 0.19/0.52  
% 0.19/0.52  
% 0.19/0.52  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.52  
% 0.19/0.52  Stopped by limit on number of solutions
% 0.19/0.52  
% 0.19/0.52  =========== start of search ===========
% 0.59/0.85  
% 0.59/0.85  -------- PROOF -------- 
% 0.59/0.85  % SZS status Unsatisfiable
% 0.59/0.85  % SZS output start Refutation
% 0.59/0.85  
% 0.59/0.85  Model 3 (0.00 seconds, 0 Inserts)
% 0.59/0.85  
% 0.59/0.85  Stopped by limit on number of solutions
% 0.59/0.85  
% 0.59/0.85  Model 4 (0.00 seconds, 0 Inserts)
% 0.59/0.85  
% 0.59/0.85  Stopped by limit on number of solutions
% 0.59/0.85  
% 0.59/0.85  Model 5 (0.00 seconds, 0 Inserts)
% 0.59/0.85  
% 0.59/0.85  Stopped by limit on number of solutions
% 0.59/0.85  
% 0.59/0.85  Model 6 (0.00 seconds, 0 Inserts)
% 0.59/0.85  
% 0.59/0.85  Stopped by limit on number of solutions
% 0.59/0.85  
% 0.59/0.85  Stopped by limit on insertions
% 0.59/0.85  
% 0.59/0.85  Model 7 [ 1 6 1440 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.85  
% 0.59/0.85  ----> UNIT CONFLICT at   0.37 sec ----> 20 [binary,19.1,4.1] {+} $F.
% 0.59/0.85  
% 0.59/0.85  Length of proof is 4.  Level of proof is 3.
% 0.59/0.85  
% 0.59/0.85  ---------------- PROOF ----------------
% 0.59/0.85  % SZS status Unsatisfiable
% 0.59/0.85  % SZS output start Refutation
% 0.59/0.85  
% 0.59/0.85  1 [] {+} -organization(A,B)|inertia(A,sk1(B,A),B).
% 0.59/0.85  2 [] {+} -organization(A,B)| -organization(C,D)| -class(A,E,B)| -class(C,E,D)| -size(A,F,B)| -size(C,G,D)| -inertia(A,H,B)| -inertia(C,I,D)| -greater(G,F)|greater(I,H).
% 0.59/0.85  3 [] {+} -organization(A,B)| -organization(C,D)| -reorganization_free(A,B,B)| -reorganization_free(C,D,D)| -inertia(A,E,B)| -inertia(C,F,D)| -survival_chance(A,G,B)| -survival_chance(C,H,D)| -greater(F,E)|greater(H,G).
% 0.59/0.85  4 [] {+} -greater(sk6,sk5).
% 0.59/0.85  5 [] {+} organization(sk2,sk9).
% 0.59/0.85  6 [] {+} organization(sk3,sk10).
% 0.59/0.85  7 [] {+} reorganization_free(sk2,sk9,sk9).
% 0.59/0.85  8 [] {+} reorganization_free(sk3,sk10,sk10).
% 0.59/0.85  9 [] {+} class(sk2,sk4,sk9).
% 0.59/0.85  10 [] {+} class(sk3,sk4,sk10).
% 0.59/0.85  11 [] {+} survival_chance(sk2,sk5,sk9).
% 0.59/0.85  12 [] {+} survival_chance(sk3,sk6,sk10).
% 0.59/0.85  13 [] {+} size(sk2,sk7,sk9).
% 0.59/0.85  14 [] {+} size(sk3,sk8,sk10).
% 0.59/0.85  15 [] {+} greater(sk8,sk7).
% 0.59/0.85  16 [hyper,5,1] {+} inertia(sk2,sk1(sk9,sk2),sk9).
% 0.59/0.85  17 [hyper,6,1] {+} inertia(sk3,sk1(sk10,sk3),sk10).
% 0.59/0.85  18 [hyper,17,2,5,6,9,10,13,14,16,15] {-} greater(sk1(sk10,sk3),sk1(sk9,sk2)).
% 0.59/0.85  19 [hyper,18,3,5,6,7,8,16,17,11,12] {-} greater(sk6,sk5).
% 0.59/0.85  20 [binary,19.1,4.1] {+} $F.
% 0.59/0.85  
% 0.59/0.85  % SZS output end Refutation
% 0.59/0.85  ------------ end of proof -------------
% 0.59/0.85  
% 0.59/0.85  
% 0.59/0.85  Search stopped by max_proofs option.
% 0.59/0.85  
% 0.59/0.85  
% 0.59/0.85  Search stopped by max_proofs option.
% 0.59/0.85  
% 0.59/0.85  ============ end of search ============
% 0.59/0.85  
% 0.59/0.85  ----------- soft-scott stats ----------
% 0.59/0.85  
% 0.59/0.85  true clauses given           7      (50.0%)
% 0.59/0.85  false clauses given          7
% 0.59/0.85  
% 0.59/0.85        FALSE     TRUE
% 0.59/0.85  tot:  0         0      (-nan% true)
% 0.59/0.85  
% 0.59/0.85  
% 0.59/0.85  Model 7 [ 1 6 1440 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.85  
% 0.59/0.85  That finishes the proof of the theorem.
% 0.59/0.85  
% 0.59/0.85  Process 6402 finished Thu Jun  9 11:48:23 2022
%------------------------------------------------------------------------------