TSTP Solution File: RNG020-6 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : RNG020-6 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n027.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:40:34 EDT 2022
% Result : Unsatisfiable 0.20s 0.56s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 3 RR)
% Number of literals : 11 ( 10 equ; 2 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 : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_additive_identity,axiom,
add(additive_identity,X) = X,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',left_additive_identity) ).
cnf(left_additive_inverse,axiom,
add(additive_inverse(X),X) = additive_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',left_additive_inverse) ).
cnf(5,plain,
add(additive_inverse(X),add(X,Y)) = add(additive_identity,Y),
inference('EMBED',[status(thm)],[left_additive_inverse]) ).
cnf(distribute1,axiom,
multiply(X,add(Y,Z)) = add(multiply(X,Y),multiply(X,Z)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',distribute1) ).
cnf(distribute2,axiom,
multiply(add(X,Y),Z) = add(multiply(X,Z),multiply(Y,Z)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',distribute2) ).
cnf(associator,axiom,
associator(X,Y,Z) = add(multiply(multiply(X,Y),Z),additive_inverse(multiply(X,multiply(Y,Z)))),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',associator) ).
cnf(prove_linearised_form2,negated_conjecture,
associator(x,add(u,v),y) != add(associator(x,u,y),associator(x,v,y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_linearised_form2) ).
cnf(15,plain,
add(multiply(multiply(x,u),y),add(multiply(multiply(x,v),y),additive_inverse(add(multiply(x,multiply(u,y)),multiply(x,multiply(v,y)))))) != add(multiply(multiply(x,u),y),add(additive_inverse(multiply(x,multiply(u,y))),add(multiply(multiply(x,v),y),additive_inverse(multiply(x,multiply(v,y)))))),
inference('REWRITE',[status(thm)],[prove_linearised_form2,distribute2,distribute1,associator,theory(equality)]) ).
cnf(17,plain,
additive_inverse(X) = add(additive_inverse(add(X,Y)),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[5,5,theory(equality)]),left_additive_identity,theory(equality)]) ).
cnf(71,plain,
additive_inverse(add(X,Y)) = add(additive_inverse(Y),additive_inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[17,5,theory(equality)]),left_additive_identity,theory(equality)]) ).
cnf(73,plain,
$false,
inference('REWRITE',[status(thm)],[15,71,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG020-6 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon May 30 05:24:01 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.47 *
% 0.20/0.48 #<PACKAGE "SNARK-USER">
% 0.20/0.48 *
% 0.20/0.48 SNARK-TPTP-OPTIONS
% 0.20/0.48 *
% 0.20/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48 (USE-FACTORING :POS)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48 *
% 0.20/0.48 "."
% 0.20/0.48 *
% 0.20/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-30T05:24:01
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n027.cluster.edu at 2022-05-30T05:24:01
% 0.20/0.49
% 0.20/0.49 ; Recognized left identity assertion (= (|add| |additive_identity| ?X) ?X).
% 0.20/0.49 ; Recognized right identity assertion (= (|add| ?X |additive_identity|) ?X).
% 0.20/0.49 ; Recognized possible left inverse assertion (= (|add| (|additive_inverse| ?X) ?X) |additive_identity|).
% 0.20/0.49 ; Recognized possible right inverse assertion (= (|add| ?X (|additive_inverse| ?X)) |additive_identity|).
% 0.20/0.49 ; Recognized commutativity assertion (= (|add| ?X ?Y) (|add| ?Y ?X)).
% 0.20/0.49 ; Recognized associativity assertion (= (|add| ?X (|add| ?Y ?Z)) (|add| (|add| ?X ?Y) ?Z)).
% 0.20/0.49 ; Declaring add to be commutative.
% 0.20/0.56 ; Declaring add to be associative-commutative.
% 0.20/0.56
% 0.20/0.56 #||
% 0.20/0.56 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.56 % SZS output start Refutation
% See solution above
% 0.20/0.56 ||#
% 0.20/0.56
% 0.20/0.56 ; Summary of computation:
% 0.20/0.56 ; 309 formulas have been input or derived (from 20 formulas).
% 0.20/0.56 ; 73 (24%) were retained. Of these,
% 0.20/0.56 ; 2 ( 3%) were simplified or subsumed later,
% 0.20/0.56 ; 71 (97%) are still being kept.
% 0.20/0.56 ;
% 0.20/0.56 ; Run time in seconds excluding printing time:
% 0.20/0.56 ; 0.003 4% Read assertion file (1 call)
% 0.20/0.56 ; 0.001 1% Assert (16 calls)
% 0.20/0.56 ; 0.010 12% Process new row (257 calls)
% 0.20/0.56 ; 0.001 1% Resolution (38 calls)
% 0.20/0.56 ; 0.009 11% Paramodulation (19 calls)
% 0.20/0.56 ; 0.001 1% Embedding (28 calls)
% 0.20/0.56 ; 0.022 27% Forward simplification (233 calls)
% 0.20/0.56 ; 0.004 5% Backward simplification (48 calls)
% 0.20/0.56 ; 0.005 6% Ordering (579 calls)
% 0.20/0.56 ; 0.003 4% Ordering ac (80 calls)
% 0.20/0.56 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.56 ; 0.000 0% Purity testing (1 call)
% 0.20/0.56 ; 0.023 28% Other
% 0.20/0.56 ; 0.082 Total
% 0.20/0.56 ; 0.084 Real time
% 0.20/0.56 ;
% 0.20/0.56 ; Term-hash-array has 281 terms in all.
% 0.20/0.56 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.20/0.56 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.20/0.56 ; Path-index has 271 entries (283 at peak, 290 added, 19 deleted).
% 0.20/0.56 ; Path-index has 399 nodes (447 at peak, 451 added, 52 deleted).
% 0.20/0.56 ; Trie-index has 271 entries (283 at peak, 290 added, 19 deleted).
% 0.20/0.56 ; Trie-index has 279 nodes (302 at peak, 306 added, 27 deleted).
% 0.20/0.56 ; Retrieved 9,873 generalization terms in 2,226 calls.
% 0.20/0.56 ; Retrieved 203 instance terms in 73 calls.
% 0.20/0.56 ; Retrieved 589 unifiable terms in 114 calls.
% 0.20/0.56 ;
% 0.20/0.56 ; The agenda of rows to process has 42 entries:
% 0.20/0.56 ; 5 with value 18 11 with value 22 5 with value 27
% 0.20/0.56 ; 2 with value 19 3 with value 23 4 with value 29
% 0.20/0.56 ; 2 with value 20 6 with value 25 1 with value 30
% 0.20/0.56 ; 1 with value 21 2 with value 26
% 0.20/0.56 ; The agenda of rows to give has 52 entries:
% 0.20/0.56 ; 1 with value (4 14) 5 with value (4 20) 8 with value (4 28)
% 0.20/0.56 ; 8 with value (4 15) 24 with value (4 24) 4 with value (4 52)
% 0.20/0.56 ; 2 with value (4 18)
% 0.20/0.56 Evaluation took:
% 0.20/0.56 0.085 seconds of real time
% 0.20/0.56 0.074503 seconds of user run time
% 0.20/0.56 0.009893 seconds of system run time
% 0.20/0.56 0 calls to %EVAL
% 0.20/0.56 0 page faults and
% 0.20/0.56 4,459,472 bytes consed.
% 0.20/0.56 :PROOF-FOUND
% 0.20/0.56 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-30T05:24:01
% 0.20/0.56 :PROOF-FOUND
% 0.20/0.56 *
%------------------------------------------------------------------------------