TSTP Solution File: GRA004+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRA004+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n032.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 : Sat Jul 16 07:21:53 EDT 2022
% Result : Theorem 0.14s 0.52s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 26 ( 12 unt; 7 nHn; 26 RR)
% Number of literals : 55 ( 20 equ; 25 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 37 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(15,axiom,
( ~ path(X,Y,Z)
| ~ on_path(U,Z)
| edge(U) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',on_path_properties) ).
cnf(25,axiom,
( sequential(X,Y)
| ~ edge(X)
| ~ edge(Y)
| X = Y
| head_of(X) != tail_of(Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',sequential_defn) ).
cnf(27,axiom,
( ~ path(X,Y,Z)
| precedes(U,V,Z)
| ~ on_path(U,Z)
| ~ on_path(V,Z)
| ~ sequential(U,W)
| ~ precedes(W,V,Z) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',precedes_defn) ).
cnf(28,axiom,
( ~ path(X,Y,Z)
| ~ precedes(U,V,Z)
| on_path(U,Z) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',precedes_properties) ).
cnf(29,axiom,
( ~ path(X,Y,Z)
| ~ precedes(U,V,Z)
| on_path(V,Z) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',precedes_properties) ).
cnf(33,axiom,
( ~ shortest_path(X,Y,Z)
| path(X,Y,Z) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',shortest_path_defn) ).
cnf(38,axiom,
( ~ shortest_path(X,Y,Z)
| ~ precedes(U,V,Z)
| tail_of(W) != tail_of(U)
| head_of(W) != head_of(V) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',shortest_path_properties) ).
cnf(39,axiom,
( ~ shortest_path(X,Y,Z)
| ~ precedes(U,V,Z)
| ~ precedes(V,U,Z) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',shortest_path_properties) ).
cnf(54,negated_conjecture,
shortest_path('SKOLEMAAAN9','SKOLEMAAAN10','SKOLEMAAAN13'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',shortest_path_properties_lemma) ).
cnf(55,negated_conjecture,
precedes('SKOLEMAAAN11','SKOLEMAAAN12','SKOLEMAAAN13'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',shortest_path_properties_lemma) ).
cnf(56,negated_conjecture,
( tail_of('SKOLEMAAAN14') = tail_of('SKOLEMAAAN11')
| head_of('SKOLEMAAAN12') = tail_of('SKOLEMAAAN11')
| head_of('SKOLEMAAAN12') = head_of('SKOLEMAAAN11') ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',shortest_path_properties_lemma) ).
cnf(57,negated_conjecture,
( head_of('SKOLEMAAAN14') = head_of('SKOLEMAAAN12')
| head_of('SKOLEMAAAN12') = tail_of('SKOLEMAAAN11')
| head_of('SKOLEMAAAN12') = head_of('SKOLEMAAAN11') ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',shortest_path_properties_lemma) ).
cnf(61,plain,
path('SKOLEMAAAN9','SKOLEMAAAN10','SKOLEMAAAN13'),
inference('HYPERRESOLVE',[status(thm)],[33,54]) ).
cnf(62,plain,
~ precedes(X,X,'SKOLEMAAAN13'),
inference('UR-RESOLVE',[status(thm)],[39,54]) ).
cnf(68,plain,
head_of('SKOLEMAAAN12') != head_of('SKOLEMAAAN11'),
inference('UR-RESOLVE',[status(thm)],[38,54,55,theory(equality)]) ).
cnf(69,plain,
( tail_of('SKOLEMAAAN14') = tail_of('SKOLEMAAAN11')
| head_of('SKOLEMAAAN12') = tail_of('SKOLEMAAAN11') ),
inference('REWRITE',[status(thm)],[56,68]) ).
cnf(70,plain,
( head_of('SKOLEMAAAN14') = head_of('SKOLEMAAAN12')
| head_of('SKOLEMAAAN12') = tail_of('SKOLEMAAAN11') ),
inference('REWRITE',[status(thm)],[57,68]) ).
cnf(87,plain,
on_path('SKOLEMAAAN12','SKOLEMAAAN13'),
inference('HYPERRESOLVE',[status(thm)],[29,61,55]) ).
cnf(88,plain,
on_path('SKOLEMAAAN11','SKOLEMAAAN13'),
inference('HYPERRESOLVE',[status(thm)],[28,61,55]) ).
cnf(103,plain,
edge('SKOLEMAAAN12'),
inference('HYPERRESOLVE',[status(thm)],[15,87,61]) ).
cnf(104,plain,
~ sequential('SKOLEMAAAN12','SKOLEMAAAN11'),
inference('UR-RESOLVE',[status(thm)],[27,87,61,62,87,55]) ).
cnf(107,plain,
edge('SKOLEMAAAN11'),
inference('HYPERRESOLVE',[status(thm)],[15,88,61]) ).
cnf(119,plain,
( head_of('SKOLEMAAAN14') = head_of('SKOLEMAAAN12')
| 'SKOLEMAAAN12' = 'SKOLEMAAAN11' ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[25,107,103,70]),104]) ).
cnf(175,plain,
( 'SKOLEMAAAN12' = 'SKOLEMAAAN11'
| head_of('SKOLEMAAAN12') = tail_of('SKOLEMAAAN11') ),
inference('HYPERRESOLVE',[status(thm)],[38,119,54,55,69]) ).
cnf(227,plain,
'SKOLEMAAAN12' = 'SKOLEMAAAN11',
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[25,175,103,107]),104]) ).
cnf(228,plain,
$false,
inference('REWRITE',[status(thm)],[55,62,227,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : GRA004+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.05/0.10 % Command : run-snark %s %d
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Tue May 31 03:36:58 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.14/0.36 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.37 *
% 0.14/0.37 *
% 0.14/0.38 #<PACKAGE "SNARK-USER">
% 0.14/0.38 *
% 0.14/0.38 SNARK-TPTP-OPTIONS
% 0.14/0.38 *
% 0.14/0.38 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.14/0.38 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.14/0.38 (USE-FACTORING :POS)
% 0.14/0.38 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.14/0.38 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.14/0.38 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.14/0.38 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.14/0.38 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.14/0.38 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.14/0.38 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.14/0.38 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.14/0.38 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.14/0.38 (DECLARE-TPTP-SYMBOLS2))
% 0.14/0.38 *
% 0.14/0.38 "."
% 0.14/0.38 *
% 0.14/0.38 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-31T03:36:58
% 0.14/0.38 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n032.cluster.edu at 2022-05-31T03:36:58
% 0.14/0.39 WARNING:
% 0.14/0.39 #:|complete| is a proposition that occurs only negatively; disabling rows that contain it.
% 0.14/0.52
% 0.14/0.52
% 0.14/0.52 #||
% 0.14/0.52 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.52 % SZS output start Refutation
% See solution above
% 0.14/0.53 ||#
% 0.14/0.53
% 0.14/0.53 ; Summary of computation:
% 0.14/0.53 ; 563 formulas have been input or derived (from 132 formulas).
% 0.14/0.53 ; 228 (40%) were retained. Of these,
% 0.14/0.53 ; 94 (41%) were simplified or subsumed later,
% 0.14/0.53 ; 134 (59%) are still being kept.
% 0.14/0.53 ;
% 0.14/0.53 ; Run time in seconds excluding printing time:
% 0.14/0.53 ; 0.004 3% Read assertion file (1 call)
% 0.14/0.53 ; 0.002 1% Assert (18 calls)
% 0.14/0.53 ; 0.018 12% Process new row (367 calls)
% 0.14/0.53 ; 0.084 58% Resolution (262 calls)
% 0.14/0.53 ; 0.001 1% Paramodulation (131 calls)
% 0.14/0.53 ; 0.000 0% Factoring (10 calls)
% 0.14/0.53 ; 0.000 0% Condensing (138 calls)
% 0.14/0.53 ; 0.006 4% Forward subsumption (138 calls)
% 0.14/0.53 ; 0.004 3% Backward subsumption (132 calls)
% 0.14/0.53 ; 0.000 0% Clause clause subsumption (63 calls)
% 0.14/0.53 ; 0.005 3% Forward simplification (357 calls)
% 0.14/0.53 ; 0.005 3% Backward simplification (228 calls)
% 0.14/0.53 ; 0.002 1% Ordering (331 calls)
% 0.14/0.53 ; 0.000 0% Sortal reasoning (32 calls)
% 0.14/0.53 ; 0.000 0% Purity testing (1 call)
% 0.14/0.53 ; 0.014 10% Other
% 0.14/0.53 ; 0.145 Total
% 0.14/0.53 ; 0.152 Real time
% 0.14/0.53 ;
% 0.14/0.53 ; Term-hash-array has 402 terms in all.
% 0.14/0.53 ; Feature-vector-row-index has 78 entries (124 at peak, 132 added, 54 deleted).
% 0.14/0.53 ; Feature-vector-row-index has 581 nodes (1,128 at peak, 1,251 added, 670 deleted).
% 0.14/0.53 ; Retrieved 57 possibly forward subsuming rows in 138 calls.
% 0.14/0.53 ; Retrieved 9 possibly backward subsumed rows in 132 calls.
% 0.14/0.53 ; Path-index has 255 entries (414 at peak, 439 added, 184 deleted).
% 0.14/0.53 ; Path-index has 906 nodes (1,100 at peak, 1,115 added, 209 deleted).
% 0.14/0.53 ; Trie-index has 255 entries (414 at peak, 439 added, 184 deleted).
% 0.14/0.53 ; Trie-index has 875 nodes (1,379 at peak, 1,414 added, 539 deleted).
% 0.14/0.53 ; Retrieved 203 generalization terms in 654 calls.
% 0.14/0.53 ; Retrieved 114 instance terms in 95 calls.
% 0.14/0.53 ; Retrieved 120,400 unifiable terms in 13,337 calls.
% 0.14/0.53 ;
% 0.14/0.53 ; The agenda of backward simplifiable rows to process has 85 entries:
% 0.14/0.53 ; 85 with value 0
% 0.14/0.53 ; The agenda of rows to process has 21 entries:
% 0.14/0.53 ; 1 with value 15 1 with value 19 1 with value 31
% 0.14/0.53 ; 1 with value 16 4 with value 20 2 with value 34
% 0.14/0.53 ; 3 with value 17 4 with value 21 1 with value 43
% 0.14/0.53 ; 1 with value 18 1 with value 24 1 with value 44
% 0.14/0.53 ; The agenda of rows to give has 40 entries:
% 0.14/0.53 ; 1 with value (4 10) 2 with value (4 27) 1 with value (4 39)
% 0.14/0.53 ; 1 with value (4 18) 5 with value (4 28) 1 with value (4 40)
% 0.14/0.53 ; 3 with value (4 19) 2 with value (4 30) 5 with value (4 46)
% 0.14/0.53 ; 6 with value (4 20) 1 with value (4 32) 1 with value (4 47)
% 0.14/0.53 ; 2 with value (4 21) 2 with value (4 33) 1 with value (4 48)
% 0.14/0.53 ; 2 with value (4 22) 1 with value (4 34) 1 with value (4 49)
% 0.14/0.53 ; 2 with value (4 26)
% 0.14/0.53 Evaluation took:
% 0.14/0.53 0.153 seconds of real time
% 0.14/0.53 0.145947 seconds of user run time
% 0.14/0.53 0.006715 seconds of system run time
% 0.14/0.53 [Run times include 0.005 seconds GC run time.]
% 0.14/0.53 0 calls to %EVAL
% 0.14/0.53 0 page faults and
% 0.14/0.53 14,134,400 bytes consed.
% 0.14/0.53 :PROOF-FOUND
% 0.14/0.53 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-31T03:36:58
% 0.14/0.53 :PROOF-FOUND
% 0.14/0.53 *
%------------------------------------------------------------------------------