TSTP Solution File: LCL397-1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : LCL397-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n008.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:55 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : LCL397-1 : TPTP v8.1.0. Released v2.3.0.
% 0.11/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n008.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 : Mon Jul  4 01:51:10 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.34  ----- Otter 3.2, August 2001 -----
% 0.18/0.34  The process was started by sandbox2 on n008.cluster.edu,
% 0.18/0.34  Mon Jul  4 01:51:10 2022
% 0.18/0.34  The command was "./sos".  The process ID is 30590.
% 0.18/0.34  
% 0.18/0.34  set(prolog_style_variables).
% 0.18/0.34  set(auto).
% 0.18/0.34     dependent: set(auto1).
% 0.18/0.34     dependent: set(process_input).
% 0.18/0.34     dependent: clear(print_kept).
% 0.18/0.34     dependent: clear(print_new_demod).
% 0.18/0.34     dependent: clear(print_back_demod).
% 0.18/0.34     dependent: clear(print_back_sub).
% 0.18/0.34     dependent: set(control_memory).
% 0.18/0.34     dependent: assign(max_mem, 12000).
% 0.18/0.34     dependent: assign(pick_given_ratio, 4).
% 0.18/0.34     dependent: assign(stats_level, 1).
% 0.18/0.34     dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.34     dependent: assign(sos_limit, 5000).
% 0.18/0.34     dependent: assign(max_weight, 60).
% 0.18/0.34  clear(print_given).
% 0.18/0.34  
% 0.18/0.34  list(usable).
% 0.18/0.34  
% 0.18/0.34  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.18/0.34  
% 0.18/0.34  This is a Horn set without equality.  The strategy will
% 0.18/0.34  be hyperresolution, with satellites in sos and nuclei
% 0.18/0.34  in usable.
% 0.18/0.34  
% 0.18/0.34     dependent: set(hyper_res).
% 0.18/0.34     dependent: clear(order_hyper).
% 0.18/0.34  
% 0.18/0.34  ------------> process usable:
% 0.18/0.34  
% 0.18/0.34  ------------> process sos:
% 0.18/0.34  
% 0.18/0.34  ======= end of input processing =======
% 0.18/0.36  
% 0.18/0.36  Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.36  
% 0.18/0.36  Stopped by limit on number of solutions
% 0.18/0.36  
% 0.18/0.36  
% 0.18/0.36  -------------- Softie stats --------------
% 0.18/0.36  
% 0.18/0.36  UPDATE_STOP: 300
% 0.18/0.36  SFINDER_TIME_LIMIT: 2
% 0.18/0.36  SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.36  number of clauses in intial UL: 2
% 0.18/0.36  number of clauses initially in problem: 5
% 0.18/0.36  percentage of clauses intially in UL: 40
% 0.18/0.36  percentage of distinct symbols occuring in initial UL: 80
% 0.18/0.36  percent of all initial clauses that are short: 100
% 0.18/0.36  absolute distinct symbol count: 5
% 0.18/0.36     distinct predicate count: 1
% 0.18/0.36     distinct function count: 2
% 0.18/0.36     distinct constant count: 2
% 0.18/0.36  
% 0.18/0.36  ---------- no more Softie stats ----------
% 0.18/0.36  
% 0.18/0.36  
% 0.18/0.36  
% 0.18/0.36  =========== start of search ===========
% 0.59/0.80  
% 0.59/0.80  -------- PROOF -------- 
% 0.59/0.80  % SZS status Unsatisfiable
% 0.59/0.80  % SZS output start Refutation
% 0.59/0.80  
% 0.59/0.80  Model 2 (0.00 seconds, 0 Inserts)
% 0.59/0.80  
% 0.59/0.80  Stopped by limit on number of solutions
% 0.59/0.80  
% 0.59/0.80  Model 3 (0.00 seconds, 0 Inserts)
% 0.59/0.80  
% 0.59/0.80  Stopped by limit on number of solutions
% 0.59/0.80  
% 0.59/0.80  Model 4 [ 1 0 164 ] (0.00 seconds, 225810 Inserts)
% 0.59/0.80  
% 0.59/0.80  ----> UNIT CONFLICT at   0.43 sec ----> 337 [binary,336.1,2.1] {-} $F.
% 0.59/0.80  
% 0.59/0.80  Length of proof is 8.  Level of proof is 6.
% 0.59/0.80  
% 0.59/0.80  ---------------- PROOF ----------------
% 0.59/0.80  % SZS status Unsatisfiable
% 0.59/0.80  % SZS output start Refutation
% 0.59/0.80  
% 0.59/0.80  1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.59/0.80  2 [] {+} -is_a_theorem(implies(x,implies(y,y))).
% 0.59/0.80  3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 0.59/0.80  4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 0.59/0.80  5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 0.59/0.80  6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 0.59/0.80  9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 0.59/0.80  29 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 0.59/0.80  34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 0.59/0.80  36 [hyper,34,1,5] {+} is_a_theorem(implies(not(implies(A,A)),B)).
% 0.59/0.80  69 [hyper,29,1,36] {-} is_a_theorem(implies(A,implies(not(implies(B,B)),C))).
% 0.59/0.80  95 [hyper,69,1,3] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 0.59/0.80  336 [hyper,95,1,4] {-} is_a_theorem(implies(A,implies(B,B))).
% 0.59/0.80  337 [binary,336.1,2.1] {-} $F.
% 0.59/0.80  
% 0.59/0.80  % SZS output end Refutation
% 0.59/0.80  ------------ end of proof -------------
% 0.59/0.80  
% 0.59/0.80  
% 0.59/0.80  Search stopped by max_proofs option.
% 0.59/0.80  
% 0.59/0.80  
% 0.59/0.80  Search stopped by max_proofs option.
% 0.59/0.80  
% 0.59/0.80  ============ end of search ============
% 0.59/0.80  
% 0.59/0.80  ----------- soft-scott stats ----------
% 0.59/0.80  
% 0.59/0.80  true clauses given           5      (13.2%)
% 0.59/0.80  false clauses given         33
% 0.59/0.80  
% 0.59/0.80        FALSE     TRUE
% 0.59/0.80    13  2         2
% 0.59/0.80    14  11        0
% 0.59/0.80    15  25        0
% 0.59/0.80    16  23        3
% 0.59/0.80    17  26        1
% 0.59/0.80    18  28        0
% 0.59/0.80    19  26        3
% 0.59/0.80    20  28        0
% 0.59/0.80    21  30        0
% 0.59/0.80    22  11        1
% 0.59/0.80    23  9         0
% 0.59/0.80    24  6         0
% 0.59/0.80    25  9         2
% 0.59/0.80    26  1         0
% 0.59/0.80    27  5         0
% 0.59/0.80    29  9         0
% 0.59/0.80    31  8         0
% 0.59/0.80    33  1         0
% 0.59/0.80    35  2         0
% 0.59/0.80    37  2         0
% 0.59/0.80  tot:  262       12      (4.4% true)
% 0.59/0.80  
% 0.59/0.80  
% 0.59/0.80  Model 4 [ 1 0 164 ] (0.00 seconds, 225810 Inserts)
% 0.59/0.80  
% 0.59/0.80  That finishes the proof of the theorem.
% 0.59/0.80  
% 0.59/0.80  Process 30590 finished Mon Jul  4 01:51:10 2022
%------------------------------------------------------------------------------