TSTP Solution File: GRA010+2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRA010+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n024.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:54 EDT 2022
% Result : Theorem 0.48s 0.66s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 9 unt; 3 nHn; 15 RR)
% Number of literals : 27 ( 8 equ; 11 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 18 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(54,axiom,
( ~ path(X,Y,Z)
| number_of_in(sequential_pairs,Z) = minus(length_of(Z),n1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',path_length_sequential_pairs) ).
cnf(55,axiom,
( ~ path(X,Y,Z)
| on_path('SKOLEMAAAV7'(Z),Z)
| number_of_in(sequential_pairs,Z) = number_of_in(triangles,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_pairs_and_triangles) ).
cnf(56,axiom,
( ~ path(X,Y,Z)
| on_path('SKOLEMAAAV8'(Z),Z)
| number_of_in(sequential_pairs,Z) = number_of_in(triangles,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_pairs_and_triangles) ).
cnf(57,axiom,
( ~ path(X,Y,Z)
| sequential('SKOLEMAAAV7'(Z),'SKOLEMAAAV8'(Z))
| number_of_in(sequential_pairs,Z) = number_of_in(triangles,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_pairs_and_triangles) ).
cnf(58,axiom,
( ~ path(X,Y,Z)
| ~ triangle('SKOLEMAAAV7'(Z),'SKOLEMAAAV8'(Z),U)
| number_of_in(sequential_pairs,Z) = number_of_in(triangles,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_pairs_and_triangles) ).
cnf(62,negated_conjecture,
path('SKOLEMAAAV11','SKOLEMAAAV12','SKOLEMAAAV10'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complete_means_sequential_pairs_and_triangles) ).
cnf(63,negated_conjecture,
( ~ on_path(X,'SKOLEMAAAV10')
| ~ on_path(Y,'SKOLEMAAAV10')
| ~ sequential(X,Y)
| triangle(X,Y,'SKOLEMAAAV13'(X,Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complete_means_sequential_pairs_and_triangles) ).
cnf(64,negated_conjecture,
number_of_in(sequential_pairs,'SKOLEMAAAV10') != number_of_in(triangles,'SKOLEMAAAV10'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complete_means_sequential_pairs_and_triangles) ).
cnf(79,plain,
number_of_in(sequential_pairs,'SKOLEMAAAV10') = minus(length_of('SKOLEMAAAV10'),n1),
inference('HYPERRESOLVE',[status(thm)],[54,62]) ).
cnf(80,plain,
minus(length_of('SKOLEMAAAV10'),n1) != number_of_in(triangles,'SKOLEMAAAV10'),
inference('REWRITE',[status(thm)],[64,79,theory(equality)]) ).
cnf(81,plain,
on_path('SKOLEMAAAV7'('SKOLEMAAAV10'),'SKOLEMAAAV10'),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[55,62]),80,79,theory(equality)]) ).
cnf(82,plain,
on_path('SKOLEMAAAV8'('SKOLEMAAAV10'),'SKOLEMAAAV10'),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[56,62]),80,79,theory(equality)]) ).
cnf(83,plain,
sequential('SKOLEMAAAV7'('SKOLEMAAAV10'),'SKOLEMAAAV8'('SKOLEMAAAV10')),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[57,62]),80,79,theory(equality)]) ).
cnf(120,plain,
triangle('SKOLEMAAAV7'('SKOLEMAAAV10'),'SKOLEMAAAV8'('SKOLEMAAAV10'),'SKOLEMAAAV13'('SKOLEMAAAV7'('SKOLEMAAAV10'),'SKOLEMAAAV8'('SKOLEMAAAV10'))),
inference('HYPERRESOLVE',[status(thm)],[63,83,81,82]) ).
cnf(321,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[58,120,62]),80,79,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : GRA010+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.10/0.13 % Command : run-snark %s %d
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon May 30 22:45:36 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.47 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.48 *
% 0.21/0.48 *
% 0.21/0.49 #<PACKAGE "SNARK-USER">
% 0.21/0.49 *
% 0.21/0.49 SNARK-TPTP-OPTIONS
% 0.21/0.49 *
% 0.21/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.49 (USE-FACTORING :POS)
% 0.21/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.49 *
% 0.21/0.49 "."
% 0.21/0.49 *
% 0.21/0.49 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-30T22:45:36
% 0.21/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n024.cluster.edu at 2022-05-30T22:45:36
% 0.48/0.66
% 0.48/0.66
% 0.48/0.66 #||
% 0.48/0.66 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.48/0.66 % SZS output start Refutation
% See solution above
% 0.48/0.66 ||#
% 0.48/0.66
% 0.48/0.66 ; Summary of computation:
% 0.48/0.66 ; 552 formulas have been input or derived (from 111 formulas).
% 0.48/0.66 ; 321 (58%) were retained. Of these,
% 0.48/0.66 ; 21 ( 7%) were simplified or subsumed later,
% 0.48/0.66 ; 300 (93%) are still being kept.
% 0.48/0.66 ;
% 0.48/0.66 ; Run time in seconds excluding printing time:
% 0.48/0.66 ; 0.008 5% Read assertion file (1 call)
% 0.48/0.66 ; 0.003 2% Assert (19 calls)
% 0.48/0.66 ; 0.028 16% Process new row (459 calls)
% 0.48/0.66 ; 0.058 33% Resolution (220 calls)
% 0.48/0.66 ; 0.000 0% Paramodulation (110 calls)
% 0.48/0.66 ; 0.000 0% Factoring (2 calls)
% 0.48/0.66 ; 0.000 0% Condensing (241 calls)
% 0.48/0.66 ; 0.020 11% Forward subsumption (241 calls)
% 0.48/0.66 ; 0.010 6% Backward subsumption (241 calls)
% 0.48/0.66 ; 0.002 1% Clause clause subsumption (229 calls)
% 0.48/0.66 ; 0.013 7% Forward simplification (459 calls)
% 0.48/0.66 ; 0.003 2% Backward simplification (321 calls)
% 0.48/0.66 ; 0.002 1% Ordering (364 calls)
% 0.48/0.66 ; 0.000 0% Sortal reasoning (32 calls)
% 0.48/0.66 ; 0.000 0% Purity testing (1 call)
% 0.48/0.66 ; 0.028 16% Other
% 0.48/0.66 ; 0.175 Total
% 0.48/0.66 ; 0.178 Real time
% 0.48/0.66 ;
% 0.48/0.66 ; Term-hash-array has 502 terms in all.
% 0.48/0.66 ; Feature-vector-row-index has 224 entries (224 at peak, 241 added, 17 deleted).
% 0.48/0.66 ; Feature-vector-row-index has 1,258 nodes (1,258 at peak, 1,362 added, 104 deleted).
% 0.48/0.66 ; Retrieved 130 possibly forward subsuming rows in 241 calls.
% 0.48/0.66 ; Retrieved 99 possibly backward subsumed rows in 241 calls.
% 0.48/0.66 ; Path-index has 508 entries (508 at peak, 539 added, 31 deleted).
% 0.48/0.66 ; Path-index has 928 nodes (928 at peak, 947 added, 19 deleted).
% 0.48/0.66 ; Trie-index has 508 entries (508 at peak, 539 added, 31 deleted).
% 0.48/0.66 ; Trie-index has 1,592 nodes (1,592 at peak, 1,682 added, 90 deleted).
% 0.48/0.66 ; Retrieved 177 generalization terms in 1,042 calls.
% 0.48/0.66 ; Retrieved 102 instance terms in 79 calls.
% 0.48/0.66 ; Retrieved 62,881 unifiable terms in 6,707 calls.
% 0.48/0.66 ;
% 0.48/0.66 ; The agenda of rows to process has 6 entries:
% 0.48/0.66 ; 2 with value 12 4 with value 14
% 0.48/0.66 ; The agenda of rows to give has 190 entries:
% 0.48/0.66 ; 1 with value (4 12) 2 with value (4 26) 25 with value (4 40)
% 0.48/0.67 ; 7 with value (4 15) 2 with value (4 27) 2 with value (4 41)
% 0.48/0.67 ; 6 with value (4 16) 2 with value (4 29) 12 with value (4 42)
% 0.48/0.67 ; 12 with value (4 17) 6 with value (4 30) 2 with value (4 43)
% 0.48/0.67 ; 2 with value (4 18) 2 with value (4 31) 4 with value (4 47)
% 0.48/0.67 ; 2 with value (4 19) 5 with value (4 33) 2 with value (4 51)
% 0.48/0.67 ; 12 with value (4 22) 4 with value (4 37) 6 with value (4 54)
% 0.48/0.67 ; 3 with value (4 23) 37 with value (4 38) 12 with value (4 56)
% 0.48/0.67 ; 8 with value (4 24) 2 with value (4 39) 6 with value (4 58)
% 0.48/0.67 ; 4 with value (4 25)
% 0.48/0.67 Evaluation took:
% 0.48/0.67 0.178 seconds of real time
% 0.48/0.67 0.159228 seconds of user run time
% 0.48/0.67 0.019188 seconds of system run time
% 0.48/0.67 0 calls to %EVAL
% 0.48/0.67 0 page faults and
% 0.48/0.67 12,054,928 bytes consed.
% 0.48/0.67 :PROOF-FOUND
% 0.48/0.67 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-30T22:45:36
% 0.48/0.67 :PROOF-FOUND
% 0.48/0.67 *
%------------------------------------------------------------------------------