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

View Problem - Process Solution

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

% Computer : n020.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:49:57 EDT 2022

% Result   : Theorem 2.73s 2.95s
% Output   : Refutation 2.73s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SYO607+1 : TPTP v8.1.0. Released v7.0.0.
% 0.11/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n020.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 : Fri Jul  8 19:59:28 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.34  ----- Otter 3.2, August 2001 -----
% 0.12/0.34  The process was started by sandbox2 on n020.cluster.edu,
% 0.12/0.34  Fri Jul  8 19:59:28 2022
% 0.12/0.34  The command was "./sos".  The process ID is 31260.
% 0.12/0.34  
% 0.12/0.34  set(prolog_style_variables).
% 0.12/0.34  set(auto).
% 0.12/0.34     dependent: set(auto1).
% 0.12/0.34     dependent: set(process_input).
% 0.12/0.34     dependent: clear(print_kept).
% 0.12/0.34     dependent: clear(print_new_demod).
% 0.12/0.34     dependent: clear(print_back_demod).
% 0.12/0.34     dependent: clear(print_back_sub).
% 0.12/0.34     dependent: set(control_memory).
% 0.12/0.34     dependent: assign(max_mem, 12000).
% 0.12/0.34     dependent: assign(pick_given_ratio, 4).
% 0.12/0.34     dependent: assign(stats_level, 1).
% 0.12/0.34     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.34     dependent: assign(sos_limit, 5000).
% 0.12/0.34     dependent: assign(max_weight, 60).
% 0.12/0.34  clear(print_given).
% 0.12/0.34  
% 0.12/0.34  formula_list(usable).
% 0.12/0.34  
% 0.12/0.34  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=8.
% 0.12/0.34  
% 0.12/0.34  This is a non-Horn set without equality.  The strategy
% 0.12/0.34  will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.34  factoring, with satellites in sos and nuclei in usable.
% 0.12/0.34  
% 0.12/0.34     dependent: set(hyper_res).
% 0.12/0.34     dependent: set(factor).
% 0.12/0.34     dependent: set(unit_deletion).
% 0.12/0.34  
% 0.12/0.34  ------------> process usable:
% 0.12/0.34  
% 0.12/0.34  ------------> process sos:
% 0.12/0.34  
% 0.12/0.34  ======= end of input processing =======
% 0.46/0.65  
% 0.46/0.65  Model 1 (0.00 seconds, 0 Inserts)
% 0.46/0.65  
% 0.46/0.65  Stopped by limit on number of solutions
% 0.46/0.65  
% 0.46/0.65  
% 0.46/0.65  -------------- Softie stats --------------
% 0.46/0.65  
% 0.46/0.65  UPDATE_STOP: 300
% 0.46/0.65  SFINDER_TIME_LIMIT: 2
% 0.46/0.65  SHORT_CLAUSE_CUTOFF: 4
% 0.46/0.65  number of clauses in intial UL: 36
% 0.46/0.65  number of clauses initially in problem: 37
% 0.46/0.65  percentage of clauses intially in UL: 97
% 0.46/0.65  percentage of distinct symbols occuring in initial UL: 100
% 0.46/0.65  percent of all initial clauses that are short: 100
% 0.46/0.65  absolute distinct symbol count: 12
% 0.46/0.65     distinct predicate count: 5
% 0.46/0.65     distinct function count: 3
% 0.46/0.65     distinct constant count: 4
% 0.46/0.65  
% 0.46/0.65  ---------- no more Softie stats ----------
% 0.46/0.65  
% 0.46/0.65  
% 0.46/0.65  
% 0.46/0.65  Stopped by limit on insertions
% 0.46/0.65  
% 0.46/0.65  =========== start of search ===========
% 2.73/2.95  
% 2.73/2.95  -------- PROOF -------- 
% 2.73/2.95  % SZS status Theorem
% 2.73/2.95  % SZS output start Refutation
% 2.73/2.95  
% 2.73/2.95  Stopped by limit on insertions
% 2.73/2.95  
% 2.73/2.95  Stopped by limit on insertions
% 2.73/2.95  
% 2.73/2.95  Stopped by limit on insertions
% 2.73/2.95  
% 2.73/2.95  Stopped by limit on insertions
% 2.73/2.95  
% 2.73/2.95  Stopped by limit on insertions
% 2.73/2.95  
% 2.73/2.95  Model 2 [ 6 16 142220 ] (0.00 seconds, 250000 Inserts)
% 2.73/2.95  
% 2.73/2.95  Stopped by limit on insertions
% 2.73/2.95  
% 2.73/2.95  Model 3 [ 6 52 118937 ] (0.00 seconds, 250000 Inserts)
% 2.73/2.95  
% 2.73/2.95  Stopped by limit on insertions
% 2.73/2.95  
% 2.73/2.95  Stopped by limit on insertions
% 2.73/2.95  
% 2.73/2.95  Model 4 [ 7 2 38430 ] (0.00 seconds, 250000 Inserts)
% 2.73/2.95  
% 2.73/2.95  Stopped by limit on insertions
% 2.73/2.95  
% 2.73/2.95  -----> EMPTY CLAUSE at   2.58 sec ----> 284 [hyper,282,1,247] {-} $F.
% 2.73/2.95  
% 2.73/2.95  Length of proof is 48.  Level of proof is 22.
% 2.73/2.95  
% 2.73/2.95  ---------------- PROOF ----------------
% 2.73/2.95  % SZS status Theorem
% 2.73/2.95  % SZS output start Refutation
% 2.73/2.95  
% 2.73/2.95  1 [] {+} -g_false_only(a,A)| -g_false_only(A,B).
% 2.73/2.95  2 [] {+} -g_true_only(A,$f1(A)).
% 2.73/2.95  3 [] {+} -g_both(a,A)|g_true_only(a,A)|g_true_only(A,B)|g_false_only(a,$c2)| -g_both(C,D)|g_false_only(C,$f3(C))|g_true_only($c3,E).
% 2.73/2.95  4 [] {+} -g_both(a,A)|g_true_only(a,A)|g_true_only(A,B)|g_false_only($c2,$c1)| -g_both(C,D)|g_false_only(C,$f3(C))|g_true_only($c3,E).
% 2.73/2.95  5 [] {+} -g_both(A,B)|g_false_only(A,$f2(A))|g_true_only(a,A)|g_true_only(A,C)|g_false_only(a,$c2)| -g_both(D,E)|g_false_only(D,$f3(D))|g_true_only($c3,F).
% 2.73/2.95  6 [] {+} -g_both(A,B)|g_false_only(A,$f2(A))|g_true_only(a,A)|g_true_only(A,C)|g_false_only($c2,$c1)| -g_both(D,E)|g_false_only(D,$f3(D))|g_true_only($c3,F).
% 2.73/2.95  8 [] {+} -g_true_only(A,B)| -g_false(A,B).
% 2.73/2.95  11 [] {+} -g_both(A,B)|g_false(A,B).
% 2.73/2.95  13 [] {+} -g_false_only(A,B)|g_false(A,B).
% 2.73/2.95  17 [factor,3.1.5] {+} -g_both(a,A)|g_true_only(a,A)|g_true_only(A,B)|g_false_only(a,$c2)|g_false_only(a,$f3(a))|g_true_only($c3,C).
% 2.73/2.95  20 [factor,4.1.5] {+} -g_both(a,A)|g_true_only(a,A)|g_true_only(A,B)|g_false_only($c2,$c1)|g_false_only(a,$f3(a))|g_true_only($c3,C).
% 2.73/2.95  23 [factor,5.1.6] {+} -g_both(A,B)|g_false_only(A,$f2(A))|g_true_only(a,A)|g_true_only(A,C)|g_false_only(a,$c2)|g_false_only(A,$f3(A))|g_true_only($c3,D).
% 2.73/2.95  26 [factor,6.1.6] {+} -g_both(A,B)|g_false_only(A,$f2(A))|g_true_only(a,A)|g_true_only(A,C)|g_false_only($c2,$c1)|g_false_only(A,$f3(A))|g_true_only($c3,D).
% 2.73/2.95  37 [] {-} g_true_only(A,B)|g_both(A,B)|g_false_only(A,B).
% 2.73/2.95  39 [hyper,37,2] {-} g_both(A,$f1(A))|g_false_only(A,$f1(A)).
% 2.73/2.95  40 [hyper,39,13] {-} g_both(A,$f1(A))|g_false(A,$f1(A)).
% 2.73/2.95  41 [hyper,39,1,39] {-} g_both($f1(a),$f1($f1(a)))|g_both(a,$f1(a)).
% 2.73/2.95  42 [hyper,41,26,unit_del,2] {+} g_both(a,$f1(a))|g_false_only($f1(a),$f2($f1(a)))|g_true_only($f1(a),A)|g_false_only($c2,$c1)|g_false_only($f1(a),$f3($f1(a)))|g_true_only($c3,B).
% 2.73/2.95  43 [hyper,41,23,unit_del,2] {+} g_both(a,$f1(a))|g_false_only($f1(a),$f2($f1(a)))|g_true_only($f1(a),A)|g_false_only(a,$c2)|g_false_only($f1(a),$f3($f1(a)))|g_true_only($c3,B).
% 2.73/2.95  48 [hyper,41,20,unit_del,2] {+} g_both($f1(a),$f1($f1(a)))|g_true_only($f1(a),A)|g_false_only($c2,$c1)|g_false_only(a,$f3(a))|g_true_only($c3,B).
% 2.73/2.95  49 [hyper,41,17,unit_del,2] {-} g_both($f1(a),$f1($f1(a)))|g_true_only($f1(a),A)|g_false_only(a,$c2)|g_false_only(a,$f3(a))|g_true_only($c3,B).
% 2.73/2.95  53 [hyper,42,2] {+} g_both(a,$f1(a))|g_false_only($f1(a),$f2($f1(a)))|g_false_only($c2,$c1)|g_false_only($f1(a),$f3($f1(a)))|g_true_only($c3,A).
% 2.73/2.95  57 [hyper,49,8,40,factor_simp] {-} g_both($f1(a),$f1($f1(a)))|g_false_only(a,$c2)|g_false_only(a,$f3(a))|g_true_only($c3,A).
% 2.73/2.95  62 [hyper,43,2] {+} g_both(a,$f1(a))|g_false_only($f1(a),$f2($f1(a)))|g_false_only(a,$c2)|g_false_only($f1(a),$f3($f1(a)))|g_true_only($c3,A).
% 2.73/2.95  68 [hyper,57,2] {-} g_both($f1(a),$f1($f1(a)))|g_false_only(a,$c2)|g_false_only(a,$f3(a)).
% 2.73/2.95  81 [hyper,48,8,40,factor_simp] {+} g_both($f1(a),$f1($f1(a)))|g_false_only($c2,$c1)|g_false_only(a,$f3(a))|g_true_only($c3,A).
% 2.73/2.95  104 [hyper,53,2] {+} g_both(a,$f1(a))|g_false_only($f1(a),$f2($f1(a)))|g_false_only($c2,$c1)|g_false_only($f1(a),$f3($f1(a))).
% 2.73/2.95  107 [hyper,81,2] {+} g_both($f1(a),$f1($f1(a)))|g_false_only($c2,$c1)|g_false_only(a,$f3(a)).
% 2.73/2.95  111 [hyper,107,1,68,factor_simp,factor_simp] {-} g_both($f1(a),$f1($f1(a)))|g_false_only(a,$f3(a)).
% 2.73/2.95  116 [hyper,62,2] {+} g_both(a,$f1(a))|g_false_only($f1(a),$f2($f1(a)))|g_false_only(a,$c2)|g_false_only($f1(a),$f3($f1(a))).
% 2.73/2.95  118 [hyper,111,1,39] {-} g_both($f1(a),$f1($f1(a)))|g_both($f3(a),$f1($f3(a))).
% 2.73/2.95  130 [hyper,118,3,41,unit_del,2,factor_simp] {+} g_both($f1(a),$f1($f1(a)))|g_true_only($f1(a),A)|g_false_only(a,$c2)|g_false_only($f3(a),$f3($f3(a)))|g_true_only($c3,B).
% 2.73/2.95  132 [hyper,104,1,39,factor_simp] {+} g_both(a,$f1(a))|g_false_only($c2,$c1)|g_false_only($f1(a),$f3($f1(a))).
% 2.73/2.95  138 [hyper,132,1,39,factor_simp] {+} g_both(a,$f1(a))|g_false_only($c2,$c1).
% 2.73/2.95  140 [hyper,116,1,39,factor_simp] {+} g_both(a,$f1(a))|g_false_only(a,$c2)|g_false_only($f1(a),$f3($f1(a))).
% 2.73/2.95  149 [hyper,140,1,39,factor_simp] {-} g_both(a,$f1(a))|g_false_only(a,$c2).
% 2.73/2.95  151 [hyper,149,1,138,factor_simp] {-} g_both(a,$f1(a)).
% 2.73/2.95  160 [hyper,151,20,unit_del,2] {+} g_true_only($f1(a),A)|g_false_only($c2,$c1)|g_false_only(a,$f3(a))|g_true_only($c3,B).
% 2.73/2.95  161 [hyper,151,17,unit_del,2] {+} g_true_only($f1(a),A)|g_false_only(a,$c2)|g_false_only(a,$f3(a))|g_true_only($c3,B).
% 2.73/2.95  179 [hyper,160,2] {+} g_false_only($c2,$c1)|g_false_only(a,$f3(a))|g_true_only($c3,A).
% 2.73/2.95  194 [hyper,179,2] {+} g_false_only($c2,$c1)|g_false_only(a,$f3(a)).
% 2.73/2.95  199 [hyper,130,8,40,factor_simp] {+} g_both($f1(a),$f1($f1(a)))|g_false_only(a,$c2)|g_false_only($f3(a),$f3($f3(a)))|g_true_only($c3,A).
% 2.73/2.95  210 [hyper,161,2] {+} g_false_only(a,$c2)|g_false_only(a,$f3(a))|g_true_only($c3,A).
% 2.73/2.95  216 [hyper,210,2] {+} g_false_only(a,$c2)|g_false_only(a,$f3(a)).
% 2.73/2.95  220 [hyper,216,1,194,factor_simp] {+} g_false_only(a,$f3(a)).
% 2.73/2.95  224 [hyper,220,1,39] {+} g_both($f3(a),$f1($f3(a))).
% 2.73/2.95  232 [hyper,224,4,151,unit_del,2] {-} g_true_only($f1(a),A)|g_false_only($c2,$c1)|g_false_only($f3(a),$f3($f3(a)))|g_true_only($c3,B).
% 2.73/2.95  233 [hyper,224,3,151,unit_del,2] {+} g_true_only($f1(a),A)|g_false_only(a,$c2)|g_false_only($f3(a),$f3($f3(a)))|g_true_only($c3,B).
% 2.73/2.95  235 [hyper,232,2] {-} g_false_only($c2,$c1)|g_false_only($f3(a),$f3($f3(a)))|g_true_only($c3,A).
% 2.73/2.95  241 [hyper,235,2] {-} g_false_only($c2,$c1)|g_false_only($f3(a),$f3($f3(a))).
% 2.73/2.95  247 [hyper,241,1,220] {+} g_false_only($c2,$c1).
% 2.73/2.95  251 [hyper,199,2] {+} g_both($f1(a),$f1($f1(a)))|g_false_only(a,$c2)|g_false_only($f3(a),$f3($f3(a))).
% 2.73/2.95  255 [hyper,251,1,220] {+} g_both($f1(a),$f1($f1(a)))|g_false_only(a,$c2).
% 2.73/2.95  257 [hyper,255,1,247] {+} g_both($f1(a),$f1($f1(a))).
% 2.73/2.95  260 [hyper,257,11] {+} g_false($f1(a),$f1($f1(a))).
% 2.73/2.95  268 [hyper,233,8,260] {+} g_false_only(a,$c2)|g_false_only($f3(a),$f3($f3(a)))|g_true_only($c3,A).
% 2.73/2.95  274 [hyper,268,2] {+} g_false_only(a,$c2)|g_false_only($f3(a),$f3($f3(a))).
% 2.73/2.95  282 [hyper,274,1,220] {-} g_false_only(a,$c2).
% 2.73/2.95  284 [hyper,282,1,247] {-} $F.
% 2.73/2.95  
% 2.73/2.95  % SZS output end Refutation
% 2.73/2.95  ------------ end of proof -------------
% 2.73/2.95  
% 2.73/2.95  
% 2.73/2.95  Search stopped by max_proofs option.
% 2.73/2.95  
% 2.73/2.95  
% 2.73/2.95  Search stopped by max_proofs option.
% 2.73/2.95  
% 2.73/2.95  ============ end of search ============
% 2.73/2.95  
% 2.73/2.95  ----------- soft-scott stats ----------
% 2.73/2.95  
% 2.73/2.95  true clauses given          49      (52.7%)
% 2.73/2.95  false clauses given         44
% 2.73/2.95  
% 2.73/2.95        FALSE     TRUE
% 2.73/2.95     6  0         1
% 2.73/2.95  tot:  0         1      (100.0% true)
% 2.73/2.95  
% 2.73/2.95  
% 2.73/2.95  Model 4 [ 7 -8 38430 ] (0.00 seconds, 250000 Inserts)
% 2.73/2.95  
% 2.73/2.95  That finishes the proof of the theorem.
% 2.73/2.95  
% 2.73/2.95  Process 31260 finished Fri Jul  8 19:59:31 2022
%------------------------------------------------------------------------------