↑ Up

SOS---2.0.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : LCL039-1 : 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 : Sun Jul 17 14:27:31 EDT 2022

% Result   : Unsatisfiable 1.56s 1.76s
% Output   : Refutation 1.56s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL039-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/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 : Sun Jul  3 04:38:34 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 sandbox on n018.cluster.edu,
% 0.12/0.35  Sun Jul  3 04:38:34 2022
% 0.12/0.35  The command was "./sos".  The process ID is 24023.
% 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=3.
% 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.12/0.39  
% 0.12/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39  
% 0.12/0.39  Stopped by limit on number of solutions
% 0.12/0.39  
% 0.12/0.39  
% 0.12/0.39  -------------- Softie stats --------------
% 0.12/0.39  
% 0.12/0.39  UPDATE_STOP: 300
% 0.12/0.39  SFINDER_TIME_LIMIT: 2
% 0.12/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39  number of clauses in intial UL: 3
% 0.12/0.39  number of clauses initially in problem: 8
% 0.12/0.39  percentage of clauses intially in UL: 37
% 0.12/0.39  percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.39  percent of all initial clauses that are short: 100
% 0.12/0.39  absolute distinct symbol count: 5
% 0.12/0.39     distinct predicate count: 1
% 0.12/0.39     distinct function count: 3
% 0.12/0.39     distinct constant count: 1
% 0.12/0.39  
% 0.12/0.39  ---------- no more Softie stats ----------
% 0.12/0.39  
% 0.12/0.39  
% 0.12/0.39  
% 0.12/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39  
% 0.12/0.39  Stopped by limit on number of solutions
% 0.12/0.39  
% 0.12/0.39  =========== start of search ===========
% 1.56/1.76  
% 1.56/1.76  -------- PROOF -------- 
% 1.56/1.76  % SZS status Unsatisfiable
% 1.56/1.76  % SZS output start Refutation
% 1.56/1.76  
% 1.56/1.76  Model 3 (0.00 seconds, 0 Inserts)
% 1.56/1.76  
% 1.56/1.76  Stopped by limit on number of solutions
% 1.56/1.76  
% 1.56/1.76  Model 4 (0.00 seconds, 0 Inserts)
% 1.56/1.76  
% 1.56/1.76  Stopped by limit on number of solutions
% 1.56/1.76  
% 1.56/1.76  Model 5 (0.00 seconds, 0 Inserts)
% 1.56/1.76  
% 1.56/1.76  Stopped by limit on number of solutions
% 1.56/1.76  
% 1.56/1.76  Stopped by limit on insertions
% 1.56/1.76  
% 1.56/1.76  Model 6 [ 1 1 31 ] (0.00 seconds, 250000 Inserts)
% 1.56/1.76  
% 1.56/1.76  ----> UNIT CONFLICT at   1.36 sec ----> 2902 [binary,2901.1,3.1] {-} $F.
% 1.56/1.76  
% 1.56/1.76  Length of proof is 16.  Level of proof is 7.
% 1.56/1.76  
% 1.56/1.76  ---------------- PROOF ----------------
% 1.56/1.76  % SZS status Unsatisfiable
% 1.56/1.76  % SZS output start Refutation
% 1.56/1.76  
% 1.56/1.76  1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.56/1.76  3 [] {+} -is_a_theorem(implies(necessary(a),not(necessary(not(a))))).
% 1.56/1.76  4 [] {+} is_a_theorem(implies(A,implies(B,A))).
% 1.56/1.76  5 [] {+} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))).
% 1.56/1.76  6 [] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 1.56/1.76  8 [] {+} is_a_theorem(implies(necessary(A),A)).
% 1.56/1.76  10 [hyper,4,1,4] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 1.56/1.76  12 [hyper,8,1,4] {+} is_a_theorem(implies(A,implies(necessary(B),B))).
% 1.56/1.76  14 [hyper,6,1,4] {-} is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))).
% 1.56/1.76  20 [hyper,5,1,5] {+} is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(A,B)),implies(implies(A,implies(B,C)),implies(A,C)))).
% 1.56/1.76  26 [hyper,14,1,5] {-} is_a_theorem(implies(implies(A,implies(not(B),not(C))),implies(A,implies(C,B)))).
% 1.56/1.76  42 [hyper,12,1,5] {+} is_a_theorem(implies(implies(A,necessary(B)),implies(A,B))).
% 1.56/1.76  49 [hyper,10,1,5] {+} is_a_theorem(implies(implies(A,B),implies(A,implies(C,B)))).
% 1.56/1.76  61 [hyper,26,1,4] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 1.56/1.76  63 [hyper,61,1,26] {+} is_a_theorem(implies(not(not(A)),implies(B,A))).
% 1.56/1.76  107 [hyper,20,1,12] {+} is_a_theorem(implies(implies(necessary(A),implies(A,B)),implies(necessary(A),B))).
% 1.56/1.76  108 [hyper,20,1,10] {+} is_a_theorem(implies(implies(A,implies(implies(B,A),C)),implies(A,C))).
% 1.56/1.76  306 [hyper,42,1,26] {-} is_a_theorem(implies(implies(not(A),necessary(not(B))),implies(B,A))).
% 1.56/1.76  433 [hyper,49,1,306] {-} is_a_theorem(implies(implies(not(A),necessary(not(B))),implies(C,implies(B,A)))).
% 1.56/1.76  1989 [hyper,108,1,63] {+} is_a_theorem(implies(not(not(A)),A)).
% 1.56/1.76  2011 [hyper,1989,1,433] {-} is_a_theorem(implies(A,implies(B,not(necessary(not(B)))))).
% 1.56/1.76  2901 [hyper,2011,1,107] {-} is_a_theorem(implies(necessary(A),not(necessary(not(A))))).
% 1.56/1.76  2902 [binary,2901.1,3.1] {-} $F.
% 1.56/1.76  
% 1.56/1.76  % SZS output end Refutation
% 1.56/1.76  ------------ end of proof -------------
% 1.56/1.76  
% 1.56/1.76  
% 1.56/1.76  Search stopped by max_proofs option.
% 1.56/1.76  
% 1.56/1.76  
% 1.56/1.76  Search stopped by max_proofs option.
% 1.56/1.76  
% 1.56/1.76  ============ end of search ============
% 1.56/1.76  
% 1.56/1.76  ----------- soft-scott stats ----------
% 1.56/1.76  
% 1.56/1.76  true clauses given          95      (29.1%)
% 1.56/1.76  false clauses given        232
% 1.56/1.76  
% 1.56/1.76        FALSE     TRUE
% 1.56/1.76     7  0         3
% 1.56/1.76     8  0         20
% 1.56/1.76     9  21        39
% 1.56/1.76    10  69        93
% 1.56/1.76    11  82        99
% 1.56/1.76    12  64        58
% 1.56/1.76    13  67        89
% 1.56/1.76    14  231       111
% 1.56/1.76    15  286       80
% 1.56/1.76    16  197       70
% 1.56/1.76    17  177       38
% 1.56/1.76    18  108       31
% 1.56/1.76    19  79        19
% 1.56/1.76    20  65        25
% 1.56/1.76    21  44        8
% 1.56/1.76    22  40        16
% 1.56/1.76    23  33        8
% 1.56/1.76    24  21        14
% 1.56/1.76    25  8         3
% 1.56/1.76    26  14        10
% 1.56/1.76    27  7         2
% 1.56/1.76    28  14        4
% 1.56/1.76    29  17        3
% 1.56/1.76    30  17        1
% 1.56/1.76    31  0         1
% 1.56/1.76    32  4         4
% 1.56/1.76    33  1         1
% 1.56/1.76    34  0         3
% 1.56/1.76    35  1         1
% 1.56/1.76    36  1         0
% 1.56/1.76    38  1         0
% 1.56/1.76    41  4         0
% 1.56/1.76    46  0         1
% 1.56/1.76    50  0         1
% 1.56/1.76  tot:  1673      856      (33.8% true)
% 1.56/1.76  
% 1.56/1.76  
% 1.56/1.76  Model 6 [ 1 1 31 ] (0.00 seconds, 250000 Inserts)
% 1.56/1.76  
% 1.56/1.76  That finishes the proof of the theorem.
% 1.56/1.76  
% 1.56/1.76  Process 24023 finished Sun Jul  3 04:38:36 2022
%------------------------------------------------------------------------------