TSTP Solution File: ROB021-1 by SNARK---20120808r022

View Problem - Process Solution

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

% Computer : n023.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 : Mon Jul 18 20:56:02 EDT 2022

% Result   : Unsatisfiable 0.17s 0.48s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    5 (   4 unt;   0 nHn;   3 RR)
%            Number of literals    :    6 (   5 equ;   2 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :    6 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(robbins_axiom,axiom,
    negate(add(negate(add(X,Y)),negate(add(X,negate(Y))))) = X,
    file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',robbins_axiom) ).

cnf(negative_equality_implies_positive_equality,hypothesis,
    ( negate(X) != negate(Y)
    | X = Y ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',negative_equality_implies_positive_equality) ).

cnf(prove_huntingtons_axiom,negated_conjecture,
    add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_huntingtons_axiom) ).

cnf(4,plain,
    add(negate(add(negate(X),Y)),negate(add(negate(X),negate(Y)))) = X,
    inference('HYPERRESOLVE',[status(thm)],[negative_equality_implies_positive_equality,robbins_axiom]) ).

cnf(6,plain,
    $false,
    inference('REWRITE',[status(thm)],[prove_huntingtons_axiom,4,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : ROB021-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : run-snark %s %d
% 0.12/0.32  % Computer : n023.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Thu Jun  9 15:16:08 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 0.17/0.43  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.44  * 
% 0.17/0.44  * 
% 0.17/0.45  #<PACKAGE "SNARK-USER">
% 0.17/0.45  * 
% 0.17/0.45  SNARK-TPTP-OPTIONS
% 0.17/0.45  * 
% 0.17/0.45  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.17/0.45   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.17/0.45   (USE-FACTORING :POS)
% 0.17/0.45   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.17/0.45   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.17/0.45   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.17/0.45   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.17/0.45   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.17/0.45   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.17/0.45   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.17/0.45   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.17/0.45   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.17/0.45   (DECLARE-TPTP-SYMBOLS2))
% 0.17/0.45  * 
% 0.17/0.45  "."
% 0.17/0.45  * 
% 0.17/0.45  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-09T15:16:08
% 0.17/0.45  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n023.cluster.edu at 2022-06-09T15:16:08
% 0.17/0.46  
% 0.17/0.46  ; Recognized commutativity assertion (= (|add| ?X ?Y) (|add| ?Y ?X)).
% 0.17/0.46  ; Recognized associativity assertion (= (|add| (|add| ?X ?Y) ?Z) (|add| ?X (|add| ?Y ?Z))).
% 0.17/0.46  ; Declaring add to be commutative.
% 0.17/0.48  ; Declaring add to be associative-commutative.
% 0.17/0.48  
% 0.17/0.48  #||
% 0.17/0.48  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.48  % SZS output start Refutation
% See solution above
% 0.17/0.48  ||#
% 0.17/0.48  
% 0.17/0.48  ; Summary of computation:
% 0.17/0.48  ;        23 formulas have been input or derived (from 3 formulas).
% 0.17/0.48  ;         6 (26%) were retained.  Of these,
% 0.17/0.48  ;            1 (17%) were simplified or subsumed later,
% 0.17/0.48  ;            5 (83%) are still being kept.
% 0.17/0.48  ; 
% 0.17/0.48  ; Run time in seconds excluding printing time:
% 0.17/0.48  ;     0.002   8%   Read assertion file          (1 call)
% 0.17/0.48  ;     0.000   0%   Assert                       (5 calls)
% 0.17/0.48  ;     0.001   4%   Process new row              (12 calls)
% 0.17/0.48  ;     0.000   0%   Resolution                   (4 calls)
% 0.17/0.48  ;     0.001   4%   Paramodulation               (2 calls)
% 0.17/0.48  ;     0.000   0%   Embedding                    (1 call)
% 0.17/0.48  ;     0.000   0%   Condensing                   (1 call)
% 0.17/0.48  ;     0.000   0%   Forward subsumption          (1 call)
% 0.17/0.48  ;     0.000   0%   Backward subsumption         (1 call)
% 0.17/0.48  ;     0.001   4%   Forward simplification       (11 calls)
% 0.17/0.48  ;     0.000   0%   Backward simplification      (5 calls)
% 0.17/0.48  ;     0.000   0%   Ordering                     (14 calls)
% 0.17/0.48  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.17/0.48  ;     0.000   0%   Purity testing               (1 call)
% 0.17/0.48  ;     0.021  81%   Other
% 0.17/0.48  ;     0.026        Total
% 0.17/0.48  ;     0.028        Real time
% 0.17/0.48  ; 
% 0.17/0.48  ; Term-hash-array has 28 terms in all.
% 0.17/0.48  ; Feature-vector-row-index has 1 entry (1 at peak, 1 added, 0 deleted).
% 0.17/0.48  ; Feature-vector-row-index has 5 nodes (5 at peak, 5 added, 0 deleted).
% 0.17/0.48  ;  Retrieved 0 possibly forward subsuming rows in 1 call.
% 0.17/0.48  ;  Retrieved 0 possibly backward subsumed rows in 1 call.
% 0.17/0.48  ; Path-index has 21 entries (27 at peak, 31 added, 10 deleted).
% 0.17/0.48  ; Path-index has 37 nodes (52 at peak, 54 added, 17 deleted).
% 0.17/0.48  ; Trie-index has 21 entries (27 at peak, 31 added, 10 deleted).
% 0.17/0.48  ; Trie-index has 18 nodes (21 at peak, 23 added, 5 deleted).
% 0.17/0.48  ; Retrieved 4 generalization terms in 12 calls.
% 0.17/0.48  ; Retrieved 5 instance terms in 3 calls.
% 0.17/0.48  ; Retrieved 21 unifiable terms in 18 calls.
% 0.17/0.48  ; 
% 0.17/0.48  ; The agenda of rows to process has 10 entries:
% 0.17/0.48  ;     3 with value 20              1 with value 26               3 with value 30
% 0.17/0.48  ;     2 with value 24              1 with value 28
% 0.17/0.48  ; The agenda of rows to give has 2 entries:
% 0.17/0.48  ;     2 with value (4 20)
% 0.17/0.48  Evaluation took:
% 0.17/0.48    0.028 seconds of real time
% 0.17/0.48    0.022656 seconds of user run time
% 0.17/0.48    0.005683 seconds of system run time
% 0.17/0.48    0 calls to %EVAL
% 0.17/0.48    0 page faults and
% 0.17/0.48    1,616,976 bytes consed.
% 0.17/0.48  :PROOF-FOUND
% 0.17/0.48  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-09T15:16:08
% 0.17/0.48  :PROOF-FOUND
% 0.17/0.48  * 
%------------------------------------------------------------------------------