TSTP Solution File: GRA010+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRA010+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n028.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.46s 0.64s
% Output : Refutation 0.46s
% 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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',sequential_pairs_and_triangles) ).
cnf(61,negated_conjecture,
path('SKOLEMAAAV10','SKOLEMAAAV11','SKOLEMAAAV9'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complete_means_sequential_pairs_and_triangles) ).
cnf(62,negated_conjecture,
( ~ on_path(X,'SKOLEMAAAV9')
| ~ on_path(Y,'SKOLEMAAAV9')
| ~ sequential(X,Y)
| triangle(X,Y,'SKOLEMAAAV12'(X,Y)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complete_means_sequential_pairs_and_triangles) ).
cnf(63,negated_conjecture,
number_of_in(sequential_pairs,'SKOLEMAAAV9') != number_of_in(triangles,'SKOLEMAAAV9'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complete_means_sequential_pairs_and_triangles) ).
cnf(77,plain,
number_of_in(sequential_pairs,'SKOLEMAAAV9') = minus(length_of('SKOLEMAAAV9'),n1),
inference('HYPERRESOLVE',[status(thm)],[54,61]) ).
cnf(78,plain,
minus(length_of('SKOLEMAAAV9'),n1) != number_of_in(triangles,'SKOLEMAAAV9'),
inference('REWRITE',[status(thm)],[63,77,theory(equality)]) ).
cnf(79,plain,
on_path('SKOLEMAAAV7'('SKOLEMAAAV9'),'SKOLEMAAAV9'),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[55,61]),78,77,theory(equality)]) ).
cnf(80,plain,
on_path('SKOLEMAAAV8'('SKOLEMAAAV9'),'SKOLEMAAAV9'),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[56,61]),78,77,theory(equality)]) ).
cnf(81,plain,
sequential('SKOLEMAAAV7'('SKOLEMAAAV9'),'SKOLEMAAAV8'('SKOLEMAAAV9')),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[57,61]),78,77,theory(equality)]) ).
cnf(118,plain,
triangle('SKOLEMAAAV7'('SKOLEMAAAV9'),'SKOLEMAAAV8'('SKOLEMAAAV9'),'SKOLEMAAAV12'('SKOLEMAAAV7'('SKOLEMAAAV9'),'SKOLEMAAAV8'('SKOLEMAAAV9'))),
inference('HYPERRESOLVE',[status(thm)],[62,81,79,80]) ).
cnf(319,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[58,118,61]),78,77,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRA010+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.12/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon May 30 23:12:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 0.19/0.48 #<PACKAGE "SNARK-USER">
% 0.19/0.48 *
% 0.19/0.48 SNARK-TPTP-OPTIONS
% 0.19/0.48 *
% 0.19/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.48 (USE-FACTORING :POS)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.48 *
% 0.19/0.48 "."
% 0.19/0.48 *
% 0.19/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-30T23:12:05
% 0.19/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n028.cluster.edu at 2022-05-30T23:12:05
% 0.46/0.64
% 0.46/0.64
% 0.46/0.64 #||
% 0.46/0.64 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.64 % SZS output start Refutation
% See solution above
% 0.46/0.64 ||#
% 0.46/0.64
% 0.46/0.64 ; Summary of computation:
% 0.46/0.64 ; 550 formulas have been input or derived (from 110 formulas).
% 0.46/0.64 ; 319 (58%) were retained. Of these,
% 0.46/0.64 ; 20 ( 6%) were simplified or subsumed later,
% 0.46/0.64 ; 299 (94%) are still being kept.
% 0.46/0.64 ;
% 0.46/0.64 ; Run time in seconds excluding printing time:
% 0.46/0.64 ; 0.008 5% Read assertion file (1 call)
% 0.47/0.64 ; 0.002 1% Assert (18 calls)
% 0.47/0.64 ; 0.034 21% Process new row (457 calls)
% 0.47/0.64 ; 0.048 29% Resolution (218 calls)
% 0.47/0.64 ; 0.000 0% Paramodulation (109 calls)
% 0.47/0.64 ; 0.000 0% Factoring (2 calls)
% 0.47/0.64 ; 0.005 3% Condensing (239 calls)
% 0.47/0.64 ; 0.024 15% Forward subsumption (239 calls)
% 0.47/0.64 ; 0.007 4% Backward subsumption (239 calls)
% 0.47/0.64 ; 0.000 0% Clause clause subsumption (229 calls)
% 0.47/0.64 ; 0.009 5% Forward simplification (457 calls)
% 0.47/0.64 ; 0.000 0% Backward simplification (319 calls)
% 0.47/0.64 ; 0.001 1% Ordering (364 calls)
% 0.47/0.64 ; 0.000 0% Sortal reasoning (32 calls)
% 0.47/0.64 ; 0.001 1% Purity testing (1 call)
% 0.47/0.64 ; 0.025 15% Other
% 0.47/0.64 ; 0.164 Total
% 0.47/0.64 ; 0.166 Real time
% 0.47/0.64 ;
% 0.47/0.64 ; Term-hash-array has 500 terms in all.
% 0.47/0.64 ; Feature-vector-row-index has 223 entries (223 at peak, 239 added, 16 deleted).
% 0.47/0.64 ; Feature-vector-row-index has 1,253 nodes (1,253 at peak, 1,352 added, 99 deleted).
% 0.47/0.64 ; Retrieved 130 possibly forward subsuming rows in 239 calls.
% 0.47/0.64 ; Retrieved 99 possibly backward subsumed rows in 239 calls.
% 0.47/0.64 ; Path-index has 506 entries (506 at peak, 535 added, 29 deleted).
% 0.47/0.64 ; Path-index has 918 nodes (918 at peak, 933 added, 15 deleted).
% 0.47/0.64 ; Trie-index has 506 entries (506 at peak, 535 added, 29 deleted).
% 0.47/0.64 ; Trie-index has 1,586 nodes (1,586 at peak, 1,670 added, 84 deleted).
% 0.47/0.64 ; Retrieved 177 generalization terms in 1,042 calls.
% 0.47/0.64 ; Retrieved 99 instance terms in 79 calls.
% 0.47/0.64 ; Retrieved 62,819 unifiable terms in 6,693 calls.
% 0.47/0.64 ;
% 0.47/0.64 ; The agenda of rows to process has 6 entries:
% 0.47/0.64 ; 2 with value 12 4 with value 14
% 0.47/0.64 ; The agenda of rows to give has 190 entries:
% 0.47/0.64 ; 1 with value (4 12) 2 with value (4 26) 25 with value (4 40)
% 0.47/0.64 ; 7 with value (4 15) 2 with value (4 27) 2 with value (4 41)
% 0.47/0.64 ; 6 with value (4 16) 2 with value (4 29) 12 with value (4 42)
% 0.47/0.64 ; 12 with value (4 17) 6 with value (4 30) 2 with value (4 43)
% 0.47/0.64 ; 2 with value (4 18) 2 with value (4 31) 4 with value (4 47)
% 0.47/0.64 ; 2 with value (4 19) 5 with value (4 33) 2 with value (4 51)
% 0.47/0.64 ; 12 with value (4 22) 4 with value (4 37) 6 with value (4 54)
% 0.47/0.64 ; 3 with value (4 23) 37 with value (4 38) 12 with value (4 56)
% 0.47/0.64 ; 8 with value (4 24) 2 with value (4 39) 6 with value (4 58)
% 0.47/0.64 ; 4 with value (4 25)
% 0.47/0.64 Evaluation took:
% 0.47/0.64 0.167 seconds of real time
% 0.47/0.64 0.150014 seconds of user run time
% 0.47/0.65 0.016932 seconds of system run time
% 0.47/0.65 0 calls to %EVAL
% 0.47/0.65 0 page faults and
% 0.47/0.65 12,006,160 bytes consed.
% 0.47/0.65 :PROOF-FOUND
% 0.47/0.65 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-30T23:12:05
% 0.47/0.65 :PROOF-FOUND
% 0.47/0.65 *
%------------------------------------------------------------------------------