TSTP Solution File: MSC012+1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : MSC012+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n010.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 : Sun Jul 17 22:59:16 EDT 2022

% Result   : Theorem 0.18s 0.44s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : MSC012+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n010.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 : Fri Jul  1 16:36:33 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  ----- Otter 3.2, August 2001 -----
% 0.13/0.35  The process was started by sandbox on n010.cluster.edu,
% 0.13/0.35  Fri Jul  1 16:36:33 2022
% 0.13/0.35  The command was "./sos".  The process ID is 22842.
% 0.13/0.35  
% 0.13/0.35  set(prolog_style_variables).
% 0.13/0.35  set(auto).
% 0.13/0.35     dependent: set(auto1).
% 0.13/0.35     dependent: set(process_input).
% 0.13/0.35     dependent: clear(print_kept).
% 0.13/0.35     dependent: clear(print_new_demod).
% 0.13/0.35     dependent: clear(print_back_demod).
% 0.13/0.35     dependent: clear(print_back_sub).
% 0.13/0.35     dependent: set(control_memory).
% 0.13/0.35     dependent: assign(max_mem, 12000).
% 0.13/0.35     dependent: assign(pick_given_ratio, 4).
% 0.13/0.35     dependent: assign(stats_level, 1).
% 0.13/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35     dependent: assign(sos_limit, 5000).
% 0.13/0.35     dependent: assign(max_weight, 60).
% 0.13/0.35  clear(print_given).
% 0.13/0.35  
% 0.13/0.35  formula_list(usable).
% 0.13/0.35  
% 0.13/0.35  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 0.13/0.35  
% 0.13/0.35  This is a non-Horn set without equality.  The strategy
% 0.13/0.35  will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.35  factoring, with satellites in sos and nuclei in usable.
% 0.13/0.35  
% 0.13/0.35     dependent: set(hyper_res).
% 0.13/0.35     dependent: set(factor).
% 0.13/0.35     dependent: set(unit_deletion).
% 0.13/0.35  
% 0.13/0.35  ------------> process usable:
% 0.13/0.35  
% 0.13/0.35  ------------> process sos:
% 0.13/0.35  
% 0.13/0.35  ======= end of input processing =======
% 0.13/0.39  
% 0.13/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39  
% 0.13/0.39  Stopped by limit on number of solutions
% 0.13/0.39  
% 0.13/0.39  
% 0.13/0.39  -------------- Softie stats --------------
% 0.13/0.39  
% 0.13/0.39  UPDATE_STOP: 300
% 0.13/0.39  SFINDER_TIME_LIMIT: 2
% 0.13/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.39  number of clauses in intial UL: 4
% 0.13/0.39  number of clauses initially in problem: 7
% 0.13/0.39  percentage of clauses intially in UL: 57
% 0.13/0.39  percentage of distinct symbols occuring in initial UL: 60
% 0.13/0.39  percent of all initial clauses that are short: 100
% 0.13/0.39  absolute distinct symbol count: 5
% 0.13/0.39     distinct predicate count: 2
% 0.13/0.39     distinct function count: 2
% 0.13/0.39     distinct constant count: 1
% 0.13/0.39  
% 0.13/0.39  ---------- no more Softie stats ----------
% 0.13/0.39  
% 0.13/0.39  
% 0.13/0.39  
% 0.13/0.39  =========== start of search ===========
% 0.18/0.44  
% 0.18/0.44  -------- PROOF -------- 
% 0.18/0.44  % SZS status Theorem
% 0.18/0.44  % SZS output start Refutation
% 0.18/0.44  
% 0.18/0.44  Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.44  
% 0.18/0.44  Stopped by limit on number of solutions
% 0.18/0.44  
% 0.18/0.44  Model 3 (0.00 seconds, 0 Inserts)
% 0.18/0.44  
% 0.18/0.44  Stopped by limit on number of solutions
% 0.18/0.44  
% 0.18/0.44  Model 4 [ 1 1 409 ] (0.00 seconds, 1597 Inserts)
% 0.18/0.44  
% 0.18/0.44  Model 5 [ 1 0 77 ] (0.00 seconds, 182 Inserts)
% 0.18/0.44  
% 0.18/0.44  Model 6 [ 6 1 51 ] (0.00 seconds, 81 Inserts)
% 0.18/0.44  
% 0.18/0.44  ----> UNIT CONFLICT at   0.04 sec ----> 159 [binary,158.1,3.1] {-} $F.
% 0.18/0.44  
% 0.18/0.44  Length of proof is 8.  Level of proof is 7.
% 0.18/0.44  
% 0.18/0.44  ---------------- PROOF ----------------
% 0.18/0.44  % SZS status Theorem
% 0.18/0.44  % SZS output start Refutation
% 0.18/0.44  
% 0.18/0.44  1 [] {+} -p(A)| -less(A,B)| -p(B)|goal.
% 0.18/0.44  2 [] {+} -less(A,B)| -less(B,C)|less(A,C).
% 0.18/0.44  3 [] {+} -goal.
% 0.18/0.44  5 [] {+} p(A)|less(A,$f1(A)).
% 0.18/0.44  6 [] {+} p(A)|p($f1(A)).
% 0.18/0.44  7 [] {+} less(A,$f2(A)).
% 0.18/0.44  9 [hyper,7,1,5,5,unit_del,3] {-} less(A,$f1(A))|less($f2(A),$f1($f2(A))).
% 0.18/0.44  33 [hyper,9,2,7] {-} less(A,$f1(A))|less(A,$f1($f2(A))).
% 0.18/0.44  66 [hyper,33,1,5,6,unit_del,3,factor_simp] {+} less(A,$f1(A))|p($f2(A)).
% 0.18/0.44  72 [hyper,66,1,5,7,unit_del,3,factor_simp] {+} less(A,$f1(A)).
% 0.18/0.44  73 [hyper,72,2,72] {+} less(A,$f1($f1(A))).
% 0.18/0.44  78 [hyper,72,1,6,6,unit_del,3] {-} p(A)|p($f1($f1($f1(A)))).
% 0.18/0.44  157 [hyper,73,1,6,78,unit_del,3,factor_simp] {+} p(A).
% 0.18/0.44  158 [hyper,157,1,157,73] {-} goal.
% 0.18/0.44  159 [binary,158.1,3.1] {-} $F.
% 0.18/0.44  
% 0.18/0.44  % SZS output end Refutation
% 0.18/0.44  ------------ end of proof -------------
% 0.18/0.44  
% 0.18/0.44  
% 0.18/0.44  Search stopped by max_proofs option.
% 0.18/0.44  
% 0.18/0.44  
% 0.18/0.44  Search stopped by max_proofs option.
% 0.18/0.44  
% 0.18/0.44  ============ end of search ============
% 0.18/0.44  
% 0.18/0.44  ----------- soft-scott stats ----------
% 0.18/0.44  
% 0.18/0.44  true clauses given           3      (21.4%)
% 0.18/0.44  false clauses given         11
% 0.18/0.44  
% 0.18/0.44        FALSE     TRUE
% 0.18/0.44     5  2         0
% 0.18/0.44     6  6         0
% 0.18/0.44     7  4         0
% 0.18/0.44  tot:  12        0      (0.0% true)
% 0.18/0.44  
% 0.18/0.44  
% 0.18/0.44  Model 6 [ 6 1 51 ] (0.00 seconds, 81 Inserts)
% 0.18/0.44  
% 0.18/0.44  That finishes the proof of the theorem.
% 0.18/0.44  
% 0.18/0.44  Process 22842 finished Fri Jul  1 16:36:33 2022
%------------------------------------------------------------------------------