↑ Up

Otter---3.3.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : PUZ023-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n007.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  : 300s
% DateTime : Wed Jul 27 13:11:24 EDT 2022

% Result   : Unsatisfiable 1.66s 1.84s
% Output   : Refutation 1.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   11 (   5 unt;   2 nHn;  10 RR)
%            Number of literals    :   21 (   0 equ;   9 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-1 aty)
%            Number of variables   :    2 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(13,axiom,
    ( ~ a_truth(liar(b))
    | ~ a_truth(liar(c))
    | an_answer(b_and_c_liars) ),
    file('PUZ023-1.p',unknown),
    [] ).

cnf(14,axiom,
    ( ~ a_truth(liar(b))
    | ~ a_truth(truthteller(c))
    | an_answer(b_liar_and_c_truthteller) ),
    file('PUZ023-1.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ a_truth(truthteller(b))
    | ~ a_truth(liar(c))
    | an_answer(b_truthteller_and_c_liar) ),
    file('PUZ023-1.p',unknown),
    [] ).

cnf(16,axiom,
    ( ~ a_truth(truthteller(b))
    | ~ a_truth(truthteller(c))
    | an_answer(b_and_c_truthtellers) ),
    file('PUZ023-1.p',unknown),
    [] ).

cnf(17,axiom,
    ~ an_answer(A),
    file('PUZ023-1.p',unknown),
    [] ).

cnf(30,axiom,
    ( a_truth(truthteller(A))
    | a_truth(liar(A)) ),
    file('PUZ023-1.p',unknown),
    [] ).

cnf(35,plain,
    ( a_truth(liar(c))
    | a_truth(liar(b)) ),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[30,16,30]),17]),
    [iquote('hyper,30,16,30,unit_del,17')] ).

cnf(41,plain,
    a_truth(liar(b)),
    inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[35,15,30]),17])]),
    [iquote('hyper,35,15,30,unit_del,17,factor_simp')] ).

cnf(42,plain,
    a_truth(liar(c)),
    inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[35,14,30]),17])]),
    [iquote('hyper,35,14,30,unit_del,17,factor_simp')] ).

cnf(44,plain,
    an_answer(b_and_c_liars),
    inference(hyper,[status(thm)],[42,13,41]),
    [iquote('hyper,42,13,41')] ).

cnf(45,plain,
    $false,
    inference(binary,[status(thm)],[44,17]),
    [iquote('binary,44.1,17.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : PUZ023-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13  % Command  : otter-tptp-script %s
% 0.13/0.34  % Computer : n007.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  : 300
% 0.13/0.34  % DateTime : Wed Jul 27 01:31:46 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.66/1.84  ----- Otter 3.3f, August 2004 -----
% 1.66/1.84  The process was started by sandbox on n007.cluster.edu,
% 1.66/1.84  Wed Jul 27 01:31:46 2022
% 1.66/1.84  The command was "./otter".  The process ID is 14722.
% 1.66/1.84  
% 1.66/1.84  set(prolog_style_variables).
% 1.66/1.84  set(auto).
% 1.66/1.84     dependent: set(auto1).
% 1.66/1.84     dependent: set(process_input).
% 1.66/1.84     dependent: clear(print_kept).
% 1.66/1.84     dependent: clear(print_new_demod).
% 1.66/1.84     dependent: clear(print_back_demod).
% 1.66/1.84     dependent: clear(print_back_sub).
% 1.66/1.84     dependent: set(control_memory).
% 1.66/1.84     dependent: assign(max_mem, 12000).
% 1.66/1.84     dependent: assign(pick_given_ratio, 4).
% 1.66/1.84     dependent: assign(stats_level, 1).
% 1.66/1.84     dependent: assign(max_seconds, 10800).
% 1.66/1.84  clear(print_given).
% 1.66/1.84  
% 1.66/1.84  list(usable).
% 1.66/1.84  0 [] a_truth(truthteller(X))|a_truth(liar(X)).
% 1.66/1.84  0 [] -a_truth(truthteller(X))| -a_truth(liar(X)).
% 1.66/1.84  0 [] -a_truth(truthteller(Truthteller))| -a_truth(says(Truthteller,Statement))|a_truth(Statement).
% 1.66/1.84  0 [] -a_truth(liar(Liar))| -a_truth(says(Liar,Statement))| -a_truth(Statement).
% 1.66/1.84  0 [] -a_truth(Statement)| -a_truth(says(Truthteller,Statement))|a_truth(truthteller(Truthteller)).
% 1.66/1.84  0 [] a_truth(Statement)| -a_truth(says(Liar,Statement))|a_truth(liar(Liar)).
% 1.66/1.84  0 [] -people(X,Y,Z)| -a_truth(one_truthteller)|a_truth(truthteller(X))|a_truth(truthteller(Y))|a_truth(truthteller(Z)).
% 1.66/1.84  0 [] -people(X,Y,Z)| -a_truth(truthteller(X))| -a_truth(truthteller(Y))| -a_truth(one_truthteller).
% 1.66/1.84  0 [] -people(X,Y,Z)| -a_truth(truthteller(X))| -a_truth(truthteller(Z))| -a_truth(one_truthteller).
% 1.66/1.84  0 [] -people(X,Y,Z)| -a_truth(truthteller(Y))| -a_truth(truthteller(Z))| -a_truth(one_truthteller).
% 1.66/1.84  0 [] -people(X,Y,Z)|a_truth(one_truthteller)| -a_truth(truthteller(X))|a_truth(truthteller(Y))|a_truth(truthteller(Z)).
% 1.66/1.84  0 [] -people(X,Y,Z)|a_truth(one_truthteller)| -a_truth(truthteller(Y))|a_truth(truthteller(X))|a_truth(truthteller(Z)).
% 1.66/1.84  0 [] -people(X,Y,Z)|a_truth(one_truthteller)| -a_truth(truthteller(Z))|a_truth(truthteller(Y))|a_truth(truthteller(X)).
% 1.66/1.84  0 [] people(a,b,c).
% 1.66/1.84  0 [] a_truth(says(a,garbage)).
% 1.66/1.84  0 [] a_truth(says(b,says(a,one_truthteller))).
% 1.66/1.84  0 [] a_truth(says(c,liar(b))).
% 1.66/1.84  0 [] -a_truth(liar(b))| -a_truth(liar(c))|an_answer(b_and_c_liars).
% 1.66/1.84  0 [] -a_truth(liar(b))| -a_truth(truthteller(c))|an_answer(b_liar_and_c_truthteller).
% 1.66/1.84  0 [] -a_truth(truthteller(b))| -a_truth(liar(c))|an_answer(b_truthteller_and_c_liar).
% 1.66/1.84  0 [] -a_truth(truthteller(b))| -a_truth(truthteller(c))|an_answer(b_and_c_truthtellers).
% 1.66/1.84  0 [] -an_answer(X).
% 1.66/1.84  end_of_list.
% 1.66/1.84  
% 1.66/1.84  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 1.66/1.84  
% 1.66/1.84  This is a non-Horn set without equality.  The strategy will
% 1.66/1.84  be ordered hyper_res, unit deletion, and factoring, with
% 1.66/1.84  satellites in sos and with nuclei in usable.
% 1.66/1.84  
% 1.66/1.84     dependent: set(hyper_res).
% 1.66/1.84     dependent: set(factor).
% 1.66/1.84     dependent: set(unit_deletion).
% 1.66/1.84  
% 1.66/1.84  ------------> process usable:
% 1.66/1.84  ** KEPT (pick-wt=6): 1 [] -a_truth(truthteller(A))| -a_truth(liar(A)).
% 1.66/1.84  ** KEPT (pick-wt=9): 2 [] -a_truth(truthteller(A))| -a_truth(says(A,B))|a_truth(B).
% 1.66/1.84  ** KEPT (pick-wt=9): 3 [] -a_truth(liar(A))| -a_truth(says(A,B))| -a_truth(B).
% 1.66/1.84  ** KEPT (pick-wt=9): 4 [] -a_truth(A)| -a_truth(says(B,A))|a_truth(truthteller(B)).
% 1.66/1.84  ** KEPT (pick-wt=9): 5 [] a_truth(A)| -a_truth(says(B,A))|a_truth(liar(B)).
% 1.66/1.84  ** KEPT (pick-wt=15): 6 [] -people(A,B,C)| -a_truth(one_truthteller)|a_truth(truthteller(A))|a_truth(truthteller(B))|a_truth(truthteller(C)).
% 1.66/1.84  ** KEPT (pick-wt=12): 7 [] -people(A,B,C)| -a_truth(truthteller(A))| -a_truth(truthteller(B))| -a_truth(one_truthteller).
% 1.66/1.84  ** KEPT (pick-wt=12): 8 [] -people(A,B,C)| -a_truth(truthteller(A))| -a_truth(truthteller(C))| -a_truth(one_truthteller).
% 1.66/1.84  ** KEPT (pick-wt=12): 9 [] -people(A,B,C)| -a_truth(truthteller(B))| -a_truth(truthteller(C))| -a_truth(one_truthteller).
% 1.66/1.84  ** KEPT (pick-wt=15): 10 [] -people(A,B,C)|a_truth(one_truthteller)| -a_truth(truthteller(A))|a_truth(truthteller(B))|a_truth(truthteller(C)).
% 1.66/1.84  ** KEPT (pick-wt=15): 11 [] -people(A,B,C)|a_truth(one_truthteller)| -a_truth(truthteller(B))|a_truth(truthteller(A))|a_truth(truthteller(C)).
% 1.66/1.84  ** KEPT (pick-wt=15): 12 [] -people(A,B,C)|a_truth(one_truthteller)| -a_truth(truthteller(C))|a_truth(truthteller(B))|a_truth(truthteller(A)).
% 1.66/1.84  ** KEPT (pick-wt=8): 13 [] -a_truth(liar(b))| -a_truth(liar(c))|an_answer(b_and_c_liars).
% 1.66/1.84  ** KEPT (pick-wt=8): 14 [] -a_truth(liar(b))| -a_truth(truthteller(c))|an_answer(b_liar_and_c_truthteller).
% 1.66/1.84  ** KEPT (pick-wt=8): 15 [] -a_truth(truthteller(b))| -a_truth(liar(c))|an_answer(b_truthteller_and_c_liar).
% 1.66/1.84  ** KEPT (pick-wt=8): 16 [] -a_truth(truthteller(b))| -a_truth(truthteller(c))|an_answer(b_and_c_truthtellers).
% 1.66/1.84  ** KEPT (pick-wt=2): 17 [] -an_answer(A).
% 1.66/1.84  
% 1.66/1.84  ------------> process sos:
% 1.66/1.84  ** KEPT (pick-wt=6): 30 [] a_truth(truthteller(A))|a_truth(liar(A)).
% 1.66/1.84  ** KEPT (pick-wt=4): 31 [] people(a,b,c).
% 1.66/1.84  ** KEPT (pick-wt=4): 32 [] a_truth(says(a,garbage)).
% 1.66/1.84  ** KEPT (pick-wt=6): 33 [] a_truth(says(b,says(a,one_truthteller))).
% 1.66/1.84  ** KEPT (pick-wt=5): 34 [] a_truth(says(c,liar(b))).
% 1.66/1.84  
% 1.66/1.84  ======= end of input processing =======
% 1.66/1.84  
% 1.66/1.84  =========== start of search ===========
% 1.66/1.84  
% 1.66/1.84  -------- PROOF -------- 
% 1.66/1.84  
% 1.66/1.84  ----> UNIT CONFLICT at   0.00 sec ----> 45 [binary,44.1,17.1] $F.
% 1.66/1.84  
% 1.66/1.84  Length of proof is 4.  Level of proof is 3.
% 1.66/1.84  
% 1.66/1.84  ---------------- PROOF ----------------
% 1.66/1.84  % SZS status Unsatisfiable
% 1.66/1.84  % SZS output start Refutation
% See solution above
% 1.66/1.85  ------------ end of proof -------------
% 1.66/1.85  
% 1.66/1.85  
% 1.66/1.85  Search stopped by max_proofs option.
% 1.66/1.85  
% 1.66/1.85  
% 1.66/1.85  Search stopped by max_proofs option.
% 1.66/1.85  
% 1.66/1.85  ============ end of search ============
% 1.66/1.85  
% 1.66/1.85  -------------- statistics -------------
% 1.66/1.85  clauses given                  9
% 1.66/1.85  clauses generated             60
% 1.66/1.85  clauses kept                  44
% 1.66/1.85  clauses forward subsumed      38
% 1.66/1.85  clauses back subsumed          5
% 1.66/1.85  Kbytes malloced              976
% 1.66/1.85  
% 1.66/1.85  ----------- times (seconds) -----------
% 1.66/1.85  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.66/1.85  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.66/1.85  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.66/1.85  
% 1.66/1.85  That finishes the proof of the theorem.
% 1.66/1.85  
% 1.66/1.85  Process 14722 finished Wed Jul 27 01:31:47 2022
% 1.66/1.85  Otter interrupted
% 1.66/1.85  PROOF FOUND
%------------------------------------------------------------------------------