↑ Up

SOS---2.0.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SYN069+1 : TPTP v8.1.0. Released v2.0.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 : Thu Jul 21 12:09:46 EDT 2022

% Result   : Theorem 0.19s 0.44s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN069+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n029.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 : Mon Jul 11 18:21:17 EDT 2022
% 0.19/0.34  % CPUTime  : 
% 0.19/0.35  ----- Otter 3.2, August 2001 -----
% 0.19/0.35  The process was started by sandbox2 on n029.cluster.edu,
% 0.19/0.35  Mon Jul 11 18:21:17 2022
% 0.19/0.35  The command was "./sos".  The process ID is 21423.
% 0.19/0.35  
% 0.19/0.35  set(prolog_style_variables).
% 0.19/0.35  set(auto).
% 0.19/0.35     dependent: set(auto1).
% 0.19/0.35     dependent: set(process_input).
% 0.19/0.35     dependent: clear(print_kept).
% 0.19/0.35     dependent: clear(print_new_demod).
% 0.19/0.35     dependent: clear(print_back_demod).
% 0.19/0.35     dependent: clear(print_back_sub).
% 0.19/0.35     dependent: set(control_memory).
% 0.19/0.35     dependent: assign(max_mem, 12000).
% 0.19/0.35     dependent: assign(pick_given_ratio, 4).
% 0.19/0.35     dependent: assign(stats_level, 1).
% 0.19/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35     dependent: assign(sos_limit, 5000).
% 0.19/0.35     dependent: assign(max_weight, 60).
% 0.19/0.35  clear(print_given).
% 0.19/0.35  
% 0.19/0.35  formula_list(usable).
% 0.19/0.35  
% 0.19/0.35  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.19/0.35  
% 0.19/0.35  This is a non-Horn set without equality.  The strategy
% 0.19/0.35  will be ordered hyper_res, ur_res, unit deletion, and
% 0.19/0.35  factoring, with satellites in sos and nuclei in usable.
% 0.19/0.35  
% 0.19/0.35     dependent: set(hyper_res).
% 0.19/0.35     dependent: set(factor).
% 0.19/0.35     dependent: set(unit_deletion).
% 0.19/0.35  
% 0.19/0.35  ------------> process usable:
% 0.19/0.35    Following clause subsumed by 2 during input processing: 0 [] {-} -big_f(A)|big_g($f1(A))|big_h(A,B).
% 0.19/0.35    Following clause subsumed by 2 during input processing: 0 [] {-} -big_f(A)|big_g($f1(A))|big_k(B).
% 0.19/0.35    Following clause subsumed by 5 during input processing: 0 [] {-} -big_f(A)|big_h(A,$f1(A))|big_k(B).
% 0.19/0.35  5 back subsumes 3.
% 0.19/0.35  
% 0.19/0.35  ------------> process sos:
% 0.19/0.35  
% 0.19/0.35  ======= end of input processing =======
% 0.19/0.41  
% 0.19/0.41  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.41  
% 0.19/0.41  Stopped by limit on number of solutions
% 0.19/0.41  
% 0.19/0.41  
% 0.19/0.41  -------------- Softie stats --------------
% 0.19/0.41  
% 0.19/0.41  UPDATE_STOP: 300
% 0.19/0.41  SFINDER_TIME_LIMIT: 2
% 0.19/0.41  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.41  number of clauses in intial UL: 10
% 0.19/0.41  number of clauses initially in problem: 11
% 0.19/0.41  percentage of clauses intially in UL: 90
% 0.19/0.41  percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.41  percent of all initial clauses that are short: 100
% 0.19/0.41  absolute distinct symbol count: 9
% 0.19/0.41     distinct predicate count: 6
% 0.19/0.41     distinct function count: 2
% 0.19/0.41     distinct constant count: 1
% 0.19/0.41  
% 0.19/0.41  ---------- no more Softie stats ----------
% 0.19/0.41  
% 0.19/0.41  
% 0.19/0.41  
% 0.19/0.41  =========== start of search ===========
% 0.19/0.44  
% 0.19/0.44  -------- PROOF -------- 
% 0.19/0.44  % SZS status Theorem
% 0.19/0.44  % SZS output start Refutation
% 0.19/0.44  
% 0.19/0.44  Model 2 [ 1 0 45 ] (0.00 seconds, 9248 Inserts)
% 0.19/0.44  
% 0.19/0.44  Model 3 [ 1 1 53 ] (0.00 seconds, 10257 Inserts)
% 0.19/0.44  
% 0.19/0.44  Model 4 [ 1 0 88 ] (0.00 seconds, 361 Inserts)
% 0.19/0.44  
% 0.19/0.44  -----> EMPTY CLAUSE at   0.05 sec ----> 26 [hyper,23,9,22] {-} $F.
% 0.19/0.44  
% 0.19/0.44  Length of proof is 7.  Level of proof is 4.
% 0.19/0.44  
% 0.19/0.44  ---------------- PROOF ----------------
% 0.19/0.44  % SZS status Theorem
% 0.19/0.44  % SZS output start Refutation
% 0.19/0.44  
% 0.19/0.44  1 [] {-} -big_f(A)|big_g($f1(A))|big_g(B).
% 0.19/0.44  2 [copy,1,factor_simp] {+} -big_f(A)|big_g($f1(A)).
% 0.19/0.44  4 [] {-} -big_f(A)|big_h(A,$f1(A))|big_h(A,B).
% 0.19/0.44  5 [copy,4,factor_simp] {+} -big_f(A)|big_h(A,$f1(A)).
% 0.19/0.44  8 [] {+} -big_f(A)| -big_j(A,$f1(A))|big_k(B).
% 0.19/0.44  9 [] {+} -big_l(A)| -big_k(A).
% 0.19/0.44  10 [] {+} -big_h($c1,A)|big_l(A).
% 0.19/0.44  11 [] {+} -big_g(A)| -big_h($c1,A)|big_j($c1,A).
% 0.19/0.44  14 [] {-} big_f($c1).
% 0.19/0.44  17 [hyper,14,5] {+} big_h($c1,$f1($c1)).
% 0.19/0.44  18 [hyper,14,2] {+} big_g($f1($c1)).
% 0.19/0.44  21 [hyper,17,11,18] {+} big_j($c1,$f1($c1)).
% 0.19/0.44  22 [hyper,17,10] {+} big_l($f1($c1)).
% 0.19/0.44  23 [hyper,21,8,14] {+} big_k(A).
% 0.19/0.44  26 [hyper,23,9,22] {-} $F.
% 0.19/0.44  
% 0.19/0.44  % SZS output end Refutation
% 0.19/0.44  ------------ end of proof -------------
% 0.19/0.44  
% 0.19/0.44  
% 0.19/0.44  Search stopped by max_proofs option.
% 0.19/0.44  
% 0.19/0.44  
% 0.19/0.44  Search stopped by max_proofs option.
% 0.19/0.44  
% 0.19/0.44  ============ end of search ============
% 0.19/0.44  
% 0.19/0.44  ----------- soft-scott stats ----------
% 0.19/0.44  
% 0.19/0.44  true clauses given           6      (60.0%)
% 0.19/0.44  false clauses given          4
% 0.19/0.44  
% 0.19/0.44        FALSE     TRUE
% 0.19/0.44     2  1         0
% 0.19/0.44     3  1         0
% 0.19/0.44  tot:  2         0      (0.0% true)
% 0.19/0.44  
% 0.19/0.44  
% 0.19/0.44  Model 4 [ 1 0 88 ] (0.00 seconds, 361 Inserts)
% 0.19/0.44  
% 0.19/0.44  That finishes the proof of the theorem.
% 0.19/0.44  
% 0.19/0.44  Process 21423 finished Mon Jul 11 18:21:17 2022
%------------------------------------------------------------------------------