↑ Up

SOS---2.0.UNS-Ref.s

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

% Computer : n017.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 03:29:50 EDT 2022

% Result   : Unsatisfiable 0.46s 0.63s
% Output   : Refutation 0.46s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : KRS126+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n017.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 : Tue Jun  7 18:58:47 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.36  ----- Otter 3.2, August 2001 -----
% 0.13/0.36  The process was started by sandbox on n017.cluster.edu,
% 0.13/0.36  Tue Jun  7 18:58:47 2022
% 0.13/0.36  The command was "./sos".  The process ID is 11135.
% 0.13/0.36  
% 0.13/0.36  set(prolog_style_variables).
% 0.13/0.36  set(auto).
% 0.13/0.36     dependent: set(auto1).
% 0.13/0.36     dependent: set(process_input).
% 0.13/0.36     dependent: clear(print_kept).
% 0.13/0.36     dependent: clear(print_new_demod).
% 0.13/0.36     dependent: clear(print_back_demod).
% 0.13/0.36     dependent: clear(print_back_sub).
% 0.13/0.36     dependent: set(control_memory).
% 0.13/0.36     dependent: assign(max_mem, 12000).
% 0.13/0.36     dependent: assign(pick_given_ratio, 4).
% 0.13/0.36     dependent: assign(stats_level, 1).
% 0.13/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36     dependent: assign(sos_limit, 5000).
% 0.13/0.36     dependent: assign(max_weight, 60).
% 0.13/0.36  clear(print_given).
% 0.13/0.36  
% 0.13/0.36  formula_list(usable).
% 0.13/0.36  
% 0.13/0.36  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=2.
% 0.13/0.36  
% 0.13/0.36  This is a non-Horn set without equality.  The strategy
% 0.13/0.36  will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.36  factoring, with satellites in sos and nuclei in usable.
% 0.13/0.36  
% 0.13/0.36     dependent: set(hyper_res).
% 0.13/0.36     dependent: set(factor).
% 0.13/0.36     dependent: set(unit_deletion).
% 0.13/0.36  
% 0.13/0.36  ------------> process usable:
% 0.13/0.36  
% 0.13/0.36  ------------> process sos:
% 0.13/0.36  
% 0.13/0.36  ======= end of input processing =======
% 0.13/0.40  
% 0.13/0.40  Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.40  
% 0.13/0.40  Stopped by limit on number of solutions
% 0.13/0.40  
% 0.13/0.40  
% 0.13/0.40  -------------- Softie stats --------------
% 0.13/0.40  
% 0.13/0.40  UPDATE_STOP: 300
% 0.13/0.40  SFINDER_TIME_LIMIT: 2
% 0.13/0.40  SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.40  number of clauses in intial UL: 13
% 0.13/0.40  number of clauses initially in problem: 18
% 0.13/0.40  percentage of clauses intially in UL: 72
% 0.13/0.40  percentage of distinct symbols occuring in initial UL: 78
% 0.13/0.40  percent of all initial clauses that are short: 100
% 0.13/0.40  absolute distinct symbol count: 19
% 0.13/0.40     distinct predicate count: 14
% 0.13/0.40     distinct function count: 4
% 0.13/0.40     distinct constant count: 1
% 0.13/0.40  
% 0.13/0.40  ---------- no more Softie stats ----------
% 0.13/0.40  
% 0.13/0.40  
% 0.13/0.40  
% 0.13/0.40  Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.40  
% 0.13/0.40  Stopped by limit on number of solutions
% 0.13/0.40  
% 0.13/0.40  =========== start of search ===========
% 0.46/0.63  
% 0.46/0.63  -------- PROOF -------- 
% 0.46/0.63  % SZS status Theorem
% 0.46/0.63  % SZS output start Refutation
% 0.46/0.63  
% 0.46/0.63  Model 3 [ 1 1 160 ] (0.00 seconds, 231 Inserts)
% 0.46/0.63  
% 0.46/0.63  Stopped by limit on insertions
% 0.46/0.63  
% 0.46/0.63  Model 4 [ 2 0 109 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.63  
% 0.46/0.63  Stopped by limit on insertions
% 0.46/0.63  
% 0.46/0.63  Model 5 [ 2 0 147 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.63  
% 0.46/0.63  Stopped by limit on insertions
% 0.46/0.63  
% 0.46/0.63  Model 6 [ 2 1 289 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.63  
% 0.46/0.63  -----> EMPTY CLAUSE at   0.24 sec ----> 22 [hyper,21,11,20] {-} $F.
% 0.46/0.63  
% 0.46/0.63  Length of proof is 3.  Level of proof is 2.
% 0.46/0.63  
% 0.46/0.63  ---------------- PROOF ----------------
% 0.46/0.63  % SZS status Theorem
% 0.46/0.63  % SZS output start Refutation
% 0.46/0.63  
% 0.46/0.63  3 [] {+} -cUnsatisfiable(A)|cd1xcomp(A).
% 0.46/0.63  4 [] {+} -cUnsatisfiable(A)|cd1(A).
% 0.46/0.63  9 [] {+} -cd1(A)|ra_Px2(A,$f3(A)).
% 0.46/0.63  11 [] {+} -cd1xcomp(A)| -ra_Px2(A,B).
% 0.46/0.63  18 [] {-} cUnsatisfiable(i2003_11_14_17_22_23554).
% 0.46/0.63  19 [hyper,18,4] {+} cd1(i2003_11_14_17_22_23554).
% 0.46/0.63  20 [hyper,18,3] {+} cd1xcomp(i2003_11_14_17_22_23554).
% 0.46/0.63  21 [hyper,19,9] {+} ra_Px2(i2003_11_14_17_22_23554,$f3(i2003_11_14_17_22_23554)).
% 0.46/0.63  22 [hyper,21,11,20] {-} $F.
% 0.46/0.63  
% 0.46/0.63  % SZS output end Refutation
% 0.46/0.63  ------------ end of proof -------------
% 0.46/0.63  
% 0.46/0.63  
% 0.46/0.63  Search stopped by max_proofs option.
% 0.46/0.63  
% 0.46/0.63  
% 0.46/0.63  Search stopped by max_proofs option.
% 0.46/0.63  
% 0.46/0.63  ============ end of search ============
% 0.46/0.63  
% 0.46/0.63  ----------- soft-scott stats ----------
% 0.46/0.63  
% 0.46/0.63  true clauses given           2      (25.0%)
% 0.46/0.63  false clauses given          6
% 0.46/0.63  
% 0.46/0.63        FALSE     TRUE
% 0.46/0.63  tot:  0         0      (-nan% true)
% 0.46/0.63  
% 0.46/0.63  
% 0.46/0.63  Model 6 [ 2 1 289 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.63  
% 0.46/0.63  That finishes the proof of the theorem.
% 0.46/0.63  
% 0.46/0.63  Process 11135 finished Tue Jun  7 18:58:48 2022
%------------------------------------------------------------------------------