TSTP Solution File: LCL682+1.001 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : LCL682+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

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

% Result   : Theorem 0.20s 0.50s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL682+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n016.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 : Sun Jul  3 01:18:44 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 n016.cluster.edu,
% 0.13/0.35  Sun Jul  3 01:18:44 2022
% 0.13/0.35  The command was "./sos".  The process ID is 21055.
% 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  formula_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.35  
% 0.13/0.35  ------------> process usable:
% 0.13/0.35    Following clause subsumed by 3 during input processing: 0 [] {-} -r1($c9,A)| -r1(A,B)|p12(B).
% 0.13/0.35  
% 0.13/0.35  ------------> process sos:
% 0.13/0.35  
% 0.13/0.35  ======= end of input processing =======
% 0.20/0.39  
% 0.20/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39  
% 0.20/0.39  Stopped by limit on number of solutions
% 0.20/0.39  
% 0.20/0.39  
% 0.20/0.39  -------------- Softie stats --------------
% 0.20/0.39  
% 0.20/0.39  UPDATE_STOP: 300
% 0.20/0.39  SFINDER_TIME_LIMIT: 2
% 0.20/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.39  number of clauses in intial UL: 8
% 0.20/0.39  number of clauses initially in problem: 17
% 0.20/0.39  percentage of clauses intially in UL: 47
% 0.20/0.39  percentage of distinct symbols occuring in initial UL: 75
% 0.20/0.39  percent of all initial clauses that are short: 100
% 0.20/0.39  absolute distinct symbol count: 16
% 0.20/0.39     distinct predicate count: 7
% 0.20/0.39     distinct function count: 0
% 0.20/0.39     distinct constant count: 9
% 0.20/0.39  
% 0.20/0.39  ---------- no more Softie stats ----------
% 0.20/0.39  
% 0.20/0.39  
% 0.20/0.39  
% 0.20/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.39  
% 0.20/0.39  Stopped by limit on number of solutions
% 0.20/0.39  
% 0.20/0.39  =========== start of search ===========
% 0.20/0.50  
% 0.20/0.50  -------- PROOF -------- 
% 0.20/0.50  % SZS status Theorem
% 0.20/0.50  % SZS output start Refutation
% 0.20/0.50  
% 0.20/0.50  Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.50  
% 0.20/0.50  Stopped by limit on number of solutions
% 0.20/0.50  
% 0.20/0.50  Model 4 (0.00 seconds, 0 Inserts)
% 0.20/0.50  
% 0.20/0.50  Stopped by limit on number of solutions
% 0.20/0.50  
% 0.20/0.50  Model 5 (0.00 seconds, 0 Inserts)
% 0.20/0.50  
% 0.20/0.50  Stopped by limit on number of solutions
% 0.20/0.50  
% 0.20/0.50  Stopped by limit on insertions
% 0.20/0.50  
% 0.20/0.50  Model 6 [ 1 0 47 ] (0.00 seconds, 250000 Inserts)
% 0.20/0.50  
% 0.20/0.50  ----> UNIT CONFLICT at   0.12 sec ----> 36 [binary,35.1,7.1] {-} $F.
% 0.20/0.50  
% 0.20/0.50  Length of proof is 1.  Level of proof is 1.
% 0.20/0.50  
% 0.20/0.50  ---------------- PROOF ----------------
% 0.20/0.50  % SZS status Theorem
% 0.20/0.50  % SZS output start Refutation
% 0.20/0.50  
% 0.20/0.50  3 [] {+} -r1($c9,A)| -r1(A,B)|p12(B).
% 0.20/0.50  7 [] {+} -p12($c5).
% 0.20/0.50  14 [] {+} r1($c9,$c6).
% 0.20/0.50  15 [] {+} r1($c6,$c5).
% 0.20/0.50  35 [hyper,15,3,14] {-} p12($c5).
% 0.20/0.50  36 [binary,35.1,7.1] {-} $F.
% 0.20/0.50  
% 0.20/0.50  % SZS output end Refutation
% 0.20/0.50  ------------ end of proof -------------
% 0.20/0.50  
% 0.20/0.50  
% 0.20/0.50  Search stopped by max_proofs option.
% 0.20/0.50  
% 0.20/0.50  
% 0.20/0.50  Search stopped by max_proofs option.
% 0.20/0.50  
% 0.20/0.50  ============ end of search ============
% 0.20/0.50  
% 0.20/0.50  ----------- soft-scott stats ----------
% 0.20/0.50  
% 0.20/0.50  true clauses given           2      (28.6%)
% 0.20/0.50  false clauses given          5
% 0.20/0.50  
% 0.20/0.50        FALSE     TRUE
% 0.20/0.50     2  2         12
% 0.20/0.50     3  2         2
% 0.20/0.50  tot:  4         14      (77.8% true)
% 0.20/0.50  
% 0.20/0.50  
% 0.20/0.50  Model 6 [ 1 0 47 ] (0.00 seconds, 250000 Inserts)
% 0.20/0.50  
% 0.20/0.50  That finishes the proof of the theorem.
% 0.20/0.50  
% 0.20/0.50  Process 21055 finished Sun Jul  3 01:18:44 2022
%------------------------------------------------------------------------------