TSTP Solution File: GRP130-3.003 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP130-3.003 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n018.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 11:36:59 EDT 2022
% Result : Unsatisfiable 0.19s 0.58s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 24
% Syntax : Number of clauses : 59 ( 29 unt; 23 nHn; 59 RR)
% Number of literals : 127 ( 0 equ; 40 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(e_0_then_e_1,axiom,
next(e_0,e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_0_then_e_1) ).
cnf(e_2_then_e_3,axiom,
next(e_2,e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_2_then_e_3) ).
cnf(e_1_greater_e_0,axiom,
greater(e_1,e_0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_1_greater_e_0) ).
cnf(e_2_greater_e_0,axiom,
greater(e_2,e_0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_2_greater_e_0) ).
cnf(e_2_greater_e_1,axiom,
greater(e_2,e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_2_greater_e_1) ).
cnf(e_3_greater_e_1,axiom,
greater(e_3,e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_3_greater_e_1) ).
cnf(cycle2,axiom,
( ~ group_element(X)
| cycle(X,e_0)
| cycle(X,e_1)
| cycle(X,e_2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cycle2) ).
cnf(cycle3,axiom,
cycle(e_3,e_0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cycle3) ).
cnf(cycle4,axiom,
( ~ cycle(X,Y)
| ~ cycle(Z,U)
| ~ next(X,Z)
| ~ greater(Y,e_0)
| ~ next(U,V)
| equalish(Y,V) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cycle4) ).
cnf(cycle5,axiom,
( ~ cycle(X,Y)
| ~ cycle(Z,e_0)
| ~ cycle(U,V)
| ~ next(Z,U)
| ~ greater(Z,X)
| ~ greater(Y,V) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cycle5) ).
cnf(cycle6,axiom,
( ~ cycle(X,e_0)
| ~ product(X,e_1,Y)
| ~ greater(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cycle6) ).
cnf(cycle7,axiom,
( ~ cycle(X,Y)
| ~ product(X,e_1,Z)
| ~ greater(Y,e_0)
| ~ next(X,U)
| equalish(Z,U) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cycle7) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_1) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_2) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_3) ).
cnf(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_1_is_not_e_2) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_1_is_not_e_3) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_2_is_not_e_1) ).
cnf(e_2_is_not_e_3,axiom,
~ equalish(e_2,e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_2_is_not_e_3) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_3_is_not_e_1) ).
cnf(product_total_function1,axiom,
( ~ group_element(X)
| ~ group_element(Y)
| product(X,Y,e_1)
| product(X,Y,e_2)
| product(X,Y,e_3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_total_function1) ).
cnf(product_right_cancellation,axiom,
( ~ product(X,Y,Z)
| ~ product(X,U,Z)
| equalish(Y,U) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_right_cancellation) ).
cnf(product_left_cancellation,axiom,
( ~ product(X,Y,Z)
| ~ product(U,Y,Z)
| equalish(X,U) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_left_cancellation) ).
cnf(qg3,negated_conjecture,
( ~ product(X,Y,Z)
| ~ product(X,Z,U)
| product(U,Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qg3) ).
cnf(32,plain,
( cycle(e_2,e_0)
| cycle(e_2,e_1)
| cycle(e_2,e_2) ),
inference('HYPERRESOLVE',[status(thm)],[cycle2,element_2]) ).
cnf(33,plain,
( cycle(e_1,e_0)
| cycle(e_1,e_1)
| cycle(e_1,e_2) ),
inference('HYPERRESOLVE',[status(thm)],[cycle2,element_1]) ).
cnf(36,plain,
( product(e_3,e_1,e_1)
| product(e_3,e_1,e_2)
| product(e_3,e_1,e_3) ),
inference('HYPERRESOLVE',[status(thm)],[product_total_function1,element_3,element_1]) ).
cnf(37,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_2)
| product(e_2,e_3,e_3) ),
inference('HYPERRESOLVE',[status(thm)],[product_total_function1,element_2,element_3]) ).
cnf(38,plain,
( product(e_2,e_2,e_1)
| product(e_2,e_2,e_2)
| product(e_2,e_2,e_3) ),
inference('HYPERRESOLVE',[status(thm)],[product_total_function1,element_2,element_2]) ).
cnf(39,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2)
| product(e_2,e_1,e_3) ),
inference('HYPERRESOLVE',[status(thm)],[product_total_function1,element_2,element_1]) ).
cnf(42,plain,
( product(e_1,e_1,e_1)
| product(e_1,e_1,e_2)
| product(e_1,e_1,e_3) ),
inference('HYPERRESOLVE',[status(thm)],[product_total_function1,element_1,element_1]) ).
cnf(43,plain,
~ cycle(e_2,e_2),
inference('UR-RESOLVE',[status(thm)],[cycle4,cycle3,e_2_then_e_3,e_2_greater_e_0,e_0_then_e_1,e_2_is_not_e_1]) ).
cnf(44,plain,
( cycle(e_2,e_0)
| cycle(e_2,e_1) ),
inference('REWRITE',[status(thm)],[32,43]) ).
cnf(66,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2)
| product(e_3,e_1,e_1)
| product(e_3,e_1,e_2) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_left_cancellation,39,36]),e_2_is_not_e_3]) ).
cnf(67,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2)
| product(e_2,e_3,e_1)
| product(e_2,e_3,e_2) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_right_cancellation,39,37]),e_1_is_not_e_3]) ).
cnf(113,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2)
| product(e_2,e_3,e_1) ),
inference('HYPERRESOLVE',[status(thm)],[qg3,67,39]) ).
cnf(114,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2)
| product(e_3,e_3,e_2) ),
inference('HYPERRESOLVE',[status(thm)],[qg3,113,39]) ).
cnf(117,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2)
| product(e_3,e_1,e_1) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_right_cancellation,114,66]),e_3_is_not_e_1]) ).
cnf(126,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2)
| product(e_1,e_1,e_3) ),
inference('HYPERRESOLVE',[status(thm)],[qg3,117,117]) ).
cnf(127,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_left_cancellation,126,39]),e_1_is_not_e_2]) ).
cnf(128,plain,
( product(e_2,e_1,e_1)
| cycle(e_2,e_0) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[cycle7,127,44,e_1_greater_e_0,e_2_then_e_3]),e_2_is_not_e_3]) ).
cnf(130,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_2,e_1)
| product(e_2,e_2,e_2)
| product(e_3,e_1,e_2) ),
inference('HYPERRESOLVE',[status(thm)],[qg3,127,38]) ).
cnf(133,plain,
cycle(e_2,e_0),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[cycle7,128,44,e_1_greater_e_0,e_2_then_e_3]),e_1_is_not_e_3]) ).
cnf(137,plain,
~ cycle(e_1,e_1),
inference('UR-RESOLVE',[status(thm)],[cycle5,133,cycle3,e_2_then_e_3,e_2_greater_e_1,e_1_greater_e_0]) ).
cnf(138,plain,
( cycle(e_1,e_0)
| cycle(e_1,e_2) ),
inference('REWRITE',[status(thm)],[33,137]) ).
cnf(142,plain,
~ cycle(e_1,e_2),
inference('UR-RESOLVE',[status(thm)],[cycle5,133,cycle3,e_2_then_e_3,e_2_greater_e_1,e_2_greater_e_0]) ).
cnf(143,plain,
cycle(e_1,e_0),
inference('REWRITE',[status(thm)],[138,142]) ).
cnf(148,plain,
~ product(e_1,e_1,e_2),
inference('UR-RESOLVE',[status(thm)],[cycle6,143,e_2_greater_e_1]) ).
cnf(149,plain,
( product(e_1,e_1,e_1)
| product(e_1,e_1,e_3) ),
inference('REWRITE',[status(thm)],[42,148]) ).
cnf(153,plain,
~ product(e_1,e_1,e_3),
inference('UR-RESOLVE',[status(thm)],[cycle6,143,e_3_greater_e_1]) ).
cnf(155,plain,
product(e_1,e_1,e_1),
inference('REWRITE',[status(thm)],[149,153]) ).
cnf(158,plain,
~ product(e_2,e_1,e_1),
inference('UR-RESOLVE',[status(thm)],[product_left_cancellation,155,e_1_is_not_e_2]) ).
cnf(159,plain,
product(e_2,e_1,e_2),
inference('REWRITE',[status(thm)],[127,158]) ).
cnf(161,plain,
( product(e_2,e_2,e_1)
| product(e_2,e_2,e_2)
| product(e_3,e_1,e_2) ),
inference('REWRITE',[status(thm)],[130,158]) ).
cnf(183,plain,
~ product(e_2,e_2,e_1),
inference('UR-RESOLVE',[status(thm)],[qg3,159,148]) ).
cnf(188,plain,
( product(e_2,e_2,e_2)
| product(e_3,e_1,e_2) ),
inference('REWRITE',[status(thm)],[161,183]) ).
cnf(191,plain,
~ product(e_3,e_1,e_2),
inference('UR-RESOLVE',[status(thm)],[product_left_cancellation,159,e_2_is_not_e_3]) ).
cnf(198,plain,
product(e_2,e_2,e_2),
inference('REWRITE',[status(thm)],[188,191]) ).
cnf(199,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[product_right_cancellation,159,e_1_is_not_e_2]),198]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP130-3.003 : TPTP v8.1.0. Released v1.2.0.
% 0.06/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n018.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 : Mon Jun 13 18:14:43 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p 2022-06-13T18:14:43
% 0.19/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n018.cluster.edu at 2022-06-13T18:14:43
% 0.19/0.58
% 0.19/0.58
% 0.19/0.58 #||
% 0.19/0.58 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.58 % SZS output start Refutation
% See solution above
% 0.19/0.58 ||#
% 0.19/0.58
% 0.19/0.58 ; Summary of computation:
% 0.19/0.58 ; 835 formulas have been input or derived (from 91 formulas).
% 0.19/0.58 ; 199 (24%) were retained. Of these,
% 0.19/0.58 ; 132 (66%) were simplified or subsumed later,
% 0.19/0.58 ; 67 (34%) are still being kept.
% 0.19/0.58 ;
% 0.19/0.58 ; Run time in seconds excluding printing time:
% 0.19/0.58 ; 0.004 4% Read assertion file (1 call)
% 0.19/0.58 ; 0.000 0% Assert (30 calls)
% 0.19/0.58 ; 0.015 15% Process new row (670 calls)
% 0.19/0.58 ; 0.022 22% Resolution (180 calls)
% 0.19/0.58 ; 0.000 0% Paramodulation (90 calls)
% 0.19/0.58 ; 0.000 0% Factoring (43 calls)
% 0.19/0.58 ; 0.001 1% Condensing (322 calls)
% 0.19/0.58 ; 0.013 13% Forward subsumption (322 calls)
% 0.19/0.58 ; 0.006 6% Backward subsumption (146 calls)
% 0.19/0.58 ; 0.001 1% Clause clause subsumption (1,276 calls)
% 0.19/0.58 ; 0.009 9% Forward simplification (538 calls)
% 0.19/0.58 ; 0.003 3% Backward simplification (199 calls)
% 0.19/0.58 ; 0.003 3% Ordering (613 calls)
% 0.19/0.58 ; 0.000 0% Sortal reasoning (32 calls)
% 0.19/0.58 ; 0.000 0% Purity testing (1 call)
% 0.19/0.58 ; 0.025 25% Other
% 0.19/0.58 ; 0.102 Total
% 0.19/0.58 ; 0.106 Real time
% 0.19/0.58 ;
% 0.19/0.58 ; Term-hash-array has 97 terms in all.
% 0.19/0.58 ; Feature-vector-row-index has 14 entries (66 at peak, 146 added, 132 deleted).
% 0.19/0.58 ; Feature-vector-row-index has 42 nodes (229 at peak, 419 added, 377 deleted).
% 0.19/0.58 ; Retrieved 1,621 possibly forward subsuming rows in 322 calls.
% 0.19/0.58 ; Retrieved 461 possibly backward subsumed rows in 146 calls.
% 0.19/0.58 ; Path-index has 95 entries (101 at peak, 116 added, 21 deleted).
% 0.19/0.58 ; Path-index has 75 nodes (75 at peak, 75 added, 0 deleted).
% 0.19/0.58 ; Trie-index has 95 entries (101 at peak, 116 added, 21 deleted).
% 0.19/0.58 ; Trie-index has 116 nodes (122 at peak, 138 added, 22 deleted).
% 0.19/0.58 ; Retrieved 310 generalization terms in 652 calls.
% 0.19/0.58 ; Retrieved 52 instance terms in 52 calls.
% 0.19/0.58 ; Retrieved 4,965 unifiable terms in 1,488 calls.
% 0.19/0.58 ;
% 0.19/0.58 ; The agenda of rows to process has 13 entries:
% 0.19/0.58 ; 9 with value 13 2 with value 14 2 with value 23
% 0.19/0.58 ; The agenda of rows to give has 19 entries:
% 0.19/0.58 ; 1 with value (4 6) 2 with value (4 12) 7 with value (4 14)
% 0.19/0.58 ; 2 with value (4 8) 6 with value (4 13) 1 with value (4 15)
% 0.19/0.58 Evaluation took:
% 0.19/0.58 0.106 seconds of real time
% 0.19/0.58 0.09029 seconds of user run time
% 0.19/0.58 0.016113 seconds of system run time
% 0.19/0.58 0 calls to %EVAL
% 0.19/0.58 0 page faults and
% 0.19/0.58 9,901,056 bytes consed.
% 0.19/0.58 :PROOF-FOUND
% 0.19/0.58 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T18:14:43
% 0.19/0.58 :PROOF-FOUND
% 0.19/0.58 *
%------------------------------------------------------------------------------