TSTP Solution File: PLA002-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : PLA002-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n020.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 17:32:03 EDT 2022
% Result : Unsatisfiable 20.17s 20.42s
% Output : Refutation 20.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 28 ( 17 unt; 1 nHn; 17 RR)
% Number of literals : 48 ( 0 equ; 24 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 42 ( 30 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(warm_or_cold,hypothesis,
( warm(X)
| cold(Y)
| ~ situation(X)
| ~ situation(Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',warm_or_cold) ).
cnf(drive_b_to_a,hypothesis,
( ~ at(b,X)
| at(a,drive(a,X))
| ~ situation(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',drive_b_to_a) ).
cnf(cross_river_c_to_b,hypothesis,
( ~ cold(X)
| ~ at(c,X)
| at(b,skate(b,X))
| ~ situation(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cross_river_c_to_b) ).
cnf(climb_mountain_d_to_b,hypothesis,
( ~ warm(X)
| ~ at(d,X)
| at(b,climb(b,X))
| ~ situation(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',climb_mountain_d_to_b) ).
cnf(go_d_to_c,hypothesis,
( ~ at(d,X)
| at(c,go(c,X))
| ~ situation(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_d_to_c) ).
cnf(go_f_to_d,hypothesis,
( ~ at(f,X)
| at(d,go(d,X))
| ~ situation(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_f_to_d) ).
cnf(initial_situation,hypothesis,
situation(s0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_situation) ).
cnf(drive_situation,hypothesis,
( ~ situation(X)
| situation(drive(Y,X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',drive_situation) ).
cnf(climb_situation,hypothesis,
( ~ situation(X)
| situation(climb(Y,X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',climb_situation) ).
cnf(skate_situation,hypothesis,
( ~ situation(X)
| situation(skate(Y,X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',skate_situation) ).
cnf(go_situation,hypothesis,
( ~ situation(X)
| situation(go(Y,X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_situation) ).
cnf(initial,hypothesis,
at(f,s0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial) ).
cnf(prove_you_can_get_to_a_in_a_situation,negated_conjecture,
( ~ at(a,X)
| ~ situation(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_you_can_get_to_a_in_a_situation) ).
cnf(29,plain,
situation(go(X,s0)),
inference('HYPERRESOLVE',[status(thm)],[go_situation,initial_situation]) ).
cnf(31,plain,
at(d,go(d,s0)),
inference('HYPERRESOLVE',[status(thm)],[go_f_to_d,initial,initial_situation]) ).
cnf(81,plain,
situation(go(X,go(Y,s0))),
inference('HYPERRESOLVE',[status(thm)],[go_situation,29]) ).
cnf(83,plain,
situation(climb(X,go(Y,s0))),
inference('HYPERRESOLVE',[status(thm)],[climb_situation,29]) ).
cnf(98,plain,
at(c,go(c,go(d,s0))),
inference('HYPERRESOLVE',[status(thm)],[go_d_to_c,31,29]) ).
cnf(862,plain,
situation(skate(X,go(Y,go(Z,s0)))),
inference('HYPERRESOLVE',[status(thm)],[skate_situation,81]) ).
cnf(984,plain,
situation(drive(X,climb(Y,go(Z,s0)))),
inference('HYPERRESOLVE',[status(thm)],[drive_situation,83]) ).
cnf(18262,plain,
situation(drive(X,skate(Y,go(Z,go(U,s0))))),
inference('HYPERRESOLVE',[status(thm)],[drive_situation,862]) ).
cnf(21642,plain,
~ at(a,drive(X,climb(Y,go(Z,s0)))),
inference('UR-RESOLVE',[status(thm)],[prove_you_can_get_to_a_in_a_situation,984]) ).
cnf(25344,plain,
~ at(b,climb(X,go(Y,s0))),
inference('UR-RESOLVE',[status(thm)],[drive_b_to_a,21642,83]) ).
cnf(25357,plain,
~ warm(go(d,s0)),
inference('UR-RESOLVE',[status(thm)],[climb_mountain_d_to_b,25344,31,29]) ).
cnf(25358,plain,
cold(go(X,go(Y,s0))),
inference('UR-RESOLVE',[status(thm)],[warm_or_cold,25357,29,81]) ).
cnf(25508,plain,
at(b,skate(b,go(c,go(d,s0)))),
inference('HYPERRESOLVE',[status(thm)],[cross_river_c_to_b,25358,98,81]) ).
cnf(29067,plain,
~ at(a,drive(X,skate(Y,go(Z,go(U,s0))))),
inference('UR-RESOLVE',[status(thm)],[prove_you_can_get_to_a_in_a_situation,18262]) ).
cnf(29895,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[drive_b_to_a,25508,862]),29067]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PLA002-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n020.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 : Tue May 31 19:39:08 EDT 2022
% 0.13/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-05-31T19:39:08
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n020.cluster.edu at 2022-05-31T19:39:08
% 20.17/20.42
% 20.17/20.42
% 20.17/20.42 #||
% 20.17/20.42 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 20.17/20.42 % SZS output start Refutation
% See solution above
% 20.17/20.42 ||#
% 20.17/20.42
% 20.17/20.42 ; Summary of computation:
% 20.17/20.42 ; 620268 formulas have been input or derived (from 1253 formulas).
% 20.17/20.42 ; 29895 ( 5%) were retained. Of these,
% 20.17/20.42 ; 24345 (81%) were simplified or subsumed later,
% 20.17/20.42 ; 5550 (19%) are still being kept.
% 20.17/20.42 ;
% 20.17/20.42 ; Run time in seconds excluding printing time:
% 20.17/20.42 ; 0.005 0% Read assertion file (1 call)
% 20.17/20.42 ; 0.000 0% Assert (23 calls)
% 20.17/20.42 ; 2.627 13% Process new row (620,253 calls)
% 20.17/20.42 ; 5.224 26% Resolution (2,504 calls)
% 20.17/20.42 ; 0.009 0% Paramodulation (1,252 calls)
% 20.17/20.42 ; 0.001 0% Factoring (87 calls)
% 20.17/20.42 ; 0.142 1% Condensing (24,519 calls)
% 20.17/20.42 ; 1.327 7% Forward subsumption (24,519 calls)
% 20.17/20.42 ; 1.864 9% Backward subsumption (24,364 calls)
% 20.17/20.42 ; 0.258 1% Clause clause subsumption (205,057 calls)
% 20.17/20.42 ; 5.664 28% Forward simplification (620,252 calls)
% 20.17/20.42 ; 1.310 7% Backward simplification (29,895 calls)
% 20.17/20.42 ; 0.000 0% Ordering (739 calls)
% 20.17/20.42 ; 0.000 0% Sortal reasoning (32 calls)
% 20.17/20.42 ; 0.000 0% Purity testing (1 call)
% 20.17/20.42 ; 1.509 8% Other
% 20.17/20.42 ; 19.940 Total
% 20.17/20.42 ; 19.948 Real time
% 20.17/20.42 ;
% 20.17/20.42 ; Term-hash-array has 11,251 terms in all.
% 20.17/20.42 ; Feature-vector-row-index has 19 entries (24,362 at peak, 24,364 added, 24,345 deleted).
% 20.17/20.42 ; Feature-vector-row-index has 76 nodes (17,541 at peak, 17,547 added, 17,471 deleted).
% 20.17/20.42 ; Retrieved 130,699 possibly forward subsuming rows in 24,519 calls.
% 20.17/20.42 ; Retrieved 74,359 possibly backward subsumed rows in 24,364 calls.
% 20.17/20.42 ; Path-index has 10,474 entries (10,474 at peak, 11,414 added, 940 deleted).
% 20.17/20.42 ; Path-index has 47,417 nodes (47,417 at peak, 47,737 added, 320 deleted).
% 20.17/20.42 ; Trie-index has 10,474 entries (10,474 at peak, 11,414 added, 940 deleted).
% 20.17/20.42 ; Trie-index has 28,499 nodes (28,499 at peak, 28,991 added, 492 deleted).
% 20.17/20.42 ; Retrieved 590,204 generalization terms in 1,181,999 calls.
% 20.17/20.42 ; Retrieved 5,996 instance terms in 5,530 calls.
% 20.17/20.42 ; Retrieved 3,095,134 unifiable terms in 50,056 calls.
% 20.17/20.42 ;
% 20.17/20.42 ; The agenda of rows to process has 4 entries:
% 20.17/20.42 ; 4 with value 25
% 20.17/20.42 ; The agenda of rows to give has 4384 entries:
% 20.17/20.42 ; 625 with value (4 21) 3125 with value (4 23) 1 with value (4 25)
% 20.17/20.42 ; 625 with value (4 22) 8 with value (4 24)
% 20.17/20.42 Evaluation took:
% 20.17/20.42 19.949 seconds of real time
% 20.17/20.42 17.749743 seconds of user run time
% 20.17/20.42 2.192824 seconds of system run time
% 20.17/20.42 [Run times include 1.96 seconds GC run time.]
% 20.17/20.42 0 calls to %EVAL
% 20.17/20.42 0 page faults and
% 20.17/20.42 2,158,230,104 bytes consed.
% 20.17/20.42 :PROOF-FOUND
% 20.17/20.42 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-31T19:39:28
% 20.17/20.42 :PROOF-FOUND
% 20.17/20.42 *
%------------------------------------------------------------------------------