↑ Up

SOS---2.0.THM-Ref.s

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

% Computer : n009.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:20:42 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET794+4 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n009.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 10:48:37 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.37  ----- Otter 3.2, August 2001 -----
% 0.20/0.37  The process was started by sandbox2 on n009.cluster.edu,
% 0.20/0.37  Mon Jul 11 10:48:37 2022
% 0.20/0.37  The command was "./sos".  The process ID is 32509.
% 0.20/0.37  
% 0.20/0.37  set(prolog_style_variables).
% 0.20/0.37  set(auto).
% 0.20/0.37     dependent: set(auto1).
% 0.20/0.37     dependent: set(process_input).
% 0.20/0.37     dependent: clear(print_kept).
% 0.20/0.37     dependent: clear(print_new_demod).
% 0.20/0.37     dependent: clear(print_back_demod).
% 0.20/0.37     dependent: clear(print_back_sub).
% 0.20/0.37     dependent: set(control_memory).
% 0.20/0.37     dependent: assign(max_mem, 12000).
% 0.20/0.37     dependent: assign(pick_given_ratio, 4).
% 0.20/0.37     dependent: assign(stats_level, 1).
% 0.20/0.37     dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.37     dependent: assign(sos_limit, 5000).
% 0.20/0.37     dependent: assign(max_weight, 60).
% 0.20/0.37  clear(print_given).
% 0.20/0.37  
% 0.20/0.37  formula_list(usable).
% 0.20/0.37  
% 0.20/0.37  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.20/0.37  
% 0.20/0.37  This ia a non-Horn set with equality.  The strategy will be
% 0.20/0.37  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.37  unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.37  clauses in usable.
% 0.20/0.37  
% 0.20/0.37     dependent: set(knuth_bendix).
% 0.20/0.37     dependent: set(para_from).
% 0.20/0.37     dependent: set(para_into).
% 0.20/0.37     dependent: clear(para_from_right).
% 0.20/0.37     dependent: clear(para_into_right).
% 0.20/0.37     dependent: set(para_from_vars).
% 0.20/0.37     dependent: set(eq_units_both_ways).
% 0.20/0.37     dependent: set(dynamic_demod_all).
% 0.20/0.37     dependent: set(dynamic_demod).
% 0.20/0.37     dependent: set(order_eq).
% 0.20/0.37     dependent: set(back_demod).
% 0.20/0.37     dependent: set(lrpo).
% 0.20/0.37     dependent: set(hyper_res).
% 0.20/0.37     dependent: set(unit_deletion).
% 0.20/0.37     dependent: set(factor).
% 0.20/0.37  
% 0.20/0.37  ------------> process usable:
% 0.20/0.37  
% 0.20/0.37  ------------> process sos:
% 0.20/0.37    Following clause subsumed by 113 during input processing: 0 [copy,113,flip.1] {-} A=A.
% 0.20/0.37  113 back subsumes 87.
% 0.20/0.37  
% 0.20/0.37  ======= end of input processing =======
% 0.59/0.77  
% 0.59/0.77  Stopped by limit on insertions
% 0.59/0.77  
% 0.59/0.77  
% 0.59/0.77  Failed to model usable list: disabling FINDER
% 0.59/0.77  
% 0.59/0.77  
% 0.59/0.77  
% 0.59/0.77  -------------- Softie stats --------------
% 0.59/0.77  
% 0.59/0.77  UPDATE_STOP: 300
% 0.59/0.77  SFINDER_TIME_LIMIT: 2
% 0.59/0.77  SHORT_CLAUSE_CUTOFF: 4
% 0.59/0.77  number of clauses in intial UL: 85
% 0.59/0.77  number of clauses initially in problem: 110
% 0.59/0.77  percentage of clauses intially in UL: 77
% 0.59/0.77  percentage of distinct symbols occuring in initial UL: 100
% 0.59/0.77  percent of all initial clauses that are short: 100
% 0.59/0.77  absolute distinct symbol count: 32
% 0.59/0.77     distinct predicate count: 13
% 0.59/0.77     distinct function count: 16
% 0.59/0.77     distinct constant count: 3
% 0.59/0.77  
% 0.59/0.77  ---------- no more Softie stats ----------
% 0.59/0.77  
% 0.59/0.77  
% 0.59/0.77  
% 0.59/0.77  =========== start of search ===========
% 2.53/2.73  
% 2.53/2.73  -------- PROOF -------- 
% 2.53/2.73  % SZS status Theorem
% 2.53/2.73  % SZS output start Refutation
% 2.53/2.73  
% 2.53/2.73  -----> EMPTY CLAUSE at   2.35 sec ----> 2118 [para_from,2078.1.1,61.3.3,unit_del,86,156,195] {-} $F.
% 2.53/2.73  
% 2.53/2.73  Length of proof is 8.  Level of proof is 6.
% 2.53/2.73  
% 2.53/2.73  ---------------- PROOF ----------------
% 2.53/2.73  % SZS status Theorem
% 2.53/2.73  % SZS output start Refutation
% 2.53/2.73  
% 2.53/2.73  45 [] {+} -total_order(A,B)| -member(C,B)| -member(D,B)|apply(A,C,D)|apply(A,D,C).
% 2.53/2.73  60 [] {+} least(A,B,C)| -member(A,C)|member($f12(B,C,A),C).
% 2.53/2.73  61 [] {+} least(A,B,C)| -member(A,C)| -apply(B,A,$f12(B,C,A)).
% 2.53/2.73  68 [] {+} -min(A,B,C)|member(A,C).
% 2.53/2.73  69 [] {+} -min(A,B,C)| -member(D,C)| -apply(B,D,A)|A=D.
% 2.53/2.73  86 [] {+} -least($c1,$c3,$c2).
% 2.53/2.73  88 [factor,45.2.3,factor_simp] {+} -total_order(A,B)| -member(C,B)|apply(A,C,C).
% 2.53/2.73  111 [] {-} total_order($c3,$c2).
% 2.53/2.73  112 [] {-} min($c1,$c3,$c2).
% 2.53/2.73  156 [hyper,112,68] {-} member($c1,$c2).
% 2.53/2.73  195 [hyper,156,88,111] {-} apply($c3,$c1,$c1).
% 2.53/2.73  200 [hyper,156,60] {-} least($c1,A,$c2)|member($f12(A,$c2,$c1),$c2).
% 2.53/2.73  355 [hyper,200,45,111,156] {-} least($c1,A,$c2)|apply($c3,$c1,$f12(A,$c2,$c1))|apply($c3,$f12(A,$c2,$c1),$c1).
% 2.53/2.73  1991 [hyper,355,86] {-} apply($c3,$c1,$f12($c3,$c2,$c1))|apply($c3,$f12($c3,$c2,$c1),$c1).
% 2.53/2.73  2062 [hyper,1991,61,156,unit_del,86] {-} apply($c3,$f12($c3,$c2,$c1),$c1).
% 2.53/2.73  2078 [hyper,2062,69,112,200,unit_del,86,flip.1] {-} $f12($c3,$c2,$c1)=$c1.
% 2.53/2.73  2118 [para_from,2078.1.1,61.3.3,unit_del,86,156,195] {-} $F.
% 2.53/2.73  
% 2.53/2.73  % SZS output end Refutation
% 2.53/2.73  ------------ end of proof -------------
% 2.53/2.73  
% 2.53/2.73  
% 2.53/2.73  Search stopped by max_proofs option.
% 2.53/2.73  
% 2.53/2.73  
% 2.53/2.73  Search stopped by max_proofs option.
% 2.53/2.73  
% 2.53/2.73  ============ end of search ============
% 2.53/2.73  
% 2.53/2.73  That finishes the proof of the theorem.
% 2.53/2.73  
% 2.53/2.73  Process 32509 finished Mon Jul 11 10:48:39 2022
%------------------------------------------------------------------------------