TSTP Solution File: GRP124-1.004 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP124-1.004 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n016.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:42 EDT 2022
% Result : Unsatisfiable 0.42s 0.59s
% Output : Refutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 20
% Syntax : Number of clauses : 46 ( 32 unt; 11 nHn; 45 RR)
% Number of literals : 69 ( 0 equ; 34 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(element_4,axiom,
group_element(e_4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_4) ).
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_1_is_not_e_4,axiom,
~ equalish(e_1,e_4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_1_is_not_e_4) ).
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(e_3_is_not_e_2,axiom,
~ equalish(e_3,e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_3_is_not_e_2) ).
cnf(e_3_is_not_e_4,axiom,
~ equalish(e_3,e_4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_3_is_not_e_4) ).
cnf(e_4_is_not_e_1,axiom,
~ equalish(e_4,e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_4_is_not_e_1) ).
cnf(e_4_is_not_e_2,axiom,
~ equalish(e_4,e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_4_is_not_e_2) ).
cnf(e_4_is_not_e_3,axiom,
~ equalish(e_4,e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_4_is_not_e_3) ).
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)
| product(X,Y,e_4) ),
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(product_idempotence,axiom,
product(X,X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_idempotence) ).
cnf(qg2_2,negated_conjecture,
( ~ product(X,Y,Z)
| ~ product(U,V,Z)
| ~ product(W,X,Y)
| ~ product(W,U,V)
| equalish(Y,V) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qg2_2) ).
cnf(37,plain,
~ product(e_4,e_1,e_4),
inference('UR-RESOLVE',[status(thm)],[product_right_cancellation,product_idempotence,e_1_is_not_e_4]) ).
cnf(40,plain,
~ product(e_3,e_1,e_3),
inference('UR-RESOLVE',[status(thm)],[product_right_cancellation,product_idempotence,e_1_is_not_e_3]) ).
cnf(41,plain,
~ product(e_3,e_2,e_3),
inference('UR-RESOLVE',[status(thm)],[product_right_cancellation,product_idempotence,e_2_is_not_e_3]) ).
cnf(42,plain,
~ product(e_3,e_4,e_3),
inference('UR-RESOLVE',[status(thm)],[product_right_cancellation,product_idempotence,e_4_is_not_e_3]) ).
cnf(43,plain,
~ product(e_2,e_1,e_2),
inference('UR-RESOLVE',[status(thm)],[product_right_cancellation,product_idempotence,e_1_is_not_e_2]) ).
cnf(44,plain,
~ product(e_2,e_3,e_2),
inference('UR-RESOLVE',[status(thm)],[product_right_cancellation,product_idempotence,e_3_is_not_e_2]) ).
cnf(51,plain,
~ product(e_3,e_4,e_4),
inference('UR-RESOLVE',[status(thm)],[product_left_cancellation,product_idempotence,e_3_is_not_e_4]) ).
cnf(53,plain,
~ product(e_2,e_3,e_3),
inference('UR-RESOLVE',[status(thm)],[product_left_cancellation,product_idempotence,e_2_is_not_e_3]) ).
cnf(56,plain,
~ product(e_3,e_2,e_2),
inference('UR-RESOLVE',[status(thm)],[product_left_cancellation,product_idempotence,e_3_is_not_e_2]) ).
cnf(58,plain,
~ product(e_2,e_1,e_1),
inference('UR-RESOLVE',[status(thm)],[product_left_cancellation,product_idempotence,e_2_is_not_e_1]) ).
cnf(59,plain,
~ product(e_3,e_1,e_1),
inference('UR-RESOLVE',[status(thm)],[product_left_cancellation,product_idempotence,e_3_is_not_e_1]) ).
cnf(60,plain,
~ product(e_4,e_1,e_1),
inference('UR-RESOLVE',[status(thm)],[product_left_cancellation,product_idempotence,e_4_is_not_e_1]) ).
cnf(63,plain,
( product(e_4,e_1,e_2)
| product(e_4,e_1,e_3) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_total_function1,element_4,element_1]),37,60]) ).
cnf(64,plain,
( product(e_3,e_4,e_1)
| product(e_3,e_4,e_2) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_total_function1,element_3,element_4]),51,42]) ).
cnf(65,plain,
( product(e_3,e_2,e_1)
| product(e_3,e_2,e_4) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_total_function1,element_3,element_2]),41,56]) ).
cnf(66,plain,
( product(e_3,e_1,e_2)
| product(e_3,e_1,e_4) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_total_function1,element_3,element_1]),40,59]) ).
cnf(68,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_4) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_total_function1,element_2,element_3]),53,44]) ).
cnf(69,plain,
( product(e_2,e_1,e_3)
| product(e_2,e_1,e_4) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_total_function1,element_2,element_1]),43,58]) ).
cnf(76,plain,
( product(e_3,e_1,e_2)
| product(e_3,e_2,e_1) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_right_cancellation,66,65]),e_1_is_not_e_2]) ).
cnf(80,plain,
( product(e_2,e_3,e_1)
| product(e_3,e_4,e_1) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[qg2_2,68,64,product_idempotence,product_idempotence]),e_4_is_not_e_2]) ).
cnf(81,plain,
( product(e_2,e_1,e_3)
| product(e_3,e_1,e_2) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_left_cancellation,69,66]),e_2_is_not_e_3]) ).
cnf(105,plain,
( product(e_2,e_3,e_1)
| product(e_4,e_1,e_2) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[qg2_2,80,63,product_idempotence,product_idempotence]),e_1_is_not_e_3]) ).
cnf(106,plain,
product(e_3,e_1,e_2),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[qg2_2,81,product_idempotence,76,product_idempotence]),e_1_is_not_e_3]) ).
cnf(107,plain,
~ product(e_2,e_3,e_1),
inference('UR-RESOLVE',[status(thm)],[qg2_2,106,product_idempotence,product_idempotence,e_1_is_not_e_2]) ).
cnf(115,plain,
product(e_4,e_1,e_2),
inference('REWRITE',[status(thm)],[105,107]) ).
cnf(116,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[product_left_cancellation,106,e_3_is_not_e_4]),115]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP124-1.004 : TPTP v8.1.0. Released v1.2.0.
% 0.12/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n016.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 Jun 13 22:24:30 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T22:24:30
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n016.cluster.edu at 2022-06-13T22:24:30
% 0.42/0.59
% 0.42/0.59
% 0.42/0.59 #||
% 0.42/0.59 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.42/0.59 % SZS output start Refutation
% See solution above
% 0.42/0.59 ||#
% 0.42/0.59
% 0.42/0.59 ; Summary of computation:
% 0.42/0.59 ; 1041 formulas have been input or derived (from 83 formulas).
% 0.42/0.59 ; 116 (11%) were retained. Of these,
% 0.42/0.59 ; 42 (36%) were simplified or subsumed later,
% 0.42/0.59 ; 74 (64%) are still being kept.
% 0.42/0.59 ;
% 0.42/0.59 ; Run time in seconds excluding printing time:
% 0.42/0.59 ; 0.004 3% Read assertion file (1 call)
% 0.42/0.59 ; 0.000 0% Assert (23 calls)
% 0.42/0.59 ; 0.008 7% Process new row (917 calls)
% 0.42/0.59 ; 0.036 31% Resolution (164 calls)
% 0.42/0.59 ; 0.002 2% Paramodulation (82 calls)
% 0.42/0.59 ; 0.000 0% Factoring (21 calls)
% 0.42/0.59 ; 0.001 1% Condensing (351 calls)
% 0.42/0.59 ; 0.015 13% Forward subsumption (351 calls)
% 0.42/0.59 ; 0.001 1% Backward subsumption (51 calls)
% 0.42/0.59 ; 0.002 2% Clause clause subsumption (1,661 calls)
% 0.42/0.59 ; 0.017 14% Forward simplification (823 calls)
% 0.42/0.59 ; 0.001 1% Backward simplification (116 calls)
% 0.42/0.59 ; 0.004 3% Ordering (642 calls)
% 0.42/0.59 ; 0.001 1% Sortal reasoning (32 calls)
% 0.42/0.59 ; 0.001 1% Purity testing (1 call)
% 0.42/0.59 ; 0.025 21% Other
% 0.42/0.59 ; 0.118 Total
% 0.42/0.59 ; 0.121 Real time
% 0.42/0.59 ;
% 0.42/0.59 ; Term-hash-array has 95 terms in all.
% 0.42/0.59 ; Feature-vector-row-index has 9 entries (51 at peak, 51 added, 42 deleted).
% 0.42/0.59 ; Feature-vector-row-index has 28 nodes (53 at peak, 53 added, 25 deleted).
% 0.42/0.59 ; Retrieved 6,366 possibly forward subsuming rows in 351 calls.
% 0.42/0.59 ; Retrieved 212 possibly backward subsumed rows in 51 calls.
% 0.42/0.59 ; Path-index has 91 entries (99 at peak, 100 added, 9 deleted).
% 0.42/0.59 ; Path-index has 43 nodes (43 at peak, 43 added, 0 deleted).
% 0.42/0.59 ; Trie-index has 91 entries (99 at peak, 100 added, 9 deleted).
% 0.42/0.59 ; Trie-index has 110 nodes (118 at peak, 119 added, 9 deleted).
% 0.42/0.59 ; Retrieved 2,515 generalization terms in 2,537 calls.
% 0.42/0.59 ; Retrieved 88 instance terms in 64 calls.
% 0.42/0.59 ; Retrieved 14,430 unifiable terms in 3,580 calls.
% 0.42/0.59 ;
% 0.42/0.59 ; The agenda of rows to process has 37 entries:
% 0.42/0.59 ; 17 with value 9 16 with value 13 4 with value 18
% 0.42/0.59 ; The agenda of rows to give has 9 entries:
% 0.42/0.59 ; 1 with value (4 6) 3 with value (4 8) 1 with value (4 9)
% 0.42/0.59 ; 4 with value (4 7)
% 0.42/0.59 Evaluation took:
% 0.42/0.59 0.121 seconds of real time
% 0.42/0.60 0.103065 seconds of user run time
% 0.42/0.60 0.017968 seconds of system run time
% 0.42/0.60 0 calls to %EVAL
% 0.42/0.60 0 page faults and
% 0.42/0.60 9,553,152 bytes consed.
% 0.42/0.60 :PROOF-FOUND
% 0.42/0.60 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T22:24:30
% 0.42/0.60 :PROOF-FOUND
% 0.42/0.60 *
%------------------------------------------------------------------------------