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

View Problem - Process Solution

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

% Computer : n025.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 0.67s 0.86s
% Output   : Refutation 0.67s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : PUZ035-4 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n025.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 23:06:41 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 n025.cluster.edu,
% 0.12/0.35  Sat May 28 23:06:41 2022
% 0.12/0.35  The command was "./sos".  The process ID is 25015.
% 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=3.
% 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.37  
% 0.18/0.37  Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.37  
% 0.18/0.37  Stopped by limit on number of solutions
% 0.18/0.37  
% 0.18/0.37  
% 0.18/0.37  -------------- Softie stats --------------
% 0.18/0.37  
% 0.18/0.37  UPDATE_STOP: 300
% 0.18/0.37  SFINDER_TIME_LIMIT: 2
% 0.18/0.37  SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.37  number of clauses in intial UL: 12
% 0.18/0.37  number of clauses initially in problem: 15
% 0.18/0.37  percentage of clauses intially in UL: 80
% 0.18/0.37  percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.37  percent of all initial clauses that are short: 100
% 0.18/0.37  absolute distinct symbol count: 10
% 0.18/0.37     distinct predicate count: 3
% 0.18/0.37     distinct function count: 3
% 0.18/0.37     distinct constant count: 4
% 0.18/0.37  
% 0.18/0.37  ---------- no more Softie stats ----------
% 0.18/0.37  
% 0.18/0.37  
% 0.18/0.37  
% 0.18/0.37  =========== start of search ===========
% 0.67/0.86  
% 0.67/0.86  -------- PROOF -------- 
% 0.67/0.86  % SZS status Unsatisfiable
% 0.67/0.86  % SZS output start Refutation
% 0.67/0.86  
% 0.67/0.86  Model 2 (0.00 seconds, 0 Inserts)
% 0.67/0.86  
% 0.67/0.86  Stopped by limit on number of solutions
% 0.67/0.86  
% 0.67/0.86  Stopped by limit on insertions
% 0.67/0.86  
% 0.67/0.86  Model 3 [ 1 0 275 ] (0.00 seconds, 250000 Inserts)
% 0.67/0.86  
% 0.67/0.86  Stopped by limit on insertions
% 0.67/0.86  
% 0.67/0.86  Model 4 [ 2 3 20423 ] (0.00 seconds, 250000 Inserts)
% 0.67/0.86  
% 0.67/0.86  Model 5 (0.00 seconds, 250000 Inserts)
% 0.67/0.86  
% 0.67/0.86  Stopped by limit on number of solutions
% 0.67/0.86  
% 0.67/0.86  -----> EMPTY CLAUSE at   0.49 sec ----> 47 [hyper,46,11,45,37] {-} $F.
% 0.67/0.86  
% 0.67/0.86  Length of proof is 9.  Level of proof is 6.
% 0.67/0.86  
% 0.67/0.86  ---------------- PROOF ----------------
% 0.67/0.86  % SZS status Unsatisfiable
% 0.67/0.86  % SZS output start Refutation
% 0.67/0.86  
% 0.67/0.86  1 [] {+} -person(A)|truth(isa(A,knight))|truth(isa(A,knave)).
% 0.67/0.86  11 [] {+} -truth(isa(asked,A))| -truth(isa(other,B))| -says(asked,C).
% 0.67/0.86  13 [] {-} says(asked,or(isa(asked,knight),isa(other,knight)))|says(asked,not(or(isa(asked,knight),isa(other,knight)))).
% 0.67/0.86  14 [] {+} person(asked).
% 0.67/0.86  15 [] {+} person(other).
% 0.67/0.86  19 [hyper,14,1] {-} truth(isa(asked,knight))|truth(isa(asked,knave)).
% 0.67/0.86  20 [hyper,15,1] {+} truth(isa(other,knight))|truth(isa(other,knave)).
% 0.67/0.86  28 [hyper,20,11,19,13] {-} truth(isa(other,knight))|truth(isa(asked,knight))|says(asked,not(or(isa(asked,knight),isa(other,knight)))).
% 0.67/0.86  33 [hyper,28,11,19,13,factor_simp,factor_simp] {-} truth(isa(asked,knight))|says(asked,not(or(isa(asked,knight),isa(other,knight)))).
% 0.67/0.86  34 [hyper,28,11,20,13,factor_simp,factor_simp] {-} truth(isa(other,knight))|says(asked,not(or(isa(asked,knight),isa(other,knight)))).
% 0.67/0.86  37 [hyper,34,11,33,13,factor_simp,factor_simp] {-} says(asked,not(or(isa(asked,knight),isa(other,knight)))).
% 0.67/0.86  38 [hyper,37,11,19,20] {-} truth(isa(asked,knight))|truth(isa(other,knight)).
% 0.67/0.86  45 [hyper,38,11,20,37,factor_simp] {+} truth(isa(other,knight)).
% 0.67/0.86  46 [hyper,38,11,19,37,factor_simp] {+} truth(isa(asked,knight)).
% 0.67/0.86  47 [hyper,46,11,45,37] {-} $F.
% 0.67/0.86  
% 0.67/0.86  % SZS output end Refutation
% 0.67/0.86  ------------ end of proof -------------
% 0.67/0.86  
% 0.67/0.86  
% 0.67/0.86  Search stopped by max_proofs option.
% 0.67/0.86  
% 0.67/0.86  
% 0.67/0.86  Search stopped by max_proofs option.
% 0.67/0.86  
% 0.67/0.86  ============ end of search ============
% 0.67/0.86  
% 0.67/0.86  ----------- soft-scott stats ----------
% 0.67/0.86  
% 0.67/0.86  true clauses given           2      (15.4%)
% 0.67/0.86  false clauses given         11
% 0.67/0.86  
% 0.67/0.86        FALSE     TRUE
% 0.67/0.86     8  1         0
% 0.67/0.86    13  1         0
% 0.67/0.86    17  0         1
% 0.67/0.86    19  0         1
% 0.67/0.86  tot:  2         2      (50.0% true)
% 0.67/0.86  
% 0.67/0.86  
% 0.67/0.86  Model 5 (0.00 seconds, 250000 Inserts)
% 0.67/0.86  
% 0.67/0.86  That finishes the proof of the theorem.
% 0.67/0.86  
% 0.67/0.86  Process 25015 finished Sat May 28 23:06:41 2022
%------------------------------------------------------------------------------