TSTP Solution File: PUZ035-1 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : PUZ035-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n019.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:26:47 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(everyone_a_knight_or_knave,axiom,
    ( ~ person(X)
    | isa(X,knight)
    | isa(X,knave) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',everyone_a_knight_or_knave) ).

cnf(not_both_a_knight_and_knave,axiom,
    ( ~ isa(X,knight)
    | ~ isa(X,knave) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_both_a_knight_and_knave) ).

cnf(knights_make_true_statements,axiom,
    ( ~ isa(X,knight)
    | tell_the_truth(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knights_make_true_statements) ).

cnf(knaves_make_false_statements,axiom,
    ( ~ isa(X,knave)
    | lies(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knaves_make_false_statements) ).

cnf(statements_are_true_or_false,axiom,
    ( ~ tell_the_truth(X)
    | ~ lies(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',statements_are_true_or_false) ).

cnf(lie_one_is_a_knight,axiom,
    ( isa(asked,knight)
    | isa(other,knight)
    | ~ response(no)
    | ~ lies(asked) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lie_one_is_a_knight) ).

cnf(knight_answers2,axiom,
    ( ~ response(no)
    | ~ tell_the_truth(asked)
    | ~ isa(X,knight) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knight_answers2) ).

cnf(two_answers,axiom,
    ( response(yes)
    | response(no) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_answers) ).

cnf(asked_person,axiom,
    person(asked),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',asked_person) ).

cnf(other_person,axiom,
    person(other),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',other_person) ).

cnf(prove_answer,negated_conjecture,
    ( ~ response(X)
    | ~ isa(asked,Y)
    | ~ isa(other,Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_answer) ).

cnf(16,plain,
    ( isa(other,knight)
    | isa(other,knave) ),
    inference('HYPERRESOLVE',[status(thm)],[everyone_a_knight_or_knave,other_person]) ).

cnf(17,plain,
    ( isa(asked,knight)
    | isa(asked,knave) ),
    inference('HYPERRESOLVE',[status(thm)],[everyone_a_knight_or_knave,asked_person]) ).

cnf(19,plain,
    ( isa(asked,knave)
    | tell_the_truth(asked) ),
    inference('HYPERRESOLVE',[status(thm)],[knights_make_true_statements,17]) ).

cnf(20,plain,
    ( isa(asked,knave)
    | response(no)
    | isa(other,knave) ),
    inference('HYPERRESOLVE',[status(thm)],[prove_answer,17,two_answers,16]) ).

cnf(23,plain,
    ( tell_the_truth(asked)
    | lies(asked) ),
    inference('HYPERRESOLVE',[status(thm)],[knaves_make_false_statements,19]) ).

cnf(29,plain,
    ( isa(asked,knave)
    | response(no) ),
    inference('HYPERRESOLVE',[status(thm)],[prove_answer,20,two_answers,17]) ).

cnf(31,plain,
    ( response(no)
    | lies(asked) ),
    inference('HYPERRESOLVE',[status(thm)],[knaves_make_false_statements,29]) ).

cnf(32,plain,
    ( response(no)
    | isa(other,knave) ),
    inference('HYPERRESOLVE',[status(thm)],[prove_answer,29,two_answers,16]) ).

cnf(33,plain,
    ( lies(asked)
    | isa(asked,knave) ),
    inference('HYPERRESOLVE',[status(thm)],[knight_answers2,31,23,17]) ).

cnf(35,plain,
    response(no),
    inference('HYPERRESOLVE',[status(thm)],[prove_answer,32,two_answers,29]) ).

cnf(36,plain,
    ( isa(asked,knight)
    | isa(other,knight)
    | ~ lies(asked) ),
    inference('REWRITE',[status(thm)],[lie_one_is_a_knight,35]) ).

cnf(42,plain,
    lies(asked),
    inference('HYPERRESOLVE',[status(thm)],[knaves_make_false_statements,33]) ).

cnf(44,plain,
    ( isa(asked,knight)
    | isa(other,knight) ),
    inference('REWRITE',[status(thm)],[36,42]) ).

cnf(46,plain,
    ( isa(asked,knight)
    | tell_the_truth(asked) ),
    inference('HYPERRESOLVE',[status(thm)],[prove_answer,44,35,19]) ).

cnf(48,plain,
    ~ tell_the_truth(asked),
    inference('UR-RESOLVE',[status(thm)],[statements_are_true_or_false,42]) ).

cnf(49,plain,
    isa(asked,knave),
    inference('REWRITE',[status(thm)],[19,48]) ).

cnf(51,plain,
    isa(asked,knight),
    inference('REWRITE',[status(thm)],[46,48]) ).

cnf(52,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[not_both_a_knight_and_knave,49]),51]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : PUZ035-1 : TPTP v8.1.0. Released v2.0.0.
% 0.04/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n019.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 : Sat May 28 22:10:11 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.46  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47  * 
% 0.20/0.47  * 
% 0.20/0.48  #<PACKAGE "SNARK-USER">
% 0.20/0.48  * 
% 0.20/0.48  SNARK-TPTP-OPTIONS
% 0.20/0.48  * 
% 0.20/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48   (USE-FACTORING :POS)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48  * 
% 0.20/0.48  "."
% 0.20/0.48  * 
% 0.20/0.48  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-28T22:10:11
% 0.20/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n019.cluster.edu at 2022-05-28T22:10:11
% 0.20/0.52  
% 0.20/0.52  
% 0.20/0.52  #||
% 0.20/0.52  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.52  % SZS output start Refutation
% See solution above
% 0.20/0.52  ||#
% 0.20/0.52  
% 0.20/0.52  ; Summary of computation:
% 0.20/0.52  ;        86 formulas have been input or derived (from 37 formulas).
% 0.20/0.52  ;        52 (60%) were retained.  Of these,
% 0.20/0.52  ;           35 (67%) were simplified or subsumed later,
% 0.20/0.52  ;           17 (33%) are still being kept.
% 0.20/0.52  ; 
% 0.20/0.52  ; Run time in seconds excluding printing time:
% 0.20/0.52  ;     0.003   8%   Read assertion file          (1 call)
% 0.20/0.52  ;     0.001   3%   Assert                       (15 calls)
% 0.20/0.52  ;     0.004  11%   Process new row              (83 calls)
% 0.20/0.52  ;     0.003   8%   Resolution                   (72 calls)
% 0.20/0.52  ;     0.000   0%   Paramodulation               (36 calls)
% 0.20/0.52  ;     0.000   0%   Factoring                    (16 calls)
% 0.20/0.52  ;     0.000   0%   Condensing                   (56 calls)
% 0.20/0.52  ;     0.001   3%   Forward subsumption          (56 calls)
% 0.20/0.52  ;     0.002   5%   Backward subsumption         (42 calls)
% 0.20/0.52  ;     0.000   0%   Clause clause subsumption    (30 calls)
% 0.20/0.52  ;     0.001   3%   Forward simplification       (67 calls)
% 0.20/0.52  ;     0.000   0%   Backward simplification      (52 calls)
% 0.20/0.52  ;     0.000   0%   Ordering                     (62 calls)
% 0.20/0.52  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.20/0.52  ;     0.000   0%   Purity testing               (1 call)
% 0.20/0.52  ;     0.022  59%   Other
% 0.20/0.52  ;     0.037        Total
% 0.20/0.52  ;     0.040        Real time
% 0.20/0.52  ; 
% 0.20/0.52  ; Term-hash-array has 20 terms in all.
% 0.20/0.52  ; Feature-vector-row-index has 7 entries (26 at peak, 42 added, 35 deleted).
% 0.20/0.52  ; Feature-vector-row-index has 25 nodes (136 at peak, 188 added, 163 deleted).
% 0.20/0.52  ;  Retrieved 27 possibly forward subsuming rows in 56 calls.
% 0.20/0.52  ;  Retrieved 13 possibly backward subsumed rows in 42 calls.
% 0.20/0.52  ; Path-index has 24 entries (26 at peak, 26 added, 2 deleted).
% 0.20/0.52  ; Path-index has 31 nodes (32 at peak, 32 added, 1 deleted).
% 0.20/0.52  ; Trie-index has 24 entries (26 at peak, 26 added, 2 deleted).
% 0.20/0.52  ; Trie-index has 33 nodes (35 at peak, 35 added, 2 deleted).
% 0.20/0.52  ; Retrieved 2 generalization terms in 7 calls.
% 0.20/0.52  ; Retrieved 9 instance terms in 9 calls.
% 0.20/0.52  ; Retrieved 386 unifiable terms in 244 calls.
% 0.20/0.52  ; 
% 0.20/0.52  ; The agenda of rows to process has 1 entry:
% 0.20/0.52  ;     1 with value 10
% 0.20/0.52  ; The agenda of rows to give has 4 entries:
% 0.20/0.52  ;     1 with value (4 9)           3 with value (4 10)
% 0.20/0.52  Evaluation took:
% 0.20/0.52    0.041 seconds of real time
% 0.20/0.52    0.032851 seconds of user run time
% 0.20/0.52    0.007982 seconds of system run time
% 0.20/0.52    0 calls to %EVAL
% 0.20/0.52    0 page faults and
% 0.20/0.52    3,340,344 bytes consed.
% 0.20/0.52  :PROOF-FOUND
% 0.20/0.52  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-28T22:10:11
% 0.20/0.52  :PROOF-FOUND
% 0.20/0.52  * 
%------------------------------------------------------------------------------