↑ Up

SOS---2.0.UNS-Ref.s

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

% Computer : n026.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:34 EDT 2022

% Result   : Unsatisfiable 13.76s 14.09s
% Output   : Refutation 13.76s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : LCL048-1 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.10  % Command  : sos-script %s
% 0.09/0.29  % Computer : n026.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit : 300
% 0.09/0.29  % WCLimit  : 600
% 0.09/0.29  % DateTime : Mon Jul  4 10:14:06 EDT 2022
% 0.09/0.29  % CPUTime  : 
% 0.09/0.31  ----- Otter 3.2, August 2001 -----
% 0.09/0.31  The process was started by sandbox2 on n026.cluster.edu,
% 0.09/0.31  Mon Jul  4 10:14:06 2022
% 0.09/0.31  The command was "./sos".  The process ID is 7084.
% 0.09/0.31  
% 0.09/0.31  set(prolog_style_variables).
% 0.09/0.31  set(auto).
% 0.09/0.31     dependent: set(auto1).
% 0.09/0.31     dependent: set(process_input).
% 0.09/0.31     dependent: clear(print_kept).
% 0.09/0.31     dependent: clear(print_new_demod).
% 0.09/0.31     dependent: clear(print_back_demod).
% 0.09/0.31     dependent: clear(print_back_sub).
% 0.09/0.31     dependent: set(control_memory).
% 0.09/0.31     dependent: assign(max_mem, 12000).
% 0.09/0.31     dependent: assign(pick_given_ratio, 4).
% 0.09/0.31     dependent: assign(stats_level, 1).
% 0.09/0.31     dependent: assign(pick_semantic_ratio, 3).
% 0.09/0.31     dependent: assign(sos_limit, 5000).
% 0.09/0.31     dependent: assign(max_weight, 60).
% 0.09/0.31  clear(print_given).
% 0.09/0.31  
% 0.09/0.31  list(usable).
% 0.09/0.31  
% 0.09/0.31  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.09/0.31  
% 0.09/0.31  This is a Horn set without equality.  The strategy will
% 0.09/0.31  be hyperresolution, with satellites in sos and nuclei
% 0.09/0.31  in usable.
% 0.09/0.31  
% 0.09/0.31     dependent: set(hyper_res).
% 0.09/0.31     dependent: clear(order_hyper).
% 0.09/0.31  
% 0.09/0.31  ------------> process usable:
% 0.09/0.31  
% 0.09/0.31  ------------> process sos:
% 0.09/0.31  
% 0.09/0.31  ======= end of input processing =======
% 0.14/0.32  
% 0.14/0.32  Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.32  
% 0.14/0.32  Stopped by limit on number of solutions
% 0.14/0.32  
% 0.14/0.32  
% 0.14/0.32  -------------- Softie stats --------------
% 0.14/0.32  
% 0.14/0.32  UPDATE_STOP: 300
% 0.14/0.32  SFINDER_TIME_LIMIT: 2
% 0.14/0.32  SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.32  number of clauses in intial UL: 2
% 0.14/0.32  number of clauses initially in problem: 5
% 0.14/0.32  percentage of clauses intially in UL: 40
% 0.14/0.32  percentage of distinct symbols occuring in initial UL: 83
% 0.14/0.32  percent of all initial clauses that are short: 100
% 0.14/0.32  absolute distinct symbol count: 6
% 0.14/0.32     distinct predicate count: 1
% 0.14/0.32     distinct function count: 2
% 0.14/0.32     distinct constant count: 3
% 0.14/0.32  
% 0.14/0.32  ---------- no more Softie stats ----------
% 0.14/0.32  
% 0.14/0.32  
% 0.14/0.32  
% 0.14/0.32  =========== start of search ===========
% 13.76/14.09  
% 13.76/14.09  -- HEY sandbox2, WE HAVE A PROOF!! -- 
% 13.76/14.09  
% 13.76/14.09  Model 2 (0.00 seconds, 0 Inserts)
% 13.76/14.09  
% 13.76/14.09  Stopped by limit on number of solutions
% 13.76/14.09  
% 13.76/14.09  Model 3 (0.00 seconds, 0 Inserts)
% 13.76/14.09  
% 13.76/14.09  Stopped by limit on number of solutions
% 13.76/14.09  
% 13.76/14.09  Model 4 (0.00 seconds, 0 Inserts)
% 13.76/14.09  
% 13.76/14.09  Stopped by limit on number of solutions
% 13.76/14.09  
% 13.76/14.09  Stopped by limit on insertions
% 13.76/14.09  
% 13.76/14.09  Model 5 [ 1 1 342 ] (0.00 seconds, 250000 Inserts)
% 13.76/14.09  
% 13.76/14.09  Stopped by limit on insertions
% 13.76/14.09  
% 13.76/14.09  Model 6 [ 1 0 453 ] (0.00 seconds, 250000 Inserts)
% 13.76/14.09  
% 13.76/14.09  Stopped by limit on insertions
% 13.76/14.09  
% 13.76/14.09  Stopped by limit on insertions
% 13.76/14.09  
% 13.76/14.09  Stopped by limit on insertions
% 13.76/14.09  
% 13.76/14.09  Model 7 [ 3 1 314 ] (0.00 seconds, 250000 Inserts)
% 13.76/14.09  
% 13.76/14.09  ----> UNIT CONFLICT at  13.71 sec ----> 1071 [binary,1070.1,2.1] {-} $F.
% 13.76/14.09  
% 13.76/14.09  Length of proof is 18.  Level of proof is 14.
% 13.76/14.09  
% 13.76/14.09  ---------------- PROOF ----------------
% 13.76/14.09  % SZS status Unsatisfiable
% 13.76/14.09  % SZS output start Refutation
% 13.76/14.09  
% 13.76/14.09  1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 13.76/14.09  2 [] {+} -is_a_theorem(implies(implies(implies(a,b),c),implies(b,c))).
% 13.76/14.09  3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 13.76/14.09  4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 13.76/14.09  5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 13.76/14.09  6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 13.76/14.09  7 [hyper,4,1,3] {+} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 13.76/14.09  9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 13.76/14.09  15 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 13.76/14.09  18 [hyper,6,1,6] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 13.76/14.09  21 [hyper,6,1,9] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 13.76/14.09  24 [hyper,21,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 13.76/14.09  55 [hyper,24,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 13.76/14.09  71 [hyper,55,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 13.76/14.09  85 [hyper,71,1,15] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 13.76/14.09  111 [hyper,85,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 13.76/14.09  162 [hyper,111,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 13.76/14.09  203 [hyper,162,1,7] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 13.76/14.09  437 [hyper,203,1,18] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 13.76/14.09  947 [hyper,437,1,55] {-} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 13.76/14.09  972 [hyper,947,1,437] {-} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 13.76/14.09  1047 [hyper,972,1,972] {+} is_a_theorem(implies(A,implies(B,A))).
% 13.76/14.09  1070 [hyper,1047,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 13.76/14.09  1071 [binary,1070.1,2.1] {-} $F.
% 13.76/14.09  
% 13.76/14.09  % SZS output end Refutation
% 13.76/14.09  ------------ end of proof -------------
% 13.76/14.09  
% 13.76/14.09  
% 13.76/14.09  Search stopped by max_proofs option.
% 13.76/14.09  
% 13.76/14.09  
% 13.76/14.09  Search stopped by max_proofs option.
% 13.76/14.09  
% 13.76/14.09  ============ end of search ============
% 13.76/14.09  
% 13.76/14.09  ----------- soft-scott stats ----------
% 13.76/14.09  
% 13.76/14.09  true clauses given          19      (25.3%)
% 13.76/14.09  false clauses given         56
% 13.76/14.09  
% 13.76/14.09        FALSE     TRUE
% 13.76/14.09     9  0         1
% 13.76/14.09    10  0         2
% 13.76/14.09    11  5         10
% 13.76/14.09    12  7         15
% 13.76/14.09    13  13        25
% 13.76/14.09    14  24        25
% 13.76/14.09    15  44        31
% 13.76/14.09    16  60        26
% 13.76/14.09    17  79        19
% 13.76/14.09    18  80        9
% 13.76/14.09    19  75        11
% 13.76/14.09    20  62        4
% 13.76/14.09    21  49        9
% 13.76/14.09    22  47        0
% 13.76/14.09    23  34        6
% 13.76/14.09    24  32        0
% 13.76/14.09    25  18        9
% 13.76/14.09    26  16        0
% 13.76/14.09    27  8         4
% 13.76/14.09    28  17        0
% 13.76/14.09    29  8         3
% 13.76/14.09    30  8         0
% 13.76/14.09    31  11        3
% 13.76/14.09    32  10        0
% 13.76/14.09    33  9         0
% 13.76/14.09    34  14        0
% 13.76/14.09    35  4         0
% 13.76/14.09    36  9         0
% 13.76/14.09    37  4         0
% 13.76/14.09    38  4         0
% 13.76/14.09    39  1         0
% 13.76/14.09    40  4         0
% 13.76/14.09    42  1         0
% 13.76/14.09    43  1         0
% 13.76/14.09    45  1         0
% 13.76/14.09    46  1         0
% 13.76/14.09    48  1         0
% 13.76/14.09  tot:  761       212      (21.8% true)
% 13.76/14.09  
% 13.76/14.09  
% 13.76/14.09  Model 7 [ 3 1 314 ] (0.00 seconds, 250000 Inserts)
% 13.76/14.09  
% 13.76/14.09  That finishes the proof of the theorem.
% 13.76/14.09  
% 13.76/14.09  Process 7084 finished Mon Jul  4 10:14:20 2022
%------------------------------------------------------------------------------