TSTP Solution File: COM002-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : COM002-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n022.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:06 EDT 2022
% Result : Unsatisfiable 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 9
% Syntax : Number of clauses : 16 ( 13 unt; 1 nHn; 15 RR)
% Number of literals : 21 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(direct_success,axiom,
( ~ fails(X,Y)
| ~ follows(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',direct_success) ).
cnf(transitivity_of_success,axiom,
( ~ fails(X,Y)
| fails(X,Z)
| fails(Z,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_success) ).
cnf(goto_success,axiom,
( ~ fails(X,Y)
| ~ has(Y,goto(Z))
| ~ labels(Z,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goto_success) ).
cnf(label_state_3,hypothesis,
labels(loop,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',label_state_3) ).
cnf(transition_3_to_6,hypothesis,
follows(p6,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_3_to_6) ).
cnf(transition_6_to_7,hypothesis,
follows(p7,p6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_6_to_7) ).
cnf(transition_7_to_8,hypothesis,
follows(p8,p7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_7_to_8) ).
cnf(state_8,hypothesis,
has(p8,goto(loop)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_8) ).
cnf(prove_there_is_a_loop_through_p3,negated_conjecture,
fails(p3,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).
cnf(20,plain,
~ fails(p8,p7),
inference('UR-RESOLVE',[status(thm)],[direct_success,transition_7_to_8]) ).
cnf(21,plain,
~ fails(p7,p6),
inference('UR-RESOLVE',[status(thm)],[direct_success,transition_6_to_7]) ).
cnf(23,plain,
~ fails(p6,p3),
inference('UR-RESOLVE',[status(thm)],[direct_success,transition_3_to_6]) ).
cnf(30,plain,
~ fails(p3,p8),
inference('UR-RESOLVE',[status(thm)],[goto_success,state_8,label_state_3]) ).
cnf(32,plain,
~ fails(p8,p6),
inference('UR-RESOLVE',[status(thm)],[transitivity_of_success,21,20]) ).
cnf(42,plain,
fails(p8,p3),
inference('UR-RESOLVE',[status(thm)],[transitivity_of_success,30,prove_there_is_a_loop_through_p3]) ).
cnf(45,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[transitivity_of_success,32,23]),42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COM002-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 19:53:02 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 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.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T19:53:02
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n022.cluster.edu at 2022-06-16T19:53:02
% 0.19/0.50
% 0.19/0.50
% 0.19/0.50 #||
% 0.19/0.50 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.50 % SZS output start Refutation
% See solution above
% 0.19/0.50 ||#
% 0.19/0.50
% 0.19/0.50 ; Summary of computation:
% 0.19/0.50 ; 47 formulas have been input or derived (from 30 formulas).
% 0.19/0.50 ; 45 (96%) were retained. Of these,
% 0.19/0.50 ; 45 (100%) are still being kept.
% 0.19/0.50 ;
% 0.19/0.50 ; Run time in seconds excluding printing time:
% 0.19/0.50 ; 0.003 10% Read assertion file (1 call)
% 0.19/0.50 ; 0.001 3% Assert (19 calls)
% 0.19/0.50 ; 0.001 3% Process new row (46 calls)
% 0.19/0.50 ; 0.001 3% Resolution (58 calls)
% 0.19/0.50 ; 0.000 0% Paramodulation (29 calls)
% 0.19/0.50 ; 0.000 0% Condensing (5 calls)
% 0.19/0.50 ; 0.000 0% Forward subsumption (5 calls)
% 0.19/0.50 ; 0.000 0% Backward subsumption (5 calls)
% 0.19/0.50 ; 0.001 3% Forward simplification (46 calls)
% 0.19/0.50 ; 0.001 3% Backward simplification (45 calls)
% 0.19/0.50 ; 0.000 0% Ordering (2 calls)
% 0.19/0.50 ; 0.000 0% Sortal reasoning (32 calls)
% 0.19/0.50 ; 0.000 0% Purity testing (1 call)
% 0.19/0.50 ; 0.022 73% Other
% 0.19/0.50 ; 0.030 Total
% 0.19/0.50 ; 0.032 Real time
% 0.19/0.50 ;
% 0.19/0.50 ; Term-hash-array has 61 terms in all.
% 0.19/0.50 ; Feature-vector-row-index has 5 entries (5 at peak, 5 added, 0 deleted).
% 0.19/0.50 ; Feature-vector-row-index has 11 nodes (11 at peak, 11 added, 0 deleted).
% 0.19/0.50 ; Retrieved 0 possibly forward subsuming rows in 5 calls.
% 0.19/0.50 ; Retrieved 0 possibly backward subsumed rows in 5 calls.
% 0.19/0.50 ; Path-index has 77 entries (77 at peak, 77 added, 0 deleted).
% 0.19/0.50 ; Path-index has 152 nodes (152 at peak, 152 added, 0 deleted).
% 0.19/0.50 ; Trie-index has 77 entries (77 at peak, 77 added, 0 deleted).
% 0.19/0.50 ; Trie-index has 147 nodes (147 at peak, 147 added, 0 deleted).
% 0.19/0.50 ; Retrieved 2 generalization terms in 39 calls.
% 0.19/0.50 ; Retrieved 39 instance terms in 39 calls.
% 0.19/0.50 ; Retrieved 273 unifiable terms in 204 calls.
% 0.19/0.50 ;
% 0.19/0.50 ; The agenda of rows to process has 1 entry:
% 0.19/0.50 ; 1 with value 7
% 0.19/0.50 ; The agenda of rows to give has 15 entries:
% 0.19/0.50 ; 12 with value (4 6) 1 with value (4 8) 1 with value (4 9)
% 0.19/0.50 ; 1 with value (4 7)
% 0.19/0.50 Evaluation took:
% 0.19/0.50 0.032 seconds of real time
% 0.19/0.50 0.025169 seconds of user run time
% 0.19/0.50 0.006976 seconds of system run time
% 0.19/0.50 0 calls to %EVAL
% 0.19/0.50 0 page faults and
% 0.19/0.50 2,222,928 bytes consed.
% 0.19/0.50 :PROOF-FOUND
% 0.19/0.50 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T19:53:02
% 0.19/0.50 :PROOF-FOUND
% 0.19/0.50 *
%------------------------------------------------------------------------------