TSTP Solution File: BOO015-4 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : BOO015-4 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n021.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 : Thu Jul 14 23:48:57 EDT 2022
% Result : Unsatisfiable 0.60s 0.81s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of clauses : 40 ( 40 unt; 0 nHn; 4 RR)
% Number of literals : 40 ( 39 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 69 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distributivity1,axiom,
add(X,multiply(Y,Z)) = multiply(add(X,Y),add(X,Z)),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',distributivity1) ).
cnf(distributivity2,axiom,
multiply(X,add(Y,Z)) = add(multiply(X,Y),multiply(X,Z)),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',distributivity2) ).
cnf(additive_id1,axiom,
add(X,additive_identity) = X,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',additive_id1) ).
cnf(multiplicative_id1,axiom,
multiply(X,multiplicative_identity) = X,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',multiplicative_id1) ).
cnf(additive_inverse1,axiom,
add(X,inverse(X)) = multiplicative_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',additive_inverse1) ).
cnf(multiplicative_inverse1,axiom,
multiply(X,inverse(X)) = additive_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',multiplicative_inverse1) ).
cnf(prove_c_inverse_is_d,negated_conjecture,
inverse(multiply(a,b)) != add(inverse(a),inverse(b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c_inverse_is_d) ).
cnf(8,plain,
add(X,multiply(Y,Z)) = add(add(multiply(X,X),multiply(X,Y)),add(multiply(X,Z),multiply(Y,Z))),
inference('REWRITE',[status(thm)],[distributivity1,distributivity2,theory(equality)]) ).
cnf(10,plain,
additive_identity = inverse(multiplicative_identity),
inference('PARAMODULATE',[status(thm)],[multiplicative_id1,multiplicative_inverse1,theory(equality)]) ).
cnf(11,plain,
multiply(X,Y) = add(multiply(X,Y),multiply(X,additive_identity)),
inference('PARAMODULATE',[status(thm)],[distributivity2,additive_id1,theory(equality)]) ).
cnf(12,plain,
X = add(multiply(X,Y),multiply(X,inverse(Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[distributivity2,additive_inverse1,theory(equality)]),multiplicative_id1,theory(equality)]) ).
cnf(13,plain,
add(multiply(inverse(add(X,Y)),X),multiply(inverse(add(X,Y)),Y)) = additive_identity,
inference('PARAMODULATE',[status(thm)],[multiplicative_inverse1,distributivity2,theory(equality)]) ).
cnf(16,plain,
add(X,Y) = add(add(multiply(X,X),multiply(X,Y)),add(X,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,multiplicative_id1,theory(equality)]),multiplicative_id1,theory(equality)]) ).
cnf(20,plain,
X = add(add(multiply(X,X),multiply(X,inverse(Y))),multiply(X,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,multiplicative_inverse1,theory(equality)]),additive_id1,theory(equality)]) ).
cnf(21,plain,
add(X,multiply(inverse(X),Y)) = add(Y,multiply(X,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,multiplicative_inverse1,theory(equality)]),12,additive_id1,theory(equality)]) ).
cnf(23,plain,
add(inverse(X),multiply(X,Y)) = add(multiply(inverse(X),inverse(X)),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,multiplicative_inverse1,theory(equality)]),12,additive_id1,theory(equality)]) ).
cnf(30,plain,
additive_identity = multiply(X,additive_identity),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[11,multiplicative_inverse1,theory(equality)]),additive_id1,theory(equality)]) ).
cnf(31,plain,
X = add(multiply(X,X),multiply(X,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,30,theory(equality)]),30,additive_id1,theory(equality)]) ).
cnf(32,plain,
X = add(X,multiply(X,Y)),
inference('REWRITE',[status(thm)],[20,31,theory(equality)]) ).
cnf(34,plain,
add(X,multiply(Y,Z)) = add(X,add(multiply(X,Z),multiply(Y,Z))),
inference('REWRITE',[status(thm)],[8,31,theory(equality)]) ).
cnf(35,plain,
add(X,Y) = add(X,add(X,Y)),
inference('REWRITE',[status(thm)],[16,31,theory(equality)]) ).
cnf(46,plain,
multiply(X,Y) = add(multiply(X,Y),multiply(X,multiply(Y,Z))),
inference('PARAMODULATE',[status(thm)],[distributivity2,32,theory(equality)]) ).
cnf(49,plain,
X = multiply(X,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,multiplicative_inverse1,theory(equality)]),additive_id1,theory(equality)]) ).
cnf(50,plain,
add(inverse(X),multiply(X,Y)) = add(inverse(X),Y),
inference('REWRITE',[status(thm)],[23,49,theory(equality)]) ).
cnf(51,plain,
add(X,multiply(inverse(X),Y)) = add(X,Y),
inference('REWRITE',[status(thm)],[21,49,theory(equality)]) ).
cnf(52,plain,
X = multiply(X,inverse(inverse(X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,multiplicative_inverse1,theory(equality)]),additive_id1,theory(equality)]) ).
cnf(53,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,multiplicative_inverse1,theory(equality)]),additive_id1,52,theory(equality)]) ).
cnf(69,plain,
multiplicative_identity = add(inverse(multiply(X,Y)),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[34,51,theory(equality)]),32,additive_inverse1,theory(equality)]) ).
cnf(86,plain,
additive_identity = multiply(inverse(X),multiply(X,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[46,multiplicative_inverse1,theory(equality)]),additive_id1,theory(equality)]) ).
cnf(94,plain,
inverse(X) = multiply(inverse(multiply(X,Y)),inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,86,theory(equality)]),additive_id1,theory(equality)]) ).
cnf(163,plain,
additive_identity = multiply(inverse(add(X,Y)),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[35,13,theory(equality)]),additive_id1,theory(equality)]) ).
cnf(171,plain,
inverse(add(X,Y)) = multiply(inverse(add(X,Y)),inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,163,theory(equality)]),additive_id1,theory(equality)]) ).
cnf(227,plain,
inverse(X) = add(multiply(inverse(X),Y),inverse(add(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,171,theory(equality)]),additive_id1,multiplicative_inverse1,distributivity2,theory(equality)]) ).
cnf(277,plain,
inverse(multiply(X,Y)) = add(inverse(X),inverse(add(inverse(X),Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[227,94,theory(equality)]),50,theory(equality)]) ).
cnf(303,plain,
multiplicative_identity = add(add(inverse(X),inverse(add(inverse(X),Y))),Y),
inference('REWRITE',[status(thm)],[69,277,theory(equality)]) ).
cnf(315,plain,
add(inverse(a),inverse(add(inverse(a),b))) != add(inverse(a),inverse(b)),
inference('REWRITE',[status(thm)],[prove_c_inverse_is_d,277,theory(equality)]) ).
cnf(333,plain,
multiplicative_identity = add(add(X,inverse(add(X,Y))),Y),
inference('PARAMODULATE',[status(thm)],[303,53,theory(equality)]) ).
cnf(336,plain,
multiplicative_identity = add(add(inverse(X),inverse(Y)),multiply(X,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[333,12,theory(equality)]),50,theory(equality)]) ).
cnf(350,plain,
add(inverse(X),inverse(add(inverse(X),Y))) = add(inverse(X),inverse(Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[227,336,theory(equality)]),10,227,171,additive_id1,163,49,distributivity2,277,theory(equality)]) ).
cnf(369,plain,
$false,
inference('REWRITE',[status(thm)],[315,350,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : BOO015-4 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n021.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 : Wed Jun 1 17:59:01 EDT 2022
% 0.13/0.35 % 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-06-01T17:59: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 n021.cluster.edu at 2022-06-01T17:59:01
% 0.20/0.49
% 0.20/0.49 ; Recognized commutativity assertion (= (|add| ?X ?Y) (|add| ?Y ?X)).
% 0.20/0.49 ; Recognized commutativity assertion (= (|multiply| ?X ?Y) (|multiply| ?Y ?X)).
% 0.20/0.49 ; Recognized right identity assertion (= (|add| ?X |additive_identity|) ?X).
% 0.20/0.49 ; Recognized right identity assertion (= (|multiply| ?X |multiplicative_identity|) ?X).
% 0.20/0.49 ; Recognized possible right inverse assertion (= (|add| ?X (|inverse| ?X)) |multiplicative_identity|).
% 0.20/0.49 ; Recognized possible right inverse assertion (= (|multiply| ?X (|inverse| ?X)) |additive_identity|).
% 0.20/0.49 ; Declaring add to be commutative.
% 0.60/0.81 ; Declaring multiply to be commutative.
% 0.60/0.81
% 0.60/0.81 #||
% 0.60/0.81 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.60/0.81 % SZS output start Refutation
% See solution above
% 0.60/0.81 ||#
% 0.60/0.81
% 0.60/0.81 ; Summary of computation:
% 0.60/0.81 ; 3476 formulas have been input or derived (from 62 formulas).
% 0.60/0.81 ; 369 (11%) were retained. Of these,
% 0.60/0.81 ; 181 (49%) were simplified or subsumed later,
% 0.60/0.81 ; 188 (51%) are still being kept.
% 0.60/0.81 ;
% 0.60/0.81 ; Run time in seconds excluding printing time:
% 0.60/0.81 ; 0.002 1% Read assertion file (1 call)
% 0.60/0.81 ; 0.001 0% Assert (9 calls)
% 0.60/0.81 ; 0.051 15% Process new row (3,086 calls)
% 0.60/0.81 ; 0.000 0% Resolution (122 calls)
% 0.60/0.81 ; 0.046 14% Paramodulation (61 calls)
% 0.60/0.81 ; 0.170 51% Forward simplification (2,961 calls)
% 0.60/0.81 ; 0.015 5% Backward simplification (369 calls)
% 0.60/0.81 ; 0.014 4% Ordering (3,309 calls)
% 0.60/0.81 ; 0.000 0% Sortal reasoning (32 calls)
% 0.60/0.81 ; 0.000 0% Purity testing (1 call)
% 0.60/0.81 ; 0.034 10% Other
% 0.60/0.81 ; 0.333 Total
% 0.60/0.81 ; 0.336 Real time
% 0.60/0.81 ;
% 0.60/0.81 ; Term-hash-array has 1,116 terms in all.
% 0.60/0.81 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.60/0.81 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.60/0.81 ; Path-index has 609 entries (641 at peak, 1,162 added, 553 deleted).
% 0.60/0.81 ; Path-index has 542 nodes (583 at peak, 759 added, 217 deleted).
% 0.60/0.81 ; Trie-index has 609 entries (641 at peak, 1,162 added, 553 deleted).
% 0.60/0.81 ; Trie-index has 3,387 nodes (3,532 at peak, 6,633 added, 3,246 deleted).
% 0.60/0.81 ; Retrieved 24,039 generalization terms in 20,155 calls.
% 0.60/0.81 ; Retrieved 1,277 instance terms in 372 calls.
% 0.60/0.81 ; Retrieved 4,626 unifiable terms in 403 calls.
% 0.60/0.81 ;
% 0.60/0.81 ; The agenda of rows to process has 1 entry:
% 0.60/0.81 ; 1 with value 31
% 0.60/0.81 ; The agenda of rows to give has 144 entries:
% 0.60/0.82 ; 1 with value (4 18) 11 with value (4 27) 6 with value (4 35)
% 0.60/0.82 ; 1 with value (4 20) 13 with value (4 28) 1 with value (4 36)
% 0.60/0.82 ; 11 with value (4 21) 7 with value (4 29) 3 with value (4 37)
% 0.60/0.82 ; 12 with value (4 22) 6 with value (4 30) 2 with value (4 38)
% 0.60/0.82 ; 8 with value (4 23) 5 with value (4 31) 2 with value (4 39)
% 0.60/0.82 ; 12 with value (4 24) 10 with value (4 32) 1 with value (4 41)
% 0.60/0.82 ; 17 with value (4 25) 5 with value (4 33) 2 with value (4 49)
% 0.60/0.82 ; 6 with value (4 26) 2 with value (4 34)
% 0.60/0.82 Evaluation took:
% 0.60/0.82 0.337 seconds of real time
% 0.60/0.82 0.308652 seconds of user run time
% 0.60/0.82 0.028182 seconds of system run time
% 0.60/0.82 [Run times include 0.011 seconds GC run time.]
% 0.60/0.82 0 calls to %EVAL
% 0.60/0.82 0 page faults and
% 0.60/0.82 30,123,568 bytes consed.
% 0.60/0.82 :PROOF-FOUND
% 0.60/0.82 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-01T17:59:01
% 0.60/0.82 :PROOF-FOUND
% 0.60/0.82 *
%------------------------------------------------------------------------------