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

View Problem - Process Solution

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

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

% Result   : Unsatisfiable 34.97s 35.19s
% Output   : Refutation 34.97s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : LCL045-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13  % Command  : sos-script %s
% 0.14/0.34  % Computer : n007.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sun Jul  3 13:11:41 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.14/0.36  ----- Otter 3.2, August 2001 -----
% 0.14/0.36  The process was started by sandbox on n007.cluster.edu,
% 0.14/0.36  Sun Jul  3 13:11:41 2022
% 0.14/0.36  The command was "./sos".  The process ID is 2270.
% 0.14/0.36  
% 0.14/0.36  set(prolog_style_variables).
% 0.14/0.36  set(auto).
% 0.14/0.36     dependent: set(auto1).
% 0.14/0.36     dependent: set(process_input).
% 0.14/0.36     dependent: clear(print_kept).
% 0.14/0.36     dependent: clear(print_new_demod).
% 0.14/0.36     dependent: clear(print_back_demod).
% 0.14/0.36     dependent: clear(print_back_sub).
% 0.14/0.36     dependent: set(control_memory).
% 0.14/0.36     dependent: assign(max_mem, 12000).
% 0.14/0.36     dependent: assign(pick_given_ratio, 4).
% 0.14/0.36     dependent: assign(stats_level, 1).
% 0.14/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36     dependent: assign(sos_limit, 5000).
% 0.14/0.36     dependent: assign(max_weight, 60).
% 0.14/0.36  clear(print_given).
% 0.14/0.36  
% 0.14/0.36  list(usable).
% 0.14/0.36  
% 0.14/0.36  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.14/0.36  
% 0.14/0.36  This is a Horn set without equality.  The strategy will
% 0.14/0.36  be hyperresolution, with satellites in sos and nuclei
% 0.14/0.36  in usable.
% 0.14/0.36  
% 0.14/0.36     dependent: set(hyper_res).
% 0.14/0.36     dependent: clear(order_hyper).
% 0.14/0.36  
% 0.14/0.36  ------------> process usable:
% 0.14/0.36  
% 0.14/0.36  ------------> process sos:
% 0.14/0.36  
% 0.14/0.36  ======= end of input processing =======
% 0.14/0.39  
% 0.14/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.39  
% 0.14/0.39  Stopped by limit on number of solutions
% 0.14/0.39  
% 0.14/0.39  
% 0.14/0.39  -------------- Softie stats --------------
% 0.14/0.39  
% 0.14/0.39  UPDATE_STOP: 300
% 0.14/0.39  SFINDER_TIME_LIMIT: 2
% 0.14/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.39  number of clauses in intial UL: 2
% 0.14/0.39  number of clauses initially in problem: 7
% 0.14/0.39  percentage of clauses intially in UL: 28
% 0.14/0.39  percentage of distinct symbols occuring in initial UL: 100
% 0.14/0.39  percent of all initial clauses that are short: 100
% 0.14/0.39  absolute distinct symbol count: 5
% 0.14/0.39     distinct predicate count: 1
% 0.14/0.39     distinct function count: 2
% 0.14/0.39     distinct constant count: 2
% 0.14/0.39  
% 0.14/0.39  ---------- no more Softie stats ----------
% 0.14/0.39  
% 0.14/0.39  
% 0.14/0.39  
% 0.14/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.39  
% 0.14/0.39  Stopped by limit on number of solutions
% 0.14/0.39  
% 0.14/0.39  =========== start of search ===========
% 34.35/34.51  
% 34.35/34.51  
% 34.35/34.51  Changing weight limit from 60 to 49.
% 34.35/34.51  
% 34.35/34.51  Stopped by limit on insertions
% 34.35/34.51  
% 34.35/34.51  Model 3 (0.00 seconds, 0 Inserts)
% 34.35/34.51  
% 34.35/34.51  Stopped by limit on number of solutions
% 34.35/34.51  
% 34.35/34.51  Model 4 (0.00 seconds, 0 Inserts)
% 34.35/34.51  
% 34.35/34.51  Stopped by limit on number of solutions
% 34.35/34.51  
% 34.35/34.51  Stopped by limit on insertions
% 34.35/34.51  
% 34.35/34.51  Stopped by limit on insertions
% 34.35/34.51  
% 34.35/34.51  Model 5 [ 1 0 79 ] (0.00 seconds, 250000 Inserts)
% 34.35/34.51  
% 34.35/34.51  Stopped by limit on insertions
% 34.35/34.51  
% 34.35/34.51  Stopped by limit on insertions
% 34.35/34.51  
% 34.35/34.51  Model 6 [ 1 0 21 ] (0.00 seconds, 250000 Inserts)
% 34.35/34.51  
% 34.35/34.51  Stopped by limit on insertions
% 34.35/34.51  
% 34.35/34.51  Model 7 [ 1 1 272 ] (0.00 seconds, 250000 Inserts)
% 34.35/34.51  
% 34.35/34.51  Stopped by limit on insertions
% 34.35/34.51  
% 34.35/34.51  Model 8 [ 1 1 1289 ] (0.00 seconds, 250000 Inserts)
% 34.35/34.51  
% 34.35/34.51  Resetting weight limit to 49 after 160 givens.
% 34.35/34.51  
% 34.47/34.64  
% 34.47/34.64  
% 34.47/34.64  Changing weight limit from 49 to 28.
% 34.47/34.64  
% 34.47/34.64  Resetting weight limit to 28 after 185 givens.
% 34.47/34.64  
% 34.47/34.66  
% 34.47/34.66  
% 34.47/34.66  Changing weight limit from 28 to 24.
% 34.47/34.66  
% 34.47/34.66  Resetting weight limit to 24 after 190 givens.
% 34.47/34.66  
% 34.53/34.70  
% 34.53/34.70  
% 34.53/34.70  Changing weight limit from 24 to 22.
% 34.53/34.70  
% 34.53/34.70  Resetting weight limit to 22 after 195 givens.
% 34.53/34.70  
% 34.53/34.73  
% 34.53/34.73  
% 34.53/34.73  Changing weight limit from 22 to 21.
% 34.53/34.73  
% 34.53/34.73  Resetting weight limit to 21 after 200 givens.
% 34.53/34.73  
% 34.53/34.76  
% 34.53/34.76  
% 34.53/34.76  Changing weight limit from 21 to 20.
% 34.53/34.76  
% 34.53/34.76  Resetting weight limit to 20 after 210 givens.
% 34.53/34.76  
% 34.63/34.79  
% 34.63/34.79  
% 34.63/34.79  Changing weight limit from 20 to 19.
% 34.63/34.79  
% 34.63/34.79  Resetting weight limit to 19 after 220 givens.
% 34.63/34.79  
% 34.67/34.87  
% 34.67/34.87  
% 34.67/34.87  Changing weight limit from 19 to 18.
% 34.67/34.87  
% 34.67/34.87  Resetting weight limit to 18 after 235 givens.
% 34.67/34.87  
% 34.81/34.98  
% 34.81/34.98  
% 34.81/34.98  Changing weight limit from 18 to 17.
% 34.81/34.98  
% 34.81/34.98  Resetting weight limit to 17 after 250 givens.
% 34.81/34.98  
% 34.81/35.06  
% 34.81/35.06  
% 34.81/35.06  Changing weight limit from 17 to 16.
% 34.81/35.06  
% 34.81/35.06  Resetting weight limit to 16 after 275 givens.
% 34.81/35.06  
% 34.97/35.19  
% 34.97/35.19  -- HEY sandbox, WE HAVE A PROOF!! -- 
% 34.97/35.19  
% 34.97/35.19  ----> UNIT CONFLICT at  34.79 sec ----> 11692 [binary,11691.1,2.1] {-} $F.
% 34.97/35.19  
% 34.97/35.19  Length of proof is 7.  Level of proof is 4.
% 34.97/35.19  
% 34.97/35.19  ---------------- PROOF ----------------
% 34.97/35.19  % SZS status Unsatisfiable
% 34.97/35.19  % SZS output start Refutation
% 34.97/35.19  
% 34.97/35.19  1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 34.97/35.19  2 [] {+} -is_a_theorem(implies(implies(a,b),implies(not(b),not(a)))).
% 34.97/35.19  3 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 34.97/35.19  4 [] {-} is_a_theorem(implies(A,implies(B,A))).
% 34.97/35.19  5 [] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 34.97/35.19  6 [] {+} is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))).
% 34.97/35.19  7 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),B),B))).
% 34.97/35.19  9 [hyper,4,1,4] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 34.97/35.19  26 [hyper,5,1,9] {+} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 34.97/35.19  27 [hyper,5,1,7] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(A,B),B))).
% 34.97/35.19  56 [hyper,6,1,3] {-} is_a_theorem(implies(implies(A,B),implies(A,implies(not(B),C)))).
% 34.97/35.19  122 [hyper,26,1,27] {+} is_a_theorem(implies(implies(A,implies(B,implies(C,not(A)))),implies(B,implies(C,not(A))))).
% 34.97/35.19  275 [hyper,56,1,5] {-} is_a_theorem(implies(A,implies(implies(A,B),implies(not(B),C)))).
% 34.97/35.19  11691 [hyper,122,1,275] {-} is_a_theorem(implies(implies(A,B),implies(not(B),not(A)))).
% 34.97/35.19  11692 [binary,11691.1,2.1] {-} $F.
% 34.97/35.19  
% 34.97/35.19  % SZS output end Refutation
% 34.97/35.19  ------------ end of proof -------------
% 34.97/35.19  
% 34.97/35.19  
% 34.97/35.19  Search stopped by max_proofs option.
% 34.97/35.19  
% 34.97/35.19  
% 34.97/35.19  Search stopped by max_proofs option.
% 34.97/35.19  
% 34.97/35.19  ============ end of search ============
% 34.97/35.19  
% 34.97/35.19  ----------- soft-scott stats ----------
% 34.97/35.19  
% 34.97/35.19  true clauses given         128      (37.5%)
% 34.97/35.19  false clauses given        213
% 34.97/35.19  
% 34.97/35.19        FALSE     TRUE
% 34.97/35.19    10  0         64
% 34.97/35.19    11  0         137
% 34.97/35.19    12  163       309
% 34.97/35.19    13  464       483
% 34.97/35.19    14  688       652
% 34.97/35.19    15  1029      773
% 34.97/35.19    16  170       85
% 34.97/35.19  tot:  2514      2503      (49.9% true)
% 34.97/35.19  
% 34.97/35.19  
% 34.97/35.19  Model 8 [ 1 1 1289 ] (0.00 seconds, 250000 Inserts)
% 34.97/35.19  
% 34.97/35.19  That finishes the proof of the theorem.
% 34.97/35.19  
% 34.97/35.19  Process 2270 finished Sun Jul  3 13:12:16 2022
%------------------------------------------------------------------------------