TSTP Solution File: GRP130-1.003 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP130-1.003 : TPTP v8.1.0. Released v1.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 11:36:58 EDT 2022
% Result : Unsatisfiable 0.44s 0.61s
% Output : Refutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of clauses : 47 ( 18 unt; 25 nHn; 47 RR)
% Number of literals : 107 ( 0 equ; 20 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_1) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_2) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_3) ).
cnf(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',product_total_function1) ).
cnf(product_total_function2,axiom,
( ~ product(X,Y,Z)
| ~ product(X,Y,U)
| equalish(Z,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_total_function2) ).
cnf(product_right_cancellation,axiom,
( ~ product(X,Y,Z)
| ~ product(X,U,Z)
| equalish(Y,U) ),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',qg3) ).
cnf(17,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(18,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(19,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(20,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(34,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_2)
| product(e_3,e_3,e_2) ),
inference('HYPERRESOLVE',[status(thm)],[qg3,18,18]) ).
cnf(38,plain,
( product(e_2,e_2,e_1)
| product(e_2,e_2,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,19,18]),e_2_is_not_e_3]) ).
cnf(42,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,20,17]),e_2_is_not_e_3]) ).
cnf(43,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,20,18]),e_1_is_not_e_3]) ).
cnf(69,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_2)
| product(e_3,e_1,e_1)
| product(e_3,e_1,e_2)
| product(e_2,e_1,e_3) ),
inference('HYPERRESOLVE',[status(thm)],[qg3,34,17]) ).
cnf(79,plain,
( product(e_2,e_2,e_1)
| product(e_2,e_2,e_2)
| product(e_2,e_3,e_1) ),
inference('HYPERRESOLVE',[status(thm)],[qg3,38,19]) ).
cnf(80,plain,
( product(e_2,e_2,e_1)
| product(e_2,e_2,e_2)
| product(e_1,e_2,e_2) ),
inference('HYPERRESOLVE',[status(thm)],[qg3,79,19]) ).
cnf(86,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,43,20]) ).
cnf(87,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,86,20]) ).
cnf(90,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,87,42]),e_3_is_not_e_1]) ).
cnf(96,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,90,90]) ).
cnf(97,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,96,20]),e_1_is_not_e_2]) ).
cnf(98,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_2,e_1)
| product(e_1,e_2,e_2) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_right_cancellation,97,80]),e_1_is_not_e_2]) ).
cnf(141,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_2,e_1) ),
inference('HYPERRESOLVE',[status(thm)],[qg3,98,98]) ).
cnf(142,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_2,e_2) ),
inference('HYPERRESOLVE',[status(thm)],[qg3,141,97]) ).
cnf(145,plain,
product(e_2,e_1,e_1),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_right_cancellation,142,97]),e_2_is_not_e_1]) ).
cnf(148,plain,
~ product(e_3,e_1,e_1),
inference('UR-RESOLVE',[status(thm)],[product_left_cancellation,145,e_2_is_not_e_3]) ).
cnf(152,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_2)
| product(e_3,e_1,e_2)
| product(e_2,e_1,e_3) ),
inference('REWRITE',[status(thm)],[69,148]) ).
cnf(169,plain,
~ product(e_2,e_2,e_1),
inference('UR-RESOLVE',[status(thm)],[product_right_cancellation,145,e_1_is_not_e_2]) ).
cnf(172,plain,
( product(e_2,e_2,e_2)
| product(e_2,e_3,e_1) ),
inference('REWRITE',[status(thm)],[79,169]) ).
cnf(182,plain,
~ product(e_2,e_3,e_1),
inference('UR-RESOLVE',[status(thm)],[product_right_cancellation,145,e_1_is_not_e_3]) ).
cnf(184,plain,
( product(e_2,e_3,e_2)
| product(e_3,e_3,e_2) ),
inference('REWRITE',[status(thm)],[34,182]) ).
cnf(189,plain,
( product(e_2,e_3,e_2)
| product(e_3,e_1,e_2)
| product(e_2,e_1,e_3) ),
inference('REWRITE',[status(thm)],[152,182]) ).
cnf(192,plain,
product(e_2,e_2,e_2),
inference('REWRITE',[status(thm)],[172,182]) ).
cnf(195,plain,
~ product(e_2,e_1,e_3),
inference('UR-RESOLVE',[status(thm)],[product_total_function2,145,e_1_is_not_e_3]) ).
cnf(199,plain,
( product(e_2,e_3,e_2)
| product(e_3,e_1,e_2) ),
inference('REWRITE',[status(thm)],[189,195]) ).
cnf(211,plain,
~ product(e_2,e_3,e_2),
inference('UR-RESOLVE',[status(thm)],[product_right_cancellation,192,e_2_is_not_e_3]) ).
cnf(213,plain,
product(e_3,e_3,e_2),
inference('REWRITE',[status(thm)],[184,211]) ).
cnf(214,plain,
product(e_3,e_1,e_2),
inference('REWRITE',[status(thm)],[199,211]) ).
cnf(221,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[product_right_cancellation,213,e_3_is_not_e_1]),214]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP130-1.003 : TPTP v8.1.0. Released v1.2.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n028.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 21:22:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 *
% 0.20/0.46 *
% 0.20/0.47 #<PACKAGE "SNARK-USER">
% 0.20/0.47 *
% 0.20/0.47 SNARK-TPTP-OPTIONS
% 0.20/0.47 *
% 0.20/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47 (USE-FACTORING :POS)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47 *
% 0.20/0.47 "."
% 0.20/0.47 *
% 0.20/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T21:22:23
% 0.20/0.47 ; 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-06-13T21:22:23
% 0.44/0.61
% 0.44/0.61
% 0.44/0.61 #||
% 0.44/0.61 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.44/0.61 % SZS output start Refutation
% See solution above
% 0.44/0.61 ||#
% 0.44/0.61
% 0.44/0.61 ; Summary of computation:
% 0.44/0.61 ; 1214 formulas have been input or derived (from 70 formulas).
% 0.44/0.61 ; 221 (18%) were retained. Of these,
% 0.44/0.61 ; 181 (82%) were simplified or subsumed later,
% 0.44/0.61 ; 40 (18%) are still being kept.
% 0.44/0.61 ;
% 0.44/0.61 ; Run time in seconds excluding printing time:
% 0.44/0.61 ; 0.002 1% Read assertion file (1 call)
% 0.44/0.61 ; 0.001 1% Assert (14 calls)
% 0.44/0.61 ; 0.019 14% Process new row (989 calls)
% 0.44/0.61 ; 0.017 12% Resolution (138 calls)
% 0.44/0.61 ; 0.001 1% Paramodulation (69 calls)
% 0.44/0.61 ; 0.000 0% Factoring (48 calls)
% 0.44/0.61 ; 0.002 1% Condensing (494 calls)
% 0.44/0.61 ; 0.026 19% Forward subsumption (494 calls)
% 0.44/0.61 ; 0.007 5% Backward subsumption (187 calls)
% 0.44/0.61 ; 0.011 8% Clause clause subsumption (2,782 calls)
% 0.44/0.61 ; 0.014 10% Forward simplification (787 calls)
% 0.44/0.61 ; 0.005 4% Backward simplification (221 calls)
% 0.44/0.61 ; 0.005 4% Ordering (874 calls)
% 0.44/0.61 ; 0.000 0% Sortal reasoning (32 calls)
% 0.44/0.61 ; 0.000 0% Purity testing (1 call)
% 0.44/0.61 ; 0.028 20% Other
% 0.44/0.61 ; 0.138 Total
% 0.44/0.61 ; 0.142 Real time
% 0.44/0.61 ;
% 0.44/0.61 ; Term-hash-array has 53 terms in all.
% 0.44/0.61 ; Feature-vector-row-index has 6 entries (77 at peak, 187 added, 181 deleted).
% 0.44/0.61 ; Feature-vector-row-index has 17 nodes (227 at peak, 483 added, 466 deleted).
% 0.44/0.61 ; Retrieved 4,224 possibly forward subsuming rows in 494 calls.
% 0.44/0.61 ; Retrieved 850 possibly backward subsumed rows in 187 calls.
% 0.44/0.61 ; Path-index has 52 entries (56 at peak, 73 added, 21 deleted).
% 0.44/0.61 ; Path-index has 36 nodes (36 at peak, 36 added, 0 deleted).
% 0.44/0.61 ; Trie-index has 52 entries (56 at peak, 73 added, 21 deleted).
% 0.44/0.61 ; Trie-index has 66 nodes (70 at peak, 87 added, 21 deleted).
% 0.44/0.61 ; Retrieved 508 generalization terms in 744 calls.
% 0.44/0.61 ; Retrieved 33 instance terms in 33 calls.
% 0.44/0.61 ; Retrieved 3,770 unifiable terms in 888 calls.
% 0.44/0.61 ;
% 0.44/0.61 ; The agenda of rows to process has 9 entries:
% 0.44/0.61 ; 9 with value 8
% 0.44/0.61 ; The agenda of rows to give has 18 entries:
% 0.44/0.61 ; 2 with value (4 7) 4 with value (4 9) 1 with value (4 11)
% 0.44/0.61 ; 2 with value (4 8) 2 with value (4 10) 7 with value (4 17)
% 0.44/0.61 Evaluation took:
% 0.44/0.61 0.142 seconds of real time
% 0.44/0.61 0.123286 seconds of user run time
% 0.44/0.61 0.019107 seconds of system run time
% 0.44/0.61 0 calls to %EVAL
% 0.44/0.61 0 page faults and
% 0.44/0.61 12,158,656 bytes consed.
% 0.44/0.61 :PROOF-FOUND
% 0.44/0.61 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T21:22:23
% 0.44/0.61 :PROOF-FOUND
% 0.44/0.61 *
%------------------------------------------------------------------------------