↑ Up

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

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

% Computer : n018.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 13:02:34 EDT 2022

% Result   : Unsatisfiable 0.46s 0.65s
% Output   : Refutation 0.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   24 (  17 unt;   0 nHn;  18 RR)
%            Number of literals    :   42 (   3 equ;  20 neg)
%            Maximal clause size   :    6 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   37 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(less_equal_quotient,axiom,
    ( ~ quotient(X,Y,zero)
    | less_equal(X,Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',less_equal_quotient) ).

cnf(divisor_existence,axiom,
    ( ~ quotient(X,Y,Z)
    | less_equal(Z,X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',divisor_existence) ).

cnf(quotient_property,axiom,
    ( ~ quotient(X,Y,Z)
    | ~ quotient(Y,U,V)
    | ~ quotient(X,U,W)
    | ~ quotient(W,V,X1)
    | ~ quotient(Z,U,Y1)
    | less_equal(X1,Y1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',quotient_property) ).

cnf(less_equal_and_equal,axiom,
    ( ~ less_equal(X,Y)
    | ~ less_equal(Y,X)
    | X = Y ),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',less_equal_and_equal) ).

cnf(identity_is_largest,axiom,
    less_equal(X,identity),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',identity_is_largest) ).

cnf(closure,axiom,
    quotient(X,Y,divide(X,Y)),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',closure) ).

cnf(x_divide_x_is_zero,axiom,
    quotient(X,X,zero),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_divide_x_is_zero) ).

cnf(x_divde_zero_is_x,axiom,
    quotient(X,zero,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_divde_zero_is_x) ).

cnf(xQyLEz_implies_xQzLEy,axiom,
    ( ~ quotient(X,Y,Z)
    | ~ less_equal(Z,U)
    | ~ quotient(X,U,V)
    | less_equal(V,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',xQyLEz_implies_xQzLEy) ).

cnf(xLEy_implies_zQyLEzQx,axiom,
    ( ~ less_equal(X,Y)
    | ~ quotient(Z,Y,U)
    | ~ quotient(Z,X,V)
    | less_equal(U,V) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',xLEy_implies_zQyLEzQx) ).

cnf(xLEy_implies_xQzLEyQz,axiom,
    ( ~ less_equal(X,Y)
    | ~ quotient(X,Z,U)
    | ~ quotient(Y,Z,V)
    | less_equal(U,V) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',xLEy_implies_xQzLEyQz) ).

cnf(identity_divide_a,hypothesis,
    quotient(identity,a,idQa),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity_divide_a) ).

cnf(identity_divide_idQa,hypothesis,
    quotient(identity,idQa,idQ_idQa),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity_divide_idQa) ).

cnf(identity_divide_idQ_idQa,hypothesis,
    quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity_divide_idQ_idQa) ).

cnf(prove_idQa_equals_idQa_Q__idQ_idQa,negated_conjecture,
    idQa != idQa_Q__idQ_idQa,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_idQa_equals_idQa_Q__idQ_idQa) ).

cnf(22,plain,
    less_equal(X,X),
    inference('HYPERRESOLVE',[status(thm)],[less_equal_quotient,x_divide_x_is_zero]) ).

cnf(23,plain,
    less_equal(idQa_Q__idQ_idQa,idQa),
    inference('HYPERRESOLVE',[status(thm)],[divisor_existence,identity_divide_idQ_idQa]) ).

cnf(37,plain,
    less_equal(divide(X,a),idQa),
    inference('HYPERRESOLVE',[status(thm)],[xLEy_implies_xQzLEyQz,identity_is_largest,closure,identity_divide_a]) ).

cnf(42,plain,
    less_equal(idQa,divide(idQa,a)),
    inference('HYPERRESOLVE',[status(thm)],[quotient_property,identity_divide_a,x_divide_x_is_zero,identity_divide_a,x_divde_zero_is_x,closure]) ).

cnf(62,plain,
    less_equal(idQ_idQa,a),
    inference('HYPERRESOLVE',[status(thm)],[xQyLEz_implies_xQzLEy,22,identity_divide_a,identity_divide_idQa]) ).

cnf(66,plain,
    ~ less_equal(idQa,idQa_Q__idQ_idQa),
    inference('UR-RESOLVE',[status(thm)],[less_equal_and_equal,23,prove_idQa_equals_idQa_Q__idQ_idQa]) ).

cnf(75,plain,
    less_equal(divide(idQa,a),idQa_Q__idQ_idQa),
    inference('HYPERRESOLVE',[status(thm)],[xLEy_implies_zQyLEzQx,62,closure,identity_divide_idQ_idQa]) ).

cnf(216,plain,
    idQa = divide(idQa,a),
    inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,42,37]) ).

cnf(217,plain,
    $false,
    inference('REWRITE',[status(thm)],[75,66,216,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : HEN010-7 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n018.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Fri Jul  1 13:22:32 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45  * 
% 0.18/0.45  * 
% 0.18/0.45  #<PACKAGE "SNARK-USER">
% 0.18/0.45  * 
% 0.18/0.45  SNARK-TPTP-OPTIONS
% 0.18/0.45  * 
% 0.18/0.45  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.45   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46   (USE-FACTORING :POS)
% 0.18/0.46   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46   (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46  * 
% 0.18/0.46  "."
% 0.18/0.46  * 
% 0.18/0.46  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-01T13:22:32
% 0.18/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n018.cluster.edu at 2022-07-01T13:22:32
% 0.18/0.47  
% 0.18/0.47  ; Recognized relation function assertion (|quotient| ?X ?Y (|divide| ?X ?Y)).
% 0.18/0.47  ; Recognized relation functionality assertion (OR (NOT (|quotient| ?X ?Y ?Z)) (NOT (|quotient| ?X ?Y ?U)) (= ?Z ?U)).
% 0.46/0.65  ; Recognized possible right identity assertion (|quotient| ?X |zero| ?X).
% 0.46/0.65  
% 0.46/0.65  #||
% 0.46/0.65  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.65  % SZS output start Refutation
% See solution above
% 0.46/0.66  ||#
% 0.46/0.66  
% 0.46/0.66  ; Summary of computation:
% 0.46/0.66  ;      6160 formulas have been input or derived (from 48 formulas).
% 0.46/0.66  ;       217 ( 4%) were retained.  Of these,
% 0.46/0.66  ;           19 ( 9%) were simplified or subsumed later,
% 0.46/0.66  ;          198 (91%) are still being kept.
% 0.46/0.66  ; 
% 0.46/0.66  ; Run time in seconds excluding printing time:
% 0.46/0.66  ;     0.004   2%   Read assertion file          (1 call)
% 0.46/0.66  ;     0.001   1%   Assert                       (21 calls)
% 0.46/0.66  ;     0.015   8%   Process new row              (3,449 calls)
% 0.46/0.66  ;     0.117  60%   Resolution                   (94 calls)
% 0.46/0.66  ;     0.001   1%   Paramodulation               (47 calls)
% 0.46/0.66  ;     0.001   1%   Condensing                   (10 calls)
% 0.46/0.66  ;     0.000   0%   Forward subsumption          (10 calls)
% 0.46/0.66  ;     0.001   1%   Backward subsumption         (10 calls)
% 0.46/0.66  ;     0.000   0%   Clause clause subsumption    (11 calls)
% 0.46/0.66  ;     0.020  10%   Forward simplification       (3,348 calls)
% 0.46/0.66  ;     0.001   1%   Backward simplification      (217 calls)
% 0.46/0.66  ;     0.000   0%   Ordering                     (59 calls)
% 0.46/0.66  ;     0.001   1%   Sortal reasoning             (32 calls)
% 0.46/0.66  ;     0.000   0%   Purity testing               (1 call)
% 0.46/0.66  ;     0.033  17%   Other
% 0.46/0.66  ;     0.195        Total
% 0.46/0.66  ;     0.201        Real time
% 0.46/0.66  ; 
% 0.46/0.66  ; Term-hash-array has 311 terms in all.
% 0.46/0.66  ; Feature-vector-row-index has 10 entries (10 at peak, 10 added, 0 deleted).
% 0.46/0.66  ; Feature-vector-row-index has 15 nodes (15 at peak, 15 added, 0 deleted).
% 0.46/0.66  ;  Retrieved 7 possibly forward subsuming rows in 10 calls.
% 0.46/0.66  ;  Retrieved 4 possibly backward subsumed rows in 10 calls.
% 0.46/0.66  ; Path-index has 296 entries (300 at peak, 317 added, 21 deleted).
% 0.46/0.66  ; Path-index has 247 nodes (247 at peak, 247 added, 0 deleted).
% 0.46/0.66  ; Trie-index has 296 entries (300 at peak, 317 added, 21 deleted).
% 0.46/0.66  ; Trie-index has 623 nodes (634 at peak, 667 added, 44 deleted).
% 0.46/0.66  ; Retrieved 7,399 generalization terms in 6,459 calls.
% 0.46/0.66  ; Retrieved 318 instance terms in 206 calls.
% 0.46/0.66  ; Retrieved 58,198 unifiable terms in 15,199 calls.
% 0.46/0.66  ; 
% 0.46/0.66  ; The agenda of rows to process has 62 entries:
% 0.46/0.66  ;    13 with value 9               8 with value 11               1 with value 13
% 0.46/0.66  ;     3 with value 10             33 with value 12               4 with value 14
% 0.46/0.66  ; The agenda of rows to give has 155 entries:
% 0.46/0.66  ;    18 with value (4 8)          35 with value (4 12)           1 with value (4 17)
% 0.46/0.66  ;    40 with value (4 9)           7 with value (4 13)           1 with value (4 18)
% 0.46/0.66  ;    13 with value (4 10)         15 with value (4 14)           2 with value (4 19)
% 0.46/0.66  ;    14 with value (4 11)          9 with value (4 15)
% 0.46/0.66  Evaluation took:
% 0.46/0.66    0.201 seconds of real time
% 0.46/0.66    0.177382 seconds of user run time
% 0.46/0.66    0.024219 seconds of system run time
% 0.46/0.66    [Run times include 0.005 seconds GC run time.]
% 0.46/0.66    0 calls to %EVAL
% 0.46/0.66    0 page faults and
% 0.46/0.66    12,682,600 bytes consed.
% 0.46/0.66  :PROOF-FOUND
% 0.46/0.66  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-01T13:22:33
% 0.46/0.66  :PROOF-FOUND
% 0.46/0.66  * 
%------------------------------------------------------------------------------