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

View Problem - Process Solution

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

% Computer : n019.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.18s 0.54s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   17 (  17 unt;   0 nHn;   7 RR)
%            Number of literals    :   17 (  16 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   12 (   0 sgn)

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

cnf(condition,hypothesis,
    add(c,negate(c)) = c,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',condition) ).

cnf(3,plain,
    add(c,add(negate(c),X)) = add(c,X),
    inference('EMBED',[status(thm)],[condition]) ).

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

cnf(5,plain,
    negate(add(negate(add(c,c)),negate(c))) = c,
    inference('PARAMODULATE',[status(thm)],[robbins_axiom,condition,theory(equality)]) ).

cnf(13,plain,
    negate(add(negate(add(c,X)),negate(add(X,add(negate(c),negate(c)))))) = add(X,negate(c)),
    inference('PARAMODULATE',[status(thm)],[robbins_axiom,3,theory(equality)]) ).

cnf(20,plain,
    negate(add(negate(add(c,c)),c)) = negate(c),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[robbins_axiom,5,theory(equality)]),condition,theory(equality)]) ).

cnf(21,plain,
    negate(c) = negate(add(c,c)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[robbins_axiom,5,theory(equality)]),condition,20,theory(equality)]) ).

cnf(22,plain,
    negate(add(negate(c),negate(c))) = c,
    inference('REWRITE',[status(thm)],[5,21,theory(equality)]) ).

cnf(25,plain,
    add(X,negate(c)) = X,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[robbins_axiom,22,theory(equality)]),13,theory(equality)]) ).

cnf(28,plain,
    negate(add(negate(add(c,X)),negate(X))) = X,
    inference('REWRITE',[status(thm)],[13,25,theory(equality)]) ).

cnf(31,plain,
    negate(add(negate(X),negate(negate(X)))) = negate(c),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[robbins_axiom,25,theory(equality)]),25,theory(equality)]) ).

cnf(40,plain,
    negate(add(X,negate(X))) = negate(c),
    inference('PARAMODULATE',[status(thm)],[31,28,theory(equality)]) ).

cnf(43,plain,
    negate(negate(add(X,negate(negate(X))))) = X,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[robbins_axiom,40,theory(equality)]),25,theory(equality)]) ).

cnf(44,plain,
    X = negate(negate(X)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[robbins_axiom,40,theory(equality)]),43,25,theory(equality)]) ).

cnf(68,plain,
    add(negate(add(X,Y)),negate(add(X,negate(Y)))) = negate(X),
    inference('PARAMODULATE',[status(thm)],[44,robbins_axiom,theory(equality)]) ).

cnf(71,plain,
    $false,
    inference('REWRITE',[status(thm)],[prove_huntingtons_axiom,44,68,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : ROB022-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n019.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 : Thu Jun  9 14:05:40 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.46  #<PACKAGE "SNARK-USER">
% 0.18/0.46  * 
% 0.18/0.46  SNARK-TPTP-OPTIONS
% 0.18/0.46  * 
% 0.18/0.46  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46   (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-06-09T14:05:40
% 0.18/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n019.cluster.edu at 2022-06-09T14:05:40
% 0.18/0.47  
% 0.18/0.47  ; Recognized commutativity assertion (= (|add| ?X ?Y) (|add| ?Y ?X)).
% 0.18/0.47  ; Recognized associativity assertion (= (|add| (|add| ?X ?Y) ?Z) (|add| ?X (|add| ?Y ?Z))).
% 0.18/0.47  ; Declaring add to be commutative.
% 0.18/0.54  ; Declaring add to be associative-commutative.
% 0.18/0.54  
% 0.18/0.54  #||
% 0.18/0.54  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.54  % SZS output start Refutation
% See solution above
% 0.18/0.54  ||#
% 0.18/0.54  
% 0.18/0.54  ; Summary of computation:
% 0.18/0.54  ;       205 formulas have been input or derived (from 16 formulas).
% 0.18/0.54  ;        71 (35%) were retained.  Of these,
% 0.18/0.54  ;           49 (69%) were simplified or subsumed later,
% 0.18/0.54  ;           22 (31%) are still being kept.
% 0.18/0.54  ; 
% 0.18/0.54  ; Run time in seconds excluding printing time:
% 0.18/0.54  ;     0.002   3%   Read assertion file          (1 call)
% 0.18/0.54  ;     0.001   1%   Assert                       (5 calls)
% 0.18/0.54  ;     0.007  10%   Process new row              (200 calls)
% 0.18/0.54  ;     0.001   1%   Resolution                   (30 calls)
% 0.18/0.54  ;     0.005   7%   Paramodulation               (15 calls)
% 0.18/0.54  ;     0.001   1%   Embedding                    (23 calls)
% 0.18/0.54  ;     0.022  31%   Forward simplification       (179 calls)
% 0.18/0.54  ;     0.010  14%   Backward simplification      (62 calls)
% 0.18/0.54  ;     0.000   0%   Ordering                     (240 calls)
% 0.18/0.54  ;     0.000   0%   Ordering ac                  (49 calls)
% 0.18/0.54  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.18/0.54  ;     0.000   0%   Purity testing               (1 call)
% 0.18/0.54  ;     0.021  30%   Other
% 0.18/0.54  ;     0.070        Total
% 0.18/0.54  ;     0.077        Real time
% 0.18/0.54  ; 
% 0.18/0.54  ; Term-hash-array has 277 terms in all.
% 0.18/0.54  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.18/0.54  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.18/0.54  ; Path-index has 77 entries (128 at peak, 289 added, 212 deleted).
% 0.18/0.54  ; Path-index has 93 nodes (145 at peak, 183 added, 90 deleted).
% 0.18/0.54  ; Trie-index has 77 entries (128 at peak, 289 added, 212 deleted).
% 0.18/0.54  ; Trie-index has 30 nodes (40 at peak, 55 added, 25 deleted).
% 0.18/0.54  ; Retrieved 5,196 generalization terms in 1,288 calls.
% 0.37/0.54  ; Retrieved 348 instance terms in 61 calls.
% 0.37/0.54  ; Retrieved 372 unifiable terms in 101 calls.
% 0.37/0.54  ; 
% 0.37/0.54  ; The agenda of rows to process has 1 entry:
% 0.37/0.54  ;     1 with value 25
% 0.37/0.54  ; The agenda of rows to give has 17 entries:
% 0.37/0.54  ;     2 with value (4 15)          1 with value (4 23)           2 with value (4 27)
% 0.37/0.54  ;     2 with value (4 16)          2 with value (4 24)           1 with value (4 28)
% 0.37/0.54  ;     1 with value (4 19)          3 with value (4 25)           1 with value (4 34)
% 0.37/0.54  ;     2 with value (4 22)
% 0.37/0.54  Evaluation took:
% 0.37/0.54    0.077 seconds of real time
% 0.37/0.54    0.065 seconds of user run time
% 0.37/0.54    0.008094 seconds of system run time
% 0.37/0.54    0 calls to %EVAL
% 0.37/0.54    0 page faults and
% 0.37/0.54    4,634,920 bytes consed.
% 0.37/0.54  :PROOF-FOUND
% 0.37/0.54  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-09T14:05:40
% 0.37/0.54  :PROOF-FOUND
% 0.37/0.54  * 
%------------------------------------------------------------------------------