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

View Problem - Process Solution

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

% Computer : n003.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:33 EDT 2022

% Result   : Unsatisfiable 1.92s 2.08s
% Output   : Refutation 1.92s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : LCL195-1 : TPTP v8.1.0. Released v1.1.0.
% 0.12/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n003.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 16:09:40 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.35  ----- Otter 3.2, August 2001 -----
% 0.19/0.35  The process was started by sandbox on n003.cluster.edu,
% 0.19/0.35  Mon Jul  4 16:09:40 2022
% 0.19/0.35  The command was "./sos".  The process ID is 28937.
% 0.19/0.35  
% 0.19/0.35  set(prolog_style_variables).
% 0.19/0.35  set(auto).
% 0.19/0.35     dependent: set(auto1).
% 0.19/0.35     dependent: set(process_input).
% 0.19/0.35     dependent: clear(print_kept).
% 0.19/0.35     dependent: clear(print_new_demod).
% 0.19/0.35     dependent: clear(print_back_demod).
% 0.19/0.35     dependent: clear(print_back_sub).
% 0.19/0.35     dependent: set(control_memory).
% 0.19/0.35     dependent: assign(max_mem, 12000).
% 0.19/0.35     dependent: assign(pick_given_ratio, 4).
% 0.19/0.35     dependent: assign(stats_level, 1).
% 0.19/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35     dependent: assign(sos_limit, 5000).
% 0.19/0.35     dependent: assign(max_weight, 60).
% 0.19/0.35  clear(print_given).
% 0.19/0.35  
% 0.19/0.35  list(usable).
% 0.19/0.35  
% 0.19/0.35  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.19/0.35  
% 0.19/0.35  This is a Horn set without equality.  The strategy will
% 0.19/0.35  be hyperresolution, with satellites in sos and nuclei
% 0.19/0.35  in usable.
% 0.19/0.35  
% 0.19/0.35     dependent: set(hyper_res).
% 0.19/0.35     dependent: clear(order_hyper).
% 0.19/0.35  
% 0.19/0.35  ------------> process usable:
% 0.19/0.35  
% 0.19/0.35  ------------> process sos:
% 0.19/0.35  
% 0.19/0.35  ======= end of input processing =======
% 0.19/0.39  
% 0.19/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39  
% 0.19/0.39  Stopped by limit on number of solutions
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  -------------- Softie stats --------------
% 0.19/0.39  
% 0.19/0.39  UPDATE_STOP: 300
% 0.19/0.39  SFINDER_TIME_LIMIT: 2
% 0.19/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39  number of clauses in intial UL: 4
% 0.19/0.39  number of clauses initially in problem: 9
% 0.19/0.39  percentage of clauses intially in UL: 44
% 0.19/0.39  percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.39  percent of all initial clauses that are short: 100
% 0.19/0.39  absolute distinct symbol count: 7
% 0.19/0.39     distinct predicate count: 2
% 0.19/0.39     distinct function count: 2
% 0.19/0.39     distinct constant count: 3
% 0.19/0.39  
% 0.19/0.39  ---------- no more Softie stats ----------
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39  
% 0.19/0.39  Stopped by limit on number of solutions
% 0.19/0.39  
% 0.19/0.39  =========== start of search ===========
% 0.59/0.85  
% 0.59/0.85  
% 0.59/0.85  Changing weight limit from 60 to 37.
% 0.59/0.85  
% 0.59/0.85  Model 3 (0.00 seconds, 0 Inserts)
% 0.59/0.85  
% 0.59/0.85  Stopped by limit on number of solutions
% 0.59/0.85  
% 0.59/0.85  Model 4 (0.00 seconds, 0 Inserts)
% 0.59/0.85  
% 0.59/0.85  Stopped by limit on number of solutions
% 0.59/0.85  
% 0.59/0.85  Modelling stopped after 300 given clauses and 0.00 seconds
% 0.59/0.85  
% 0.59/0.85  
% 0.59/0.85  Resetting weight limit to 37 after 1135 givens.
% 0.59/0.85  
% 1.65/1.85  
% 1.65/1.85  
% 1.65/1.85  Changing weight limit from 37 to 34.
% 1.65/1.85  
% 1.65/1.85  Resetting weight limit to 34 after 3950 givens.
% 1.65/1.85  
% 1.65/1.86  
% 1.65/1.86  
% 1.65/1.86  Changing weight limit from 34 to 33.
% 1.65/1.86  
% 1.65/1.86  Resetting weight limit to 33 after 3960 givens.
% 1.65/1.86  
% 1.65/1.86  
% 1.65/1.86  
% 1.65/1.86  Changing weight limit from 33 to 32.
% 1.65/1.86  
% 1.65/1.86  Resetting weight limit to 32 after 3970 givens.
% 1.65/1.86  
% 1.65/1.86  
% 1.65/1.86  
% 1.65/1.86  Changing weight limit from 32 to 31.
% 1.65/1.86  
% 1.65/1.86  Resetting weight limit to 31 after 3990 givens.
% 1.65/1.86  
% 1.65/1.87  
% 1.65/1.87  
% 1.65/1.87  Changing weight limit from 31 to 30.
% 1.65/1.87  
% 1.65/1.87  Resetting weight limit to 30 after 3995 givens.
% 1.65/1.87  
% 1.65/1.87  
% 1.65/1.87  
% 1.65/1.87  Changing weight limit from 30 to 29.
% 1.65/1.87  
% 1.65/1.87  Resetting weight limit to 29 after 4015 givens.
% 1.65/1.87  
% 1.65/1.88  
% 1.65/1.88  
% 1.65/1.88  Changing weight limit from 29 to 28.
% 1.65/1.88  
% 1.65/1.88  Resetting weight limit to 28 after 4030 givens.
% 1.65/1.88  
% 1.65/1.88  
% 1.65/1.88  
% 1.65/1.88  Changing weight limit from 28 to 27.
% 1.65/1.88  
% 1.65/1.88  Resetting weight limit to 27 after 4050 givens.
% 1.65/1.88  
% 1.65/1.89  
% 1.65/1.89  
% 1.65/1.89  Changing weight limit from 27 to 26.
% 1.65/1.89  
% 1.65/1.89  Resetting weight limit to 26 after 4065 givens.
% 1.65/1.89  
% 1.65/1.90  
% 1.65/1.90  
% 1.65/1.90  Changing weight limit from 26 to 25.
% 1.65/1.90  
% 1.65/1.90  Resetting weight limit to 25 after 4075 givens.
% 1.65/1.90  
% 1.65/1.91  
% 1.65/1.91  
% 1.65/1.91  Changing weight limit from 25 to 24.
% 1.65/1.91  
% 1.65/1.91  Resetting weight limit to 24 after 4110 givens.
% 1.65/1.91  
% 1.75/1.93  
% 1.75/1.93  
% 1.75/1.93  Changing weight limit from 24 to 23.
% 1.75/1.93  
% 1.75/1.93  Resetting weight limit to 23 after 4160 givens.
% 1.75/1.93  
% 1.75/1.97  
% 1.75/1.97  
% 1.75/1.97  Changing weight limit from 23 to 22.
% 1.75/1.97  
% 1.75/1.97  Resetting weight limit to 22 after 4280 givens.
% 1.75/1.97  
% 1.75/1.99  
% 1.75/1.99  
% 1.75/1.99  Changing weight limit from 22 to 21.
% 1.75/1.99  
% 1.75/1.99  Resetting weight limit to 21 after 4340 givens.
% 1.75/1.99  
% 1.83/2.06  
% 1.83/2.06  
% 1.83/2.06  Changing weight limit from 21 to 20.
% 1.83/2.06  
% 1.83/2.06  Resetting weight limit to 20 after 4535 givens.
% 1.83/2.06  
% 1.92/2.08  
% 1.92/2.08  -------- PROOF -------- 
% 1.92/2.08  % SZS status Unsatisfiable
% 1.92/2.08  % SZS output start Refutation
% 1.92/2.08  
% 1.92/2.08  ----> UNIT CONFLICT at   1.68 sec ----> 17934 [binary,17933.1,4.1] {-} $F.
% 1.92/2.08  
% 1.92/2.08  Length of proof is 6.  Level of proof is 6.
% 1.92/2.08  
% 1.92/2.08  ---------------- PROOF ----------------
% 1.92/2.08  % SZS status Unsatisfiable
% 1.92/2.08  % SZS output start Refutation
% 1.92/2.08  
% 1.92/2.08  1 [] {+} theorem(A)| -axiom(A).
% 1.92/2.08  2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 1.92/2.08  3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 1.92/2.08  4 [] {+} -theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(r,p)))).
% 1.92/2.08  7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 1.92/2.08  8 [] {-} axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 1.92/2.08  9 [] {-} axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))).
% 1.92/2.08  12 [hyper,7,1] {-} theorem(or(not(or(A,B)),or(B,A))).
% 1.92/2.08  48 [hyper,9,2,12] {-} theorem(or(not(or(A,or(B,C))),or(A,or(C,B)))).
% 1.92/2.08  339 [hyper,48,3,9] {-} theorem(or(not(or(not(A),B)),or(not(or(C,A)),or(B,C)))).
% 1.92/2.08  3505 [hyper,339,2,8] {-} theorem(or(not(or(A,B)),or(not(or(not(B),C)),or(C,A)))).
% 1.92/2.08  9530 [hyper,3505,3,7] {-} theorem(or(not(or(A,B)),or(not(or(not(A),C)),or(C,B)))).
% 1.92/2.08  17933 [hyper,9530,2,8] {-} theorem(or(not(or(not(A),B)),or(not(or(A,C)),or(B,C)))).
% 1.92/2.08  17934 [binary,17933.1,4.1] {-} $F.
% 1.92/2.08  
% 1.92/2.08  % SZS output end Refutation
% 1.92/2.08  ------------ end of proof -------------
% 1.92/2.08  
% 1.92/2.08  
% 1.92/2.08  Search stopped by max_proofs option.
% 1.92/2.08  
% 1.92/2.08  
% 1.92/2.08  Search stopped by max_proofs option.
% 1.92/2.08  
% 1.92/2.08  ============ end of search ============
% 1.92/2.08  
% 1.92/2.08  ----------- soft-scott stats ----------
% 1.92/2.08  
% 1.92/2.08  true clauses given        1141      (24.7%)
% 1.92/2.08  false clauses given       3473
% 1.92/2.08  
% 1.92/2.08        FALSE     TRUE
% 1.92/2.08    13  0         616
% 1.92/2.08    14  0         24
% 1.92/2.08    15  1180      897
% 1.92/2.08    16  52        53
% 1.92/2.08    17  1270      498
% 1.92/2.08    18  0         80
% 1.92/2.08    19  3         279
% 1.92/2.08    20  0         52
% 1.92/2.08  tot:  2505      2499      (49.9% true)
% 1.92/2.08  
% 1.92/2.08  
% 1.92/2.08  Model 4 (0.00 seconds, 0 Inserts)
% 1.92/2.08  
% 1.92/2.08  That finishes the proof of the theorem.
% 1.92/2.08  
% 1.92/2.08  Process 28937 finished Mon Jul  4 16:09:42 2022
%------------------------------------------------------------------------------