TSTP Solution File: ROB016-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : ROB016-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:01 EDT 2022
% Result : Unsatisfiable 0.18s 0.49s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 7 ( 6 unt; 0 nHn; 6 RR)
% Number of literals : 9 ( 6 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 3 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 5 ( 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(condition,hypothesis,
negate(add(d,e)) = negate(e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condition) ).
cnf(k_positive,axiom,
positive_integer(k),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k_positive) ).
cnf(lemma_3_6,axiom,
( negate(add(negate(X),negate(add(Y,negate(X))))) != Y
| ~ positive_integer(Z)
| negate(add(X,multiply(Z,add(Y,negate(add(Y,negate(X))))))) = negate(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_3_6) ).
cnf(prove_result,negated_conjecture,
negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))) != negate(e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_result) ).
cnf(14,plain,
negate(add(negate(e),negate(add(d,negate(e))))) = d,
inference('PARAMODULATE',[status(thm)],[robbins_axiom,condition,theory(equality)]) ).
cnf(22,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[lemma_3_6,k_positive,prove_result]),14,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ROB016-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/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:59:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p 2022-06-09T14:59:25
% 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:59:25
% 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 ; Recognized left identity assertion (= (|multiply| |one| ?X) ?X).
% 0.18/0.47 ; Declaring add to be commutative.
% 0.18/0.49 ; Declaring add to be associative-commutative.
% 0.18/0.49
% 0.18/0.49 #||
% 0.18/0.49 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.49 % SZS output start Refutation
% See solution above
% 0.18/0.49 ||#
% 0.18/0.49
% 0.18/0.49 ; Summary of computation:
% 0.18/0.49 ; 37 formulas have been input or derived (from 10 formulas).
% 0.18/0.49 ; 22 (59%) were retained. Of these,
% 0.18/0.49 ; 22 (100%) are still being kept.
% 0.18/0.49 ;
% 0.18/0.49 ; Run time in seconds excluding printing time:
% 0.18/0.49 ; 0.003 9% Read assertion file (1 call)
% 0.18/0.49 ; 0.001 3% Assert (11 calls)
% 0.18/0.49 ; 0.005 15% Process new row (33 calls)
% 0.18/0.49 ; 0.001 3% Resolution (18 calls)
% 0.18/0.49 ; 0.001 3% Paramodulation (9 calls)
% 0.18/0.49 ; 0.000 0% Embedding (2 calls)
% 0.18/0.49 ; 0.000 0% Condensing (3 calls)
% 0.18/0.49 ; 0.000 0% Forward subsumption (3 calls)
% 0.18/0.49 ; 0.000 0% Backward subsumption (3 calls)
% 0.18/0.49 ; 0.001 3% Forward simplification (33 calls)
% 0.18/0.49 ; 0.000 0% Backward simplification (22 calls)
% 0.18/0.49 ; 0.000 0% Ordering (41 calls)
% 0.18/0.49 ; 0.000 0% Ordering ac (4 calls)
% 0.18/0.49 ; 0.000 0% Sortal reasoning (32 calls)
% 0.18/0.49 ; 0.000 0% Purity testing (1 call)
% 0.18/0.49 ; 0.021 64% Other
% 0.18/0.49 ; 0.033 Total
% 0.18/0.49 ; 0.034 Real time
% 0.18/0.49 ;
% 0.18/0.49 ; Term-hash-array has 103 terms in all.
% 0.18/0.49 ; Feature-vector-row-index has 3 entries (3 at peak, 3 added, 0 deleted).
% 0.18/0.49 ; Feature-vector-row-index has 27 nodes (27 at peak, 27 added, 0 deleted).
% 0.18/0.49 ; Retrieved 0 possibly forward subsuming rows in 3 calls.
% 0.18/0.49 ; Retrieved 0 possibly backward subsumed rows in 3 calls.
% 0.18/0.49 ; Path-index has 107 entries (107 at peak, 107 added, 0 deleted).
% 0.18/0.49 ; Path-index has 208 nodes (208 at peak, 208 added, 0 deleted).
% 0.18/0.49 ; Trie-index has 107 entries (107 at peak, 107 added, 0 deleted).
% 0.18/0.49 ; Trie-index has 62 nodes (62 at peak, 62 added, 0 deleted).
% 0.18/0.49 ; Retrieved 195 generalization terms in 90 calls.
% 0.18/0.49 ; Retrieved 20 instance terms in 18 calls.
% 0.18/0.49 ; Retrieved 121 unifiable terms in 63 calls.
% 0.18/0.49 ;
% 0.18/0.49 ; The agenda of rows to process has 4 entries:
% 0.18/0.50 ; 1 with value 46 1 with value 49 1 with value 50
% 0.18/0.50 ; 1 with value 47
% 0.18/0.50 ; The agenda of rows to give has 12 entries:
% 0.18/0.50 ; 2 with value (4 6) 1 with value (4 22) 1 with value (4 28)
% 0.18/0.50 ; 2 with value (4 14) 1 with value (4 26) 3 with value (4 30)
% 0.18/0.50 ; 2 with value (4 18)
% 0.18/0.50 Evaluation took:
% 0.18/0.50 0.034 seconds of real time
% 0.18/0.50 0.027179 seconds of user run time
% 0.18/0.50 0.007283 seconds of system run time
% 0.18/0.50 0 calls to %EVAL
% 0.18/0.50 0 page faults and
% 0.18/0.50 2,100,208 bytes consed.
% 0.18/0.50 :PROOF-FOUND
% 0.18/0.50 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-09T14:59:25
% 0.18/0.50 :PROOF-FOUND
% 0.18/0.50 *
%------------------------------------------------------------------------------