TSTP Solution File: GRP126-3.004 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : GRP126-3.004 : TPTP v8.1.0. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n011.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:50 EDT 2022

% Result   : Unsatisfiable 0.43s 0.60s
% Output   : Refutation 0.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   19
% Syntax   : Number of clauses     :   53 (  36 unt;  13 nHn;  52 RR)
%            Number of literals    :   78 (   0 equ;  37 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   :   19 (   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(element_4,axiom,
    group_element(e_4),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_4) ).

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_2_is_not_e_4,axiom,
    ~ equalish(e_2,e_4),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_2_is_not_e_4) ).

cnf(e_3_is_not_e_2,axiom,
    ~ equalish(e_3,e_2),
    file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',e_3_is_not_e_4) ).

cnf(e_4_is_not_e_2,axiom,
    ~ equalish(e_4,e_2),
    file('/export/starexec/sandbox/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/sandbox/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/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(product_idempotence,axiom,
    product(X,X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_idempotence) ).

cnf(qg4,negated_conjecture,
    ( ~ product(X,Y,Z)
    | ~ product(Y,X,U)
    | product(Z,U,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',qg4) ).

cnf(48,plain,
    ~ product(e_4,e_4,e_3),
    inference('UR-RESOLVE',[status(thm)],[product_total_function2,product_idempotence,e_3_is_not_e_4]) ).

cnf(49,plain,
    ~ product(e_3,e_3,e_1),
    inference('UR-RESOLVE',[status(thm)],[product_total_function2,product_idempotence,e_1_is_not_e_3]) ).

cnf(54,plain,
    ~ product(e_2,e_2,e_4),
    inference('UR-RESOLVE',[status(thm)],[product_total_function2,product_idempotence,e_4_is_not_e_2]) ).

cnf(55,plain,
    ~ product(e_1,e_1,e_2),
    inference('UR-RESOLVE',[status(thm)],[product_total_function2,product_idempotence,e_2_is_not_e_1]) ).

cnf(60,plain,
    ~ product(e_4,e_3,e_4),
    inference('UR-RESOLVE',[status(thm)],[product_right_cancellation,product_idempotence,e_3_is_not_e_4]) ).

cnf(62,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(63,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(64,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(65,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(67,plain,
    ~ product(e_1,e_2,e_1),
    inference('UR-RESOLVE',[status(thm)],[product_right_cancellation,product_idempotence,e_2_is_not_e_1]) ).

cnf(72,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(74,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(75,plain,
    ~ product(e_4,e_3,e_3),
    inference('UR-RESOLVE',[status(thm)],[product_left_cancellation,product_idempotence,e_4_is_not_e_3]) ).

cnf(76,plain,
    ~ product(e_1,e_2,e_2),
    inference('UR-RESOLVE',[status(thm)],[product_left_cancellation,product_idempotence,e_1_is_not_e_2]) ).

cnf(77,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(79,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(97,plain,
    ( product(e_4,e_3,e_1)
    | product(e_4,e_3,e_2) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_total_function1,element_4,element_3]),60,75]) ).

cnf(100,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]),72,63]) ).

cnf(101,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]),62,77]) ).

cnf(104,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]),74,65]) ).

cnf(105,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]),64,79]) ).

cnf(108,plain,
    ( product(e_1,e_2,e_3)
    | product(e_1,e_2,e_4) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_total_function1,element_1,element_2]),76,67]) ).

cnf(115,plain,
    ( product(e_3,e_4,e_1)
    | product(e_4,e_3,e_1) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[qg4,100,97]),54]) ).

cnf(118,plain,
    ( product(e_2,e_3,e_1)
    | product(e_3,e_2,e_1) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[qg4,104,101]),48]) ).

cnf(120,plain,
    ( product(e_2,e_1,e_3)
    | product(e_2,e_3,e_1) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_right_cancellation,105,104]),e_1_is_not_e_3]) ).

cnf(125,plain,
    ( product(e_1,e_2,e_3)
    | product(e_3,e_2,e_1) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_left_cancellation,108,101]),e_1_is_not_e_3]) ).

cnf(134,plain,
    ( product(e_4,e_3,e_1)
    | product(e_2,e_1,e_3) ),
    inference('HYPERRESOLVE',[status(thm)],[qg4,115,97]) ).

cnf(156,plain,
    ( product(e_2,e_3,e_1)
    | product(e_4,e_1,e_3) ),
    inference('HYPERRESOLVE',[status(thm)],[qg4,118,104]) ).

cnf(194,plain,
    product(e_2,e_1,e_3),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_left_cancellation,134,120]),e_4_is_not_e_2]) ).

cnf(197,plain,
    ~ product(e_1,e_2,e_3),
    inference('UR-RESOLVE',[status(thm)],[qg4,194,49]) ).

cnf(199,plain,
    product(e_3,e_2,e_1),
    inference('REWRITE',[status(thm)],[125,197]) ).

cnf(206,plain,
    ~ product(e_4,e_1,e_3),
    inference('UR-RESOLVE',[status(thm)],[product_left_cancellation,194,e_2_is_not_e_4]) ).

cnf(207,plain,
    product(e_2,e_3,e_1),
    inference('REWRITE',[status(thm)],[156,206]) ).

cnf(215,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[qg4,199,55]),207]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : GRP126-3.004 : TPTP v8.1.0. Released v1.2.0.
% 0.12/0.13  % Command  : run-snark %s %d
% 0.13/0.35  % Computer : n011.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Mon Jun 13 13:18:48 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47  * 
% 0.20/0.47  * 
% 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-13T13:18:48
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n011.cluster.edu at 2022-06-13T13:18:48
% 0.43/0.60  
% 0.43/0.60  
% 0.43/0.60  #||
% 0.43/0.60  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.43/0.60  % SZS output start Refutation
% See solution above
% 0.43/0.61  ||#
% 0.43/0.61  
% 0.43/0.61  ; Summary of computation:
% 0.43/0.61  ;      1275 formulas have been input or derived (from 130 formulas).
% 0.43/0.61  ;       215 (17%) were retained.  Of these,
% 0.43/0.61  ;           99 (46%) were simplified or subsumed later,
% 0.43/0.61  ;          116 (54%) are still being kept.
% 0.43/0.61  ; 
% 0.43/0.61  ; Run time in seconds excluding printing time:
% 0.43/0.61  ;     0.006   5%   Read assertion file          (1 call)
% 0.43/0.61  ;     0.001   1%   Assert                       (43 calls)
% 0.43/0.61  ;     0.014  11%   Process new row              (1,187 calls)
% 0.43/0.61  ;     0.025  19%   Resolution                   (258 calls)
% 0.43/0.61  ;     0.000   0%   Paramodulation               (129 calls)
% 0.43/0.61  ;     0.000   0%   Factoring                    (33 calls)
% 0.43/0.61  ;     0.002   2%   Condensing                   (447 calls)
% 0.43/0.61  ;     0.013  10%   Forward subsumption          (447 calls)
% 0.43/0.61  ;     0.005   4%   Backward subsumption         (111 calls)
% 0.43/0.61  ;     0.007   5%   Clause clause subsumption    (2,976 calls)
% 0.43/0.61  ;     0.018  14%   Forward simplification       (1,140 calls)
% 0.43/0.61  ;     0.006   5%   Backward simplification      (215 calls)
% 0.43/0.61  ;     0.004   3%   Ordering                     (1,440 calls)
% 0.43/0.61  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.43/0.61  ;     0.000   0%   Purity testing               (1 call)
% 0.43/0.61  ;     0.030  23%   Other
% 0.43/0.61  ;     0.131        Total
% 0.43/0.61  ;     0.135        Real time
% 0.43/0.61  ; 
% 0.43/0.61  ; Term-hash-array has 149 terms in all.
% 0.43/0.61  ; Feature-vector-row-index has 13 entries (90 at peak, 111 added, 98 deleted).
% 0.43/0.61  ; Feature-vector-row-index has 49 nodes (133 at peak, 172 added, 123 deleted).
% 0.43/0.61  ;  Retrieved 4,489 possibly forward subsuming rows in 447 calls.
% 0.43/0.61  ;  Retrieved 539 possibly backward subsumed rows in 111 calls.
% 0.43/0.61  ; Path-index has 148 entries (153 at peak, 170 added, 22 deleted).
% 0.43/0.61  ; Path-index has 86 nodes (86 at peak, 88 added, 2 deleted).
% 0.43/0.61  ; Trie-index has 148 entries (153 at peak, 170 added, 22 deleted).
% 0.43/0.61  ; Trie-index has 178 nodes (183 at peak, 201 added, 23 deleted).
% 0.43/0.61  ; Retrieved 2,450 generalization terms in 2,661 calls.
% 0.43/0.61  ; Retrieved 131 instance terms in 103 calls.
% 0.43/0.61  ; Retrieved 8,021 unifiable terms in 1,918 calls.
% 0.43/0.61  ; 
% 0.43/0.61  ; The agenda of rows to process has 21 entries:
% 0.43/0.61  ;    21 with value 8
% 0.43/0.61  ; The agenda of rows to give has 18 entries:
% 0.43/0.61  ;     3 with value (4 7)           1 with value (4 9)            1 with value (4 13)
% 0.43/0.61  ;     9 with value (4 8)           4 with value (4 10)
% 0.43/0.61  Evaluation took:
% 0.43/0.61    0.135 seconds of real time
% 0.43/0.61    0.11393 seconds of user run time
% 0.43/0.61    0.021882 seconds of system run time
% 0.43/0.61    0 calls to %EVAL
% 0.43/0.61    0 page faults and
% 0.43/0.61    10,081,520 bytes consed.
% 0.43/0.61  :PROOF-FOUND
% 0.43/0.61  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T13:18:49
% 0.43/0.61  :PROOF-FOUND
% 0.43/0.61  * 
%------------------------------------------------------------------------------