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

View Problem - Process Solution

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

% Computer : n027.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:31:36 EDT 2022

% Result   : Theorem 0.46s 0.67s
% Output   : Refutation 0.46s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : LCL656+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13  % Command  : sos-script %s
% 0.12/0.33  % Computer : n027.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 : Sun Jul  3 07:38:24 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 n027.cluster.edu,
% 0.12/0.35  Sun Jul  3 07:38:24 2022
% 0.12/0.35  The command was "./sos".  The process ID is 14257.
% 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  formula_list(usable).
% 0.12/0.35  
% 0.12/0.35  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.12/0.35  
% 0.12/0.35  This is a non-Horn set without equality.  The strategy
% 0.12/0.35  will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35  factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35  
% 0.12/0.35     dependent: set(hyper_res).
% 0.12/0.35     dependent: set(factor).
% 0.12/0.35     dependent: set(unit_deletion).
% 0.12/0.35  
% 0.12/0.35  ------------> process usable:
% 0.12/0.35    Following clause subsumed by 1 during input processing: 0 [] {-} -r1($c1,A)| -r1(A,B)| -p2(B)| -p101(B)|p2(A)| -p101(A).
% 0.12/0.35  
% 0.12/0.35  ------------> process sos:
% 0.12/0.35  
% 0.12/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: 15
% 0.19/0.39  number of clauses initially in problem: 17
% 0.19/0.39  percentage of clauses intially in UL: 88
% 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: 9
% 0.19/0.39     distinct predicate count: 6
% 0.19/0.39     distinct function count: 2
% 0.19/0.39     distinct constant count: 1
% 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.46/0.67  
% 0.46/0.67  -------- PROOF -------- 
% 0.46/0.67  % SZS status Theorem
% 0.46/0.67  % SZS output start Refutation
% 0.46/0.67  
% 0.46/0.67  Model 3 [ 1 0 191 ] (0.00 seconds, 17816 Inserts)
% 0.46/0.67  
% 0.46/0.67  Stopped by limit on insertions
% 0.46/0.67  
% 0.46/0.67  Model 4 [ 1 0 80 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.67  
% 0.46/0.67  Stopped by limit on insertions
% 0.46/0.67  
% 0.46/0.67  Model 5 [ 1 1 90 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.67  
% 0.46/0.67  Model 6 [ 1 0 66 ] (0.00 seconds, 148460 Inserts)
% 0.46/0.67  
% 0.46/0.67  Model 7 [ 1 1 149 ] (0.00 seconds, 201555 Inserts)
% 0.46/0.67  
% 0.46/0.67  ----> UNIT CONFLICT at   0.29 sec ----> 28 [binary,27.1,15.1] {+} $F.
% 0.46/0.67  
% 0.46/0.67  Length of proof is 3.  Level of proof is 3.
% 0.46/0.67  
% 0.46/0.67  ---------------- PROOF ----------------
% 0.46/0.67  % SZS status Theorem
% 0.46/0.67  % SZS output start Refutation
% 0.46/0.67  
% 0.46/0.67  1 [] {+} -r1($c1,A)|p2(A).
% 0.46/0.67  2 [] {+} -r1($c1,A)|r1(A,$f1(A))|p101(A)| -p100(A).
% 0.46/0.67  3 [] {+} -r1($c1,A)| -p2($f1(A))|p101(A)| -p100(A).
% 0.46/0.67  15 [] {+} -p101($c1).
% 0.46/0.67  16 [] {+} r1(A,A).
% 0.46/0.67  17 [] {+} p100($c1).
% 0.46/0.67  23 [hyper,17,2,16,unit_del,15] {+} r1($c1,$f1($c1)).
% 0.46/0.67  26 [hyper,23,1] {+} p2($f1($c1)).
% 0.46/0.67  27 [hyper,26,3,16,17] {-} p101($c1).
% 0.46/0.67  28 [binary,27.1,15.1] {+} $F.
% 0.46/0.67  
% 0.46/0.67  % SZS output end Refutation
% 0.46/0.67  ------------ end of proof -------------
% 0.46/0.67  
% 0.46/0.67  
% 0.46/0.67  Search stopped by max_proofs option.
% 0.46/0.67  
% 0.46/0.67  
% 0.46/0.67  Search stopped by max_proofs option.
% 0.46/0.67  
% 0.46/0.67  ============ end of search ============
% 0.46/0.67  
% 0.46/0.67  ----------- soft-scott stats ----------
% 0.46/0.67  
% 0.46/0.67  true clauses given           5      (45.5%)
% 0.46/0.67  false clauses given          6
% 0.46/0.67  
% 0.46/0.67        FALSE     TRUE
% 0.46/0.67  tot:  0         0      (-nan% true)
% 0.46/0.67  
% 0.46/0.67  
% 0.46/0.67  Model 7 [ 1 1 149 ] (0.00 seconds, 201555 Inserts)
% 0.46/0.67  
% 0.46/0.67  That finishes the proof of the theorem.
% 0.46/0.67  
% 0.46/0.67  Process 14257 finished Sun Jul  3 07:38:25 2022
%------------------------------------------------------------------------------