↑ Up

SOS---2.0.THM-Ref.s

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

% Computer : n011.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 : Mon Jul 18 14:19:40 EDT 2022

% Result   : Theorem 2.66s 2.87s
% Output   : Refutation 2.66s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM576+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n011.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 : Thu Jul  7 20:13:39 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.37  ----- Otter 3.2, August 2001 -----
% 0.19/0.37  The process was started by sandbox on n011.cluster.edu,
% 0.19/0.37  Thu Jul  7 20:13:39 2022
% 0.19/0.37  The command was "./sos".  The process ID is 30530.
% 0.19/0.37  
% 0.19/0.37  set(prolog_style_variables).
% 0.19/0.37  set(auto).
% 0.19/0.37     dependent: set(auto1).
% 0.19/0.37     dependent: set(process_input).
% 0.19/0.37     dependent: clear(print_kept).
% 0.19/0.37     dependent: clear(print_new_demod).
% 0.19/0.37     dependent: clear(print_back_demod).
% 0.19/0.37     dependent: clear(print_back_sub).
% 0.19/0.37     dependent: set(control_memory).
% 0.19/0.37     dependent: assign(max_mem, 12000).
% 0.19/0.37     dependent: assign(pick_given_ratio, 4).
% 0.19/0.37     dependent: assign(stats_level, 1).
% 0.19/0.37     dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.37     dependent: assign(sos_limit, 5000).
% 0.19/0.37     dependent: assign(max_weight, 60).
% 0.19/0.37  clear(print_given).
% 0.19/0.37  
% 0.19/0.37  formula_list(usable).
% 0.19/0.37  
% 0.19/0.37  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 0.19/0.37  
% 0.19/0.37  This ia a non-Horn set with equality.  The strategy will be
% 0.19/0.37  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.37  unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.37  clauses in usable.
% 0.19/0.37  
% 0.19/0.37     dependent: set(knuth_bendix).
% 0.19/0.37     dependent: set(para_from).
% 0.19/0.37     dependent: set(para_into).
% 0.19/0.37     dependent: clear(para_from_right).
% 0.19/0.37     dependent: clear(para_into_right).
% 0.19/0.37     dependent: set(para_from_vars).
% 0.19/0.37     dependent: set(eq_units_both_ways).
% 0.19/0.37     dependent: set(dynamic_demod_all).
% 0.19/0.37     dependent: set(dynamic_demod).
% 0.19/0.37     dependent: set(order_eq).
% 0.19/0.37     dependent: set(back_demod).
% 0.19/0.37     dependent: set(lrpo).
% 0.19/0.37     dependent: set(hyper_res).
% 0.19/0.37     dependent: set(unit_deletion).
% 0.19/0.37     dependent: set(factor).
% 0.19/0.37  
% 0.19/0.37  ------------> process usable:
% 0.19/0.37    Following clause subsumed by 139 during input processing: 0 [] {-} xK!=sz00.
% 0.19/0.37  157 back subsumes 156.
% 0.19/0.37  
% 0.19/0.37  ------------> process sos:
% 0.19/0.37    Following clause subsumed by 209 during input processing: 0 [copy,209,flip.1] {-} A=A.
% 0.19/0.37  209 back subsumes 167.
% 0.19/0.37  209 back subsumes 162.
% 0.19/0.37  209 back subsumes 161.
% 0.19/0.37  209 back subsumes 159.
% 0.19/0.37  209 back subsumes 155.
% 0.19/0.37  209 back subsumes 149.
% 0.19/0.37  
% 0.19/0.37  ======= end of input processing =======
% 0.59/0.83  
% 0.59/0.83  Stopped by limit on insertions
% 0.59/0.83  
% 0.59/0.83  
% 0.59/0.83  Failed to model usable list: disabling FINDER
% 0.59/0.83  
% 0.59/0.83  
% 0.59/0.83  
% 0.59/0.83  -------------- Softie stats --------------
% 0.59/0.83  
% 0.59/0.83  UPDATE_STOP: 300
% 0.59/0.83  SFINDER_TIME_LIMIT: 2
% 0.59/0.83  SHORT_CLAUSE_CUTOFF: 4
% 0.59/0.83  number of clauses in intial UL: 172
% 0.59/0.83  number of clauses initially in problem: 198
% 0.59/0.83  percentage of clauses intially in UL: 86
% 0.59/0.83  percentage of distinct symbols occuring in initial UL: 94
% 0.59/0.83  percent of all initial clauses that are short: 100
% 0.59/0.83  absolute distinct symbol count: 56
% 0.59/0.83     distinct predicate count: 10
% 0.59/0.83     distinct function count: 35
% 0.59/0.83     distinct constant count: 11
% 0.59/0.83  
% 0.59/0.83  ---------- no more Softie stats ----------
% 0.59/0.83  
% 0.59/0.83  
% 0.59/0.83  
% 0.59/0.83  =========== start of search ===========
% 2.35/2.53  
% 2.35/2.53  
% 2.35/2.53  Changing weight limit from 60 to 31.
% 2.35/2.53  
% 2.35/2.53  Resetting weight limit to 31 after 45 givens.
% 2.35/2.53  
% 2.57/2.78  
% 2.57/2.78  
% 2.57/2.78  Changing weight limit from 31 to 29.
% 2.57/2.78  
% 2.57/2.78  Resetting weight limit to 29 after 50 givens.
% 2.57/2.78  
% 2.66/2.87  
% 2.66/2.87  -------- PROOF -------- 
% 2.66/2.87  % SZS status Theorem
% 2.66/2.87  % SZS output start Refutation
% 2.66/2.87  
% 2.66/2.87  ----> UNIT CONFLICT at   2.48 sec ----> 7121 [binary,7119.1,146.1] {-} $F.
% 2.66/2.87  
% 2.66/2.87  Length of proof is 4.  Level of proof is 2.
% 2.66/2.87  
% 2.66/2.87  ---------------- PROOF ----------------
% 2.66/2.87  % SZS status Theorem
% 2.66/2.87  % SZS output start Refutation
% 2.66/2.87  
% 2.66/2.87  53 [] {+} -aElementOf0(A,szNzAzT0)| -aElementOf0(B,szNzAzT0)| -sdtlseqdt0(A,B)| -sdtlseqdt0(B,A)|A=B.
% 2.66/2.87  55 [] {+} -aElementOf0(A,szNzAzT0)| -aElementOf0(B,szNzAzT0)|sdtlseqdt0(A,B)|sdtlseqdt0(szszuzczcdt0(B),A).
% 2.66/2.87  145 [] {-} xi!=xj.
% 2.66/2.87  146 [copy,145,flip.1] {+} xj!=xi.
% 2.66/2.87  147 [] {+} -sdtlseqdt0(szszuzczcdt0(xj),xi).
% 2.66/2.87  148 [] {+} -sdtlseqdt0(szszuzczcdt0(xi),xj).
% 2.66/2.87  207 [] {-} aElementOf0(xi,szNzAzT0).
% 2.66/2.87  208 [] {-} aElementOf0(xj,szNzAzT0).
% 2.66/2.87  2733 [hyper,208,55,207,unit_del,147] {-} sdtlseqdt0(xi,xj).
% 2.66/2.87  2737 [hyper,208,55,207,unit_del,148] {-} sdtlseqdt0(xj,xi).
% 2.66/2.87  7119 [hyper,2737,53,207,208,2733,flip.1] {-} xj=xi.
% 2.66/2.87  7121 [binary,7119.1,146.1] {-} $F.
% 2.66/2.87  
% 2.66/2.87  % SZS output end Refutation
% 2.66/2.87  ------------ end of proof -------------
% 2.66/2.87  
% 2.66/2.87  
% 2.66/2.87  Search stopped by max_proofs option.
% 2.66/2.87  
% 2.66/2.87  
% 2.66/2.87  Search stopped by max_proofs option.
% 2.66/2.87  
% 2.66/2.87  ============ end of search ============
% 2.66/2.87  
% 2.66/2.87  That finishes the proof of the theorem.
% 2.66/2.87  
% 2.66/2.87  Process 30530 finished Thu Jul  7 20:13:41 2022
%------------------------------------------------------------------------------