↑ Up

SOS---2.0.THM-Ref.s

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

% Computer : n003.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:30 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SET875+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n003.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 : Mon Jul 11 00:39:44 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  ----- Otter 3.2, August 2001 -----
% 0.12/0.35  The process was started by sandbox2 on n003.cluster.edu,
% 0.12/0.35  Mon Jul 11 00:39:44 2022
% 0.12/0.35  The command was "./sos".  The process ID is 19800.
% 0.12/0.35  
% 0.12/0.35  set(prolog_style_variables).
% 0.12/0.35  set(auto).
% 0.12/0.35     dependent: set(auto1).
% 0.12/0.35     dependent: set(process_input).
% 0.12/0.35     dependent: clear(print_kept).
% 0.12/0.35     dependent: clear(print_new_demod).
% 0.12/0.35     dependent: clear(print_back_demod).
% 0.12/0.35     dependent: clear(print_back_sub).
% 0.12/0.35     dependent: set(control_memory).
% 0.12/0.35     dependent: assign(max_mem, 12000).
% 0.12/0.35     dependent: assign(pick_given_ratio, 4).
% 0.12/0.35     dependent: assign(stats_level, 1).
% 0.12/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35     dependent: assign(sos_limit, 5000).
% 0.12/0.35     dependent: assign(max_weight, 60).
% 0.12/0.35  clear(print_given).
% 0.12/0.35  
% 0.12/0.35  formula_list(usable).
% 0.12/0.35  
% 0.12/0.35  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.12/0.35  
% 0.12/0.35  This ia a non-Horn set with equality.  The strategy will be
% 0.12/0.35  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35  unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35  clauses in usable.
% 0.12/0.35  
% 0.12/0.35     dependent: set(knuth_bendix).
% 0.12/0.35     dependent: set(para_from).
% 0.12/0.35     dependent: set(para_into).
% 0.12/0.35     dependent: clear(para_from_right).
% 0.12/0.35     dependent: clear(para_into_right).
% 0.12/0.35     dependent: set(para_from_vars).
% 0.12/0.35     dependent: set(eq_units_both_ways).
% 0.12/0.35     dependent: set(dynamic_demod_all).
% 0.12/0.35     dependent: set(dynamic_demod).
% 0.12/0.35     dependent: set(order_eq).
% 0.12/0.35     dependent: set(back_demod).
% 0.12/0.35     dependent: set(lrpo).
% 0.12/0.35     dependent: set(hyper_res).
% 0.12/0.35     dependent: set(unit_deletion).
% 0.12/0.35     dependent: set(factor).
% 0.12/0.35  
% 0.12/0.35  ------------> process usable:
% 0.12/0.35  
% 0.12/0.35  ------------> process sos:
% 0.12/0.35    Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] {-} A=A.
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.12/0.37  
% 0.12/0.37  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37  
% 0.12/0.37  Stopped by limit on number of solutions
% 0.12/0.37  
% 0.12/0.37  
% 0.12/0.37  -------------- Softie stats --------------
% 0.12/0.37  
% 0.12/0.37  UPDATE_STOP: 300
% 0.12/0.37  SFINDER_TIME_LIMIT: 2
% 0.12/0.37  SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.37  number of clauses in intial UL: 8
% 0.12/0.37  number of clauses initially in problem: 14
% 0.12/0.37  percentage of clauses intially in UL: 57
% 0.12/0.37  percentage of distinct symbols occuring in initial UL: 70
% 0.12/0.37  percent of all initial clauses that are short: 100
% 0.12/0.37  absolute distinct symbol count: 10
% 0.12/0.37     distinct predicate count: 4
% 0.12/0.37     distinct function count: 2
% 0.12/0.37     distinct constant count: 4
% 0.12/0.37  
% 0.12/0.37  ---------- no more Softie stats ----------
% 0.12/0.37  
% 0.12/0.37  
% 0.12/0.37  
% 0.12/0.37  =========== start of search ===========
% 0.19/0.42  
% 0.19/0.42  -------- PROOF -------- 
% 0.19/0.42  % SZS status Theorem
% 0.19/0.42  % SZS output start Refutation
% 0.19/0.42  
% 0.19/0.42  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.42  
% 0.19/0.42  Stopped by limit on number of solutions
% 0.19/0.42  
% 0.19/0.42  Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.42  
% 0.19/0.42  Stopped by limit on number of solutions
% 0.19/0.42  
% 0.19/0.42  -----> EMPTY CLAUSE at   0.04 sec ----> 141 [hyper,45,5,15] {-} $F.
% 0.19/0.42  
% 0.19/0.42  Length of proof is 2.  Level of proof is 1.
% 0.19/0.42  
% 0.19/0.42  ---------------- PROOF ----------------
% 0.19/0.42  % SZS status Theorem
% 0.19/0.42  % SZS output start Refutation
% 0.19/0.42  
% 0.19/0.42  3 [] {+} A!=singleton(B)|in(C,A)|C!=B.
% 0.19/0.42  5 [] {+} -disjoint(singleton(A),B)| -in(A,B).
% 0.19/0.42  11 [] {-} disjoint(singleton($c4),singleton($c3)).
% 0.19/0.42  13,12 [] {+} $c4=$c3.
% 0.19/0.42  14 [] {+} A=A.
% 0.19/0.42  15 [back_demod,11,demod,13] {-} disjoint(singleton($c3),singleton($c3)).
% 0.19/0.42  45 [hyper,14,3,14] {+} in(A,singleton(A)).
% 0.19/0.42  141 [hyper,45,5,15] {-} $F.
% 0.19/0.42  
% 0.19/0.42  % SZS output end Refutation
% 0.19/0.42  ------------ end of proof -------------
% 0.19/0.42  
% 0.19/0.42  
% 0.19/0.42  Search stopped by max_proofs option.
% 0.19/0.42  
% 0.19/0.42  
% 0.19/0.42  Search stopped by max_proofs option.
% 0.19/0.42  
% 0.19/0.42  ============ end of search ============
% 0.19/0.42  
% 0.19/0.42  ----------- soft-scott stats ----------
% 0.19/0.42  
% 0.19/0.42  true clauses given           2      (22.2%)
% 0.19/0.42  false clauses given          7
% 0.19/0.42  
% 0.19/0.42        FALSE     TRUE
% 0.19/0.42     9  0         1
% 0.19/0.42    10  0         1
% 0.19/0.42    11  1         0
% 0.19/0.42    12  3         0
% 0.19/0.42    13  1         2
% 0.19/0.42    14  1         1
% 0.19/0.42    15  1         3
% 0.19/0.42    16  3         2
% 0.19/0.42    17  1         1
% 0.19/0.42    18  2         2
% 0.19/0.42    19  7         0
% 0.19/0.42    20  1         0
% 0.19/0.42    21  2         0
% 0.19/0.42    23  4         4
% 0.19/0.42    25  4         4
% 0.19/0.42    26  0         3
% 0.19/0.42    28  3         0
% 0.19/0.42    29  6         4
% 0.19/0.42    30  1         0
% 0.19/0.42    31  2         1
% 0.19/0.42    32  0         1
% 0.19/0.42    34  2         0
% 0.19/0.42    35  2         1
% 0.19/0.42    36  8         0
% 0.19/0.42    37  1         1
% 0.19/0.42    38  4         0
% 0.19/0.42    42  5         1
% 0.19/0.42    44  8         0
% 0.19/0.42    46  0         1
% 0.19/0.42    48  6         1
% 0.19/0.42    51  3         0
% 0.19/0.42    57  1         1
% 0.19/0.42    59  1         0
% 0.19/0.42    60  1         0
% 0.19/0.42  tot:  85        36      (29.8% true)
% 0.19/0.42  
% 0.19/0.42  
% 0.19/0.42  Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.42  
% 0.19/0.42  That finishes the proof of the theorem.
% 0.19/0.42  
% 0.19/0.42  Process 19800 finished Mon Jul 11 00:39:44 2022
%------------------------------------------------------------------------------