↑ Up

SNARK---20120808r022.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : GRP124-8.004 : TPTP v8.1.0. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n013.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:46 EDT 2022

% Result   : Unsatisfiable 0.20s 0.58s
% Output   : Refutation 0.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   21
% Syntax   : Number of clauses     :   51 (  36 unt;  11 nHn;  49 RR)
%            Number of literals    :   74 (   0 equ;  37 neg)
%            Maximal clause size   :    6 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   20 (   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_1_is_not_e_4,axiom,
    ~ equalish(e_1,e_4),
    file('/export/starexec/sandbox/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/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(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_1,axiom,
    ~ equalish(e_4,e_1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_4_is_not_e_1) ).

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(product1_total_function1,axiom,
    ( ~ group_element(X)
    | ~ group_element(Y)
    | product1(X,Y,e_1)
    | product1(X,Y,e_2)
    | product1(X,Y,e_3)
    | product1(X,Y,e_4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',product1_total_function1) ).

cnf(product1_right_cancellation,axiom,
    ( ~ product1(X,Y,Z)
    | ~ product1(X,U,Z)
    | equalish(Y,U) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',product1_right_cancellation) ).

cnf(product1_left_cancellation,axiom,
    ( ~ product1(X,Y,Z)
    | ~ product1(U,Y,Z)
    | equalish(X,U) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',product1_left_cancellation) ).

cnf(product1_idempotence,axiom,
    product1(X,X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',product1_idempotence) ).

cnf(product2_total_function2,axiom,
    ( ~ product2(X,Y,Z)
    | ~ product2(X,Y,U)
    | equalish(Z,U) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',product2_total_function2) ).

cnf(product2_idempotence,axiom,
    product2(X,X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',product2_idempotence) ).

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

cnf(61,plain,
    ~ product1(e_4,e_1,e_4),
    inference('UR-RESOLVE',[status(thm)],[product1_right_cancellation,product1_idempotence,e_1_is_not_e_4]) ).

cnf(64,plain,
    ~ product1(e_3,e_1,e_3),
    inference('UR-RESOLVE',[status(thm)],[product1_right_cancellation,product1_idempotence,e_1_is_not_e_3]) ).

cnf(65,plain,
    ~ product1(e_3,e_2,e_3),
    inference('UR-RESOLVE',[status(thm)],[product1_right_cancellation,product1_idempotence,e_2_is_not_e_3]) ).

cnf(66,plain,
    ~ product1(e_3,e_4,e_3),
    inference('UR-RESOLVE',[status(thm)],[product1_right_cancellation,product1_idempotence,e_4_is_not_e_3]) ).

cnf(67,plain,
    ~ product1(e_2,e_1,e_2),
    inference('UR-RESOLVE',[status(thm)],[product1_right_cancellation,product1_idempotence,e_1_is_not_e_2]) ).

cnf(68,plain,
    ~ product1(e_2,e_3,e_2),
    inference('UR-RESOLVE',[status(thm)],[product1_right_cancellation,product1_idempotence,e_3_is_not_e_2]) ).

cnf(75,plain,
    ~ product1(e_3,e_4,e_4),
    inference('UR-RESOLVE',[status(thm)],[product1_left_cancellation,product1_idempotence,e_3_is_not_e_4]) ).

cnf(77,plain,
    ~ product1(e_2,e_3,e_3),
    inference('UR-RESOLVE',[status(thm)],[product1_left_cancellation,product1_idempotence,e_2_is_not_e_3]) ).

cnf(80,plain,
    ~ product1(e_3,e_2,e_2),
    inference('UR-RESOLVE',[status(thm)],[product1_left_cancellation,product1_idempotence,e_3_is_not_e_2]) ).

cnf(82,plain,
    ~ product1(e_2,e_1,e_1),
    inference('UR-RESOLVE',[status(thm)],[product1_left_cancellation,product1_idempotence,e_2_is_not_e_1]) ).

cnf(83,plain,
    ~ product1(e_3,e_1,e_1),
    inference('UR-RESOLVE',[status(thm)],[product1_left_cancellation,product1_idempotence,e_3_is_not_e_1]) ).

cnf(84,plain,
    ~ product1(e_4,e_1,e_1),
    inference('UR-RESOLVE',[status(thm)],[product1_left_cancellation,product1_idempotence,e_4_is_not_e_1]) ).

cnf(87,plain,
    ~ product2(e_4,e_4,e_3),
    inference('UR-RESOLVE',[status(thm)],[product2_total_function2,product2_idempotence,e_3_is_not_e_4]) ).

cnf(94,plain,
    ~ product2(e_1,e_1,e_2),
    inference('UR-RESOLVE',[status(thm)],[product2_total_function2,product2_idempotence,e_2_is_not_e_1]) ).

cnf(95,plain,
    ~ product2(e_1,e_1,e_3),
    inference('UR-RESOLVE',[status(thm)],[product2_total_function2,product2_idempotence,e_3_is_not_e_1]) ).

cnf(96,plain,
    ~ product2(e_1,e_1,e_4),
    inference('UR-RESOLVE',[status(thm)],[product2_total_function2,product2_idempotence,e_4_is_not_e_1]) ).

cnf(131,plain,
    ( product1(e_4,e_1,e_2)
    | product1(e_4,e_1,e_3) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product1_total_function1,element_4,element_1]),61,84]) ).

cnf(132,plain,
    ( product1(e_3,e_4,e_1)
    | product1(e_3,e_4,e_2) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product1_total_function1,element_3,element_4]),75,66]) ).

cnf(133,plain,
    ( product1(e_3,e_2,e_1)
    | product1(e_3,e_2,e_4) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product1_total_function1,element_3,element_2]),65,80]) ).

cnf(134,plain,
    ( product1(e_3,e_1,e_2)
    | product1(e_3,e_1,e_4) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product1_total_function1,element_3,element_1]),64,83]) ).

cnf(136,plain,
    ( product1(e_2,e_3,e_1)
    | product1(e_2,e_3,e_4) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product1_total_function1,element_2,element_3]),77,68]) ).

cnf(137,plain,
    ( product1(e_2,e_1,e_3)
    | product1(e_2,e_1,e_4) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product1_total_function1,element_2,element_1]),67,82]) ).

cnf(157,plain,
    ( product1(e_3,e_1,e_2)
    | product1(e_3,e_2,e_1) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product1_right_cancellation,134,133]),e_1_is_not_e_2]) ).

cnf(162,plain,
    ( product1(e_2,e_3,e_1)
    | product1(e_3,e_4,e_1) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[qg2a,136,132]),87]) ).

cnf(163,plain,
    ( product1(e_2,e_1,e_3)
    | product1(e_3,e_1,e_2) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product1_left_cancellation,137,134]),e_2_is_not_e_3]) ).

cnf(207,plain,
    ( product1(e_2,e_3,e_1)
    | product1(e_4,e_1,e_2) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[qg2a,162,131]),96]) ).

cnf(208,plain,
    product1(e_3,e_1,e_2),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[qg2a,163,157]),94]) ).

cnf(209,plain,
    ~ product1(e_2,e_3,e_1),
    inference('UR-RESOLVE',[status(thm)],[qg2a,208,95]) ).

cnf(219,plain,
    product1(e_4,e_1,e_2),
    inference('REWRITE',[status(thm)],[207,209]) ).

cnf(220,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[product1_left_cancellation,208,e_3_is_not_e_4]),219]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : GRP124-8.004 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.14  % Command  : run-snark %s %d
% 0.13/0.35  % Computer : n013.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 23:21:29 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.47  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48  * 
% 0.20/0.48  * 
% 0.20/0.49  #<PACKAGE "SNARK-USER">
% 0.20/0.49  * 
% 0.20/0.49  SNARK-TPTP-OPTIONS
% 0.20/0.49  * 
% 0.20/0.49  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49   (USE-FACTORING :POS)
% 0.20/0.49   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49  * 
% 0.20/0.49  "."
% 0.20/0.49  * 
% 0.20/0.49  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T23:21:29
% 0.20/0.49  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n013.cluster.edu at 2022-06-13T23:21:29
% 0.20/0.51  WARNING:
% 0.20/0.51     |product| is a 3-ary relation that occurs only negatively; disabling rows that contain it.
% 0.20/0.58  
% 0.20/0.58  
% 0.20/0.58  #||
% 0.20/0.58  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.58  % SZS output start Refutation
% See solution above
% 0.41/0.59  ||#
% 0.41/0.59  
% 0.41/0.59  ; Summary of computation:
% 0.41/0.59  ;       708 formulas have been input or derived (from 158 formulas).
% 0.41/0.59  ;       220 (31%) were retained.  Of these,
% 0.41/0.59  ;           62 (28%) were simplified or subsumed later,
% 0.41/0.59  ;          158 (72%) are still being kept.
% 0.41/0.59  ; 
% 0.41/0.59  ; Run time in seconds excluding printing time:
% 0.41/0.59  ;     0.006   7%   Read assertion file          (1 call)
% 0.41/0.59  ;     0.002   2%   Assert                       (48 calls)
% 0.41/0.59  ;     0.012  13%   Process new row              (630 calls)
% 0.41/0.59  ;     0.019  21%   Resolution                   (314 calls)
% 0.41/0.59  ;     0.000   0%   Paramodulation               (157 calls)
% 0.41/0.59  ;     0.001   1%   Factoring                    (34 calls)
% 0.41/0.59  ;     0.001   1%   Condensing                   (161 calls)
% 0.41/0.59  ;     0.007   8%   Forward subsumption          (161 calls)
% 0.41/0.59  ;     0.002   2%   Backward subsumption         (98 calls)
% 0.41/0.59  ;     0.001   1%   Clause clause subsumption    (1,064 calls)
% 0.41/0.59  ;     0.008   9%   Forward simplification       (607 calls)
% 0.41/0.59  ;     0.002   2%   Backward simplification      (220 calls)
% 0.41/0.59  ;     0.001   1%   Ordering                     (336 calls)
% 0.41/0.59  ;     0.001   1%   Sortal reasoning             (32 calls)
% 0.41/0.59  ;     0.000   0%   Purity testing               (1 call)
% 0.41/0.59  ;     0.028  31%   Other
% 0.41/0.59  ;     0.091        Total
% 0.41/0.59  ;     0.095        Real time
% 0.41/0.59  ; 
% 0.41/0.59  ; Term-hash-array has 208 terms in all.
% 0.41/0.59  ; Feature-vector-row-index has 37 entries (91 at peak, 98 added, 61 deleted).
% 0.41/0.59  ; Feature-vector-row-index has 112 nodes (177 at peak, 201 added, 89 deleted).
% 0.41/0.59  ;  Retrieved 947 possibly forward subsuming rows in 161 calls.
% 0.41/0.59  ;  Retrieved 364 possibly backward subsumed rows in 98 calls.
% 0.41/0.59  ; Path-index has 203 entries (212 at peak, 219 added, 16 deleted).
% 0.41/0.59  ; Path-index has 103 nodes (103 at peak, 105 added, 2 deleted).
% 0.41/0.59  ; Trie-index has 203 entries (212 at peak, 219 added, 16 deleted).
% 0.41/0.59  ; Trie-index has 252 nodes (261 at peak, 269 added, 17 deleted).
% 0.41/0.59  ; Retrieved 1,101 generalization terms in 1,174 calls.
% 0.41/0.59  ; Retrieved 155 instance terms in 121 calls.
% 0.41/0.59  ; Retrieved 7,344 unifiable terms in 2,034 calls.
% 0.41/0.59  ; 
% 0.41/0.59  ; The agenda of rows to process has 23 entries:
% 0.41/0.59  ;    17 with value 9               4 with value 13               2 with value 14
% 0.41/0.59  ; The agenda of rows to give has 19 entries:
% 0.41/0.59  ;     1 with value (4 6)           1 with value (4 9)            1 with value (4 13)
% 0.41/0.59  ;     4 with value (4 7)           6 with value (4 12)           2 with value (4 17)
% 0.41/0.59  ;     4 with value (4 8)
% 0.41/0.59  Evaluation took:
% 0.41/0.59    0.096 seconds of real time
% 0.41/0.59    0.083766 seconds of user run time
% 0.41/0.59    0.012143 seconds of system run time
% 0.41/0.59    0 calls to %EVAL
% 0.41/0.59    0 page faults and
% 0.41/0.59    7,706,368 bytes consed.
% 0.41/0.59  :PROOF-FOUND
% 0.41/0.59  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T23:21:29
% 0.41/0.59  :PROOF-FOUND
% 0.41/0.59  * 
%------------------------------------------------------------------------------