↑ Up

SOS---2.0.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : MGT002+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n021.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:25:45 EDT 2022

% Result   : Theorem 0.45s 0.65s
% Output   : Refutation 0.45s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : MGT002+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n021.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 : Thu Jun  9 08:24:38 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 sandbox2 on n021.cluster.edu,
% 0.13/0.36  Thu Jun  9 08:24:38 2022
% 0.13/0.36  The command was "./sos".  The process ID is 25407.
% 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  formula_list(usable).
% 0.13/0.36  
% 0.13/0.36  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=10.
% 0.13/0.36  
% 0.13/0.36  This is a Horn set without equality.  The strategy will
% 0.13/0.36  be hyperresolution, with satellites in sos and nuclei
% 0.13/0.36  in usable.
% 0.13/0.36  
% 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  
% 0.13/0.36  ======= end of input processing =======
% 0.20/0.41  
% 0.20/0.41  Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.41  
% 0.20/0.41  Stopped by limit on number of solutions
% 0.20/0.41  
% 0.20/0.41  
% 0.20/0.41  -------------- Softie stats --------------
% 0.20/0.41  
% 0.20/0.41  UPDATE_STOP: 300
% 0.20/0.41  SFINDER_TIME_LIMIT: 2
% 0.20/0.41  SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.41  number of clauses in intial UL: 7
% 0.20/0.41  number of clauses initially in problem: 13
% 0.20/0.41  percentage of clauses intially in UL: 53
% 0.20/0.41  percentage of distinct symbols occuring in initial UL: 72
% 0.20/0.41  percent of all initial clauses that are short: 100
% 0.20/0.41  absolute distinct symbol count: 11
% 0.20/0.41     distinct predicate count: 5
% 0.20/0.41     distinct function count: 1
% 0.20/0.41     distinct constant count: 5
% 0.20/0.41  
% 0.20/0.41  ---------- no more Softie stats ----------
% 0.20/0.41  
% 0.20/0.41  
% 0.20/0.41  
% 0.20/0.41  Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.41  
% 0.20/0.41  Stopped by limit on number of solutions
% 0.20/0.41  
% 0.20/0.41  =========== start of search ===========
% 0.45/0.65  
% 0.45/0.65  -------- PROOF -------- 
% 0.45/0.65  % SZS status Theorem
% 0.45/0.65  % SZS output start Refutation
% 0.45/0.65  
% 0.45/0.65  Stopped by limit on insertions
% 0.45/0.65  
% 0.45/0.65  Model 3 (0.00 seconds, 0 Inserts)
% 0.45/0.65  
% 0.45/0.65  Stopped by limit on number of solutions
% 0.45/0.65  
% 0.45/0.65  Stopped by limit on insertions
% 0.45/0.65  
% 0.45/0.65  Model 4 [ 1 1 176 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.65  
% 0.45/0.65  ----> UNIT CONFLICT at   0.27 sec ----> 20 [binary,19.1,7.1] {-} $F.
% 0.45/0.65  
% 0.45/0.65  Length of proof is 6.  Level of proof is 3.
% 0.45/0.65  
% 0.45/0.65  ---------------- PROOF ----------------
% 0.45/0.65  % SZS status Theorem
% 0.45/0.65  % SZS output start Refutation
% 0.45/0.65  
% 0.45/0.65  1 [] {+} -organization(A,B)|reproducibility(A,$f1(A,B),B).
% 0.45/0.65  2 [] {+} -reorganization_free(A,B,C)|reorganization_free(A,B,B).
% 0.45/0.65  3 [] {+} -reorganization_free(A,B,C)|reorganization_free(A,C,C).
% 0.45/0.65  4 [] {+} -organization(A,B)| -organization(C,D)| -reorganization_free(A,B,B)| -reorganization_free(C,D,D)| -reproducibility(A,E,B)| -reproducibility(C,F,D)| -inertia(A,G,B)| -inertia(C,H,D)| -greater(F,E)|greater(H,G).
% 0.45/0.65  6 [] {+} -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -reproducibility(A,D,B)| -reproducibility(A,E,C)| -greater(C,B)|greater(E,D).
% 0.45/0.65  7 [] {+} -greater($c3,$c4).
% 0.45/0.65  8 [] {+} organization($c5,$c2).
% 0.45/0.65  9 [] {+} organization($c5,$c1).
% 0.45/0.65  10 [] {+} reorganization_free($c5,$c2,$c1).
% 0.45/0.65  11 [] {+} inertia($c5,$c4,$c2).
% 0.45/0.65  12 [] {+} inertia($c5,$c3,$c1).
% 0.45/0.65  13 [] {-} greater($c1,$c2).
% 0.45/0.65  14 [hyper,8,1] {+} reproducibility($c5,$f1($c5,$c2),$c2).
% 0.45/0.65  15 [hyper,10,3] {+} reorganization_free($c5,$c1,$c1).
% 0.45/0.65  16 [hyper,10,2] {+} reorganization_free($c5,$c2,$c2).
% 0.45/0.65  17 [hyper,9,1] {+} reproducibility($c5,$f1($c5,$c1),$c1).
% 0.45/0.65  18 [hyper,17,6,8,9,10,14,13] {-} greater($f1($c5,$c1),$f1($c5,$c2)).
% 0.45/0.65  19 [hyper,18,4,8,9,16,15,14,17,11,12] {-} greater($c3,$c4).
% 0.45/0.65  20 [binary,19.1,7.1] {-} $F.
% 0.45/0.65  
% 0.45/0.65  % SZS output end Refutation
% 0.45/0.65  ------------ end of proof -------------
% 0.45/0.65  
% 0.45/0.65  
% 0.45/0.65  Search stopped by max_proofs option.
% 0.45/0.65  
% 0.45/0.65  
% 0.45/0.65  Search stopped by max_proofs option.
% 0.45/0.65  
% 0.45/0.65  ============ end of search ============
% 0.45/0.65  
% 0.45/0.65  ----------- soft-scott stats ----------
% 0.45/0.65  
% 0.45/0.65  true clauses given           6      (54.5%)
% 0.45/0.65  false clauses given          5
% 0.45/0.65  
% 0.45/0.65        FALSE     TRUE
% 0.45/0.65  tot:  0         0      (-nan% true)
% 0.45/0.65  
% 0.45/0.65  
% 0.45/0.65  Model 4 [ 1 1 176 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.65  
% 0.45/0.65  That finishes the proof of the theorem.
% 0.45/0.65  
% 0.45/0.65  Process 25407 finished Thu Jun  9 08:24:38 2022
%------------------------------------------------------------------------------