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

View Problem - Process Solution

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

% Computer : n017.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 16:38:30 EDT 2022

% Result   : Theorem 0.21s 0.43s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : NUN067+2 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.14  % Command  : sos-script %s
% 0.15/0.35  % Computer : n017.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 600
% 0.15/0.35  % DateTime : Thu Jun  2 03:59:12 EDT 2022
% 0.15/0.35  % CPUTime  : 
% 0.15/0.37  ----- Otter 3.2, August 2001 -----
% 0.15/0.37  The process was started by sandbox2 on n017.cluster.edu,
% 0.15/0.37  Thu Jun  2 03:59:12 2022
% 0.15/0.37  The command was "./sos".  The process ID is 20727.
% 0.15/0.37  
% 0.15/0.37  set(prolog_style_variables).
% 0.15/0.37  set(auto).
% 0.15/0.37     dependent: set(auto1).
% 0.15/0.37     dependent: set(process_input).
% 0.15/0.37     dependent: clear(print_kept).
% 0.15/0.37     dependent: clear(print_new_demod).
% 0.15/0.37     dependent: clear(print_back_demod).
% 0.15/0.37     dependent: clear(print_back_sub).
% 0.15/0.37     dependent: set(control_memory).
% 0.15/0.37     dependent: assign(max_mem, 12000).
% 0.15/0.37     dependent: assign(pick_given_ratio, 4).
% 0.15/0.37     dependent: assign(stats_level, 1).
% 0.15/0.37     dependent: assign(pick_semantic_ratio, 3).
% 0.15/0.37     dependent: assign(sos_limit, 5000).
% 0.15/0.37     dependent: assign(max_weight, 60).
% 0.15/0.37  clear(print_given).
% 0.15/0.37  
% 0.15/0.37  formula_list(usable).
% 0.15/0.37  
% 0.15/0.37  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.15/0.37  
% 0.15/0.37  This ia a non-Horn set with equality.  The strategy will be
% 0.15/0.37  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.15/0.37  unit deletion, with positive clauses in sos and nonpositive
% 0.15/0.37  clauses in usable.
% 0.15/0.37  
% 0.15/0.37     dependent: set(knuth_bendix).
% 0.15/0.37     dependent: set(para_from).
% 0.15/0.37     dependent: set(para_into).
% 0.15/0.37     dependent: clear(para_from_right).
% 0.15/0.37     dependent: clear(para_into_right).
% 0.15/0.37     dependent: set(para_from_vars).
% 0.15/0.37     dependent: set(eq_units_both_ways).
% 0.15/0.37     dependent: set(dynamic_demod_all).
% 0.15/0.37     dependent: set(dynamic_demod).
% 0.15/0.37     dependent: set(order_eq).
% 0.15/0.37     dependent: set(back_demod).
% 0.15/0.37     dependent: set(lrpo).
% 0.15/0.37     dependent: set(hyper_res).
% 0.15/0.37     dependent: set(unit_deletion).
% 0.15/0.37     dependent: set(factor).
% 0.15/0.37  
% 0.15/0.37  ------------> process usable:
% 0.15/0.37  
% 0.15/0.37  ------------> process sos:
% 0.15/0.37    Following clause subsumed by 46 during input processing: 0 [copy,46,flip.1] {-} A=A.
% 0.15/0.37  46 back subsumes 11.
% 0.15/0.37  50 back subsumes 37.
% 0.15/0.37  50 back subsumes 35.
% 0.15/0.37  50 back subsumes 32.
% 0.15/0.37  50 back subsumes 30.
% 0.15/0.37  50 back subsumes 26.
% 0.15/0.37  50 back subsumes 2.
% 0.15/0.37  
% 0.15/0.37  ======= end of input processing =======
% 0.15/0.41  
% 0.15/0.41  Model 1 (0.00 seconds, 0 Inserts)
% 0.15/0.41  
% 0.15/0.41  Stopped by limit on number of solutions
% 0.15/0.41  
% 0.15/0.41  
% 0.15/0.41  -------------- Softie stats --------------
% 0.15/0.41  
% 0.15/0.41  UPDATE_STOP: 300
% 0.15/0.41  SFINDER_TIME_LIMIT: 2
% 0.15/0.41  SHORT_CLAUSE_CUTOFF: 4
% 0.15/0.41  number of clauses in intial UL: 9
% 0.15/0.41  number of clauses initially in problem: 33
% 0.15/0.41  percentage of clauses intially in UL: 27
% 0.15/0.41  percentage of distinct symbols occuring in initial UL: 34
% 0.15/0.41  percent of all initial clauses that are short: 100
% 0.15/0.41  absolute distinct symbol count: 26
% 0.15/0.41     distinct predicate count: 5
% 0.15/0.41     distinct function count: 20
% 0.15/0.41     distinct constant count: 1
% 0.15/0.41  
% 0.15/0.41  ---------- no more Softie stats ----------
% 0.15/0.41  
% 0.15/0.41  
% 0.15/0.41  
% 0.15/0.41  Model 2 (0.00 seconds, 0 Inserts)
% 0.15/0.41  
% 0.15/0.41  Stopped by limit on number of solutions
% 0.15/0.41  
% 0.15/0.41  =========== start of search ===========
% 0.21/0.43  
% 0.21/0.43  -------- PROOF -------- 
% 0.21/0.43  % SZS status Theorem
% 0.21/0.43  % SZS output start Refutation
% 0.21/0.43  
% 0.21/0.43  -----> EMPTY CLAUSE at   0.03 sec ----> 64 [hyper,58,10,50,57] {-} $F.
% 0.21/0.43  
% 0.21/0.43  Length of proof is 4.  Level of proof is 3.
% 0.21/0.43  
% 0.21/0.43  ---------------- PROOF ----------------
% 0.21/0.43  % SZS status Theorem
% 0.21/0.43  % SZS output start Refutation
% 0.21/0.43  
% 0.21/0.43  1 [] {+} -r1(A)|A=$c1.
% 0.21/0.43  10 [] {+} -r1(A)|A!=B| -r2(C,B).
% 0.21/0.43  12 [] {+} r2(A,$f4(B,A)).
% 0.21/0.43  42 [] {-} r1($f20(A)).
% 0.21/0.43  43 [] {-} A=$f20(A).
% 0.21/0.43  45,44 [copy,43,flip.1] {-} $f20(A)=A.
% 0.21/0.43  50 [back_demod,42,demod,45] {-} r1(A).
% 0.21/0.43  57 [para_into,12.1.2,1.2.1,unit_del,50] {-} r2(A,$c1).
% 0.21/0.43  58 [hyper,50,1] {-} A=$c1.
% 0.21/0.43  64 [hyper,58,10,50,57] {-} $F.
% 0.21/0.43  
% 0.21/0.43  % SZS output end Refutation
% 0.21/0.43  ------------ end of proof -------------
% 0.21/0.43  
% 0.21/0.43  
% 0.21/0.43  Search stopped by max_proofs option.
% 0.21/0.43  
% 0.21/0.43  
% 0.21/0.43  Search stopped by max_proofs option.
% 0.21/0.43  
% 0.21/0.43  ============ end of search ============
% 0.21/0.43  
% 0.21/0.43  ----------- soft-scott stats ----------
% 0.21/0.43  
% 0.21/0.43  true clauses given           0      (0.0%)
% 0.21/0.43  false clauses given          4
% 0.21/0.43  
% 0.21/0.43        FALSE     TRUE
% 0.21/0.43     3  1         1
% 0.21/0.43     4  3         0
% 0.21/0.43     5  3         0
% 0.21/0.43     6  3         2
% 0.21/0.43     7  3         0
% 0.21/0.43     8  4         0
% 0.21/0.43     9  3         0
% 0.21/0.43    11  0         2
% 0.21/0.43    12  1         0
% 0.21/0.43    14  0         1
% 0.21/0.43  tot:  21        6      (22.2% true)
% 0.21/0.43  
% 0.21/0.43  
% 0.21/0.43  Model 2 (0.00 seconds, 0 Inserts)
% 0.21/0.43  
% 0.21/0.43  That finishes the proof of the theorem.
% 0.21/0.43  
% 0.21/0.43  Process 20727 finished Thu Jun  2 03:59:12 2022
%------------------------------------------------------------------------------