↑ Up

SOS---2.0.THM-Ref.s

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

% Computer : n026.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 05:21:31 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET876+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12  % Command  : sos-script %s
% 0.13/0.34  % Computer : n026.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 09:10:27 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 n026.cluster.edu,
% 0.13/0.36  Mon Jul 11 09:10:27 2022
% 0.13/0.36  The command was "./sos".  The process ID is 19151.
% 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=3.
% 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  
% 0.13/0.36  ------------> process sos:
% 0.13/0.36    Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] {-} A=A.
% 0.13/0.36  
% 0.13/0.36  ======= end of input processing =======
% 0.13/0.38  
% 0.13/0.38  Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.38  
% 0.13/0.38  Stopped by limit on number of solutions
% 0.13/0.38  
% 0.13/0.38  
% 0.13/0.38  -------------- Softie stats --------------
% 0.13/0.38  
% 0.13/0.38  UPDATE_STOP: 300
% 0.13/0.38  SFINDER_TIME_LIMIT: 2
% 0.13/0.38  SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.38  number of clauses in intial UL: 9
% 0.13/0.38  number of clauses initially in problem: 13
% 0.13/0.38  percentage of clauses intially in UL: 69
% 0.13/0.38  percentage of distinct symbols occuring in initial UL: 90
% 0.13/0.38  percent of all initial clauses that are short: 100
% 0.13/0.38  absolute distinct symbol count: 10
% 0.13/0.38     distinct predicate count: 4
% 0.13/0.38     distinct function count: 2
% 0.13/0.38     distinct constant count: 4
% 0.13/0.38  
% 0.13/0.38  ---------- no more Softie stats ----------
% 0.13/0.38  
% 0.13/0.38  
% 0.13/0.38  
% 0.13/0.38  =========== start of search ===========
% 0.19/0.47  
% 0.19/0.47  -------- PROOF -------- 
% 0.19/0.47  % SZS status Theorem
% 0.19/0.47  % SZS output start Refutation
% 0.19/0.47  
% 0.19/0.47  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.47  
% 0.19/0.47  Stopped by limit on number of solutions
% 0.19/0.47  
% 0.19/0.47  ----> UNIT CONFLICT at   0.09 sec ----> 233 [binary,231.1,7.1] {+} $F.
% 0.19/0.47  
% 0.19/0.47  Length of proof is 2.  Level of proof is 2.
% 0.19/0.47  
% 0.19/0.47  ---------------- PROOF ----------------
% 0.19/0.47  % SZS status Theorem
% 0.19/0.47  % SZS output start Refutation
% 0.19/0.47  
% 0.19/0.47  2 [] {+} A!=singleton(B)| -in(C,A)|C=B.
% 0.19/0.47  7 [] {+} $c4!=$c3.
% 0.19/0.47  8 [] {+} -disjoint(singleton($c4),singleton($c3)).
% 0.19/0.47  11 [] {-} in(A,B)|disjoint(singleton(A),B).
% 0.19/0.47  13 [] {+} A=A.
% 0.19/0.47  43 [hyper,13,2,11] {-} A=B|disjoint(singleton(A),singleton(B)).
% 0.19/0.47  231 [hyper,43,8] {-} $c4=$c3.
% 0.19/0.47  233 [binary,231.1,7.1] {+} $F.
% 0.19/0.47  
% 0.19/0.47  % SZS output end Refutation
% 0.19/0.47  ------------ end of proof -------------
% 0.19/0.47  
% 0.19/0.47  
% 0.19/0.47  Search stopped by max_proofs option.
% 0.19/0.47  
% 0.19/0.47  
% 0.19/0.47  Search stopped by max_proofs option.
% 0.19/0.47  
% 0.19/0.47  ============ end of search ============
% 0.19/0.47  
% 0.19/0.47  ----------- soft-scott stats ----------
% 0.19/0.47  
% 0.19/0.47  true clauses given           2      (13.3%)
% 0.19/0.47  false clauses given         13
% 0.19/0.47  
% 0.19/0.47        FALSE     TRUE
% 0.19/0.47     8  1         0
% 0.19/0.47     9  0         1
% 0.19/0.47    11  2         1
% 0.19/0.47    12  12        0
% 0.19/0.47    13  1         2
% 0.19/0.47    14  1         1
% 0.19/0.47    15  2         0
% 0.19/0.47    16  4         6
% 0.19/0.47    17  4         4
% 0.19/0.47    18  5         5
% 0.19/0.47    20  6         4
% 0.19/0.47    21  4         0
% 0.19/0.47    25  1         0
% 0.19/0.47    28  4         2
% 0.19/0.47    29  2         6
% 0.19/0.47    30  2         1
% 0.19/0.47    31  5         9
% 0.19/0.47    32  0         2
% 0.19/0.47    34  3         5
% 0.19/0.47    35  9         5
% 0.19/0.47    36  14        3
% 0.19/0.47    37  2         1
% 0.19/0.47    38  1         1
% 0.19/0.47    39  2         7
% 0.19/0.47    41  0         3
% 0.19/0.47    42  3         1
% 0.19/0.47    44  15        1
% 0.19/0.47    48  6         8
% 0.19/0.47    51  0         3
% 0.19/0.47    57  0         2
% 0.19/0.47    59  2         2
% 0.19/0.47    60  1         2
% 0.19/0.47  tot:  114       88      (43.6% true)
% 0.19/0.47  
% 0.19/0.47  
% 0.19/0.47  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.47  
% 0.19/0.47  That finishes the proof of the theorem.
% 0.19/0.47  
% 0.19/0.47  Process 19151 finished Mon Jul 11 09:10:27 2022
%------------------------------------------------------------------------------