↑ Up

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

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

% Computer : n021.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:49 EDT 2022

% Result   : Unsatisfiable 0.20s 0.51s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   18
% Syntax   : Number of clauses     :   35 (  27 unt;   3 nHn;  34 RR)
%            Number of literals    :   52 (   0 equ;  29 neg)
%            Maximal clause size   :    6 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   22 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
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_4_greater_e_3,axiom,
    greater(e_4,e_3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_4_greater_e_3) ).

cnf(no_redundancy,axiom,
    ( ~ product(X,e_1,Y)
    | ~ next(X,Z)
    | ~ greater(Y,Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_redundancy) ).

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_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_4,axiom,
    ~ equalish(e_2,e_4),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_2_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(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_total_function2,axiom,
    ( ~ product(X,Y,Z)
    | ~ product(X,Y,U)
    | equalish(Z,U) ),
    file('/export/starexec/sandbox2/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/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(qg4,negated_conjecture,
    ( ~ product(X,Y,Z)
    | ~ product(Y,X,U)
    | product(Z,U,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qg4) ).

cnf(34,plain,
    ~ product(e_2,e_1,e_4),
    inference('UR-RESOLVE',[status(thm)],[no_redundancy,e_2_then_e_3,e_4_greater_e_3]) ).

cnf(41,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(48,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(54,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(57,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(66,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(69,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(71,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(74,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]),48,71]) ).

cnf(80,plain,
    product(e_2,e_1,e_3),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_total_function1,element_2,element_1]),34,54,69]) ).

cnf(83,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]),66,57]) ).

cnf(87,plain,
    ~ product(e_1,e_2,e_3),
    inference('UR-RESOLVE',[status(thm)],[qg4,80,41]) ).

cnf(88,plain,
    product(e_1,e_2,e_4),
    inference('REWRITE',[status(thm)],[83,87]) ).

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

cnf(90,plain,
    product(e_4,e_1,e_2),
    inference('REWRITE',[status(thm)],[74,89]) ).

cnf(93,plain,
    product(e_4,e_3,e_2),
    inference('HYPERRESOLVE',[status(thm)],[qg4,88,80]) ).

cnf(104,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[product_right_cancellation,90,e_1_is_not_e_3]),93]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP126-2.004 : TPTP v8.1.0. Released v1.2.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.13/0.33  % Computer : n021.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jun 13 23:17:12 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46  * 
% 0.20/0.46  * 
% 0.20/0.46  #<PACKAGE "SNARK-USER">
% 0.20/0.46  * 
% 0.20/0.46  SNARK-TPTP-OPTIONS
% 0.20/0.46  * 
% 0.20/0.46  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.46   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.46   (USE-FACTORING :POS)
% 0.20/0.46   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.46   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.46   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.46   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.46   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.46   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.46   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.46   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.46   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.46   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.46  * 
% 0.20/0.46  "."
% 0.20/0.46  * 
% 0.20/0.46  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T23:17:12
% 0.20/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-06-13T23:17:12
% 0.20/0.51  
% 0.20/0.51  
% 0.20/0.51  #||
% 0.20/0.51  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.51  % SZS output start Refutation
% See solution above
% 0.20/0.51  ||#
% 0.20/0.51  
% 0.20/0.51  ; Summary of computation:
% 0.20/0.51  ;       290 formulas have been input or derived (from 78 formulas).
% 0.20/0.51  ;       104 (36%) were retained.  Of these,
% 0.20/0.51  ;            9 ( 9%) were simplified or subsumed later,
% 0.20/0.51  ;           95 (91%) are still being kept.
% 0.20/0.51  ; 
% 0.20/0.51  ; Run time in seconds excluding printing time:
% 0.20/0.51  ;     0.004   8%   Read assertion file          (1 call)
% 0.20/0.51  ;     0.000   0%   Assert                       (32 calls)
% 0.20/0.51  ;     0.006  12%   Process new row              (261 calls)
% 0.20/0.51  ;     0.008  17%   Resolution                   (154 calls)
% 0.20/0.51  ;     0.000   0%   Paramodulation               (77 calls)
% 0.20/0.51  ;     0.000   0%   Condensing                   (17 calls)
% 0.20/0.51  ;     0.000   0%   Forward subsumption          (17 calls)
% 0.20/0.51  ;     0.000   0%   Backward subsumption         (17 calls)
% 0.20/0.51  ;     0.000   0%   Clause clause subsumption    (16 calls)
% 0.20/0.51  ;     0.004   8%   Forward simplification       (261 calls)
% 0.20/0.51  ;     0.001   2%   Backward simplification      (104 calls)
% 0.20/0.51  ;     0.000   0%   Ordering                     (14 calls)
% 0.20/0.51  ;     0.001   2%   Sortal reasoning             (32 calls)
% 0.20/0.51  ;     0.000   0%   Purity testing               (1 call)
% 0.20/0.51  ;     0.024  50%   Other
% 0.20/0.51  ;     0.048        Total
% 0.20/0.51  ;     0.051        Real time
% 0.20/0.51  ; 
% 0.20/0.51  ; Term-hash-array has 110 terms in all.
% 0.20/0.51  ; Feature-vector-row-index has 8 entries (17 at peak, 17 added, 9 deleted).
% 0.20/0.51  ; Feature-vector-row-index has 26 nodes (44 at peak, 44 added, 18 deleted).
% 0.20/0.51  ;  Retrieved 8 possibly forward subsuming rows in 17 calls.
% 0.20/0.51  ;  Retrieved 8 possibly backward subsumed rows in 17 calls.
% 0.20/0.51  ; Path-index has 112 entries (113 at peak, 121 added, 9 deleted).
% 0.20/0.51  ; Path-index has 68 nodes (68 at peak, 68 added, 0 deleted).
% 0.20/0.51  ; Trie-index has 112 entries (113 at peak, 121 added, 9 deleted).
% 0.20/0.51  ; Trie-index has 146 nodes (146 at peak, 155 added, 9 deleted).
% 0.20/0.51  ; Retrieved 274 generalization terms in 308 calls.
% 0.20/0.51  ; Retrieved 110 instance terms in 86 calls.
% 0.20/0.51  ; Retrieved 3,492 unifiable terms in 967 calls.
% 0.20/0.51  ; 
% 0.20/0.51  ; The agenda of rows to process has 15 entries:
% 0.20/0.51  ;    15 with value 7
% 0.20/0.51  ; The agenda of rows to give has 17 entries:
% 0.20/0.51  ;     6 with value (4 6)           9 with value (4 7)            2 with value (4 11)
% 0.20/0.51  Evaluation took:
% 0.20/0.51    0.052 seconds of real time
% 0.20/0.51    0.042689 seconds of user run time
% 0.20/0.51    0.008838 seconds of system run time
% 0.20/0.51    0 calls to %EVAL
% 0.20/0.51    0 page faults and
% 0.20/0.51    4,135,296 bytes consed.
% 0.20/0.51  :PROOF-FOUND
% 0.20/0.52  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T23:17:12
% 0.20/0.52  :PROOF-FOUND
% 0.20/0.52  * 
%------------------------------------------------------------------------------