↑ Up

SOS---2.0.UNS-Ref.s

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

% Computer : n028.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:26:03 EDT 2022

% Result   : Unsatisfiable 53.81s 54.05s
% Output   : Refutation 53.81s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : MGT054-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n028.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 12:51:02 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.36  ----- Otter 3.2, August 2001 -----
% 0.13/0.36  The process was started by sandbox on n028.cluster.edu,
% 0.13/0.36  Thu Jun  9 12:51:02 2022
% 0.13/0.36  The command was "./sos".  The process ID is 28055.
% 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  list(usable).
% 0.13/0.36  
% 0.13/0.36  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.13/0.36  
% 0.13/0.36  This ia a non-Horn set with equality.  The strategy will be
% 0.13/0.36  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36  unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36  clauses in usable.
% 0.13/0.36  
% 0.13/0.36     dependent: set(knuth_bendix).
% 0.13/0.36     dependent: set(para_from).
% 0.13/0.36     dependent: set(para_into).
% 0.13/0.36     dependent: clear(para_from_right).
% 0.13/0.36     dependent: clear(para_into_right).
% 0.13/0.36     dependent: set(para_from_vars).
% 0.13/0.36     dependent: set(eq_units_both_ways).
% 0.13/0.36     dependent: set(dynamic_demod_all).
% 0.13/0.36     dependent: set(dynamic_demod).
% 0.13/0.36     dependent: set(order_eq).
% 0.13/0.36     dependent: set(back_demod).
% 0.13/0.36     dependent: set(lrpo).
% 0.13/0.36     dependent: set(hyper_res).
% 0.13/0.36     dependent: set(unit_deletion).
% 0.13/0.36     dependent: set(factor).
% 0.13/0.36  
% 0.13/0.36  ------------> process usable:
% 0.13/0.36  
% 0.13/0.36  ------------> process sos:
% 0.13/0.36    Following clause subsumed by 35 during input processing: 0 [copy,35,flip.1] {-} A=A.
% 0.13/0.36  
% 0.13/0.36  ======= end of input processing =======
% 0.13/0.38  
% 0.13/0.38  Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.38  
% 0.13/0.38  Stopped by limit on number of solutions
% 0.13/0.38  
% 0.13/0.38  
% 0.13/0.38  -------------- Softie stats --------------
% 0.13/0.38  
% 0.13/0.38  UPDATE_STOP: 300
% 0.13/0.38  SFINDER_TIME_LIMIT: 2
% 0.13/0.38  SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.38  number of clauses in intial UL: 27
% 0.13/0.38  number of clauses initially in problem: 35
% 0.13/0.38  percentage of clauses intially in UL: 77
% 0.13/0.38  percentage of distinct symbols occuring in initial UL: 94
% 0.13/0.38  percent of all initial clauses that are short: 100
% 0.13/0.38  absolute distinct symbol count: 19
% 0.13/0.38     distinct predicate count: 10
% 0.13/0.38     distinct function count: 3
% 0.13/0.38     distinct constant count: 6
% 0.13/0.38  
% 0.13/0.38  ---------- no more Softie stats ----------
% 0.13/0.38  
% 0.13/0.38  
% 0.13/0.38  
% 0.13/0.38  =========== start of search ===========
% 2.23/2.40  
% 2.23/2.40  
% 2.23/2.40  Changing weight limit from 60 to 41.
% 2.23/2.40  
% 2.23/2.40  Model 2 (0.00 seconds, 0 Inserts)
% 2.23/2.40  
% 2.23/2.40  Stopped by limit on number of solutions
% 2.23/2.40  
% 2.23/2.40  Model 3 (0.00 seconds, 0 Inserts)
% 2.23/2.40  
% 2.23/2.40  Stopped by limit on number of solutions
% 2.23/2.40  
% 2.23/2.40  Model 4 (0.00 seconds, 0 Inserts)
% 2.23/2.40  
% 2.23/2.40  Stopped by limit on number of solutions
% 2.23/2.40  
% 2.23/2.40  Model 5 (0.00 seconds, 0 Inserts)
% 2.23/2.40  
% 2.23/2.40  Stopped by limit on number of solutions
% 2.23/2.40  
% 2.23/2.40  Resetting weight limit to 41 after 170 givens.
% 2.23/2.40  
% 5.32/5.50  
% 5.32/5.50  
% 5.32/5.50  Changing weight limit from 41 to 23.
% 5.32/5.50  
% 5.32/5.50  Resetting weight limit to 23 after 245 givens.
% 5.32/5.50  
% 5.45/5.68  
% 5.45/5.68  
% 5.45/5.68  Changing weight limit from 23 to 19.
% 5.45/5.68  
% 5.45/5.68  Resetting weight limit to 19 after 250 givens.
% 5.45/5.68  
% 7.57/7.76  
% 7.57/7.76  
% 7.57/7.76  Changing weight limit from 19 to 17.
% 7.57/7.76  
% 7.57/7.76  Resetting weight limit to 17 after 275 givens.
% 7.57/7.76  
% 53.81/54.05  
% 53.81/54.05  -- HEY sandbox, WE HAVE A PROOF!! -- 
% 53.81/54.05  
% 53.81/54.05  Modelling stopped after 300 given clauses and 0.00 seconds
% 53.81/54.05  
% 53.81/54.05  
% 53.81/54.05  -----> EMPTY CLAUSE at  53.38 sec ----> 46341 [hyper,46331,11,188,unit_del,23,25,25] {-} $F.
% 53.81/54.05  
% 53.81/54.05  Length of proof is 28.  Level of proof is 15.
% 53.81/54.05  
% 53.81/54.05  ---------------- PROOF ----------------
% 53.81/54.05  % SZS status Unsatisfiable
% 53.81/54.05  % SZS output start Refutation
% 53.81/54.05  
% 53.81/54.05  1 [] {+} -smaller_or_equal(A,B)|smaller(A,B)|A=B.
% 53.81/54.05  4 [] {+} -greater_or_equal(A,B)|greater(A,B)|A=B.
% 53.81/54.05  6 [] {+} A!=B|greater_or_equal(A,B).
% 53.81/54.05  7 [] {+} -smaller(A,B)|greater(B,A).
% 53.81/54.05  9 [] {+} -greater(A,B)| -greater(B,A).
% 53.81/54.05  10 [] {+} -greater(A,B)| -greater(B,C)|greater(A,C).
% 53.81/54.05  11 [] {+} -organization(A)|has_endowment(A)| -has_immunity(A,B).
% 53.81/54.05  14 [] {+} -dissimilar(A,B,C)|is_aligned(A,B)|is_aligned(A,C).
% 53.81/54.05  15 [] {+} -dissimilar(A,B,C)| -is_aligned(A,B)| -is_aligned(A,C).
% 53.81/54.05  16 [] {+} -organization(A)| -is_aligned(A,B)|is_aligned(A,C)|dissimilar(A,B,C).
% 53.81/54.05  17 [] {+} -organization(A)| -is_aligned(A,B)|is_aligned(A,C)|dissimilar(A,C,B).
% 53.81/54.05  18 [] {+} -organization(A)|age(A,B)!=zero|is_aligned(A,B).
% 53.81/54.05  19 [] {+} -organization(A)| -is_aligned(A,B)|is_aligned(A,C)|greater(capability(A,B),capability(A,C)).
% 53.81/54.05  20 [] {+} -organization(A)|age(A,B)!=zero| -greater(age(A,C),sigma)|dissimilar(A,B,C).
% 53.81/54.05  21 [] {+} -organization(A)|age(A,B)!=zero| -dissimilar(A,B,C)|greater(age(A,C),sigma).
% 53.81/54.05  22 [] {+} -organization(A)|has_immunity(A,B)|has_immunity(A,C)| -greater(capability(A,C),capability(A,B))|greater(hazard_of_mortality(A,B),hazard_of_mortality(A,C)).
% 53.81/54.05  23 [] {+} -has_endowment(sk1).
% 53.81/54.05  24 [] {+} -greater(hazard_of_mortality(sk1,sk4),hazard_of_mortality(sk1,sk3)).
% 53.81/54.05  25 [factor,9.1.2] {+} -greater(A,A).
% 53.81/54.05  28 [] {+} smaller(A,B)|A=B|greater(A,B).
% 53.81/54.05  29 [] {+} organization(sk1).
% 53.81/54.05  30 [] {-} age(sk1,sk2)=zero.
% 53.81/54.05  32 [] {+} smaller_or_equal(age(sk1,sk3),sigma).
% 53.81/54.05  33 [] {-} greater(age(sk1,sk4),sigma).
% 53.81/54.05  35 [] {+} A=A.
% 53.81/54.05  36 [hyper,28,7] {+} A=B|greater(A,B)|greater(B,A).
% 53.81/54.05  72 [hyper,30,18,29] {+} is_aligned(sk1,sk2).
% 53.81/54.05  76 [para_into,30.1.1.1,4.3.1] {-} age(A,sk2)=zero| -greater_or_equal(sk1,A)|greater(sk1,A).
% 53.81/54.05  89 [hyper,72,17,29] {+} is_aligned(sk1,A)|dissimilar(sk1,A,sk2).
% 53.81/54.05  90 [hyper,72,16,29] {+} is_aligned(sk1,A)|dissimilar(sk1,sk2,A).
% 53.81/54.05  97 [hyper,32,1] {+} smaller(age(sk1,sk3),sigma)|age(sk1,sk3)=sigma.
% 53.81/54.05  110 [hyper,33,20,29,30] {+} dissimilar(sk1,sk2,sk4).
% 53.81/54.05  139 [hyper,35,6] {+} greater_or_equal(A,A).
% 53.81/54.05  181 [para_from,36.1.1,72.1.1] {+} is_aligned(A,sk2)|greater(sk1,A)|greater(A,sk1).
% 53.81/54.05  188 [para_from,36.1.1,29.1.1] {+} organization(A)|greater(sk1,A)|greater(A,sk1).
% 53.81/54.05  532 [para_from,76.1.1,21.2.1,unit_del,35] {-} -organization(A)| -dissimilar(A,sk2,B)|greater(age(A,B),sigma)| -greater_or_equal(sk1,A)|greater(sk1,A).
% 53.81/54.05  2770 [hyper,89,17,29] {+} dissimilar(sk1,A,sk2)|is_aligned(sk1,B)|dissimilar(sk1,B,A).
% 53.81/54.05  7253 [hyper,97,7] {+} age(sk1,sk3)=sigma|greater(sigma,age(sk1,sk3)).
% 53.81/54.05  43307 [hyper,2770,15,110,181,unit_del,25,25] {+} dissimilar(sk1,A,sk2)|dissimilar(sk1,sk4,A).
% 53.81/54.05  43357 [hyper,43307,15,90,181,unit_del,25,25] {+} dissimilar(sk1,sk4,A)|dissimilar(sk1,sk2,A).
% 53.81/54.05  43412 [hyper,43357,532,188,139,unit_del,25,25,25] {-} dissimilar(sk1,sk4,A)|greater(age(sk1,A),sigma).
% 53.81/54.05  43470 [hyper,43412,10,7253,unit_del,25] {-} dissimilar(sk1,sk4,sk3)|age(sk1,sk3)=sigma.
% 53.81/54.05  43691 [para_from,43470.2.1,43412.2.1,unit_del,25,factor_simp] {-} dissimilar(sk1,sk4,sk3).
% 53.81/54.05  43692 [hyper,43691,14] {-} is_aligned(sk1,sk4)|is_aligned(sk1,sk3).
% 53.81/54.05  43759 [hyper,43692,15,110,181,unit_del,25,25] {-} is_aligned(sk1,sk3).
% 53.81/54.05  43769 [hyper,43759,19,188,unit_del,25,25] {-} is_aligned(sk1,A)|greater(capability(sk1,sk3),capability(sk1,A)).
% 53.81/54.05  43775 [hyper,43759,16,188,unit_del,25,25] {-} is_aligned(sk1,A)|dissimilar(sk1,sk3,A).
% 53.81/54.05  43810 [para_into,43759.1.2,36.1.1] {-} is_aligned(sk1,A)|greater(sk3,A)|greater(A,sk3).
% 53.81/54.05  43872 [hyper,43775,15,110,181,unit_del,25,25] {-} dissimilar(sk1,sk3,sk4).
% 53.81/54.05  46161 [hyper,43769,15,43872,43810,unit_del,25,25] {-} greater(capability(sk1,sk3),capability(sk1,sk4)).
% 53.81/54.05  46208 [hyper,46161,22,188,unit_del,24,25,25] {-} has_immunity(sk1,sk4)|has_immunity(sk1,sk3).
% 53.81/54.05  46331 [hyper,46208,11,188,unit_del,23,25,25] {-} has_immunity(sk1,sk3).
% 53.81/54.05  46341 [hyper,46331,11,188,unit_del,23,25,25] {-} $F.
% 53.81/54.05  
% 53.81/54.05  % SZS output end Refutation
% 53.81/54.05  ------------ end of proof -------------
% 53.81/54.05  
% 53.81/54.05  
% 53.81/54.05  Search stopped by max_proofs option.
% 53.81/54.05  
% 53.81/54.05  
% 53.81/54.05  Search stopped by max_proofs option.
% 53.81/54.05  
% 53.81/54.05  ============ end of search ============
% 53.81/54.05  
% 53.81/54.05  ----------- soft-scott stats ----------
% 53.81/54.05  
% 53.81/54.05  true clauses given         539      (28.5%)
% 53.81/54.05  false clauses given       1349
% 53.81/54.05  
% 53.81/54.05        FALSE     TRUE
% 53.81/54.05     3  1         0
% 53.81/54.05     7  1         1
% 53.81/54.05     9  0         12
% 53.81/54.05    10  21        37
% 53.81/54.05    11  5         246
% 53.81/54.05    12  6         1044
% 53.81/54.05    13  54        712
% 53.81/54.05    14  45        475
% 53.81/54.05    15  511       16
% 53.81/54.05    16  275       24
% 53.81/54.05    17  1619      12
% 53.81/54.05  tot:  2538      2579      (50.4% true)
% 53.81/54.05  
% 53.81/54.05  
% 53.81/54.05  Model 5 (0.01 seconds, 0 Inserts)
% 53.81/54.05  
% 53.81/54.05  That finishes the proof of the theorem.
% 53.81/54.05  
% 53.81/54.05  Process 28055 finished Thu Jun  9 12:51:56 2022
%------------------------------------------------------------------------------