↑ Up

SOS---2.0.UNS-Ref.s

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

% Computer : n029.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:29:43 EDT 2022

% Result   : Unsatisfiable 4.24s 4.42s
% Output   : Refutation 4.24s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL365-1 : TPTP v8.1.0. Released v2.3.0.
% 0.12/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n029.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jul  3 19:31:56 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.36  ----- Otter 3.2, August 2001 -----
% 0.19/0.36  The process was started by sandbox2 on n029.cluster.edu,
% 0.19/0.36  Sun Jul  3 19:31:56 2022
% 0.19/0.36  The command was "./sos".  The process ID is 29430.
% 0.19/0.36  
% 0.19/0.36  set(prolog_style_variables).
% 0.19/0.36  set(auto).
% 0.19/0.36     dependent: set(auto1).
% 0.19/0.36     dependent: set(process_input).
% 0.19/0.36     dependent: clear(print_kept).
% 0.19/0.36     dependent: clear(print_new_demod).
% 0.19/0.36     dependent: clear(print_back_demod).
% 0.19/0.36     dependent: clear(print_back_sub).
% 0.19/0.36     dependent: set(control_memory).
% 0.19/0.36     dependent: assign(max_mem, 12000).
% 0.19/0.36     dependent: assign(pick_given_ratio, 4).
% 0.19/0.36     dependent: assign(stats_level, 1).
% 0.19/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36     dependent: assign(sos_limit, 5000).
% 0.19/0.36     dependent: assign(max_weight, 60).
% 0.19/0.36  clear(print_given).
% 0.19/0.36  
% 0.19/0.36  list(usable).
% 0.19/0.36  
% 0.19/0.36  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.19/0.36  
% 0.19/0.36  This is a Horn set without equality.  The strategy will
% 0.19/0.36  be hyperresolution, with satellites in sos and nuclei
% 0.19/0.36  in usable.
% 0.19/0.36  
% 0.19/0.36     dependent: set(hyper_res).
% 0.19/0.36     dependent: clear(order_hyper).
% 0.19/0.36  
% 0.19/0.36  ------------> process usable:
% 0.19/0.36  
% 0.19/0.36  ------------> process sos:
% 0.19/0.36  
% 0.19/0.36  ======= end of input processing =======
% 0.19/0.38  
% 0.19/0.38  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38  
% 0.19/0.38  Stopped by limit on number of solutions
% 0.19/0.38  
% 0.19/0.38  
% 0.19/0.38  -------------- Softie stats --------------
% 0.19/0.38  
% 0.19/0.38  UPDATE_STOP: 300
% 0.19/0.38  SFINDER_TIME_LIMIT: 2
% 0.19/0.38  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38  number of clauses in intial UL: 2
% 0.19/0.38  number of clauses initially in problem: 5
% 0.19/0.38  percentage of clauses intially in UL: 40
% 0.19/0.38  percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.38  percent of all initial clauses that are short: 100
% 0.19/0.38  absolute distinct symbol count: 7
% 0.19/0.38     distinct predicate count: 1
% 0.19/0.38     distinct function count: 2
% 0.19/0.38     distinct constant count: 4
% 0.19/0.38  
% 0.19/0.38  ---------- no more Softie stats ----------
% 0.19/0.38  
% 0.19/0.38  
% 0.19/0.38  
% 0.19/0.38  =========== start of search ===========
% 4.24/4.42  
% 4.24/4.42  -------- PROOF -------- 
% 4.24/4.42  % SZS status Unsatisfiable
% 4.24/4.42  % SZS output start Refutation
% 4.24/4.42  
% 4.24/4.42  Model 2 (0.00 seconds, 0 Inserts)
% 4.24/4.42  
% 4.24/4.42  Stopped by limit on number of solutions
% 4.24/4.42  
% 4.24/4.42  Model 3 (0.00 seconds, 0 Inserts)
% 4.24/4.42  
% 4.24/4.42  Stopped by limit on number of solutions
% 4.24/4.42  
% 4.24/4.42  Model 4 (0.00 seconds, 0 Inserts)
% 4.24/4.42  
% 4.24/4.42  Stopped by limit on number of solutions
% 4.24/4.42  
% 4.24/4.42  Stopped by limit on insertions
% 4.24/4.42  
% 4.24/4.42  Model 5 [ 1 1 436 ] (0.00 seconds, 250000 Inserts)
% 4.24/4.42  
% 4.24/4.42  ----> UNIT CONFLICT at   4.03 sec ----> 1772 [binary,1771.1,2.1] {+} $F.
% 4.24/4.42  
% 4.24/4.42  Length of proof is 16.  Level of proof is 12.
% 4.24/4.42  
% 4.24/4.42  ---------------- PROOF ----------------
% 4.24/4.42  % SZS status Unsatisfiable
% 4.24/4.42  % SZS output start Refutation
% 4.24/4.42  
% 4.24/4.42  1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 4.24/4.42  2 [] {+} -is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u))).
% 4.24/4.42  3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 4.24/4.42  4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 4.24/4.42  5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 4.24/4.42  6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 4.24/4.42  7 [hyper,4,1,3] {+} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 4.24/4.42  9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 4.24/4.42  15 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 4.24/4.42  18 [hyper,6,1,6] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 4.24/4.42  21 [hyper,6,1,9] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 4.24/4.42  24 [hyper,21,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 4.24/4.42  55 [hyper,24,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 4.24/4.42  71 [hyper,55,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 4.24/4.42  85 [hyper,71,1,15] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 4.24/4.42  111 [hyper,85,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 4.24/4.42  162 [hyper,111,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 4.24/4.42  203 [hyper,162,1,7] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 4.24/4.42  437 [hyper,203,1,18] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 4.24/4.42  947 [hyper,437,1,6] {-} is_a_theorem(implies(implies(not(A),B),implies(C,implies(implies(B,A),A)))).
% 4.24/4.42  1771 [hyper,947,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(implies(B,C),C)),D),implies(implies(not(C),B),D))).
% 4.24/4.42  1772 [binary,1771.1,2.1] {+} $F.
% 4.24/4.42  
% 4.24/4.42  % SZS output end Refutation
% 4.24/4.42  ------------ end of proof -------------
% 4.24/4.42  
% 4.24/4.42  
% 4.24/4.42  Search stopped by max_proofs option.
% 4.24/4.42  
% 4.24/4.42  
% 4.24/4.42  Search stopped by max_proofs option.
% 4.24/4.42  
% 4.24/4.42  ============ end of search ============
% 4.24/4.42  
% 4.24/4.42  ----------- soft-scott stats ----------
% 4.24/4.42  
% 4.24/4.42  true clauses given          29      (27.1%)
% 4.24/4.42  false clauses given         78
% 4.24/4.42  
% 4.24/4.42        FALSE     TRUE
% 4.24/4.42    10  0         4
% 4.24/4.42    11  0         18
% 4.24/4.42    12  0         36
% 4.24/4.42    13  22        37
% 4.24/4.42    14  19        68
% 4.24/4.42    15  57        71
% 4.24/4.42    16  23        102
% 4.24/4.42    17  51        94
% 4.24/4.42    18  23        113
% 4.24/4.42    19  63        83
% 4.24/4.42    20  39        83
% 4.24/4.42    21  56        42
% 4.24/4.42    22  33        55
% 4.24/4.42    23  34        32
% 4.24/4.42    24  18        33
% 4.24/4.42    25  38        14
% 4.24/4.42    26  8         22
% 4.24/4.42    27  22        3
% 4.24/4.42    28  7         19
% 4.24/4.42    29  22        1
% 4.24/4.42    30  2         17
% 4.24/4.42    31  32        0
% 4.24/4.42    32  1         12
% 4.24/4.42    33  13        1
% 4.24/4.42    34  0         21
% 4.24/4.42    35  7         0
% 4.24/4.42    36  1         11
% 4.24/4.42    37  9         0
% 4.24/4.42    38  0         5
% 4.24/4.42    39  5         0
% 4.24/4.42    40  0         6
% 4.24/4.42    42  0         4
% 4.24/4.42    43  1         0
% 4.24/4.42    45  1         0
% 4.24/4.42    46  0         1
% 4.24/4.42    48  0         1
% 4.24/4.42    53  1         0
% 4.24/4.42    56  1         0
% 4.24/4.42    59  1         0
% 4.24/4.42  tot:  610       1009      (62.3% true)
% 4.24/4.42  
% 4.24/4.42  
% 4.24/4.42  Model 5 [ 1 1 436 ] (0.00 seconds, 250000 Inserts)
% 4.24/4.42  
% 4.24/4.42  That finishes the proof of the theorem.
% 4.24/4.42  
% 4.24/4.42  Process 29430 finished Sun Jul  3 19:32:00 2022
%------------------------------------------------------------------------------