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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : PUZ035-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n027.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 18:27:01 EDT 2022

% Result   : Unsatisfiable 1.93s 2.13s
% Output   : Refutation 1.93s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : PUZ035-1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n027.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat May 28 22:20:14 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.35  ----- Otter 3.2, August 2001 -----
% 0.12/0.35  The process was started by sandbox2 on n027.cluster.edu,
% 0.12/0.35  Sat May 28 22:20:14 2022
% 0.12/0.35  The command was "./sos".  The process ID is 29458.
% 0.12/0.35  
% 0.12/0.35  set(prolog_style_variables).
% 0.12/0.35  set(auto).
% 0.12/0.35     dependent: set(auto1).
% 0.12/0.35     dependent: set(process_input).
% 0.12/0.35     dependent: clear(print_kept).
% 0.12/0.35     dependent: clear(print_new_demod).
% 0.12/0.35     dependent: clear(print_back_demod).
% 0.12/0.35     dependent: clear(print_back_sub).
% 0.12/0.35     dependent: set(control_memory).
% 0.12/0.35     dependent: assign(max_mem, 12000).
% 0.12/0.35     dependent: assign(pick_given_ratio, 4).
% 0.12/0.35     dependent: assign(stats_level, 1).
% 0.12/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35     dependent: assign(sos_limit, 5000).
% 0.12/0.35     dependent: assign(max_weight, 60).
% 0.12/0.35  clear(print_given).
% 0.12/0.35  
% 0.12/0.35  list(usable).
% 0.12/0.35  
% 0.12/0.35  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 0.12/0.35  
% 0.12/0.35  This is a non-Horn set without equality.  The strategy
% 0.12/0.35  will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35  factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35  
% 0.12/0.35     dependent: set(hyper_res).
% 0.12/0.35     dependent: set(factor).
% 0.12/0.35     dependent: set(unit_deletion).
% 0.12/0.35  
% 0.12/0.35  ------------> process usable:
% 0.12/0.35  
% 0.12/0.35  ------------> process sos:
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.18/0.39  
% 0.18/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.39  
% 0.18/0.39  Stopped by limit on number of solutions
% 0.18/0.39  
% 0.18/0.39  
% 0.18/0.39  -------------- Softie stats --------------
% 0.18/0.39  
% 0.18/0.39  UPDATE_STOP: 300
% 0.18/0.39  SFINDER_TIME_LIMIT: 2
% 0.18/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.39  number of clauses in intial UL: 12
% 0.18/0.39  number of clauses initially in problem: 15
% 0.18/0.39  percentage of clauses intially in UL: 80
% 0.18/0.39  percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.39  percent of all initial clauses that are short: 100
% 0.18/0.39  absolute distinct symbol count: 11
% 0.18/0.39     distinct predicate count: 5
% 0.18/0.39     distinct function count: 0
% 0.18/0.39     distinct constant count: 6
% 0.18/0.39  
% 0.18/0.39  ---------- no more Softie stats ----------
% 0.18/0.39  
% 0.18/0.39  
% 0.18/0.39  
% 0.18/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.39  
% 0.18/0.39  Stopped by limit on number of solutions
% 0.18/0.39  
% 0.18/0.39  =========== start of search ===========
% 1.93/2.13  
% 1.93/2.13  -------- PROOF -------- 
% 1.93/2.13  % SZS status Unsatisfiable
% 1.93/2.13  % SZS output start Refutation
% 1.93/2.13  
% 1.93/2.13  Model 3 (0.00 seconds, 0 Inserts)
% 1.93/2.13  
% 1.93/2.13  Stopped by limit on number of solutions
% 1.93/2.13  
% 1.93/2.13  Model 4 [ 1 1 79 ] (0.00 seconds, 237561 Inserts)
% 1.93/2.13  
% 1.93/2.13  Stopped by limit on insertions
% 1.93/2.13  
% 1.93/2.13  Model 5 [ 1 1 167 ] (0.00 seconds, 250000 Inserts)
% 1.93/2.13  
% 1.93/2.13  Model 6 [ 1 1 1027 ] (0.00 seconds, 86216 Inserts)
% 1.93/2.13  
% 1.93/2.13  Stopped by limit on insertions
% 1.93/2.13  
% 1.93/2.13  Model 7 [ 1 1 7827 ] (0.00 seconds, 250000 Inserts)
% 1.93/2.13  
% 1.93/2.13  Stopped by limit on insertions
% 1.93/2.13  
% 1.93/2.13  Model 8 [ 2 0 470 ] (0.00 seconds, 250000 Inserts)
% 1.93/2.13  
% 1.93/2.13  Model 9 [ 2 0 644 ] (0.00 seconds, 127366 Inserts)
% 1.93/2.13  
% 1.93/2.13  Model 10 [ 3 0 101 ] (0.00 seconds, 135403 Inserts)
% 1.93/2.13  
% 1.93/2.13  Stopped by limit on insertions
% 1.93/2.13  
% 1.93/2.13  Model 11 [ 3 8 103901 ] (0.00 seconds, 250000 Inserts)
% 1.93/2.13  
% 1.93/2.13  -----> EMPTY CLAUSE at   1.74 sec ----> 45 [hyper,41,12,37,42] {-} $F.
% 1.93/2.13  
% 1.93/2.13  Length of proof is 10.  Level of proof is 7.
% 1.93/2.13  
% 1.93/2.13  ---------------- PROOF ----------------
% 1.93/2.13  % SZS status Unsatisfiable
% 1.93/2.13  % SZS output start Refutation
% 1.93/2.13  
% 1.93/2.13  1 [] {+} -person(A)|isa(A,knight)|isa(A,knave).
% 1.93/2.13  3 [] {+} -isa(A,knight)|tell_the_truth(A).
% 1.93/2.13  10 [] {+} response(yes)| -tell_the_truth(asked)| -isa(A,knight).
% 1.93/2.13  12 [] {+} -response(A)| -isa(asked,B)| -isa(other,C).
% 1.93/2.13  13 [] {+} response(yes)|response(no).
% 1.93/2.13  14 [] {+} person(asked).
% 1.93/2.13  15 [] {+} person(other).
% 1.93/2.13  16 [hyper,14,1] {-} isa(asked,knight)|isa(asked,knave).
% 1.93/2.13  17 [hyper,15,1] {+} isa(other,knight)|isa(other,knave).
% 1.93/2.13  21 [hyper,17,12,13,16] {-} isa(other,knave)|response(yes)|isa(asked,knight).
% 1.93/2.13  30 [hyper,21,12,16,17,factor_simp,factor_simp] {-} isa(other,knave)|isa(asked,knight).
% 1.93/2.13  31 [hyper,30,12,13,16,factor_simp] {-} isa(asked,knight)|response(yes).
% 1.93/2.13  35 [hyper,30,12,13,17,factor_simp] {-} isa(other,knave)|response(no).
% 1.93/2.13  37 [hyper,31,12,16,30,factor_simp,factor_simp] {+} isa(asked,knight).
% 1.93/2.13  40 [hyper,37,3] {+} tell_the_truth(asked).
% 1.93/2.13  41 [hyper,40,10,37] {+} response(yes).
% 1.93/2.13  42 [hyper,35,12,37,17,factor_simp] {+} isa(other,knave).
% 1.93/2.13  45 [hyper,41,12,37,42] {-} $F.
% 1.93/2.13  
% 1.93/2.13  % SZS output end Refutation
% 1.93/2.13  ------------ end of proof -------------
% 1.93/2.13  
% 1.93/2.13  
% 1.93/2.13  Search stopped by max_proofs option.
% 1.93/2.13  
% 1.93/2.13  
% 1.93/2.13  Search stopped by max_proofs option.
% 1.93/2.13  
% 1.93/2.13  ============ end of search ============
% 1.93/2.13  
% 1.93/2.13  ----------- soft-scott stats ----------
% 1.93/2.13  
% 1.93/2.13  true clauses given           1      (5.9%)
% 1.93/2.13  false clauses given         16
% 1.93/2.13  
% 1.93/2.13        FALSE     TRUE
% 1.93/2.13     2  0         1
% 1.93/2.13     3  1         0
% 1.93/2.13  tot:  1         1      (50.0% true)
% 1.93/2.13  
% 1.93/2.13  
% 1.93/2.13  Model 11 [ 3 8 103901 ] (0.00 seconds, 250000 Inserts)
% 1.93/2.13  
% 1.93/2.13  That finishes the proof of the theorem.
% 1.93/2.13  
% 1.93/2.13  Process 29458 finished Sat May 28 22:20:16 2022
%------------------------------------------------------------------------------