TSTP Solution File: NLP257-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : NLP257-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n027.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 05:22:30 EDT 2022
% Result : Unsatisfiable 0.44s 0.60s
% Output : Refutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 25
% Syntax : Number of clauses : 34 ( 27 unt; 0 nHn; 28 RR)
% Number of literals : 109 ( 0 equ; 77 neg)
% Maximal clause size : 37 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-1 aty)
% Number of variables : 41 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause52,axiom,
( ~ accessible_world(X,Y)
| ~ man(X,Z)
| man(Y,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause52) ).
cnf(clause72,negated_conjecture,
actual_world(skc8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause72) ).
cnf(clause73,negated_conjecture,
man(skc8,skc15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause73) ).
cnf(clause74,negated_conjecture,
forename(skc8,skc14),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause74) ).
cnf(clause75,negated_conjecture,
vincent_forename(skc8,skc14),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause75) ).
cnf(clause76,negated_conjecture,
event(skc8,skc13),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause76) ).
cnf(clause77,negated_conjecture,
present(skc8,skc13),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause77) ).
cnf(clause78,negated_conjecture,
think_believe_consider(skc8,skc13),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause78) ).
cnf(clause79,negated_conjecture,
jules_forename(skc8,skc11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause79) ).
cnf(clause80,negated_conjecture,
forename(skc8,skc11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause80) ).
cnf(clause81,negated_conjecture,
man(skc8,skc10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause81) ).
cnf(clause82,negated_conjecture,
state(skc8,skc9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause82) ).
cnf(clause83,negated_conjecture,
accessible_world(skc8,skc12),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause83) ).
cnf(clause84,negated_conjecture,
proposition(skc8,skc12),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause84) ).
cnf(clause85,negated_conjecture,
of(skc8,skc14,skc15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause85) ).
cnf(clause86,negated_conjecture,
agent(skc8,skc13,skc15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause86) ).
cnf(clause87,negated_conjecture,
theme(skc8,skc13,skc12),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause87) ).
cnf(clause88,negated_conjecture,
of(skc8,skc11,skc10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause88) ).
cnf(clause89,negated_conjecture,
be(skc8,skc9,skc10,skc10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause89) ).
cnf(clause90,negated_conjecture,
( ~ man(skc12,X)
| smoke(skc12,skf2(Y)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause90) ).
cnf(clause91,negated_conjecture,
( ~ man(skc12,X)
| present(skc12,skf2(Y)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause91) ).
cnf(clause92,negated_conjecture,
( ~ man(skc12,X)
| event(skc12,skf2(Y)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause92) ).
cnf(clause93,negated_conjecture,
( ~ man(skc12,X)
| agent(skc12,skf2(X),X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause93) ).
cnf(clause94,negated_conjecture,
( ~ state(X,Y)
| ~ be(X,Y,Z,Z)
| ~ man(X,Z)
| ~ of(X,U,Z)
| ~ jules_forename(X,U)
| ~ forename(X,U)
| ~ jules_forename(X,V)
| ~ forename(X,V)
| ~ smoke(W,X1)
| ~ present(W,X1)
| ~ agent(W,X1,Y1)
| ~ event(W,X1)
| ~ man(X,Y1)
| ~ of(X,V,Y1)
| ~ proposition(X,W)
| ~ accessible_world(X,W)
| ~ accessible_world(X,Z1)
| ~ proposition(X,Z1)
| ~ theme(X,U1,Z1)
| ~ event(X,U1)
| ~ present(X,U1)
| ~ think_believe_consider(X,U1)
| ~ man(X,V1)
| ~ agent(X,U1,V1)
| ~ agent(X,W1,V1)
| ~ forename(X,X2)
| ~ vincent_forename(X,X2)
| ~ of(X,X2,V1)
| ~ think_believe_consider(X,W1)
| ~ present(X,W1)
| ~ event(X,W1)
| ~ theme(X,W1,W)
| ~ actual_world(X)
| man(Z1,skf4(Z1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause94) ).
cnf(clause95,negated_conjecture,
( ~ state(X,Y)
| ~ be(X,Y,Z,Z)
| ~ man(X,Z)
| ~ of(X,U,Z)
| ~ jules_forename(X,U)
| ~ forename(X,U)
| ~ jules_forename(X,V)
| ~ forename(X,V)
| ~ smoke(W,X1)
| ~ present(W,X1)
| ~ agent(W,X1,Y1)
| ~ event(W,X1)
| ~ man(X,Y1)
| ~ of(X,V,Y1)
| ~ proposition(X,W)
| ~ accessible_world(X,W)
| ~ smoke(Z1,U1)
| ~ present(Z1,U1)
| ~ agent(Z1,U1,skf4(Z1))
| ~ event(Z1,U1)
| ~ accessible_world(X,Z1)
| ~ proposition(X,Z1)
| ~ theme(X,V1,Z1)
| ~ event(X,V1)
| ~ present(X,V1)
| ~ think_believe_consider(X,V1)
| ~ man(X,W1)
| ~ agent(X,V1,W1)
| ~ agent(X,X2,W1)
| ~ forename(X,Y2)
| ~ vincent_forename(X,Y2)
| ~ of(X,Y2,W1)
| ~ think_believe_consider(X,X2)
| ~ present(X,X2)
| ~ event(X,X2)
| ~ theme(X,X2,W)
| ~ actual_world(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause95) ).
cnf(111,plain,
man(skc12,skc15),
inference('HYPERRESOLVE',[status(thm)],[clause52,clause83,clause73]) ).
cnf(112,plain,
man(skc12,skc10),
inference('HYPERRESOLVE',[status(thm)],[clause52,clause83,clause81]) ).
cnf(151,plain,
event(skc12,skf2(X)),
inference('HYPERRESOLVE',[status(thm)],[clause92,111]) ).
cnf(152,plain,
present(skc12,skf2(X)),
inference('HYPERRESOLVE',[status(thm)],[clause91,111]) ).
cnf(153,plain,
smoke(skc12,skf2(X)),
inference('HYPERRESOLVE',[status(thm)],[clause90,111]) ).
cnf(155,plain,
agent(skc12,skf2(skc10),skc10),
inference('HYPERRESOLVE',[status(thm)],[clause93,112]) ).
cnf(316,plain,
man(skc12,skf4(skc12)),
inference('HYPERRESOLVE',[status(thm)],[clause94,155,clause82,clause89,clause81,clause88,clause79,clause80,clause79,clause80,153,152,151,clause81,clause88,clause84,clause83,clause83,clause84,clause87,clause76,clause77,clause78,clause73,clause86,clause86,clause74,clause75,clause85,clause78,clause77,clause76,clause87,clause72]) ).
cnf(317,plain,
~ agent(skc12,skf2(X),skf4(skc12)),
inference('UR-RESOLVE',[status(thm)],[clause95,155,clause82,clause89,clause81,clause88,clause79,clause80,clause79,clause80,153,152,151,clause81,clause88,clause84,clause83,153,152,151,clause83,clause84,clause87,clause76,clause77,clause78,clause73,clause86,clause86,clause74,clause75,clause85,clause78,clause77,clause76,clause87,clause72]) ).
cnf(371,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[clause93,316]),317]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NLP257-1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13 % Command : run-snark %s %d
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 30 17:52:51 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 *
% 0.20/0.46 *
% 0.20/0.47 #<PACKAGE "SNARK-USER">
% 0.20/0.47 *
% 0.20/0.47 SNARK-TPTP-OPTIONS
% 0.20/0.47 *
% 0.20/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47 (USE-FACTORING :POS)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47 *
% 0.20/0.47 "."
% 0.20/0.47 *
% 0.20/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-30T17:52:52
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n027.cluster.edu at 2022-06-30T17:52:52
% 0.44/0.60
% 0.44/0.60
% 0.44/0.60 #||
% 0.44/0.60 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.44/0.60 % SZS output start Refutation
% See solution above
% 0.44/0.61 ||#
% 0.44/0.61
% 0.44/0.61 ; Summary of computation:
% 0.44/0.61 ; 715 formulas have been input or derived (from 317 formulas).
% 0.44/0.61 ; 371 (52%) were retained. Of these,
% 0.44/0.61 ; 3 ( 1%) were simplified or subsumed later,
% 0.44/0.61 ; 368 (99%) are still being kept.
% 0.44/0.61 ;
% 0.44/0.61 ; Run time in seconds excluding printing time:
% 0.44/0.61 ; 0.017 13% Read assertion file (1 call)
% 0.44/0.61 ; 0.006 5% Assert (95 calls)
% 0.44/0.61 ; 0.018 14% Process new row (655 calls)
% 0.44/0.61 ; 0.050 38% Resolution (632 calls)
% 0.44/0.61 ; 0.003 2% Paramodulation (316 calls)
% 0.44/0.61 ; 0.001 1% Condensing (77 calls)
% 0.44/0.61 ; 0.001 1% Forward subsumption (77 calls)
% 0.44/0.61 ; 0.001 1% Backward subsumption (77 calls)
% 0.44/0.61 ; 0.000 0% Clause clause subsumption (1 call)
% 0.44/0.61 ; 0.004 3% Forward simplification (652 calls)
% 0.44/0.61 ; 0.004 3% Backward simplification (371 calls)
% 0.44/0.61 ; 0.000 0% Ordering (3 calls)
% 0.44/0.61 ; 0.000 0% Sortal reasoning (32 calls)
% 0.44/0.61 ; 0.000 0% Purity testing (1 call)
% 0.44/0.61 ; 0.028 21% Other
% 0.44/0.61 ; 0.133 Total
% 0.44/0.61 ; 0.135 Real time
% 0.44/0.61 ;
% 0.44/0.61 ; Term-hash-array has 462 terms in all.
% 0.44/0.61 ; Feature-vector-row-index has 74 entries (77 at peak, 77 added, 3 deleted).
% 0.44/0.61 ; Feature-vector-row-index has 113 nodes (122 at peak, 122 added, 9 deleted).
% 0.44/0.61 ; Retrieved 54 possibly forward subsuming rows in 77 calls.
% 0.44/0.61 ; Retrieved 35 possibly backward subsumed rows in 77 calls.
% 0.44/0.61 ; Path-index has 466 entries (466 at peak, 470 added, 4 deleted).
% 0.44/0.61 ; Path-index has 461 nodes (461 at peak, 461 added, 0 deleted).
% 0.44/0.61 ; Trie-index has 466 entries (466 at peak, 470 added, 4 deleted).
% 0.44/0.61 ; Trie-index has 527 nodes (527 at peak, 527 added, 0 deleted).
% 0.44/0.61 ; Retrieved 270 generalization terms in 602 calls.
% 0.44/0.61 ; Retrieved 296 instance terms in 293 calls.
% 0.44/0.61 ; Retrieved 23,374 unifiable terms in 11,240 calls.
% 0.44/0.61 ;
% 0.44/0.61 ; The agenda of rows to give has 54 entries:
% 0.44/0.61 ; 53 with value (4 10) 1 with value (4 11)
% 0.44/0.61 Evaluation took:
% 0.44/0.61 0.135 seconds of real time
% 0.44/0.61 0.117178 seconds of user run time
% 0.44/0.61 0.018738 seconds of system run time
% 0.44/0.61 0 calls to %EVAL
% 0.44/0.61 0 page faults and
% 0.44/0.61 9,925,864 bytes consed.
% 0.44/0.61 :PROOF-FOUND
% 0.44/0.61 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-30T17:52:52
% 0.44/0.61 :PROOF-FOUND
% 0.44/0.61 *
%------------------------------------------------------------------------------