TSTP Solution File: COM002_2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : COM002_2 : TPTP v8.1.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n012.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 : Fri Jul 15 01:42:05 EDT 2022
% Result : Theorem 0.21s 0.51s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 9
% Syntax : Number of formulae : 16 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 16 ( 11 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 26 ( 26 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 13 ( 12 usr; 8 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 8 ( 0 sgn 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
tff(1,axiom,
! [X: state,Y: state] :
( ~ fails(X,Y)
| ~ follows(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',direct_success) ).
tff(2,axiom,
! [X: state,Y: state,Z: state] :
( ~ fails(X,Y)
| fails(X,Z)
| fails(Z,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_success) ).
tff(3,axiom,
! [X: state,Y: state,Z: label] :
( ~ fails(X,Y)
| ~ has(Y,goto(Z))
| ~ labels(Z,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goto_success) ).
tff(8,hypothesis,
labels(loop,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',label_state_3) ).
tff(13,hypothesis,
follows(p6,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_3_to_6) ).
tff(15,hypothesis,
follows(p7,p6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_6_to_7) ).
tff(17,hypothesis,
follows(p8,p7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_7_to_8) ).
tff(18,hypothesis,
has(p8,goto(loop)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_8) ).
tff(19,negated_conjecture,
fails(p3,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).
tff(20,plain,
~ fails(p8,p7),
inference('UR-RESOLVE',[status(thm)],[1,17]) ).
tff(21,plain,
~ fails(p7,p6),
inference('UR-RESOLVE',[status(thm)],[1,15]) ).
tff(23,plain,
~ fails(p6,p3),
inference('UR-RESOLVE',[status(thm)],[1,13]) ).
tff(30,plain,
~ fails(p3,p8),
inference('UR-RESOLVE',[status(thm)],[3,18,8]) ).
tff(32,plain,
~ fails(p8,p6),
inference('UR-RESOLVE',[status(thm)],[2,21,20]) ).
tff(42,plain,
fails(p8,p3),
inference('UR-RESOLVE',[status(thm)],[2,30,19]) ).
cnf(45,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[2,32,23]),42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : COM002_2 : TPTP v8.1.0. Released v5.0.0.
% 0.04/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n012.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 : Thu Jun 16 19:08:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 *
% 0.21/0.47 *
% 0.21/0.47 #<PACKAGE "SNARK-USER">
% 0.21/0.47 *
% 0.21/0.47 SNARK-TPTP-OPTIONS
% 0.21/0.47 *
% 0.21/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.47 (USE-FACTORING :POS)
% 0.21/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.48 *
% 0.21/0.48 "."
% 0.21/0.48 *
% 0.21/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T19:08:39
% 0.21/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n012.cluster.edu at 2022-06-16T19:08:39
% 0.21/0.51
% 0.21/0.51
% 0.21/0.51 #||
% 0.21/0.51 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.51 % SZS output start Refutation
% See solution above
% 0.21/0.51 ||#
% 0.21/0.51
% 0.21/0.51 ; Summary of computation:
% 0.21/0.51 ; 47 formulas have been input or derived (from 30 formulas).
% 0.21/0.51 ; 45 (96%) were retained. Of these,
% 0.21/0.51 ; 45 (100%) are still being kept.
% 0.21/0.51 ;
% 0.21/0.51 ; Run time in seconds excluding printing time:
% 0.21/0.51 ; 0.005 15% Read assertion file (1 call)
% 0.21/0.51 ; 0.001 3% Assert (19 calls)
% 0.21/0.51 ; 0.001 3% Process new row (46 calls)
% 0.21/0.51 ; 0.003 9% Resolution (58 calls)
% 0.21/0.51 ; 0.000 0% Paramodulation (29 calls)
% 0.21/0.51 ; 0.000 0% Condensing (5 calls)
% 0.21/0.51 ; 0.000 0% Forward subsumption (5 calls)
% 0.21/0.51 ; 0.000 0% Backward subsumption (5 calls)
% 0.21/0.51 ; 0.001 3% Forward simplification (46 calls)
% 0.21/0.51 ; 0.000 0% Backward simplification (45 calls)
% 0.21/0.51 ; 0.000 0% Ordering (2 calls)
% 0.21/0.51 ; 0.000 0% Sortal reasoning (38 calls)
% 0.21/0.51 ; 0.000 0% Purity testing (1 call)
% 0.21/0.51 ; 0.022 67% Other
% 0.21/0.51 ; 0.033 Total
% 0.21/0.51 ; 0.035 Real time
% 0.21/0.51 ;
% 0.21/0.51 ; Term-hash-array has 61 terms in all.
% 0.21/0.51 ; Feature-vector-row-index has 5 entries (5 at peak, 5 added, 0 deleted).
% 0.21/0.51 ; Feature-vector-row-index has 12 nodes (12 at peak, 12 added, 0 deleted).
% 0.21/0.51 ; Retrieved 0 possibly forward subsuming rows in 5 calls.
% 0.21/0.51 ; Retrieved 0 possibly backward subsumed rows in 5 calls.
% 0.21/0.51 ; Path-index has 77 entries (77 at peak, 77 added, 0 deleted).
% 0.21/0.51 ; Path-index has 152 nodes (152 at peak, 152 added, 0 deleted).
% 0.21/0.51 ; Trie-index has 77 entries (77 at peak, 77 added, 0 deleted).
% 0.21/0.51 ; Trie-index has 147 nodes (147 at peak, 147 added, 0 deleted).
% 0.21/0.51 ; Retrieved 2 generalization terms in 39 calls.
% 0.21/0.51 ; Retrieved 39 instance terms in 39 calls.
% 0.21/0.51 ; Retrieved 273 unifiable terms in 204 calls.
% 0.21/0.51 ;
% 0.21/0.51 ; The agenda of rows to process has 1 entry:
% 0.21/0.51 ; 1 with value 7
% 0.21/0.51 ; The agenda of rows to give has 15 entries:
% 0.21/0.51 ; 12 with value (4 6) 1 with value (4 8) 1 with value (4 9)
% 0.21/0.51 ; 1 with value (4 7)
% 0.21/0.51 Evaluation took:
% 0.21/0.51 0.036 seconds of real time
% 0.21/0.51 0.029836 seconds of user run time
% 0.21/0.51 0.00601 seconds of system run time
% 0.21/0.51 0 calls to %EVAL
% 0.21/0.51 0 page faults and
% 0.21/0.51 2,398,944 bytes consed.
% 0.21/0.51 :PROOF-FOUND
% 0.21/0.51 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T19:08:39
% 0.21/0.51 :PROOF-FOUND
% 0.21/0.51 *
%------------------------------------------------------------------------------