↑ Up

SOS---2.0.UNS-Ref.s

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

% Computer : n004.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 14 19:27:57 EDT 2022

% Result   : Unsatisfiable 0.74s 0.91s
% Output   : Refutation 0.74s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : ANA035-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n004.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.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Fri Jul  8 05:29:07 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.36  ----- Otter 3.2, August 2001 -----
% 0.13/0.36  The process was started by sandbox on n004.cluster.edu,
% 0.13/0.36  Fri Jul  8 05:29:07 2022
% 0.13/0.36  The command was "./sos".  The process ID is 2919.
% 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  list(usable).
% 0.13/0.36  
% 0.13/0.36  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 0.13/0.36  
% 0.13/0.36  This is a Horn set with equality.  The strategy will be
% 0.13/0.36  Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.36  sos and nonpositive 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: clear(order_hyper).
% 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 7 during input processing: 0 [copy,7,flip.1] {-} A=A.
% 0.13/0.36  
% 0.13/0.36  ======= end of input processing =======
% 0.41/0.60  
% 0.41/0.60  Model 1 (0.00 seconds, 0 Inserts)
% 0.41/0.60  
% 0.41/0.60  Stopped by limit on number of solutions
% 0.41/0.60  
% 0.41/0.60  
% 0.41/0.60  -------------- Softie stats --------------
% 0.41/0.60  
% 0.41/0.60  UPDATE_STOP: 300
% 0.41/0.60  SFINDER_TIME_LIMIT: 2
% 0.41/0.60  SHORT_CLAUSE_CUTOFF: 4
% 0.41/0.60  number of clauses in intial UL: 5
% 0.41/0.60  number of clauses initially in problem: 7
% 0.41/0.60  percentage of clauses intially in UL: 71
% 0.41/0.60  percentage of distinct symbols occuring in initial UL: 100
% 0.41/0.60  percent of all initial clauses that are short: 85
% 0.41/0.60  absolute distinct symbol count: 11
% 0.41/0.60     distinct predicate count: 3
% 0.41/0.60     distinct function count: 4
% 0.41/0.60     distinct constant count: 4
% 0.41/0.60  
% 0.41/0.60  ---------- no more Softie stats ----------
% 0.41/0.60  
% 0.41/0.60  
% 0.41/0.60  
% 0.41/0.60  Stopped by limit on insertions
% 0.41/0.60  
% 0.41/0.60  =========== start of search ===========
% 0.74/0.91  
% 0.74/0.91  -------- PROOF -------- 
% 0.74/0.91  % SZS status Unsatisfiable
% 0.74/0.91  % SZS output start Refutation
% 0.74/0.91  
% 0.74/0.91  Stopped by limit on insertions
% 0.74/0.91  
% 0.74/0.91  Model 2 [ 1 1 2155 ] (0.00 seconds, 250000 Inserts)
% 0.74/0.91  
% 0.74/0.91  ----> UNIT CONFLICT at   0.52 sec ----> 72 [binary,71.1,64.1] {+} $F.
% 0.74/0.91  
% 0.74/0.91  Length of proof is 13.  Level of proof is 6.
% 0.74/0.91  
% 0.74/0.91  ---------------- PROOF ----------------
% 0.74/0.91  % SZS status Unsatisfiable
% 0.74/0.91  % SZS output start Refutation
% 0.74/0.91  
% 0.74/0.91  1 [] {+} c_times(c_times(v_c,v_ca,t_b),c_HOL_Oabs(c_times(v_f(v_x),v_g(v_x),t_b),t_b),t_b)!=c_times(c_times(v_c,c_HOL_Oabs(v_f(v_x),t_b),t_b),c_times(v_ca,c_HOL_Oabs(v_g(v_x),t_b),t_b),t_b).
% 0.74/0.91  2 [] {+} -class_OrderedGroup_Oab__semigroup__mult(A)|c_times(B,C,A)=c_times(C,B,A).
% 0.74/0.91  3 [] {+} -class_OrderedGroup_Oab__semigroup__mult(A)|c_times(B,c_times(C,D,A),A)=c_times(C,c_times(B,D,A),A).
% 0.74/0.91  4 [] {+} -class_Ring__and__Field_Oordered__idom(A)|c_HOL_Oabs(c_times(B,C,A),A)=c_times(c_HOL_Oabs(B,A),c_HOL_Oabs(C,A),A).
% 0.74/0.91  5 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_OrderedGroup_Oab__semigroup__mult(A).
% 0.74/0.91  6 [] {-} class_Ring__and__Field_Oordered__idom(t_b).
% 0.74/0.91  8 [hyper,6,5] {+} class_OrderedGroup_Oab__semigroup__mult(t_b).
% 0.74/0.91  10,9 [hyper,6,4] {-} c_HOL_Oabs(c_times(A,B,t_b),t_b)=c_times(c_HOL_Oabs(A,t_b),c_HOL_Oabs(B,t_b),t_b).
% 0.74/0.91  11 [back_demod,1,demod,10,flip.1] {-} c_times(c_times(v_c,c_HOL_Oabs(v_f(v_x),t_b),t_b),c_times(v_ca,c_HOL_Oabs(v_g(v_x),t_b),t_b),t_b)!=c_times(c_times(v_c,v_ca,t_b),c_times(c_HOL_Oabs(v_f(v_x),t_b),c_HOL_Oabs(v_g(v_x),t_b),t_b),t_b).
% 0.74/0.91  12 [hyper,8,3] {+} c_times(A,c_times(B,C,t_b),t_b)=c_times(B,c_times(A,C,t_b),t_b).
% 0.74/0.91  13 [hyper,8,2] {+} c_times(A,B,t_b)=c_times(B,A,t_b).
% 0.74/0.91  18 [para_into,12.1.1.2,12.1.1] {+} c_times(A,c_times(B,c_times(C,D,t_b),t_b),t_b)=c_times(C,c_times(A,c_times(B,D,t_b),t_b),t_b).
% 0.74/0.91  23 [para_from,12.1.1,11.1.1] {-} c_times(v_ca,c_times(c_times(v_c,c_HOL_Oabs(v_f(v_x),t_b),t_b),c_HOL_Oabs(v_g(v_x),t_b),t_b),t_b)!=c_times(c_times(v_c,v_ca,t_b),c_times(c_HOL_Oabs(v_f(v_x),t_b),c_HOL_Oabs(v_g(v_x),t_b),t_b),t_b).
% 0.74/0.91  29 [para_into,13.1.1,12.1.1] {+} c_times(A,c_times(B,C,t_b),t_b)=c_times(c_times(A,C,t_b),B,t_b).
% 0.74/0.91  32 [para_from,13.1.1,23.1.1.2] {-} c_times(v_ca,c_times(c_HOL_Oabs(v_g(v_x),t_b),c_times(v_c,c_HOL_Oabs(v_f(v_x),t_b),t_b),t_b),t_b)!=c_times(c_times(v_c,v_ca,t_b),c_times(c_HOL_Oabs(v_f(v_x),t_b),c_HOL_Oabs(v_g(v_x),t_b),t_b),t_b).
% 0.74/0.91  58 [para_into,32.1.1,18.1.1] {-} c_times(v_c,c_times(v_ca,c_times(c_HOL_Oabs(v_g(v_x),t_b),c_HOL_Oabs(v_f(v_x),t_b),t_b),t_b),t_b)!=c_times(c_times(v_c,v_ca,t_b),c_times(c_HOL_Oabs(v_f(v_x),t_b),c_HOL_Oabs(v_g(v_x),t_b),t_b),t_b).
% 0.74/0.91  63,62 [para_into,29.1.1.2,13.1.1,flip.1] {-} c_times(c_times(A,B,t_b),C,t_b)=c_times(A,c_times(B,C,t_b),t_b).
% 0.74/0.91  64 [para_into,29.1.1.2,12.1.1,demod,63,63] {-} c_times(A,c_times(B,c_times(C,D,t_b),t_b),t_b)=c_times(A,c_times(B,c_times(D,C,t_b),t_b),t_b).
% 0.74/0.91  71 [back_demod,58,demod,63] {-} c_times(v_c,c_times(v_ca,c_times(c_HOL_Oabs(v_g(v_x),t_b),c_HOL_Oabs(v_f(v_x),t_b),t_b),t_b),t_b)!=c_times(v_c,c_times(v_ca,c_times(c_HOL_Oabs(v_f(v_x),t_b),c_HOL_Oabs(v_g(v_x),t_b),t_b),t_b),t_b).
% 0.74/0.91  72 [binary,71.1,64.1] {+} $F.
% 0.74/0.91  
% 0.74/0.91  % SZS output end Refutation
% 0.74/0.91  ------------ end of proof -------------
% 0.74/0.91  
% 0.74/0.91  
% 0.74/0.91  Search stopped by max_proofs option.
% 0.74/0.91  
% 0.74/0.91  
% 0.74/0.91  Search stopped by max_proofs option.
% 0.74/0.91  
% 0.74/0.91  ============ end of search ============
% 0.74/0.91  
% 0.74/0.91  ----------- soft-scott stats ----------
% 0.74/0.91  
% 0.74/0.91  true clauses given           5      (38.5%)
% 0.74/0.91  false clauses given          8
% 0.74/0.91  
% 0.74/0.91        FALSE     TRUE
% 0.74/0.91    15  0         3
% 0.74/0.91    21  0         8
% 0.74/0.91    27  0         6
% 0.74/0.91    33  10        2
% 0.74/0.91    35  2         0
% 0.74/0.91  tot:  12        19      (61.3% true)
% 0.74/0.91  
% 0.74/0.91  
% 0.74/0.91  Model 2 [ 1 1 2155 ] (0.00 seconds, 250000 Inserts)
% 0.74/0.91  
% 0.74/0.91  That finishes the proof of the theorem.
% 0.74/0.91  
% 0.74/0.91  Process 2919 finished Fri Jul  8 05:29:08 2022
%------------------------------------------------------------------------------