TSTP Solution File: SEV515+1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SEV515+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n016.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 : Tue Jul 19 18:12:50 EDT 2022

% Result   : Theorem 0.98s 1.22s
% Output   : Refutation 0.98s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEV515+1 : TPTP v8.1.0. Released v7.0.0.
% 0.07/0.12  % Command  : sos-script %s
% 0.13/0.33  % Computer : n016.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Tue Jun 28 12:33:22 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 n016.cluster.edu,
% 0.13/0.36  Tue Jun 28 12:33:22 2022
% 0.13/0.36  The command was "./sos".  The process ID is 27452.
% 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=8.
% 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  19 back subsumes 17.
% 0.13/0.36  19 back subsumes 16.
% 0.13/0.36  19 back subsumes 15.
% 0.13/0.36  28 back subsumes 26.
% 0.13/0.36  28 back subsumes 25.
% 0.13/0.36  28 back subsumes 24.
% 0.13/0.36  
% 0.13/0.36  ------------> process sos:
% 0.13/0.36  72 back subsumes 65.
% 0.13/0.36  72 back subsumes 64.
% 0.13/0.36  72 back subsumes 63.
% 0.13/0.36  72 back subsumes 62.
% 0.13/0.36  72 back subsumes 46.
% 0.13/0.36  72 back subsumes 45.
% 0.13/0.36  72 back subsumes 44.
% 0.13/0.36  72 back subsumes 43.
% 0.13/0.36  72 back subsumes 42.
% 0.13/0.36  72 back subsumes 41.
% 0.13/0.36  72 back subsumes 40.
% 0.13/0.36  72 back subsumes 28.
% 0.13/0.36  72 back subsumes 10.
% 0.13/0.36  72 back subsumes 9.
% 0.13/0.36  72 back subsumes 8.
% 0.13/0.36  72 back subsumes 7.
% 0.13/0.36  
% 0.13/0.36  ======= end of input processing =======
% 0.18/0.41  
% 0.18/0.41  Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.41  
% 0.18/0.41  Stopped by limit on number of solutions
% 0.18/0.41  
% 0.18/0.41  
% 0.18/0.41  -------------- Softie stats --------------
% 0.18/0.41  
% 0.18/0.41  UPDATE_STOP: 300
% 0.18/0.41  SFINDER_TIME_LIMIT: 2
% 0.18/0.41  SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.41  number of clauses in intial UL: 47
% 0.18/0.41  number of clauses initially in problem: 48
% 0.18/0.41  percentage of clauses intially in UL: 97
% 0.18/0.41  percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.41  percent of all initial clauses that are short: 100
% 0.18/0.41  absolute distinct symbol count: 8
% 0.18/0.41     distinct predicate count: 5
% 0.18/0.41     distinct function count: 1
% 0.18/0.41     distinct constant count: 2
% 0.18/0.41  
% 0.18/0.41  ---------- no more Softie stats ----------
% 0.18/0.41  
% 0.18/0.41  
% 0.18/0.41  
% 0.18/0.41  =========== start of search ===========
% 0.98/1.22  
% 0.98/1.22  -------- PROOF -------- 
% 0.98/1.22  % SZS status Theorem
% 0.98/1.22  % SZS output start Refutation
% 0.98/1.22  
% 0.98/1.22  Model 2 [ 7 1 231 ] (0.00 seconds, 73662 Inserts)
% 0.98/1.22  
% 0.98/1.22  Model 3 [ 6 1 485 ] (0.00 seconds, 104440 Inserts)
% 0.98/1.22  
% 0.98/1.22  Model 4 [ 8 0 494 ] (0.00 seconds, 33540 Inserts)
% 0.98/1.22  
% 0.98/1.22  Model 5 [ 8 1 263 ] (0.00 seconds, 40831 Inserts)
% 0.98/1.22  
% 0.98/1.22  Model 6 [ 8 0 1291 ] (0.00 seconds, 143572 Inserts)
% 0.98/1.22  
% 0.98/1.22  Model 7 [ 9 2 31042 ] (0.00 seconds, 96122 Inserts)
% 0.98/1.22  
% 0.98/1.22  -----> EMPTY CLAUSE at   0.84 sec ----> 187 [hyper,182,36,161] {-} $F.
% 0.98/1.22  
% 0.98/1.22  Length of proof is 36.  Level of proof is 15.
% 0.98/1.22  
% 0.98/1.22  ---------------- PROOF ----------------
% 0.98/1.22  % SZS status Theorem
% 0.98/1.22  % SZS output start Refutation
% 0.98/1.22  
% 0.98/1.22  1 [] {+} -g_true_only(A,$c1)| -g_both(A,A).
% 0.98/1.22  2 [] {+} -g_true_only(A,$c1)| -g_true_only(A,A).
% 0.98/1.22  3 [] {+} -g_both(A,$c1)| -g_false_only(A,A).
% 0.98/1.22  4 [] {+} -g_both(A,$c1)| -g_true_only(A,A).
% 0.98/1.22  5 [] {+} -g_false_only(A,$c1)| -g_false_only(A,A).
% 0.98/1.22  6 [] {+} -g_false_only(A,$c1)| -g_both(A,A).
% 0.98/1.22  12 [] {+} -g_both(A,B)| -g_both(A,A)|g_true_only($f1(B),B)|g_both($f1(B),B)|g_false_only($f1(B),$f1(B))|g_both($f1(B),$f1(B))|g_true_only(C,$c2)|g_true_only(C,C).
% 0.98/1.22  13 [] {+} -g_both(A,B)| -g_both(A,A)|g_true_only($f1(B),B)|g_both($f1(B),B)|g_false_only($f1(B),$f1(B))|g_both($f1(B),$f1(B))|g_false_only(C,C)|g_false_only(C,$c2).
% 0.98/1.22  18 [] {-} -g_both(A,B)| -g_both(A,A)|g_true_only($f1(B),B)|g_false_only($f1(B),$f1(B))|g_true_only($f1(B),$f1(B))|g_false_only($f1(B),B)|g_false_only(C,C)|g_true_only(C,C).
% 0.98/1.22  19 [copy,18,factor_simp,factor_simp] {+} -g_both(A,B)| -g_both(A,A)|g_true_only($f1(B),B)|g_false_only($f1(B),$f1(B))|g_true_only($f1(B),$f1(B))|g_false_only($f1(B),B).
% 0.98/1.22  21 [] {+} -g_both(A,B)| -g_both(A,A)|g_both($f1(B),$f1(B))|g_true_only($f1(B),$f1(B))|g_both($f1(B),B)|g_false_only($f1(B),B)|g_true_only(C,$c2)|g_true_only(C,C).
% 0.98/1.22  22 [] {+} -g_both(A,B)| -g_both(A,A)|g_both($f1(B),$f1(B))|g_true_only($f1(B),$f1(B))|g_both($f1(B),B)|g_false_only($f1(B),B)|g_false_only(C,C)|g_false_only(C,$c2).
% 0.98/1.22  29 [] {+} -g_true_only(A,B)|g_true(A,B).
% 0.98/1.22  30 [] {+} -g_true_only(A,B)| -g_false(A,B).
% 0.98/1.22  32 [] {+} -g_both(A,B)|g_true(A,B).
% 0.98/1.22  33 [] {+} -g_both(A,B)|g_false(A,B).
% 0.98/1.22  35 [] {+} -g_false_only(A,B)|g_false(A,B).
% 0.98/1.22  36 [] {+} -g_false_only(A,B)| -g_true(A,B).
% 0.98/1.22  38 [factor,2.1.2] {+} -g_true_only($c1,$c1).
% 0.98/1.22  39 [factor,5.1.2] {+} -g_false_only($c1,$c1).
% 0.98/1.22  48 [factor,12.1.2] {+} -g_both(A,A)|g_true_only($f1(A),A)|g_both($f1(A),A)|g_false_only($f1(A),$f1(A))|g_both($f1(A),$f1(A))|g_true_only(B,$c2)|g_true_only(B,B).
% 0.98/1.22  50 [factor,13.1.2] {+} -g_both(A,A)|g_true_only($f1(A),A)|g_both($f1(A),A)|g_false_only($f1(A),$f1(A))|g_both($f1(A),$f1(A))|g_false_only(B,B)|g_false_only(B,$c2).
% 0.98/1.22  54 [factor,19.1.2] {+} -g_both(A,A)|g_true_only($f1(A),A)|g_false_only($f1(A),$f1(A))|g_true_only($f1(A),$f1(A))|g_false_only($f1(A),A).
% 0.98/1.22  56 [factor,21.1.2] {+} -g_both(A,A)|g_both($f1(A),$f1(A))|g_true_only($f1(A),$f1(A))|g_both($f1(A),A)|g_false_only($f1(A),A)|g_true_only(B,$c2)|g_true_only(B,B).
% 0.98/1.22  59 [factor,22.1.2] {+} -g_both(A,A)|g_both($f1(A),$f1(A))|g_true_only($f1(A),$f1(A))|g_both($f1(A),A)|g_false_only($f1(A),A)|g_false_only(B,B)|g_false_only(B,$c2).
% 0.98/1.22  66 [factor,48.6.7] {+} -g_both(A,A)|g_true_only($f1(A),A)|g_both($f1(A),A)|g_false_only($f1(A),$f1(A))|g_both($f1(A),$f1(A))|g_true_only($c2,$c2).
% 0.98/1.22  68 [factor,50.6.7] {+} -g_both(A,A)|g_true_only($f1(A),A)|g_both($f1(A),A)|g_false_only($f1(A),$f1(A))|g_both($f1(A),$f1(A))|g_false_only($c2,$c2).
% 0.98/1.22  70 [factor,56.6.7] {+} -g_both(A,A)|g_both($f1(A),$f1(A))|g_true_only($f1(A),$f1(A))|g_both($f1(A),A)|g_false_only($f1(A),A)|g_true_only($c2,$c2).
% 0.98/1.22  71 [factor,59.6.7] {+} -g_both(A,A)|g_both($f1(A),$f1(A))|g_true_only($f1(A),$f1(A))|g_both($f1(A),A)|g_false_only($f1(A),A)|g_false_only($c2,$c2).
% 0.98/1.22  72 [] {-} g_true_only(A,B)|g_both(A,B)|g_false_only(A,B).
% 0.98/1.22  73 [hyper,72,38,unit_del,39] {-} g_both($c1,$c1).
% 0.98/1.22  76 [hyper,73,71] {+} g_both($f1($c1),$f1($c1))|g_true_only($f1($c1),$f1($c1))|g_both($f1($c1),$c1)|g_false_only($f1($c1),$c1)|g_false_only($c2,$c2).
% 0.98/1.22  77 [hyper,73,70] {+} g_both($f1($c1),$f1($c1))|g_true_only($f1($c1),$f1($c1))|g_both($f1($c1),$c1)|g_false_only($f1($c1),$c1)|g_true_only($c2,$c2).
% 0.98/1.22  79 [hyper,73,68] {-} g_true_only($f1($c1),$c1)|g_both($f1($c1),$c1)|g_false_only($f1($c1),$f1($c1))|g_both($f1($c1),$f1($c1))|g_false_only($c2,$c2).
% 0.98/1.22  81 [hyper,73,66] {-} g_true_only($f1($c1),$c1)|g_both($f1($c1),$c1)|g_false_only($f1($c1),$f1($c1))|g_both($f1($c1),$f1($c1))|g_true_only($c2,$c2).
% 0.98/1.22  86 [hyper,73,54] {+} g_true_only($f1($c1),$c1)|g_false_only($f1($c1),$f1($c1))|g_true_only($f1($c1),$f1($c1))|g_false_only($f1($c1),$c1).
% 0.98/1.22  98 [hyper,79,2,72,factor_simp,factor_simp] {-} g_both($f1($c1),$c1)|g_false_only($f1($c1),$f1($c1))|g_both($f1($c1),$f1($c1))|g_false_only($c2,$c2).
% 0.98/1.22  101 [hyper,76,2,72,factor_simp,factor_simp] {-} g_both($f1($c1),$f1($c1))|g_both($f1($c1),$c1)|g_false_only($f1($c1),$c1)|g_false_only($c2,$c2).
% 0.98/1.22  107 [hyper,77,2,72,factor_simp,factor_simp] {-} g_both($f1($c1),$f1($c1))|g_both($f1($c1),$c1)|g_false_only($f1($c1),$c1)|g_true_only($c2,$c2).
% 0.98/1.22  114 [hyper,107,29] {-} g_both($f1($c1),$f1($c1))|g_both($f1($c1),$c1)|g_false_only($f1($c1),$c1)|g_true($c2,$c2).
% 0.98/1.22  116 [hyper,114,36,101,factor_simp,factor_simp,factor_simp] {-} g_both($f1($c1),$f1($c1))|g_both($f1($c1),$c1)|g_false_only($f1($c1),$c1).
% 0.98/1.22  117 [hyper,116,35] {-} g_both($f1($c1),$f1($c1))|g_both($f1($c1),$c1)|g_false($f1($c1),$c1).
% 0.98/1.22  120 [hyper,98,5,116,factor_simp,factor_simp] {-} g_both($f1($c1),$c1)|g_both($f1($c1),$f1($c1))|g_false_only($c2,$c2).
% 0.98/1.22  122 [hyper,120,35] {-} g_both($f1($c1),$c1)|g_both($f1($c1),$f1($c1))|g_false($c2,$c2).
% 0.98/1.22  126 [hyper,81,30,117,factor_simp,factor_simp] {-} g_both($f1($c1),$c1)|g_false_only($f1($c1),$f1($c1))|g_both($f1($c1),$f1($c1))|g_true_only($c2,$c2).
% 0.98/1.22  129 [hyper,126,30,122,factor_simp,factor_simp] {-} g_both($f1($c1),$c1)|g_false_only($f1($c1),$f1($c1))|g_both($f1($c1),$f1($c1)).
% 0.98/1.22  131 [hyper,129,5,116,factor_simp,factor_simp] {+} g_both($f1($c1),$c1)|g_both($f1($c1),$f1($c1)).
% 0.98/1.22  156 [hyper,131,1,72,factor_simp] {+} g_both($f1($c1),$c1)|g_false_only($f1($c1),$c1).
% 0.98/1.22  158 [hyper,156,6,131,factor_simp] {+} g_both($f1($c1),$c1).
% 0.98/1.22  160 [hyper,158,33] {+} g_false($f1($c1),$c1).
% 0.98/1.22  161 [hyper,158,32] {+} g_true($f1($c1),$c1).
% 0.98/1.22  162 [hyper,158,4,86] {-} g_true_only($f1($c1),$c1)|g_false_only($f1($c1),$f1($c1))|g_false_only($f1($c1),$c1).
% 0.98/1.22  181 [hyper,162,30,160] {+} g_false_only($f1($c1),$f1($c1))|g_false_only($f1($c1),$c1).
% 0.98/1.22  182 [hyper,181,3,158] {+} g_false_only($f1($c1),$c1).
% 0.98/1.22  187 [hyper,182,36,161] {-} $F.
% 0.98/1.22  
% 0.98/1.22  % SZS output end Refutation
% 0.98/1.22  ------------ end of proof -------------
% 0.98/1.22  
% 0.98/1.22  
% 0.98/1.22  Search stopped by max_proofs option.
% 0.98/1.22  
% 0.98/1.22  
% 0.98/1.22  Search stopped by max_proofs option.
% 0.98/1.22  
% 0.98/1.22  ============ end of search ============
% 0.98/1.22  
% 0.98/1.22  ----------- soft-scott stats ----------
% 0.98/1.22  
% 0.98/1.22  true clauses given           7      (16.7%)
% 0.98/1.22  false clauses given         35
% 0.98/1.22  
% 0.98/1.22        FALSE     TRUE
% 0.98/1.22     5  2         1
% 0.98/1.22    26  0         1
% 0.98/1.22    29  0         4
% 0.98/1.22    31  0         2
% 0.98/1.22    32  0         10
% 0.98/1.22  tot:  2         18      (90.0% true)
% 0.98/1.22  
% 0.98/1.22  
% 0.98/1.22  Model 7 [ 9 2 31042 ] (0.00 seconds, 96122 Inserts)
% 0.98/1.22  
% 0.98/1.22  That finishes the proof of the theorem.
% 0.98/1.22  
% 0.98/1.22  Process 27452 finished Tue Jun 28 12:33:23 2022
%------------------------------------------------------------------------------