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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : LCL115-1 : TPTP v8.1.0. Released v1.0.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:28:02 EDT 2022

% Result   : Unsatisfiable 6.92s 7.11s
% Output   : Refutation 6.92s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL115-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n008.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 : Sat Jul  2 13:17:08 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  ----- Otter 3.2, August 2001 -----
% 0.13/0.35  The process was started by sandbox on n008.cluster.edu,
% 0.13/0.35  Sat Jul  2 13:17:08 2022
% 0.13/0.35  The command was "./sos".  The process ID is 27501.
% 0.13/0.35  
% 0.13/0.35  set(prolog_style_variables).
% 0.13/0.35  set(auto).
% 0.13/0.35     dependent: set(auto1).
% 0.13/0.35     dependent: set(process_input).
% 0.13/0.35     dependent: clear(print_kept).
% 0.13/0.35     dependent: clear(print_new_demod).
% 0.13/0.35     dependent: clear(print_back_demod).
% 0.13/0.35     dependent: clear(print_back_sub).
% 0.13/0.35     dependent: set(control_memory).
% 0.13/0.35     dependent: assign(max_mem, 12000).
% 0.13/0.35     dependent: assign(pick_given_ratio, 4).
% 0.13/0.35     dependent: assign(stats_level, 1).
% 0.13/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35     dependent: assign(sos_limit, 5000).
% 0.13/0.35     dependent: assign(max_weight, 60).
% 0.13/0.35  clear(print_given).
% 0.13/0.35  
% 0.13/0.35  list(usable).
% 0.13/0.35  
% 0.13/0.35  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.35  
% 0.13/0.35  This is a Horn set without equality.  The strategy will
% 0.13/0.35  be hyperresolution, with satellites in sos and nuclei
% 0.13/0.35  in usable.
% 0.13/0.35  
% 0.13/0.35     dependent: set(hyper_res).
% 0.13/0.35     dependent: clear(order_hyper).
% 0.13/0.36  
% 0.13/0.36  ------------> process usable:
% 0.13/0.36  
% 0.13/0.36  ------------> process sos:
% 0.13/0.36  
% 0.13/0.36  ======= end of input processing =======
% 0.13/0.39  
% 0.13/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39  
% 0.13/0.39  Stopped by limit on number of solutions
% 0.13/0.39  
% 0.13/0.39  
% 0.13/0.39  -------------- Softie stats --------------
% 0.13/0.39  
% 0.13/0.39  UPDATE_STOP: 300
% 0.13/0.39  SFINDER_TIME_LIMIT: 2
% 0.13/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.39  number of clauses in intial UL: 2
% 0.13/0.39  number of clauses initially in problem: 6
% 0.13/0.39  percentage of clauses intially in UL: 33
% 0.13/0.39  percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.39  percent of all initial clauses that are short: 100
% 0.13/0.39  absolute distinct symbol count: 5
% 0.13/0.39     distinct predicate count: 1
% 0.13/0.39     distinct function count: 2
% 0.13/0.39     distinct constant count: 2
% 0.13/0.39  
% 0.13/0.39  ---------- no more Softie stats ----------
% 0.13/0.39  
% 0.13/0.39  
% 0.13/0.39  
% 0.13/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.39  
% 0.13/0.39  Stopped by limit on number of solutions
% 0.13/0.39  
% 0.13/0.39  =========== start of search ===========
% 6.44/6.69  
% 6.44/6.69  
% 6.44/6.69  Changing weight limit from 60 to 22.
% 6.44/6.69  
% 6.44/6.69  Stopped by limit on insertions
% 6.44/6.69  
% 6.44/6.69  Stopped by limit on insertions
% 6.44/6.69  
% 6.44/6.69  Model 3 [ 1 0 50 ] (0.00 seconds, 250000 Inserts)
% 6.44/6.69  
% 6.44/6.69  Model 4 (0.00 seconds, 250000 Inserts)
% 6.44/6.69  
% 6.44/6.69  Stopped by limit on number of solutions
% 6.44/6.69  
% 6.44/6.69  Model 5 (0.00 seconds, 250000 Inserts)
% 6.44/6.69  
% 6.44/6.69  Stopped by limit on number of solutions
% 6.44/6.69  
% 6.44/6.69  Model 6 (0.00 seconds, 250000 Inserts)
% 6.44/6.69  
% 6.44/6.69  Stopped by limit on number of solutions
% 6.44/6.69  
% 6.44/6.69  Resetting weight limit to 22 after 230 givens.
% 6.44/6.69  
% 6.69/6.92  
% 6.69/6.92  
% 6.69/6.92  Changing weight limit from 22 to 21.
% 6.69/6.92  
% 6.69/6.92  Resetting weight limit to 21 after 300 givens.
% 6.69/6.92  
% 6.69/6.95  
% 6.69/6.95  
% 6.69/6.95  Changing weight limit from 21 to 20.
% 6.69/6.95  
% 6.69/6.95  Resetting weight limit to 20 after 305 givens.
% 6.69/6.95  
% 6.69/6.96  
% 6.69/6.96  
% 6.69/6.96  Changing weight limit from 20 to 19.
% 6.69/6.96  
% 6.69/6.96  Resetting weight limit to 19 after 310 givens.
% 6.69/6.96  
% 6.81/7.00  
% 6.81/7.00  
% 6.81/7.00  Changing weight limit from 19 to 18.
% 6.81/7.00  
% 6.81/7.00  Resetting weight limit to 18 after 325 givens.
% 6.81/7.00  
% 6.92/7.11  
% 6.92/7.11  -------- PROOF -------- 
% 6.92/7.11  % SZS status Unsatisfiable
% 6.92/7.11  % SZS output start Refutation
% 6.92/7.11  
% 6.92/7.11  ----> UNIT CONFLICT at   6.70 sec ----> 9326 [binary,9325.1,2.1] {-} $F.
% 6.92/7.11  
% 6.92/7.11  Length of proof is 15.  Level of proof is 12.
% 6.92/7.11  
% 6.92/7.11  ---------------- PROOF ----------------
% 6.92/7.11  % SZS status Unsatisfiable
% 6.92/7.11  % SZS output start Refutation
% 6.92/7.11  
% 6.92/7.11  1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 6.92/7.11  2 [] {+} -is_a_theorem(implies(not(implies(a,b)),not(b))).
% 6.92/7.11  3 [] {+} is_a_theorem(implies(A,implies(B,A))).
% 6.92/7.11  4 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 6.92/7.11  5 [] {+} is_a_theorem(implies(implies(implies(A,B),B),implies(implies(B,A),A))).
% 6.92/7.11  6 [] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 6.92/7.11  11 [hyper,4,1,6] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(not(B),not(A)),C))).
% 6.92/7.11  12 [hyper,4,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 6.92/7.11  15 [hyper,12,1,6] {-} is_a_theorem(implies(not(A),implies(A,B))).
% 6.92/7.11  18 [hyper,15,1,4] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).
% 6.92/7.11  19 [hyper,15,1,3] {-} is_a_theorem(implies(A,implies(not(B),implies(B,C)))).
% 6.92/7.11  20 [hyper,5,1,12] {+} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 6.92/7.11  23 [hyper,19,1,5] {-} is_a_theorem(implies(implies(implies(not(A),implies(A,B)),C),C)).
% 6.92/7.11  88 [hyper,23,1,12] {+} is_a_theorem(implies(A,A)).
% 6.92/7.11  91 [hyper,88,1,20] {+} is_a_theorem(implies(implies(implies(A,A),B),B)).
% 6.92/7.11  149 [hyper,11,1,91] {-} is_a_theorem(implies(implies(not(A),not(implies(B,B))),A)).
% 6.92/7.11  161 [hyper,149,1,18] {+} is_a_theorem(implies(not(not(A)),A)).
% 6.92/7.11  170 [hyper,161,1,6] {+} is_a_theorem(implies(A,not(not(A)))).
% 6.92/7.11  206 [hyper,170,1,11] {-} is_a_theorem(implies(implies(not(A),not(B)),not(not(implies(B,A))))).
% 6.92/7.11  380 [hyper,206,1,18] {+} is_a_theorem(implies(not(not(A)),not(not(implies(B,A))))).
% 6.92/7.11  9325 [hyper,380,1,6] {-} is_a_theorem(implies(not(implies(A,B)),not(B))).
% 6.92/7.11  9326 [binary,9325.1,2.1] {-} $F.
% 6.92/7.11  
% 6.92/7.11  % SZS output end Refutation
% 6.92/7.11  ------------ end of proof -------------
% 6.92/7.11  
% 6.92/7.11  
% 6.92/7.11  Search stopped by max_proofs option.
% 6.92/7.11  
% 6.92/7.11  
% 6.92/7.11  Search stopped by max_proofs option.
% 6.92/7.11  
% 6.92/7.11  ============ end of search ============
% 6.92/7.11  
% 6.92/7.11  ----------- soft-scott stats ----------
% 6.92/7.11  
% 6.92/7.11  true clauses given         133      (37.7%)
% 6.92/7.11  false clauses given        220
% 6.92/7.11  
% 6.92/7.11        FALSE     TRUE
% 6.92/7.11    10  0         43
% 6.92/7.11    11  0         119
% 6.92/7.11    12  0         239
% 6.92/7.11    13  1         370
% 6.92/7.11    14  238       558
% 6.92/7.11    15  254       577
% 6.92/7.11    16  860       517
% 6.92/7.11    17  741       165
% 6.92/7.11    18  498       6
% 6.92/7.11  tot:  2592      2594      (50.0% true)
% 6.92/7.11  
% 6.92/7.11  
% 6.92/7.11  Model 6 (0.00 seconds, 250000 Inserts)
% 6.92/7.11  
% 6.92/7.11  That finishes the proof of the theorem.
% 6.92/7.11  
% 6.92/7.11  Process 27501 finished Sat Jul  2 13:17:15 2022
%------------------------------------------------------------------------------