TSTP Solution File: ROB010-1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : ROB010-1 : TPTP v8.1.0. Released v1.0.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 20:56:06 EDT 2022

% Result   : Unsatisfiable 0.13s 0.40s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : ROB010-1 : TPTP v8.1.0. Released v1.0.0.
% 0.13/0.13  % Command  : sos-script %s
% 0.13/0.35  % Computer : n017.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % 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 : Thu Jun  9 14:39:49 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.37  ----- Otter 3.2, August 2001 -----
% 0.13/0.37  The process was started by sandbox on n017.cluster.edu,
% 0.13/0.37  Thu Jun  9 14:39:49 2022
% 0.13/0.37  The command was "./sos".  The process ID is 19959.
% 0.13/0.37  
% 0.13/0.37  set(prolog_style_variables).
% 0.13/0.37  set(auto).
% 0.13/0.37     dependent: set(auto1).
% 0.13/0.37     dependent: set(process_input).
% 0.13/0.37     dependent: clear(print_kept).
% 0.13/0.37     dependent: clear(print_new_demod).
% 0.13/0.37     dependent: clear(print_back_demod).
% 0.13/0.37     dependent: clear(print_back_sub).
% 0.13/0.37     dependent: set(control_memory).
% 0.13/0.37     dependent: assign(max_mem, 12000).
% 0.13/0.37     dependent: assign(pick_given_ratio, 4).
% 0.13/0.37     dependent: assign(stats_level, 1).
% 0.13/0.37     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37     dependent: assign(sos_limit, 5000).
% 0.13/0.37     dependent: assign(max_weight, 60).
% 0.13/0.37  clear(print_given).
% 0.13/0.37  
% 0.13/0.37  list(usable).
% 0.13/0.37  
% 0.13/0.37  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.13/0.37  
% 0.13/0.37  All clauses are units, and equality is present; the
% 0.13/0.37  strategy will be Knuth-Bendix with positive clauses in sos.
% 0.13/0.37  
% 0.13/0.37     dependent: set(knuth_bendix).
% 0.13/0.37     dependent: set(para_from).
% 0.13/0.37     dependent: set(para_into).
% 0.13/0.37     dependent: clear(para_from_right).
% 0.13/0.37     dependent: clear(para_into_right).
% 0.13/0.37     dependent: set(para_from_vars).
% 0.13/0.37     dependent: set(eq_units_both_ways).
% 0.13/0.37     dependent: set(dynamic_demod_all).
% 0.13/0.37     dependent: set(dynamic_demod).
% 0.13/0.37     dependent: set(order_eq).
% 0.13/0.37     dependent: set(back_demod).
% 0.13/0.37     dependent: set(lrpo).
% 0.13/0.37  
% 0.13/0.37  ------------> process usable:
% 0.13/0.37  
% 0.13/0.37  ------------> process sos:
% 0.13/0.37    Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] {-} add(A,B)=add(B,A).
% 0.13/0.37    Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] {-} A=A.
% 0.13/0.37  
% 0.13/0.37  ======= end of input processing =======
% 0.13/0.40  
% 0.13/0.40  Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.40  
% 0.13/0.40  Stopped by limit on number of solutions
% 0.13/0.40  
% 0.13/0.40  
% 0.13/0.40  -------------- Softie stats --------------
% 0.13/0.40  
% 0.13/0.40  UPDATE_STOP: 300
% 0.13/0.40  SFINDER_TIME_LIMIT: 2
% 0.13/0.40  SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.40  number of clauses in intial UL: 1
% 0.13/0.40  number of clauses initially in problem: 9
% 0.13/0.40  percentage of clauses intially in UL: 11
% 0.13/0.40  percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.40  percent of all initial clauses that are short: 100
% 0.13/0.40  absolute distinct symbol count: 6
% 0.13/0.40     distinct predicate count: 1
% 0.13/0.40     distinct function count: 2
% 0.13/0.40     distinct constant count: 3
% 0.13/0.40  
% 0.13/0.40  ---------- no more Softie stats ----------
% 0.13/0.40  
% 0.13/0.40  
% 0.13/0.40  
% 0.13/0.40  Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.40  
% 0.13/0.40  Stopped by limit on number of solutions
% 0.13/0.40  
% 0.13/0.40  =========== start of search ===========
% 0.13/0.40  
% 0.13/0.40  -------- PROOF -------- 
% 0.13/0.40  % SZS status Unsatisfiable
% 0.13/0.40  % SZS output start Refutation
% 0.13/0.40  
% 0.13/0.40  ----> UNIT CONFLICT at   0.01 sec ----> 43 [binary,41.1,10.1] {-} $F.
% 0.13/0.40  
% 0.13/0.40  Length of proof is 3.  Level of proof is 2.
% 0.13/0.40  
% 0.13/0.40  ---------------- PROOF ----------------
% 0.13/0.40  % SZS status Unsatisfiable
% 0.13/0.40  % SZS output start Refutation
% 0.13/0.40  
% 0.13/0.40  1 [] {+} negate(add(c,negate(add(b,a))))!=a.
% 0.13/0.40  2 [] {+} add(A,B)=add(B,A).
% 0.13/0.40  5 [] {-} negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 0.13/0.40  7 [] {-} negate(add(a,negate(b)))=c.
% 0.13/0.40  10 [para_from,2.1.1,1.1.1.1] {+} negate(add(negate(add(b,a)),c))!=a.
% 0.13/0.40  35 [para_into,5.1.1.1.2,7.1.1] {-} negate(add(negate(add(a,b)),c))=a.
% 0.13/0.40  41 [para_into,35.1.1.1.1.1,2.1.1] {-} negate(add(negate(add(b,a)),c))=a.
% 0.13/0.40  43 [binary,41.1,10.1] {-} $F.
% 0.13/0.40  
% 0.13/0.40  % SZS output end Refutation
% 0.13/0.40  ------------ end of proof -------------
% 0.13/0.40  
% 0.13/0.40  
% 0.13/0.40  Search stopped by max_proofs option.
% 0.13/0.40  
% 0.13/0.41  
% 0.13/0.41  Search stopped by max_proofs option.
% 0.13/0.41  
% 0.13/0.41  ============ end of search ============
% 0.13/0.41  
% 0.13/0.41  ----------- soft-scott stats ----------
% 0.13/0.41  
% 0.13/0.41  true clauses given           1      (14.3%)
% 0.13/0.41  false clauses given          6
% 0.13/0.41  
% 0.13/0.41        FALSE     TRUE
% 0.13/0.41     9  0         2
% 0.13/0.41    11  4         0
% 0.13/0.41    12  1         0
% 0.13/0.41    13  3         0
% 0.13/0.41    15  2         0
% 0.13/0.41    18  0         1
% 0.13/0.41    19  1         0
% 0.13/0.41    20  1         0
% 0.13/0.41    21  1         0
% 0.13/0.41  tot:  13        3      (18.8% true)
% 0.13/0.41  
% 0.13/0.41  
% 0.13/0.41  Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.41  
% 0.13/0.41  That finishes the proof of the theorem.
% 0.13/0.41  
% 0.13/0.41  Process 19959 finished Thu Jun  9 14:39:49 2022
%------------------------------------------------------------------------------