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

View Problem - Process Solution

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

% Computer : n009.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:01 EDT 2022

% Result   : Unsatisfiable 8.75s 8.92s
% Output   : Refutation 8.75s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : LCL114-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n009.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 04:37:52 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  ----- Otter 3.2, August 2001 -----
% 0.12/0.35  The process was started by sandbox on n009.cluster.edu,
% 0.12/0.35  Mon Jul  4 04:37:52 2022
% 0.12/0.35  The command was "./sos".  The process ID is 31605.
% 0.12/0.35  
% 0.12/0.35  set(prolog_style_variables).
% 0.12/0.35  set(auto).
% 0.12/0.35     dependent: set(auto1).
% 0.12/0.35     dependent: set(process_input).
% 0.12/0.35     dependent: clear(print_kept).
% 0.12/0.35     dependent: clear(print_new_demod).
% 0.12/0.35     dependent: clear(print_back_demod).
% 0.12/0.35     dependent: clear(print_back_sub).
% 0.12/0.35     dependent: set(control_memory).
% 0.12/0.35     dependent: assign(max_mem, 12000).
% 0.12/0.35     dependent: assign(pick_given_ratio, 4).
% 0.12/0.35     dependent: assign(stats_level, 1).
% 0.12/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35     dependent: assign(sos_limit, 5000).
% 0.12/0.35     dependent: assign(max_weight, 60).
% 0.12/0.35  clear(print_given).
% 0.12/0.35  
% 0.12/0.35  list(usable).
% 0.12/0.35  
% 0.12/0.35  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.35  
% 0.12/0.35  This is a Horn set without equality.  The strategy will
% 0.12/0.35  be hyperresolution, with satellites in sos and nuclei
% 0.12/0.35  in usable.
% 0.12/0.35  
% 0.12/0.35     dependent: set(hyper_res).
% 0.12/0.35     dependent: clear(order_hyper).
% 0.12/0.35  
% 0.12/0.35  ------------> process usable:
% 0.12/0.35  
% 0.12/0.35  ------------> process sos:
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.12/0.39  
% 0.12/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39  
% 0.12/0.39  Stopped by limit on number of solutions
% 0.12/0.39  
% 0.12/0.39  
% 0.12/0.39  -------------- Softie stats --------------
% 0.12/0.39  
% 0.12/0.39  UPDATE_STOP: 300
% 0.12/0.39  SFINDER_TIME_LIMIT: 2
% 0.12/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39  number of clauses in intial UL: 2
% 0.12/0.39  number of clauses initially in problem: 6
% 0.12/0.39  percentage of clauses intially in UL: 33
% 0.12/0.39  percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.39  percent of all initial clauses that are short: 100
% 0.12/0.39  absolute distinct symbol count: 5
% 0.12/0.39     distinct predicate count: 1
% 0.12/0.39     distinct function count: 2
% 0.12/0.39     distinct constant count: 2
% 0.12/0.39  
% 0.12/0.39  ---------- no more Softie stats ----------
% 0.12/0.39  
% 0.12/0.39  
% 0.12/0.39  
% 0.12/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39  
% 0.12/0.39  Stopped by limit on number of solutions
% 0.12/0.39  
% 0.12/0.39  =========== start of search ===========
% 6.12/6.38  
% 6.12/6.38  
% 6.12/6.38  Changing weight limit from 60 to 22.
% 6.12/6.38  
% 6.12/6.38  Stopped by limit on insertions
% 6.12/6.38  
% 6.12/6.38  Model 3 (0.00 seconds, 0 Inserts)
% 6.12/6.38  
% 6.12/6.38  Stopped by limit on number of solutions
% 6.12/6.38  
% 6.12/6.38  Model 4 (0.00 seconds, 0 Inserts)
% 6.12/6.38  
% 6.12/6.38  Stopped by limit on number of solutions
% 6.12/6.38  
% 6.12/6.38  Resetting weight limit to 22 after 250 givens.
% 6.12/6.38  
% 6.51/6.69  
% 6.51/6.69  
% 6.51/6.69  Changing weight limit from 22 to 19.
% 6.51/6.69  
% 6.51/6.69  Resetting weight limit to 19 after 350 givens.
% 6.51/6.69  
% 6.55/6.75  
% 6.55/6.75  
% 6.55/6.75  Changing weight limit from 19 to 18.
% 6.55/6.75  
% 6.55/6.75  Resetting weight limit to 18 after 375 givens.
% 6.55/6.75  
% 6.64/6.85  
% 6.64/6.85  
% 6.64/6.85  Changing weight limit from 18 to 17.
% 6.64/6.85  
% 6.64/6.85  Resetting weight limit to 17 after 390 givens.
% 6.64/6.85  
% 6.74/6.93  
% 6.74/6.93  
% 6.74/6.93  Changing weight limit from 17 to 16.
% 6.74/6.93  
% 6.74/6.93  Resetting weight limit to 16 after 410 givens.
% 6.74/6.93  
% 7.64/7.81  
% 7.64/7.81  
% 7.64/7.81  Changing weight limit from 16 to 15.
% 7.64/7.81  
% 7.64/7.81  Modelling stopped after 300 given clauses and 0.00 seconds
% 7.64/7.81  
% 7.64/7.81  
% 7.64/7.81  Resetting weight limit to 15 after 765 givens.
% 7.64/7.81  
% 8.75/8.92  
% 8.75/8.92  -------- PROOF -------- 
% 8.75/8.92  % SZS status Unsatisfiable
% 8.75/8.92  % SZS output start Refutation
% 8.75/8.92  
% 8.75/8.92  ----> UNIT CONFLICT at   8.34 sec ----> 26390 [binary,26389.1,2.1] {+} $F.
% 8.75/8.92  
% 8.75/8.92  Length of proof is 20.  Level of proof is 11.
% 8.75/8.92  
% 8.75/8.92  ---------------- PROOF ----------------
% 8.75/8.92  % SZS status Unsatisfiable
% 8.75/8.92  % SZS output start Refutation
% 8.75/8.92  
% 8.75/8.92  1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 8.75/8.92  2 [] {+} -is_a_theorem(implies(implies(a,b),implies(not(b),not(a)))).
% 8.75/8.92  3 [] {+} is_a_theorem(implies(A,implies(B,A))).
% 8.75/8.92  4 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 8.75/8.92  5 [] {+} is_a_theorem(implies(implies(implies(A,B),B),implies(implies(B,A),A))).
% 8.75/8.92  6 [] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 8.75/8.92  8 [hyper,6,1,3] {-} is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))).
% 8.75/8.92  9 [hyper,4,1,4] {+} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 8.75/8.92  11 [hyper,4,1,6] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(not(B),not(A)),C))).
% 8.75/8.92  12 [hyper,4,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 8.75/8.92  15 [hyper,12,1,6] {-} is_a_theorem(implies(not(A),implies(A,B))).
% 8.75/8.92  18 [hyper,15,1,4] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).
% 8.75/8.92  19 [hyper,15,1,3] {-} is_a_theorem(implies(A,implies(not(B),implies(B,C)))).
% 8.75/8.92  20 [hyper,5,1,12] {+} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 8.75/8.92  23 [hyper,19,1,5] {-} is_a_theorem(implies(implies(implies(not(A),implies(A,B)),C),C)).
% 8.75/8.92  65 [hyper,8,1,5] {-} is_a_theorem(implies(implies(implies(implies(not(A),not(B)),implies(B,A)),C),C)).
% 8.75/8.92  100 [hyper,11,1,23] {-} is_a_theorem(implies(implies(not(A),not(implies(not(B),implies(B,C)))),A)).
% 8.75/8.92  151 [hyper,100,1,18] {+} is_a_theorem(implies(not(not(A)),A)).
% 8.75/8.92  162 [hyper,151,1,6] {+} is_a_theorem(implies(A,not(not(A)))).
% 8.75/8.92  163 [hyper,151,1,4] {-} is_a_theorem(implies(implies(A,B),implies(not(not(A)),B))).
% 8.75/8.92  166 [hyper,162,1,20] {+} is_a_theorem(implies(implies(implies(A,not(not(A))),B),B)).
% 8.75/8.92  314 [hyper,163,1,4] {-} is_a_theorem(implies(implies(implies(not(not(A)),B),C),implies(implies(A,B),C))).
% 8.75/8.92  3553 [hyper,65,1,9] {-} is_a_theorem(implies(implies(A,implies(not(B),not(C))),implies(A,implies(C,B)))).
% 8.75/8.92  3769 [hyper,166,1,9] {+} is_a_theorem(implies(implies(A,B),implies(A,not(not(B))))).
% 8.75/8.92  18754 [hyper,314,1,3769] {-} is_a_theorem(implies(implies(A,B),implies(not(not(A)),not(not(B))))).
% 8.75/8.92  26389 [hyper,3553,1,18754] {-} is_a_theorem(implies(implies(A,B),implies(not(B),not(A)))).
% 8.75/8.92  26390 [binary,26389.1,2.1] {+} $F.
% 8.75/8.92  
% 8.75/8.92  % SZS output end Refutation
% 8.75/8.92  ------------ end of proof -------------
% 8.75/8.92  
% 8.75/8.92  
% 8.75/8.92  Search stopped by max_proofs option.
% 8.75/8.92  
% 8.75/8.92  
% 8.75/8.92  Search stopped by max_proofs option.
% 8.75/8.92  
% 8.75/8.92  ============ end of search ============
% 8.75/8.92  
% 8.75/8.92  ----------- soft-scott stats ----------
% 8.75/8.92  
% 8.75/8.92  true clauses given         465      (33.4%)
% 8.75/8.92  false clauses given        929
% 8.75/8.92  
% 8.75/8.92        FALSE     TRUE
% 8.75/8.92    12  0         247
% 8.75/8.92    13  0         726
% 8.75/8.92    14  947       1465
% 8.75/8.92    15  1412      75
% 8.75/8.92  tot:  2359      2513      (51.6% true)
% 8.75/8.92  
% 8.75/8.92  
% 8.75/8.92  Model 4 (0.00 seconds, 0 Inserts)
% 8.75/8.92  
% 8.75/8.92  That finishes the proof of the theorem.
% 8.75/8.92  
% 8.75/8.92  Process 31605 finished Mon Jul  4 04:38:01 2022
%------------------------------------------------------------------------------