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

View Problem - Process Solution

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

% Computer : n026.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.09s 1.31s
% Output   : Refutation 1.09s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : PUZ035-2 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12  % Command  : sos-script %s
% 0.12/0.32  % Computer : n026.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Sun May 29 02:29:09 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.34  ----- Otter 3.2, August 2001 -----
% 0.12/0.34  The process was started by sandbox2 on n026.cluster.edu,
% 0.12/0.34  Sun May 29 02:29:09 2022
% 0.12/0.34  The command was "./sos".  The process ID is 9699.
% 0.12/0.34  
% 0.12/0.34  set(prolog_style_variables).
% 0.12/0.34  set(auto).
% 0.12/0.34     dependent: set(auto1).
% 0.12/0.34     dependent: set(process_input).
% 0.12/0.34     dependent: clear(print_kept).
% 0.12/0.34     dependent: clear(print_new_demod).
% 0.12/0.34     dependent: clear(print_back_demod).
% 0.12/0.34     dependent: clear(print_back_sub).
% 0.12/0.34     dependent: set(control_memory).
% 0.12/0.34     dependent: assign(max_mem, 12000).
% 0.12/0.34     dependent: assign(pick_given_ratio, 4).
% 0.12/0.34     dependent: assign(stats_level, 1).
% 0.12/0.34     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.34     dependent: assign(sos_limit, 5000).
% 0.12/0.34     dependent: assign(max_weight, 60).
% 0.12/0.34  clear(print_given).
% 0.12/0.34  
% 0.12/0.34  list(usable).
% 0.12/0.34  
% 0.12/0.34  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 0.12/0.34  
% 0.12/0.34  This is a non-Horn set without equality.  The strategy
% 0.12/0.34  will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.34  factoring, with satellites in sos and nuclei in usable.
% 0.12/0.34  
% 0.12/0.34     dependent: set(hyper_res).
% 0.12/0.34     dependent: set(factor).
% 0.12/0.34     dependent: set(unit_deletion).
% 0.12/0.34  
% 0.12/0.34  ------------> process usable:
% 0.12/0.34  
% 0.12/0.34  ------------> process sos:
% 0.12/0.34  
% 0.12/0.34  ======= end of input processing =======
% 0.18/0.38  
% 0.18/0.38  Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.38  
% 0.18/0.38  Stopped by limit on number of solutions
% 0.18/0.38  
% 0.18/0.38  
% 0.18/0.38  -------------- Softie stats --------------
% 0.18/0.38  
% 0.18/0.38  UPDATE_STOP: 300
% 0.18/0.38  SFINDER_TIME_LIMIT: 2
% 0.18/0.38  SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.38  number of clauses in intial UL: 13
% 0.18/0.38  number of clauses initially in problem: 16
% 0.18/0.38  percentage of clauses intially in UL: 81
% 0.18/0.38  percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.38  percent of all initial clauses that are short: 100
% 0.18/0.38  absolute distinct symbol count: 11
% 0.18/0.38     distinct predicate count: 5
% 0.18/0.38     distinct function count: 0
% 0.18/0.38     distinct constant count: 6
% 0.18/0.38  
% 0.18/0.38  ---------- no more Softie stats ----------
% 0.18/0.38  
% 0.18/0.38  
% 0.18/0.38  
% 0.18/0.38  Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.38  
% 0.18/0.38  Stopped by limit on number of solutions
% 0.18/0.38  
% 0.18/0.38  =========== start of search ===========
% 1.09/1.31  
% 1.09/1.31  -------- PROOF -------- 
% 1.09/1.31  % SZS status Unsatisfiable
% 1.09/1.31  % SZS output start Refutation
% 1.09/1.31  
% 1.09/1.31  Model 3 (0.00 seconds, 0 Inserts)
% 1.09/1.31  
% 1.09/1.31  Stopped by limit on number of solutions
% 1.09/1.31  
% 1.09/1.31  Model 4 [ 1 0 105 ] (0.00 seconds, 210936 Inserts)
% 1.09/1.31  
% 1.09/1.31  Stopped by limit on insertions
% 1.09/1.31  
% 1.09/1.31  Model 5 [ 1 1 176 ] (0.00 seconds, 250000 Inserts)
% 1.09/1.31  
% 1.09/1.31  Stopped by limit on insertions
% 1.09/1.31  
% 1.09/1.31  Model 6 [ 1 1 898 ] (0.00 seconds, 250000 Inserts)
% 1.09/1.31  
% 1.09/1.31  Model 7 [ 2 1 137 ] (0.00 seconds, 159815 Inserts)
% 1.09/1.31  
% 1.09/1.31  -----> EMPTY CLAUSE at   0.93 sec ----> 51 [hyper,46,2,41] {-} $F.
% 1.09/1.31  
% 1.09/1.31  Length of proof is 11.  Level of proof is 7.
% 1.09/1.31  
% 1.09/1.31  ---------------- PROOF ----------------
% 1.09/1.31  % SZS status Unsatisfiable
% 1.09/1.31  % SZS output start Refutation
% 1.09/1.31  
% 1.09/1.31  1 [] {+} -person(A)|isa(A,knight)|isa(A,knave).
% 1.09/1.31  2 [] {+} -isa(A,knight)| -isa(A,knave).
% 1.09/1.31  3 [] {+} -isa(A,knight)|tell_the_truth(A).
% 1.09/1.31  4 [] {+} -isa(A,knave)|lies(A).
% 1.09/1.31  8 [] {+} isa(asked,knight)|isa(other,knight)| -response(no)| -lies(asked).
% 1.09/1.31  11 [] {+} response(yes)| -tell_the_truth(asked)| -isa(A,knight).
% 1.09/1.31  13 [] {+} -response(A)| -isa(asked,B)| -isa(other,C).
% 1.09/1.31  14 [] {+} response(yes)|response(no).
% 1.09/1.31  15 [] {+} person(asked).
% 1.09/1.31  16 [] {+} person(other).
% 1.09/1.31  18 [hyper,15,1] {+} isa(asked,knight)|isa(asked,knave).
% 1.09/1.31  20 [hyper,16,1] {+} isa(other,knight)|isa(other,knave).
% 1.09/1.31  23 [hyper,18,3] {+} isa(asked,knave)|tell_the_truth(asked).
% 1.09/1.31  24 [hyper,18,4] {+} isa(asked,knight)|lies(asked).
% 1.09/1.31  25 [hyper,23,11,18,factor_simp] {+} isa(asked,knave)|response(yes).
% 1.09/1.31  26 [hyper,24,8,14,factor_simp] {-} isa(asked,knight)|isa(other,knight)|response(yes).
% 1.09/1.31  27 [hyper,20,13,25,18,factor_simp] {-} isa(other,knave)|isa(asked,knave).
% 1.09/1.31  32 [hyper,20,13,26,18,factor_simp,factor_simp] {-} isa(other,knight)|isa(asked,knight).
% 1.09/1.31  35 [hyper,32,13,14,18,factor_simp] {-} isa(asked,knight)|response(yes).
% 1.09/1.31  41 [hyper,35,13,18,32,factor_simp,factor_simp] {+} isa(asked,knight).
% 1.09/1.31  46 [hyper,27,13,25,41,factor_simp] {+} isa(asked,knave).
% 1.09/1.31  51 [hyper,46,2,41] {-} $F.
% 1.09/1.31  
% 1.09/1.31  % SZS output end Refutation
% 1.09/1.31  ------------ end of proof -------------
% 1.09/1.31  
% 1.09/1.31  
% 1.09/1.31  Search stopped by max_proofs option.
% 1.09/1.31  
% 1.09/1.31  
% 1.09/1.31  Search stopped by max_proofs option.
% 1.09/1.31  
% 1.09/1.31  ============ end of search ============
% 1.09/1.31  
% 1.09/1.31  ----------- soft-scott stats ----------
% 1.09/1.31  
% 1.09/1.31  true clauses given           8      (44.4%)
% 1.09/1.31  false clauses given         10
% 1.09/1.31  
% 1.09/1.31        FALSE     TRUE
% 1.09/1.31     2  1         0
% 1.09/1.31     3  0         1
% 1.09/1.31     5  1         0
% 1.09/1.31  tot:  2         1      (33.3% true)
% 1.09/1.31  
% 1.09/1.31  
% 1.09/1.31  Model 7 [ 2 1 137 ] (0.00 seconds, 159815 Inserts)
% 1.09/1.31  
% 1.09/1.31  That finishes the proof of the theorem.
% 1.09/1.31  
% 1.09/1.31  Process 9699 finished Sun May 29 02:29:10 2022
%------------------------------------------------------------------------------