↑ Up

SOS---2.0.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SYO650-1 : TPTP v8.1.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n023.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 19:50:10 EDT 2022

% Result   : Unsatisfiable 2.22s 2.41s
% Output   : Refutation 2.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYO650-1 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n023.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 : Sat Jul  9 02:18:55 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.39/0.63  ----- Otter 3.2, August 2001 -----
% 0.39/0.63  The process was started by sandbox on n023.cluster.edu,
% 0.39/0.63  Sat Jul  9 02:18:56 2022
% 0.39/0.63  The command was "./sos".  The process ID is 7993.
% 0.39/0.63  
% 0.39/0.63  set(prolog_style_variables).
% 0.39/0.63  set(auto).
% 0.39/0.63     dependent: set(auto1).
% 0.39/0.63     dependent: set(process_input).
% 0.39/0.63     dependent: clear(print_kept).
% 0.39/0.63     dependent: clear(print_new_demod).
% 0.39/0.63     dependent: clear(print_back_demod).
% 0.39/0.63     dependent: clear(print_back_sub).
% 0.39/0.63     dependent: set(control_memory).
% 0.39/0.63     dependent: assign(max_mem, 12000).
% 0.39/0.63     dependent: assign(pick_given_ratio, 4).
% 0.39/0.63     dependent: assign(stats_level, 1).
% 0.39/0.63     dependent: assign(pick_semantic_ratio, 3).
% 0.39/0.63     dependent: assign(sos_limit, 5000).
% 0.39/0.63     dependent: assign(max_weight, 60).
% 0.39/0.63  clear(print_given).
% 0.39/0.63  
% 0.39/0.63  list(usable).
% 0.39/0.63  
% 0.39/0.63  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=20.
% 0.39/0.63  
% 0.39/0.63  This is a non-Horn set without equality.  The strategy
% 0.39/0.63  will be ordered hyper_res, ur_res, unit deletion, and
% 0.39/0.63  factoring, with satellites in sos and nuclei in usable.
% 0.39/0.63  
% 0.39/0.63     dependent: set(hyper_res).
% 0.39/0.63     dependent: set(factor).
% 0.39/0.63     dependent: set(unit_deletion).
% 0.39/0.63  
% 0.39/0.63  ------------> process usable:
% 0.39/0.63  40 back subsumes 38.
% 0.39/0.63  42 back subsumes 37.
% 0.39/0.63  50 back subsumes 39.
% 0.39/0.63  
% 0.39/0.63  ------------> process sos:
% 0.39/0.63  
% 0.39/0.63  ======= end of input processing =======
% 1.89/2.07  
% 1.89/2.07  Model 1 (0.00 seconds, 0 Inserts)
% 1.89/2.07  
% 1.89/2.07  Stopped by limit on number of solutions
% 1.89/2.07  
% 1.89/2.07  
% 1.89/2.07  -------------- Softie stats --------------
% 1.89/2.07  
% 1.89/2.07  UPDATE_STOP: 300
% 1.89/2.07  SFINDER_TIME_LIMIT: 2
% 1.89/2.07  SHORT_CLAUSE_CUTOFF: 4
% 1.89/2.07  number of clauses in intial UL: 57
% 1.89/2.07  number of clauses initially in problem: 58
% 1.89/2.07  percentage of clauses intially in UL: 98
% 1.89/2.07  percentage of distinct symbols occuring in initial UL: 100
% 1.89/2.07  percent of all initial clauses that are short: 100
% 1.89/2.07  absolute distinct symbol count: 8
% 1.89/2.07     distinct predicate count: 3
% 1.89/2.07     distinct function count: 3
% 1.89/2.07     distinct constant count: 2
% 1.89/2.07  
% 1.89/2.07  ---------- no more Softie stats ----------
% 1.89/2.07  
% 1.89/2.07  
% 1.89/2.07  
% 1.89/2.07  Stopped by limit on insertions
% 1.89/2.07  
% 1.89/2.07  =========== start of search ===========
% 2.22/2.41  
% 2.22/2.41  -------- PROOF -------- 
% 2.22/2.41  % SZS status Unsatisfiable
% 2.22/2.41  % SZS output start Refutation
% 2.22/2.41  
% 2.22/2.41  Stopped by limit on insertions
% 2.22/2.41  
% 2.22/2.41  Model 2 [ 1 1 2829 ] (0.00 seconds, 250000 Inserts)
% 2.22/2.41  
% 2.22/2.41  -----> EMPTY CLAUSE at   2.03 sec ----> 80 [hyper,78,50,69,70,67,73,66,77] {-} $F.
% 2.22/2.41  
% 2.22/2.41  Length of proof is 16.  Level of proof is 7.
% 2.22/2.41  
% 2.22/2.41  ---------------- PROOF ----------------
% 2.22/2.41  % SZS status Unsatisfiable
% 2.22/2.41  % SZS output start Refutation
% 2.22/2.41  
% 2.22/2.41  7 [] {+} -'LE'(f(A),s('0'))|'E'('0',f(A))|'LE'(f(A),'0').
% 2.22/2.41  10 [] {+} -'LE'(f(suc(suc(A))),s('0'))|'E'('0',f(suc(suc(A))))|'LE'(f(A),'0').
% 2.22/2.41  13 [] {+} -'E'('0',f(suc(suc(suc(A)))))| -'E'('0',f(suc(A)))| -'E'('0',f(suc(suc(A))))| -'E'('0',f(A))| -'E'(f(A),f(suc(suc(A))))| -'E'(f(A),f(suc(A)))|iLEQ(suc(A),suc(A)).
% 2.22/2.41  14 [] {+} -'E'('0',f(suc(suc(A))))| -iLEQ(suc(B),suc(A))| -'E'('0',f(suc(C)))| -'E'('0',f(suc(B)))| -'E'(f(C),f(suc(C)))| -'E'('0',f(suc(suc(B))))| -'E'('0',f(B))| -'E'('0',f(suc(suc(C))))| -iLEQ(suc(A),suc(C))| -'E'(f(B),f(suc(B)))| -'E'('0',f(A))| -'E'('0',f(C))| -'E'(f(A),f(suc(A)))| -'E'('0',f(suc(A)))|'E'(f(B),f(suc(suc(B))))|'E'(f(A),f(suc(suc(A))))|'E'(f(C),f(suc(suc(C)))).
% 2.22/2.41  18 [] {+} -'LE'(f(suc(A)),s('0'))|'E'('0',f(suc(A)))|'LE'(f(A),'0').
% 2.22/2.41  20 [] {+} -iLEQ(suc(A),suc(B))| -'E'('0',f(suc(C)))| -'E'('0',f(suc(A)))| -'E'('0',f(A))| -iLEQ(suc(B),suc(C))| -'E'('0',f(B))| -'E'('0',f(C))| -'E'('0',f(suc(B)))|'E'(f(A),f(suc(A)))|'E'(f(B),f(suc(B)))|'E'(f(C),f(suc(C))).
% 2.22/2.41  21 [] {+} -'LE'(f(suc(suc(suc(A)))),s('0'))|'E'('0',f(suc(suc(suc(A)))))|'LE'(f(A),'0').
% 2.22/2.41  23 [] {+} -'E'('0',f(suc(suc(suc(A)))))| -'E'('0',f(suc(suc(B))))| -iLEQ(suc(A),suc(B))| -'E'('0',f(suc(C)))| -'E'('0',f(suc(A)))| -'E'(f(C),f(suc(C)))| -'E'('0',f(suc(suc(A))))| -'E'('0',f(A))| -'E'('0',f(suc(suc(C))))| -'E'('0',f(suc(suc(suc(B)))))| -'E'(f(A),f(suc(suc(A))))| -iLEQ(suc(B),suc(C))| -'E'(f(A),f(suc(A)))| -'E'('0',f(B))| -'E'(f(C),f(suc(suc(C))))| -'E'(f(B),f(suc(suc(B))))| -'E'('0',f(suc(suc(suc(C)))))| -'E'('0',f(C))| -'E'(f(B),f(suc(B)))| -'E'('0',f(suc(B))).
% 2.22/2.41  25 [] {+} -'E'('0',f(suc(suc(A))))| -'E'('0',f(suc(A)))| -'E'(f(A),f(suc(A)))| -'E'('0',f(A))|'E'(f(A),f(suc(suc(A))))|iLEQ(suc(A),suc(A)).
% 2.22/2.41  27 [] {+} -'LE'(f(z),'0').
% 2.22/2.41  33 [] {+} -'E'('0',f(A))| -'E'('0',f(suc(A)))|'E'(f(A),f(suc(A)))|iLEQ(suc(A),suc(A)).
% 2.22/2.41  40 [factor,14.1.6,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp] {+} -'E'('0',f(suc(suc(A))))| -iLEQ(suc(A),suc(A))| -'E'('0',f(suc(A)))| -'E'(f(A),f(suc(A)))| -'E'('0',f(A))|'E'(f(A),f(suc(suc(A)))).
% 2.22/2.41  43 [factor,20.2.3,factor_simp,factor_simp] {+} -iLEQ(suc(A),suc(B))| -'E'('0',f(suc(A)))| -'E'('0',f(A))| -iLEQ(suc(B),suc(A))| -'E'('0',f(B))| -'E'('0',f(suc(B)))|'E'(f(A),f(suc(A)))|'E'(f(B),f(suc(B))).
% 2.22/2.41  50 [factor,23.1.10,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp] {+} -'E'('0',f(suc(suc(suc(A)))))| -'E'('0',f(suc(suc(A))))| -iLEQ(suc(A),suc(A))| -'E'('0',f(suc(A)))| -'E'(f(A),f(suc(A)))| -'E'('0',f(A))| -'E'(f(A),f(suc(suc(A)))).
% 2.22/2.41  61 [] {-} 'LE'(f(A),s('0')).
% 2.22/2.41  62 [hyper,61,21] {-} 'E'('0',f(suc(suc(suc(A)))))|'LE'(f(A),'0').
% 2.22/2.41  63 [hyper,61,18] {-} 'E'('0',f(suc(A)))|'LE'(f(A),'0').
% 2.22/2.41  64 [hyper,61,10] {-} 'E'('0',f(suc(suc(A))))|'LE'(f(A),'0').
% 2.22/2.41  65 [hyper,61,7] {+} 'E'('0',f(A))|'LE'(f(A),'0').
% 2.22/2.41  66 [hyper,65,27] {+} 'E'('0',f(z)).
% 2.22/2.41  67 [hyper,63,27] {-} 'E'('0',f(suc(z))).
% 2.22/2.41  68 [hyper,66,33,67] {+} 'E'(f(z),f(suc(z)))|iLEQ(suc(z),suc(z)).
% 2.22/2.41  69 [hyper,62,27] {-} 'E'('0',f(suc(suc(suc(z))))).
% 2.22/2.41  70 [hyper,64,27] {-} 'E'('0',f(suc(suc(z)))).
% 2.22/2.41  73 [hyper,68,43,68,67,66,66,67,factor_simp,factor_simp,factor_simp] {-} 'E'(f(z),f(suc(z))).
% 2.22/2.41  75 [hyper,73,25,70,67,66] {+} 'E'(f(z),f(suc(suc(z))))|iLEQ(suc(z),suc(z)).
% 2.22/2.41  77 [hyper,75,40,70,67,73,66,factor_simp] {-} 'E'(f(z),f(suc(suc(z)))).
% 2.22/2.41  78 [hyper,77,13,69,67,70,66,73] {+} iLEQ(suc(z),suc(z)).
% 2.22/2.41  80 [hyper,78,50,69,70,67,73,66,77] {-} $F.
% 2.22/2.41  
% 2.22/2.41  % SZS output end Refutation
% 2.22/2.41  ------------ end of proof -------------
% 2.22/2.41  
% 2.22/2.41  
% 2.22/2.41  Search stopped by max_proofs option.
% 2.22/2.41  
% 2.22/2.41  
% 2.22/2.41  Search stopped by max_proofs option.
% 2.22/2.41  
% 2.22/2.41  ============ end of search ============
% 2.22/2.41  
% 2.22/2.41  ----------- soft-scott stats ----------
% 2.22/2.41  
% 2.22/2.41  true clauses given           6      (35.3%)
% 2.22/2.41  false clauses given         11
% 2.22/2.41  
% 2.22/2.41        FALSE     TRUE
% 2.22/2.41    10  1         0
% 2.22/2.41    16  0         1
% 2.22/2.41  tot:  1         1      (50.0% true)
% 2.22/2.41  
% 2.22/2.41  
% 2.22/2.41  Model 2 [ 1 1 2829 ] (0.00 seconds, 250000 Inserts)
% 2.22/2.41  
% 2.22/2.41  That finishes the proof of the theorem.
% 2.22/2.41  
% 2.22/2.41  Process 7993 finished Sat Jul  9 02:18:58 2022
%------------------------------------------------------------------------------