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

View Problem - Process Solution

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

% Computer : n012.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 : Thu Jul 21 12:14:21 EDT 2022

% Result   : Unsatisfiable 1.36s 1.54s
% Output   : Refutation 1.36s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SYN592-1 : TPTP v8.1.0. Released v2.5.0.
% 0.04/0.13  % Command  : sos-script %s
% 0.12/0.34  % Computer : n012.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Tue Jul 12 07:44:42 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 n012.cluster.edu,
% 0.12/0.35  Tue Jul 12 07:44:42 2022
% 0.12/0.35  The command was "./sos".  The process ID is 27296.
% 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=0, equality=0, symmetry=0, max_lits=4.
% 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.36     dependent: set(hyper_res).
% 0.12/0.36     dependent: set(factor).
% 0.12/0.36     dependent: set(unit_deletion).
% 0.12/0.36  
% 0.12/0.36  ------------> process usable:
% 0.12/0.36  
% 0.12/0.36  ------------> process sos:
% 0.12/0.36  24 back subsumes 18.
% 0.12/0.36  25 back subsumes 19.
% 0.12/0.36  26 back subsumes 20.
% 0.12/0.36  
% 0.12/0.36  ======= 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: 18
% 0.19/0.39  number of clauses initially in problem: 28
% 0.19/0.39  percentage of clauses intially in UL: 64
% 0.19/0.39  percentage of distinct symbols occuring in initial UL: 94
% 0.19/0.39  percent of all initial clauses that are short: 100
% 0.19/0.39  absolute distinct symbol count: 17
% 0.19/0.39     distinct predicate count: 8
% 0.19/0.39     distinct function count: 3
% 0.19/0.39     distinct constant count: 6
% 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  =========== start of search ===========
% 1.36/1.54  
% 1.36/1.54  -------- PROOF -------- 
% 1.36/1.54  % SZS status Unsatisfiable
% 1.36/1.54  % SZS output start Refutation
% 1.36/1.54  
% 1.36/1.54  Stopped by limit on insertions
% 1.36/1.54  
% 1.36/1.54  Model 2 (0.00 seconds, 0 Inserts)
% 1.36/1.54  
% 1.36/1.54  Stopped by limit on number of solutions
% 1.36/1.54  
% 1.36/1.54  Model 3 (0.00 seconds, 0 Inserts)
% 1.36/1.54  
% 1.36/1.54  Stopped by limit on number of solutions
% 1.36/1.54  
% 1.36/1.54  Stopped by limit on insertions
% 1.36/1.54  
% 1.36/1.54  Stopped by limit on insertions
% 1.36/1.54  
% 1.36/1.54  Model 4 [ 3 6 67280 ] (0.00 seconds, 250000 Inserts)
% 1.36/1.54  
% 1.36/1.54  Stopped by limit on insertions
% 1.36/1.54  
% 1.36/1.54  Model 5 [ 7 1 1741 ] (0.00 seconds, 250000 Inserts)
% 1.36/1.54  
% 1.36/1.54  Stopped by limit on insertions
% 1.36/1.54  
% 1.36/1.54  Model 6 [ 3 1 905 ] (0.00 seconds, 250000 Inserts)
% 1.36/1.54  
% 1.36/1.54  ----> UNIT CONFLICT at   1.16 sec ----> 100 [binary,99.1,3.1] {-} $F.
% 1.36/1.54  
% 1.36/1.54  Length of proof is 6.  Level of proof is 4.
% 1.36/1.54  
% 1.36/1.54  ---------------- PROOF ----------------
% 1.36/1.54  % SZS status Unsatisfiable
% 1.36/1.54  % SZS output start Refutation
% 1.36/1.54  
% 1.36/1.54  2 [] {+} -p11(c13,f4(c17,f5(c18))).
% 1.36/1.54  3 [] {+} -p11(c13,f4(f5(c18),c17)).
% 1.36/1.54  12 [] {+} p2(f6(A),f5(A))| -p12(c14,f4(A,c17)).
% 1.36/1.54  15 [] {+} p11(A,B)| -p3(C,B)| -p7(D,A)| -p11(D,C).
% 1.36/1.54  16 [] {+} p3(f4(A,B),f4(C,D))| -p2(A,C)| -p2(B,D).
% 1.36/1.54  17 [] {+} p11(c13,f4(c17,f6(A)))|p11(c13,f4(f6(A),c17))| -p12(c14,f4(A,c17)).
% 1.36/1.54  24 [] {+} p7(A,A).
% 1.36/1.54  25 [] {+} p2(A,A).
% 1.36/1.54  31 [] {-} p12(c14,f4(c18,c17)).
% 1.36/1.54  35 [hyper,31,17] {-} p11(c13,f4(c17,f6(c18)))|p11(c13,f4(f6(c18),c17)).
% 1.36/1.54  36 [hyper,31,12] {+} p2(f6(c18),f5(c18)).
% 1.36/1.54  38 [hyper,36,16,25] {+} p3(f4(A,f6(c18)),f4(A,f5(c18))).
% 1.36/1.54  39 [hyper,36,16,25] {+} p3(f4(f6(c18),A),f4(f5(c18),A)).
% 1.36/1.54  83 [hyper,38,15,24,35,unit_del,2] {-} p11(c13,f4(f6(c18),c17)).
% 1.36/1.54  99 [hyper,39,15,24,83] {-} p11(c13,f4(f5(c18),c17)).
% 1.36/1.54  100 [binary,99.1,3.1] {-} $F.
% 1.36/1.54  
% 1.36/1.54  % SZS output end Refutation
% 1.36/1.54  ------------ end of proof -------------
% 1.36/1.54  
% 1.36/1.54  
% 1.36/1.54  Search stopped by max_proofs option.
% 1.36/1.54  
% 1.36/1.54  
% 1.36/1.54  Search stopped by max_proofs option.
% 1.36/1.54  
% 1.36/1.54  ============ end of search ============
% 1.36/1.54  
% 1.36/1.54  ----------- soft-scott stats ----------
% 1.36/1.54  
% 1.36/1.54  true clauses given          14      (58.3%)
% 1.36/1.54  false clauses given         10
% 1.36/1.54  
% 1.36/1.54        FALSE     TRUE
% 1.36/1.54     9  0         10
% 1.36/1.54    11  0         11
% 1.36/1.54    13  0         16
% 1.36/1.54    15  0         16
% 1.36/1.54  tot:  0         53      (100.0% true)
% 1.36/1.54  
% 1.36/1.54  
% 1.36/1.54  Model 6 [ 3 1 905 ] (0.00 seconds, 250000 Inserts)
% 1.36/1.54  
% 1.36/1.54  That finishes the proof of the theorem.
% 1.36/1.54  
% 1.36/1.54  Process 27296 finished Tue Jul 12 07:44:43 2022
%------------------------------------------------------------------------------