TSTP Solution File: PUZ021-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : PUZ021-1 : TPTP v8.1.0. Released v1.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:44 EDT 2022
% Result : Unsatisfiable 1.19s 1.39s
% Output : Refutation 1.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 12 unt; 7 nHn; 17 RR)
% Number of literals : 44 ( 0 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 31 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(not_knight_and_knave,axiom,
( ~ a_truth(knight(X),Y)
| ~ a_truth(knave(X),Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_knight_and_knave) ).
cnf(knight_or_knave,axiom,
( a_truth(knight(X),Y)
| a_truth(knave(X),Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knight_or_knave) ).
cnf(knights_tell_truth1,axiom,
( ~ a_truth(knight(X),Y)
| ~ says(X,Z)
| a_truth(Z,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knights_tell_truth1) ).
cnf(knaves_lie1,axiom,
( ~ a_truth(knave(X),Y)
| ~ says(X,Z)
| ~ a_truth(Z,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knaves_lie1) ).
cnf(knaves_lie2,axiom,
( ~ a_truth(knave(X),Y)
| says(X,Z)
| a_truth(Z,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knaves_lie2) ).
cnf(conjunction1,axiom,
( ~ a_truth(and(X,Y),Z)
| a_truth(X,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjunction1) ).
cnf(conjunction2,axiom,
( ~ a_truth(and(X,Y),Z)
| a_truth(Y,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjunction2) ).
cnf(prove_statement_exists1,negated_conjecture,
( ~ says(me,X)
| ~ a_truth(and(knave(me),rich(me)),X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_statement_exists1) ).
cnf(prove_statement_exists2,negated_conjecture,
( says(me,X)
| a_truth(and(knave(me),rich(me)),X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_statement_exists2) ).
cnf(16,plain,
( a_truth(and(knave(me),rich(me)),X)
| a_truth(knave(me),Y)
| a_truth(X,Y) ),
inference('HYPERRESOLVE',[status(thm)],[knights_tell_truth1,prove_statement_exists2,knight_or_knave]) ).
cnf(25,plain,
( a_truth(knave(me),X)
| a_truth(Y,X)
| a_truth(knave(me),Y) ),
inference('HYPERRESOLVE',[status(thm)],[conjunction1,16]) ).
cnf(160,plain,
( a_truth(knave(me),X)
| a_truth(X,X) ),
inference('FACTOR',[status(thm)],[25]) ).
cnf(162,plain,
a_truth(knave(me),knave(me)),
inference('CONDENSE',[status(thm)],[inference('FACTOR',[status(thm)],[25])]) ).
cnf(237,plain,
~ a_truth(knight(me),knave(me)),
inference('UR-RESOLVE',[status(thm)],[not_knight_and_knave,162]) ).
cnf(239,plain,
a_truth(and(knave(me),rich(me)),knave(me)),
inference('HYPERRESOLVE',[status(thm)],[knaves_lie1,162,prove_statement_exists2,162]) ).
cnf(252,plain,
says(me,knight(me)),
inference('UR-RESOLVE',[status(thm)],[knaves_lie2,237,162]) ).
cnf(254,plain,
~ a_truth(and(X,knight(me)),knave(me)),
inference('UR-RESOLVE',[status(thm)],[conjunction2,237]) ).
cnf(255,plain,
~ a_truth(and(knave(me),rich(me)),knight(me)),
inference('UR-RESOLVE',[status(thm)],[prove_statement_exists1,252]) ).
cnf(256,plain,
( a_truth(X,X)
| says(me,Y)
| a_truth(Y,X) ),
inference('HYPERRESOLVE',[status(thm)],[knaves_lie2,160]) ).
cnf(303,plain,
~ says(me,and(knave(me),rich(me))),
inference('UR-RESOLVE',[status(thm)],[knaves_lie1,239,162]) ).
cnf(347,plain,
says(me,and(X,knight(me))),
inference('UR-RESOLVE',[status(thm)],[knaves_lie2,254,162]) ).
cnf(507,plain,
~ a_truth(knave(me),knight(me)),
inference('UR-RESOLVE',[status(thm)],[knaves_lie2,255,303]) ).
cnf(509,plain,
a_truth(knight(me),knight(me)),
inference('UR-RESOLVE',[status(thm)],[256,255,303]) ).
cnf(513,plain,
~ a_truth(and(knave(me),X),knight(me)),
inference('UR-RESOLVE',[status(thm)],[conjunction1,507]) ).
cnf(824,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[knights_tell_truth1,513,509,347]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PUZ021-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/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 21:47:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-28T21:47:56
% 0.19/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-28T21:47:56
% 1.19/1.39
% 1.19/1.39
% 1.19/1.39 #||
% 1.19/1.39 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.19/1.39 % SZS output start Refutation
% See solution above
% 1.19/1.40 ||#
% 1.19/1.40
% 1.19/1.40 ; Summary of computation:
% 1.19/1.40 ; 5917 formulas have been input or derived (from 81 formulas).
% 1.19/1.40 ; 824 (14%) were retained. Of these,
% 1.19/1.40 ; 102 (12%) were simplified or subsumed later,
% 1.19/1.40 ; 722 (88%) are still being kept.
% 1.19/1.40 ;
% 1.19/1.40 ; Run time in seconds excluding printing time:
% 1.19/1.40 ; 0.002 0% Read assertion file (1 call)
% 1.19/1.40 ; 0.001 0% Assert (13 calls)
% 1.19/1.40 ; 0.074 8% Process new row (5,444 calls)
% 1.19/1.40 ; 0.128 14% Resolution (160 calls)
% 1.19/1.40 ; 0.002 0% Paramodulation (80 calls)
% 1.19/1.40 ; 0.000 0% Factoring (30 calls)
% 1.19/1.40 ; 0.061 7% Condensing (3,047 calls)
% 1.19/1.40 ; 0.319 35% Forward subsumption (3,046 calls)
% 1.19/1.40 ; 0.032 3% Backward subsumption (690 calls)
% 1.19/1.40 ; 0.151 16% Clause clause subsumption (43,897 calls)
% 1.19/1.40 ; 0.064 7% Forward simplification (5,413 calls)
% 1.19/1.40 ; 0.003 0% Backward simplification (824 calls)
% 1.19/1.40 ; 0.034 4% Ordering (18,517 calls)
% 1.19/1.40 ; 0.000 0% Sortal reasoning (32 calls)
% 1.19/1.40 ; 0.000 0% Purity testing (1 call)
% 1.19/1.40 ; 0.048 5% Other
% 1.19/1.40 ; 0.919 Total
% 1.19/1.40 ; 0.921 Real time
% 1.19/1.40 ;
% 1.19/1.40 ; Term-hash-array has 702 terms in all.
% 1.19/1.40 ; Feature-vector-row-index has 592 entries (592 at peak, 690 added, 98 deleted).
% 1.19/1.40 ; Feature-vector-row-index has 1,920 nodes (1,921 at peak, 2,391 added, 471 deleted).
% 1.19/1.40 ; Retrieved 70,213 possibly forward subsuming rows in 3,046 calls.
% 1.19/1.40 ; Retrieved 5,380 possibly backward subsumed rows in 690 calls.
% 1.19/1.40 ; Path-index has 647 entries (647 at peak, 734 added, 87 deleted).
% 1.19/1.40 ; Path-index has 245 nodes (245 at peak, 247 added, 2 deleted).
% 1.19/1.40 ; Trie-index has 647 entries (647 at peak, 734 added, 87 deleted).
% 1.19/1.40 ; Trie-index has 1,218 nodes (1,218 at peak, 1,375 added, 157 deleted).
% 1.19/1.40 ; Retrieved 2,971 generalization terms in 15,853 calls.
% 1.19/1.40 ; Retrieved 141 instance terms in 133 calls.
% 1.19/1.40 ; Retrieved 61,141 unifiable terms in 2,063 calls.
% 1.19/1.40 ;
% 1.19/1.40 ; The agenda of rows to process has 17 entries:
% 1.19/1.40 ; 1 with value 14 2 with value 18 3 with value 21
% 1.19/1.40 ; 7 with value 15 1 with value 19 1 with value 25
% 1.19/1.40 ; 1 with value 17 1 with value 20
% 1.19/1.40 ; The agenda of rows to give has 645 entries:
% 1.19/1.40 ; 6 with value (4 17) 30 with value (4 25) 19 with value (4 33)
% 1.19/1.40 ; 27 with value (4 18) 29 with value (4 26) 17 with value (4 34)
% 1.19/1.40 ; 20 with value (4 19) 44 with value (4 27) 8 with value (4 35)
% 1.19/1.40 ; 34 with value (4 20) 46 with value (4 28) 1 with value (4 36)
% 1.19/1.40 ; 61 with value (4 21) 81 with value (4 29) 8 with value (4 37)
% 1.19/1.40 ; 32 with value (4 22) 38 with value (4 30) 2 with value (4 38)
% 1.19/1.40 ; 41 with value (4 23) 28 with value (4 31) 2 with value (4 39)
% 1.19/1.40 ; 49 with value (4 24) 20 with value (4 32) 2 with value (4 41)
% 1.19/1.40 Evaluation took:
% 1.19/1.40 0.921 seconds of real time
% 1.19/1.40 0.797214 seconds of user run time
% 1.19/1.40 0.124154 seconds of system run time
% 1.19/1.40 [Run times include 0.035 seconds GC run time.]
% 1.19/1.40 0 calls to %EVAL
% 1.19/1.40 0 page faults and
% 1.19/1.40 95,521,288 bytes consed.
% 1.19/1.40 :PROOF-FOUND
% 1.19/1.40 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-28T21:47:57
% 1.19/1.40 :PROOF-FOUND
% 1.19/1.40 *
%------------------------------------------------------------------------------