TSTP Solution File: NUM844+2 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : NUM844+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n029.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:22:35 EDT 2022

% Result   : Theorem 0.50s 0.69s
% Output   : Refutation 0.50s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : NUM844+2 : TPTP v8.1.0. Released v4.1.0.
% 0.06/0.13  % Command  : sos-script %s
% 0.12/0.33  % Computer : n029.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 : Tue Jul  5 04:59:42 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 n029.cluster.edu,
% 0.12/0.35  Tue Jul  5 04:59:42 2022
% 0.12/0.35  The command was "./sos".  The process ID is 2188.
% 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=2.
% 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 30 during input processing: 0 [demod,36] {-} vplus(A,v1)=vplus(v1,A).
% 0.12/0.35    Following clause subsumed by 30 during input processing: 0 [copy,30,flip.1] {-} vplus(A,B)=vplus(B,A).
% 0.12/0.35    Following clause subsumed by 43 during input processing: 0 [copy,43,flip.1] {-} A=A.
% 0.12/0.35    Following clause subsumed by 40 during input processing: 0 [copy,55,flip.1] {-} vplus(A,vplus(v1,B))=vplus(v1,vplus(A,B)).
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.19/0.39  
% 0.19/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39  
% 0.19/0.39  Stopped by limit on number of solutions
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  -------------- Softie stats --------------
% 0.19/0.39  
% 0.19/0.39  UPDATE_STOP: 300
% 0.19/0.39  SFINDER_TIME_LIMIT: 2
% 0.19/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39  number of clauses in intial UL: 2
% 0.19/0.39  number of clauses initially in problem: 24
% 0.19/0.39  percentage of clauses intially in UL: 8
% 0.19/0.39  percentage of distinct symbols occuring in initial UL: 50
% 0.19/0.39  percent of all initial clauses that are short: 100
% 0.19/0.39  absolute distinct symbol count: 12
% 0.19/0.39     distinct predicate count: 5
% 0.19/0.39     distinct function count: 4
% 0.19/0.39     distinct constant count: 3
% 0.19/0.39  
% 0.19/0.39  ---------- no more Softie stats ----------
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39  
% 0.19/0.39  Stopped by limit on number of solutions
% 0.19/0.39  
% 0.19/0.39  =========== start of search ===========
% 0.50/0.69  
% 0.50/0.69  -------- PROOF -------- 
% 0.50/0.69  % SZS status Theorem
% 0.50/0.69  % SZS output start Refutation
% 0.50/0.69  
% 0.50/0.69  Model 3 (0.00 seconds, 0 Inserts)
% 0.50/0.69  
% 0.50/0.69  Stopped by limit on number of solutions
% 0.50/0.69  
% 0.50/0.69  Model 4 (0.00 seconds, 0 Inserts)
% 0.50/0.69  
% 0.50/0.69  Stopped by limit on number of solutions
% 0.50/0.69  
% 0.50/0.69  Model 5 (0.00 seconds, 0 Inserts)
% 0.50/0.69  
% 0.50/0.69  Stopped by limit on number of solutions
% 0.50/0.69  
% 0.50/0.69  Stopped by limit on insertions
% 0.50/0.69  
% 0.50/0.69  Model 6 [ 1 1 542 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.69  
% 0.50/0.69  Model 7 (0.00 seconds, 250000 Inserts)
% 0.50/0.69  
% 0.50/0.69  Stopped by limit on number of solutions
% 0.50/0.69  
% 0.50/0.69  ----> UNIT CONFLICT at   0.30 sec ----> 371 [binary,369.1,50.1] {-} $F.
% 0.50/0.69  
% 0.50/0.69  Length of proof is 7.  Level of proof is 4.
% 0.50/0.69  
% 0.50/0.69  ---------------- PROOF ----------------
% 0.50/0.69  % SZS status Theorem
% 0.50/0.69  % SZS output start Refutation
% 0.50/0.69  
% 0.50/0.69  1 [] {-} vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411)))!=vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413)).
% 0.50/0.69  2 [copy,1,flip.1] {-} vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413))!=vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411))).
% 0.50/0.69  8,7 [] {-} vplus(vplus(vmul(vd411,vd413),vd413),vsucc(vd411))=vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411))).
% 0.50/0.69  9 [] {-} vplus(vmul(vsucc(vd411),vd413),vsucc(vd411))=vplus(vplus(vmul(vd411,vd413),vd413),vsucc(vd411)).
% 0.50/0.69  11,10 [copy,9,demod,8] {-} vplus(vmul(vsucc(vd411),vd413),vsucc(vd411))=vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411))).
% 0.50/0.69  12 [] {-} vmul(vsucc(vd411),vsucc(vd413))=vplus(vmul(vsucc(vd411),vd413),vsucc(vd411)).
% 0.50/0.69  13 [copy,12,demod,11] {-} vmul(vsucc(vd411),vsucc(vd413))=vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411))).
% 0.50/0.69  30 [] {+} vplus(A,B)=vplus(B,A).
% 0.50/0.69  34 [] {-} vplus(v1,A)=vsucc(A).
% 0.50/0.69  36,35 [copy,34,flip.1] {+} vsucc(A)=vplus(v1,A).
% 0.50/0.69  38,37 [] {+} vplus(vplus(A,B),C)=vplus(A,vplus(B,C)).
% 0.50/0.69  49,48 [back_demod,13,demod,36,36,36,flip.1] {+} vplus(vmul(vd411,vd413),vplus(vd413,vplus(v1,vd411)))=vmul(vplus(v1,vd411),vplus(v1,vd413)).
% 0.50/0.69  50 [back_demod,2,demod,36,38,36,49] {-} vplus(vmul(vd411,vd413),vplus(v1,vplus(vd411,vd413)))!=vmul(vplus(v1,vd411),vplus(v1,vd413)).
% 0.50/0.69  369 [para_into,48.1.1.2,30.1.1,demod,38] {-} vplus(vmul(vd411,vd413),vplus(v1,vplus(vd411,vd413)))=vmul(vplus(v1,vd411),vplus(v1,vd413)).
% 0.50/0.69  371 [binary,369.1,50.1] {-} $F.
% 0.50/0.69  
% 0.50/0.69  % SZS output end Refutation
% 0.50/0.69  ------------ end of proof -------------
% 0.50/0.69  
% 0.50/0.69  
% 0.50/0.69  Search stopped by max_proofs option.
% 0.50/0.69  
% 0.50/0.69  
% 0.50/0.69  Search stopped by max_proofs option.
% 0.50/0.69  
% 0.50/0.69  ============ end of search ============
% 0.50/0.69  
% 0.50/0.69  ----------- soft-scott stats ----------
% 0.50/0.69  
% 0.50/0.69  true clauses given           6      (28.6%)
% 0.50/0.69  false clauses given         15
% 0.50/0.69  
% 0.50/0.69        FALSE     TRUE
% 0.50/0.69     8  0         1
% 0.50/0.69     9  0         5
% 0.50/0.69    10  3         2
% 0.50/0.69    11  9         8
% 0.50/0.69    12  4         14
% 0.50/0.69    13  6         19
% 0.50/0.69    14  5         19
% 0.50/0.69    15  16        22
% 0.50/0.69    16  28        23
% 0.50/0.69    17  10        19
% 0.50/0.69    18  7         12
% 0.50/0.69    19  2         6
% 0.50/0.69    20  2         2
% 0.50/0.69  tot:  92        152      (62.3% true)
% 0.50/0.69  
% 0.50/0.69  
% 0.50/0.69  Model 7 (0.00 seconds, 250000 Inserts)
% 0.50/0.69  
% 0.50/0.69  That finishes the proof of the theorem.
% 0.50/0.69  
% 0.50/0.69  Process 2188 finished Tue Jul  5 04:59:42 2022
%------------------------------------------------------------------------------