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

View Problem - Process Solution

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

% Computer : n029.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:32 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : LCL194-1 : TPTP v8.1.0. Released v1.1.0.
% 0.04/0.13  % Command  : sos-script %s
% 0.13/0.35  % Computer : n029.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Mon Jul  4 01:14:41 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.37  ----- Otter 3.2, August 2001 -----
% 0.13/0.37  The process was started by sandbox2 on n029.cluster.edu,
% 0.13/0.37  Mon Jul  4 01:14:41 2022
% 0.13/0.37  The command was "./sos".  The process ID is 8157.
% 0.13/0.37  
% 0.13/0.37  set(prolog_style_variables).
% 0.13/0.37  set(auto).
% 0.13/0.37     dependent: set(auto1).
% 0.13/0.37     dependent: set(process_input).
% 0.13/0.37     dependent: clear(print_kept).
% 0.13/0.37     dependent: clear(print_new_demod).
% 0.13/0.37     dependent: clear(print_back_demod).
% 0.13/0.37     dependent: clear(print_back_sub).
% 0.13/0.37     dependent: set(control_memory).
% 0.13/0.37     dependent: assign(max_mem, 12000).
% 0.13/0.37     dependent: assign(pick_given_ratio, 4).
% 0.13/0.37     dependent: assign(stats_level, 1).
% 0.13/0.37     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37     dependent: assign(sos_limit, 5000).
% 0.13/0.37     dependent: assign(max_weight, 60).
% 0.13/0.37  clear(print_given).
% 0.13/0.37  
% 0.13/0.37  list(usable).
% 0.13/0.37  
% 0.13/0.37  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.37  
% 0.13/0.37  This is a Horn set without equality.  The strategy will
% 0.13/0.37  be hyperresolution, with satellites in sos and nuclei
% 0.13/0.37  in usable.
% 0.13/0.37  
% 0.13/0.37     dependent: set(hyper_res).
% 0.13/0.37     dependent: clear(order_hyper).
% 0.13/0.37  
% 0.13/0.37  ------------> process usable:
% 0.13/0.37  
% 0.13/0.37  ------------> process sos:
% 0.13/0.37  
% 0.13/0.37  ======= end of input processing =======
% 0.20/0.40  
% 0.20/0.40  Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40  
% 0.20/0.40  Stopped by limit on number of solutions
% 0.20/0.40  
% 0.20/0.40  
% 0.20/0.40  -------------- Softie stats --------------
% 0.20/0.40  
% 0.20/0.40  UPDATE_STOP: 300
% 0.20/0.40  SFINDER_TIME_LIMIT: 2
% 0.20/0.40  SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40  number of clauses in intial UL: 4
% 0.20/0.40  number of clauses initially in problem: 9
% 0.20/0.40  percentage of clauses intially in UL: 44
% 0.20/0.40  percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.40  percent of all initial clauses that are short: 100
% 0.20/0.40  absolute distinct symbol count: 7
% 0.20/0.40     distinct predicate count: 2
% 0.20/0.40     distinct function count: 2
% 0.20/0.40     distinct constant count: 3
% 0.20/0.40  
% 0.20/0.40  ---------- no more Softie stats ----------
% 0.20/0.40  
% 0.20/0.40  
% 0.20/0.40  
% 0.20/0.40  Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40  
% 0.20/0.40  Stopped by limit on number of solutions
% 0.20/0.40  
% 0.20/0.40  =========== start of search ===========
% 0.56/0.76  
% 0.56/0.76  
% 0.56/0.76  Changing weight limit from 60 to 39.
% 0.56/0.76  
% 0.56/0.76  Model 3 (0.00 seconds, 0 Inserts)
% 0.56/0.76  
% 0.56/0.76  Stopped by limit on number of solutions
% 0.56/0.76  
% 0.56/0.76  Modelling stopped after 300 given clauses and 0.00 seconds
% 0.56/0.76  
% 0.56/0.76  
% 0.56/0.76  Resetting weight limit to 39 after 1015 givens.
% 0.56/0.76  
% 0.56/0.76  
% 0.56/0.76  
% 0.56/0.76  Changing weight limit from 39 to 37.
% 0.56/0.76  
% 0.56/0.76  Resetting weight limit to 37 after 1020 givens.
% 0.56/0.76  
% 0.59/0.76  
% 0.59/0.76  
% 0.59/0.76  Changing weight limit from 37 to 36.
% 0.59/0.76  
% 0.59/0.76  Resetting weight limit to 36 after 1025 givens.
% 0.59/0.76  
% 0.59/0.76  
% 0.59/0.76  
% 0.59/0.76  Changing weight limit from 36 to 37.
% 0.59/0.76  
% 0.59/0.76  Resetting weight limit to 37 after 1030 givens.
% 0.59/0.76  
% 0.59/0.77  
% 0.59/0.77  
% 0.59/0.77  Changing weight limit from 37 to 35.
% 0.59/0.77  
% 0.59/0.77  Resetting weight limit to 35 after 1035 givens.
% 0.59/0.77  
% 0.59/0.82  
% 0.59/0.82  -------- PROOF -------- 
% 0.59/0.82  % SZS status Unsatisfiable
% 0.59/0.82  % SZS output start Refutation
% 0.59/0.82  
% 0.59/0.82  ----> UNIT CONFLICT at   0.42 sec ----> 4823 [binary,4822.1,4.1] {-} $F.
% 0.59/0.82  
% 0.59/0.82  Length of proof is 6.  Level of proof is 6.
% 0.59/0.82  
% 0.59/0.82  ---------------- PROOF ----------------
% 0.59/0.82  % SZS status Unsatisfiable
% 0.59/0.82  % SZS output start Refutation
% 0.59/0.82  
% 0.59/0.82  1 [] {+} theorem(A)| -axiom(A).
% 0.59/0.82  2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 0.59/0.82  3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 0.59/0.82  4 [] {+} -theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(p,r)))).
% 0.59/0.82  5 [] {+} axiom(or(not(or(A,A)),A)).
% 0.59/0.82  6 [] {+} axiom(or(not(A),or(B,A))).
% 0.59/0.82  7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 0.59/0.82  8 [] {-} axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 0.59/0.82  9 [] {-} axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))).
% 0.59/0.82  10 [hyper,5,1] {+} theorem(or(not(or(A,A)),A)).
% 0.59/0.82  18 [hyper,10,3,6] {+} theorem(or(not(A),A)).
% 0.59/0.82  36 [hyper,18,2,8] {-} theorem(or(A,or(not(or(A,B)),B))).
% 0.59/0.82  40 [hyper,36,3,7] {-} theorem(or(not(or(A,B)),or(not(or(not(or(B,A)),C)),C))).
% 0.59/0.82  451 [hyper,40,2,8] {-} theorem(or(not(or(not(or(A,B)),C)),or(not(or(B,A)),C))).
% 0.59/0.82  4822 [hyper,451,3,9] {-} theorem(or(not(or(not(A),B)),or(not(or(A,C)),or(C,B)))).
% 0.59/0.82  4823 [binary,4822.1,4.1] {-} $F.
% 0.59/0.82  
% 0.59/0.82  % SZS output end Refutation
% 0.59/0.82  ------------ end of proof -------------
% 0.59/0.82  
% 0.59/0.82  
% 0.59/0.82  Search stopped by max_proofs option.
% 0.59/0.82  
% 0.59/0.82  
% 0.59/0.82  Search stopped by max_proofs option.
% 0.59/0.82  
% 0.59/0.82  ============ end of search ============
% 0.59/0.82  
% 0.59/0.82  ----------- soft-scott stats ----------
% 0.59/0.82  
% 0.59/0.82  true clauses given         259      (23.3%)
% 0.59/0.82  false clauses given        853
% 0.59/0.82  
% 0.59/0.82        FALSE     TRUE
% 0.59/0.82    11  0         114
% 0.59/0.82    12  0         1
% 0.59/0.82    13  0         279
% 0.59/0.82    14  0         14
% 0.59/0.82    15  798       95
% 0.59/0.82    16  18        14
% 0.59/0.82    17  569       99
% 0.59/0.82    18  54        17
% 0.59/0.82    19  418       31
% 0.59/0.82    20  60        9
% 0.59/0.82    21  252       24
% 0.59/0.82    22  36        5
% 0.59/0.82    23  194       9
% 0.59/0.82    24  14        3
% 0.59/0.82    25  89        3
% 0.59/0.82    27  0         1
% 0.59/0.82    28  0         3
% 0.59/0.82    33  0         1
% 0.59/0.82    34  0         2
% 0.59/0.82    35  0         1
% 0.59/0.82  tot:  2502      725      (22.5% true)
% 0.59/0.82  
% 0.59/0.82  
% 0.59/0.82  Model 3 (0.00 seconds, 0 Inserts)
% 0.59/0.82  
% 0.59/0.82  That finishes the proof of the theorem.
% 0.59/0.82  
% 0.59/0.82  Process 8157 finished Mon Jul  4 01:14:41 2022
%------------------------------------------------------------------------------