↑ Up

SOS---2.0.UNS-Ref.s

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

% Computer : n021.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:47 EDT 2022

% Result   : Unsatisfiable 0.75s 0.97s
% Output   : Refutation 0.75s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : KRS111+1 : TPTP v8.1.0. Released v3.1.0.
% 0.08/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n021.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 13:34:36 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 sandbox2 on n021.cluster.edu,
% 0.13/0.36  Tue Jun  7 13:34:36 2022
% 0.13/0.36  The command was "./sos".  The process ID is 8522.
% 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=1, symmetry=0, max_lits=7.
% 0.13/0.36  
% 0.13/0.36  This ia a non-Horn set with equality.  The strategy will be
% 0.13/0.36  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36  unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36  clauses in usable.
% 0.13/0.36  
% 0.13/0.36     dependent: set(knuth_bendix).
% 0.13/0.36     dependent: set(para_from).
% 0.13/0.36     dependent: set(para_into).
% 0.13/0.36     dependent: clear(para_from_right).
% 0.13/0.36     dependent: clear(para_into_right).
% 0.13/0.36     dependent: set(para_from_vars).
% 0.13/0.36     dependent: set(eq_units_both_ways).
% 0.13/0.36     dependent: set(dynamic_demod_all).
% 0.13/0.36     dependent: set(dynamic_demod).
% 0.13/0.36     dependent: set(order_eq).
% 0.13/0.36     dependent: set(back_demod).
% 0.13/0.36     dependent: set(lrpo).
% 0.13/0.36     dependent: set(hyper_res).
% 0.13/0.36     dependent: set(unit_deletion).
% 0.13/0.36     dependent: set(factor).
% 0.13/0.36  
% 0.13/0.36  ------------> process usable:
% 0.13/0.36  22 back subsumes 2.
% 0.13/0.36  
% 0.13/0.36  ------------> process sos:
% 0.13/0.36  48 back subsumes 27.
% 0.13/0.36  48 back subsumes 3.
% 0.13/0.36    Following clause subsumed by 52 during input processing: 0 [copy,52,flip.1] {-} A=A.
% 0.13/0.36  52 back subsumes 47.
% 0.13/0.36  52 back subsumes 46.
% 0.13/0.36  52 back subsumes 45.
% 0.13/0.36  
% 0.13/0.36  ======= end of input processing =======
% 0.19/0.40  
% 0.19/0.40  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40  
% 0.19/0.40  Stopped by limit on number of solutions
% 0.19/0.40  
% 0.19/0.40  
% 0.19/0.40  -------------- Softie stats --------------
% 0.19/0.40  
% 0.19/0.40  UPDATE_STOP: 300
% 0.19/0.40  SFINDER_TIME_LIMIT: 2
% 0.19/0.40  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40  number of clauses in intial UL: 41
% 0.19/0.40  number of clauses initially in problem: 46
% 0.19/0.40  percentage of clauses intially in UL: 89
% 0.19/0.40  percentage of distinct symbols occuring in initial UL: 90
% 0.19/0.40  percent of all initial clauses that are short: 100
% 0.19/0.40  absolute distinct symbol count: 21
% 0.19/0.40     distinct predicate count: 15
% 0.19/0.40     distinct function count: 5
% 0.19/0.40     distinct constant count: 1
% 0.19/0.40  
% 0.19/0.40  ---------- no more Softie stats ----------
% 0.19/0.40  
% 0.19/0.40  
% 0.19/0.40  
% 0.19/0.40  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.40  
% 0.19/0.40  Stopped by limit on number of solutions
% 0.19/0.40  
% 0.19/0.40  =========== start of search ===========
% 0.75/0.97  
% 0.75/0.97  -------- PROOF -------- 
% 0.75/0.97  % SZS status Theorem
% 0.75/0.97  % SZS output start Refutation
% 0.75/0.97  
% 0.75/0.97  Model 3 [ 1 1 132 ] (0.00 seconds, 425 Inserts)
% 0.75/0.97  
% 0.75/0.97  Stopped by limit on insertions
% 0.75/0.97  
% 0.75/0.97  Model 4 [ 2 1 324 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.97  
% 0.75/0.97  Model 5 [ 1 1 328 ] (0.00 seconds, 14688 Inserts)
% 0.75/0.97  
% 0.75/0.97  Model 6 [ 1 1 236 ] (0.00 seconds, 10651 Inserts)
% 0.75/0.97  
% 0.75/0.97  Stopped by limit on insertions
% 0.75/0.97  
% 0.75/0.97  Model 7 [ 2 1 273 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.97  
% 0.75/0.97  Model 8 [ 1 1 572 ] (0.00 seconds, 7418 Inserts)
% 0.75/0.97  
% 0.75/0.97  Stopped by limit on insertions
% 0.75/0.97  
% 0.75/0.97  Model 9 [ 3 1 322 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.97  
% 0.75/0.97  Stopped by limit on insertions
% 0.75/0.97  
% 0.75/0.97  Model 10 [ 2 1 397 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.97  
% 0.75/0.97  Stopped by limit on insertions
% 0.75/0.97  
% 0.75/0.97  Model 11 [ 4 1 251 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.97  
% 0.75/0.97  Stopped by limit on insertions
% 0.75/0.97  
% 0.75/0.97  Model 12 [ 5 1 9864 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.97  
% 0.75/0.97  Stopped by limit on insertions
% 0.75/0.97  
% 0.75/0.97  Model 13 [ 3 0 398 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.97  
% 0.75/0.97  Stopped by limit on insertions
% 0.75/0.97  
% 0.75/0.97  Model 14 [ 8 0 458 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.97  
% 0.75/0.97  Stopped by limit on insertions
% 0.75/0.97  
% 0.75/0.97  Model 15 [ 6 0 1117 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.97  
% 0.75/0.97  Stopped by limit on insertions
% 0.75/0.97  
% 0.75/0.97  Model 16 [ 10 2 88556 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.97  
% 0.75/0.97  -----> EMPTY CLAUSE at   0.59 sec ----> 189 [hyper,185,31,70] {-} $F.
% 0.75/0.97  
% 0.75/0.97  Length of proof is 11.  Level of proof is 5.
% 0.75/0.97  
% 0.75/0.97  ---------------- PROOF ----------------
% 0.75/0.97  % SZS status Theorem
% 0.75/0.97  % SZS output start Refutation
% 0.75/0.97  
% 0.75/0.97  24 [] {+} -cUnsatisfiable(A)|rf1(A,$f1(A)).
% 0.75/0.97  25 [] {+} -cUnsatisfiable(A)|cpxcomp($f1(A)).
% 0.75/0.97  26 [] {+} -cUnsatisfiable(A)|rs(A,$f2(A)).
% 0.75/0.97  28 [] {+} -cUnsatisfiable(A)|rf(A,$f3(A)).
% 0.75/0.97  29 [] {+} -cUnsatisfiable(A)|cp($f3(A)).
% 0.75/0.97  31 [] {+} -cp(A)| -ra_Px1(A,B).
% 0.75/0.97  32 [] {+} -cpxcomp(A)|ra_Px1(A,$f5(A)).
% 0.75/0.97  34 [] {+} -rf(A,B)| -rf(A,C)|B=C.
% 0.75/0.97  35 [] {+} -rf1(A,B)| -rf1(A,C)|B=C.
% 0.75/0.97  43 [] {+} -rs(A,B)|rf(A,B).
% 0.75/0.97  44 [] {+} -rs(A,B)|rf1(A,B).
% 0.75/0.97  51 [] {-} cUnsatisfiable(i2003_11_14_17_21_15425).
% 0.75/0.97  53 [hyper,51,29] {+} cp($f3(i2003_11_14_17_21_15425)).
% 0.75/0.97  54 [hyper,51,28] {+} rf(i2003_11_14_17_21_15425,$f3(i2003_11_14_17_21_15425)).
% 0.75/0.97  55 [hyper,51,26] {-} rs(i2003_11_14_17_21_15425,$f2(i2003_11_14_17_21_15425)).
% 0.75/0.97  56 [hyper,51,25] {+} cpxcomp($f1(i2003_11_14_17_21_15425)).
% 0.75/0.97  57 [hyper,51,24] {+} rf1(i2003_11_14_17_21_15425,$f1(i2003_11_14_17_21_15425)).
% 0.75/0.97  70 [hyper,56,32] {-} ra_Px1($f1(i2003_11_14_17_21_15425),$f5($f1(i2003_11_14_17_21_15425))).
% 0.75/0.97  87 [hyper,55,44] {+} rf1(i2003_11_14_17_21_15425,$f2(i2003_11_14_17_21_15425)).
% 0.75/0.97  88 [hyper,55,43] {-} rf(i2003_11_14_17_21_15425,$f2(i2003_11_14_17_21_15425)).
% 0.75/0.97  132,131 [hyper,87,35,57,flip.1] {+} $f2(i2003_11_14_17_21_15425)=$f1(i2003_11_14_17_21_15425).
% 0.75/0.97  175,174 [hyper,88,34,54,demod,132] {-} $f3(i2003_11_14_17_21_15425)=$f1(i2003_11_14_17_21_15425).
% 0.75/0.97  185 [back_demod,53,demod,175] {-} cp($f1(i2003_11_14_17_21_15425)).
% 0.75/0.97  189 [hyper,185,31,70] {-} $F.
% 0.75/0.97  
% 0.75/0.97  % SZS output end Refutation
% 0.75/0.97  ------------ end of proof -------------
% 0.75/0.97  
% 0.75/0.97  
% 0.75/0.97  Search stopped by max_proofs option.
% 0.75/0.97  
% 300.01/300.22  Wow, sos-wrapper got a signal XCPU
%------------------------------------------------------------------------------