TSTP Solution File: GRP582-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP582-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n020.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 : Sat Jul 16 11:39:31 EDT 2022
% Result : Unsatisfiable 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 4 RR)
% Number of literals : 31 ( 30 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(double_divide(X,double_divide(double_divide(identity,Y),double_divide(Z,double_divide(Y,X)))),double_divide(identity,identity)) = Z,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = double_divide(double_divide(Y,X),identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(inverse,axiom,
inverse(X) = double_divide(X,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
cnf(identity,axiom,
identity = double_divide(X,inverse(X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(identity,a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(6,plain,
multiply(X,Y) = inverse(double_divide(Y,X)),
inference('REWRITE',[status(thm)],[multiply,inverse,theory(equality)]) ).
cnf(7,plain,
inverse(inverse(a2)) != a2,
inference('REWRITE',[status(thm)],[prove_these_axioms_2,inverse,6,theory(equality)]) ).
cnf(8,plain,
double_divide(double_divide(X,double_divide(double_divide(identity,Y),double_divide(Z,double_divide(Y,X)))),inverse(identity)) = Z,
inference('REWRITE',[status(thm)],[single_axiom,inverse,theory(equality)]) ).
cnf(9,plain,
double_divide(double_divide(inverse(X),double_divide(double_divide(identity,X),inverse(Y))),inverse(identity)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]),inverse,theory(equality)]) ).
cnf(10,plain,
double_divide(double_divide(X,double_divide(inverse(identity),double_divide(Y,double_divide(identity,X)))),inverse(identity)) = Y,
inference('PARAMODULATE',[status(thm)],[8,inverse,theory(equality)]) ).
cnf(11,plain,
double_divide(double_divide(identity,double_divide(double_divide(identity,X),double_divide(Y,inverse(X)))),inverse(identity)) = Y,
inference('PARAMODULATE',[status(thm)],[8,inverse,theory(equality)]) ).
cnf(13,plain,
double_divide(double_divide(inverse(identity),double_divide(double_divide(identity,double_divide(X,double_divide(double_divide(identity,Y),double_divide(Z,double_divide(Y,X))))),double_divide(U,Z))),inverse(identity)) = U,
inference('PARAMODULATE',[status(thm)],[8,8,theory(equality)]) ).
cnf(14,plain,
double_divide(inverse(inverse(X)),inverse(identity)) = double_divide(identity,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,identity,theory(equality)]),inverse,theory(equality)]) ).
cnf(16,plain,
double_divide(double_divide(inverse(inverse(identity)),double_divide(identity,inverse(X))),inverse(identity)) = X,
inference('PARAMODULATE',[status(thm)],[9,identity,theory(equality)]) ).
cnf(23,plain,
double_divide(double_divide(inverse(double_divide(inverse(identity),double_divide(X,inverse(identity)))),X),inverse(identity)) = identity,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,10,theory(equality)]),inverse,theory(equality)]) ).
cnf(25,plain,
double_divide(double_divide(identity,inverse(double_divide(identity,X))),inverse(identity)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[11,identity,theory(equality)]),inverse,theory(equality)]) ).
cnf(39,plain,
identity = inverse(identity),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[25,identity,theory(equality)]),identity,theory(equality)]) ).
cnf(40,plain,
inverse(double_divide(X,double_divide(double_divide(identity,Y),double_divide(Z,double_divide(Y,X))))) = Z,
inference('REWRITE',[status(thm)],[8,inverse,39,theory(equality)]) ).
cnf(42,plain,
inverse(double_divide(identity,double_divide(double_divide(identity,double_divide(X,double_divide(double_divide(identity,Y),double_divide(Z,double_divide(Y,X))))),double_divide(U,Z)))) = U,
inference('REWRITE',[status(thm)],[13,inverse,39,theory(equality)]) ).
cnf(43,plain,
inverse(inverse(inverse(X))) = double_divide(identity,X),
inference('REWRITE',[status(thm)],[14,inverse,39,theory(equality)]) ).
cnf(45,plain,
inverse(double_divide(X,double_divide(inverse(inverse(inverse(Y))),double_divide(Z,double_divide(Y,X))))) = Z,
inference('REWRITE',[status(thm)],[40,43,theory(equality)]) ).
cnf(46,plain,
inverse(inverse(inverse(inverse(double_divide(inverse(inverse(X)),double_divide(Y,X)))))) = Y,
inference('REWRITE',[status(thm)],[42,45,43,theory(equality)]) ).
cnf(47,plain,
inverse(inverse(inverse(inverse(inverse(inverse(inverse(inverse(X)))))))) = X,
inference('REWRITE',[status(thm)],[16,inverse,43,39,theory(equality)]) ).
cnf(49,plain,
inverse(double_divide(inverse(inverse(inverse(inverse(inverse(X))))),X)) = identity,
inference('REWRITE',[status(thm)],[23,43,inverse,39,theory(equality)]) ).
cnf(69,plain,
inverse(double_divide(X,inverse(inverse(inverse(X))))) = identity,
inference('PARAMODULATE',[status(thm)],[49,47,theory(equality)]) ).
cnf(70,plain,
inverse(inverse(inverse(inverse(X)))) = double_divide(inverse(inverse(Y)),double_divide(X,Y)),
inference('PARAMODULATE',[status(thm)],[47,46,theory(equality)]) ).
cnf(76,plain,
identity = double_divide(X,inverse(inverse(inverse(X)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[47,69,theory(equality)]),39,theory(equality)]) ).
cnf(77,plain,
inverse(inverse(inverse(inverse(X)))) = inverse(inverse(inverse(inverse(inverse(inverse(X)))))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[70,76,theory(equality)]),inverse,theory(equality)]) ).
cnf(78,plain,
inverse(inverse(inverse(inverse(X)))) = X,
inference('REWRITE',[status(thm)],[47,77,theory(equality)]) ).
cnf(82,plain,
X = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[77,78,theory(equality)]) ).
cnf(87,plain,
$false,
inference('REWRITE',[status(thm)],[7,82,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP582-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.12 % Command : run-snark %s %d
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 10:06:05 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 *
% 0.19/0.45 *
% 0.19/0.46 #<PACKAGE "SNARK-USER">
% 0.19/0.46 *
% 0.19/0.46 SNARK-TPTP-OPTIONS
% 0.19/0.46 *
% 0.19/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46 (USE-FACTORING :POS)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46 *
% 0.19/0.46 "."
% 0.19/0.46 *
% 0.19/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T10:06:05
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n020.cluster.edu at 2022-06-13T10:06:05
% 0.19/0.47
% 0.19/0.52 ; Recognized possible right inverse assertion (= |identity| (|double_divide| ?X (|inverse| ?X))).
% 0.19/0.52
% 0.19/0.52 #||
% 0.19/0.52 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.52 % SZS output start Refutation
% See solution above
% 0.19/0.52 ||#
% 0.19/0.52
% 0.19/0.52 ; Summary of computation:
% 0.19/0.52 ; 222 formulas have been input or derived (from 23 formulas).
% 0.19/0.52 ; 87 (39%) were retained. Of these,
% 0.19/0.52 ; 75 (86%) were simplified or subsumed later,
% 0.19/0.52 ; 12 (14%) are still being kept.
% 0.19/0.52 ;
% 0.19/0.52 ; Run time in seconds excluding printing time:
% 0.19/0.52 ; 0.002 3% Read assertion file (1 call)
% 0.19/0.52 ; 0.000 0% Assert (5 calls)
% 0.19/0.52 ; 0.016 28% Process new row (213 calls)
% 0.19/0.52 ; 0.001 2% Resolution (44 calls)
% 0.19/0.52 ; 0.001 2% Paramodulation (22 calls)
% 0.19/0.52 ; 0.009 16% Forward simplification (199 calls)
% 0.19/0.52 ; 0.006 10% Backward simplification (87 calls)
% 0.19/0.52 ; 0.001 2% Ordering (354 calls)
% 0.19/0.52 ; 0.000 0% Sortal reasoning (32 calls)
% 0.19/0.52 ; 0.000 0% Purity testing (1 call)
% 0.19/0.52 ; 0.022 38% Other
% 0.19/0.52 ; 0.058 Total
% 0.19/0.52 ; 0.063 Real time
% 0.19/0.52 ;
% 0.19/0.52 ; Term-hash-array has 369 terms in all.
% 0.19/0.52 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.19/0.52 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.19/0.52 ; Path-index has 38 entries (198 at peak, 408 added, 370 deleted).
% 0.19/0.52 ; Path-index has 1,126 nodes (1,382 at peak, 1,807 added, 681 deleted).
% 0.19/0.52 ; Trie-index has 38 entries (198 at peak, 408 added, 370 deleted).
% 0.19/0.52 ; Trie-index has 130 nodes (1,159 at peak, 2,433 added, 2,303 deleted).
% 0.19/0.52 ; Retrieved 425 generalization terms in 1,615 calls.
% 0.19/0.52 ; Retrieved 138 instance terms in 87 calls.
% 0.19/0.52 ; Retrieved 285 unifiable terms in 183 calls.
% 0.19/0.52 ;
% 0.19/0.52 ; The agenda of backward simplifiable rows to process has 4 entries:
% 0.19/0.52 ; 4 with value 0
% 0.19/0.52 ; The agenda of rows to process has 4 entries:
% 0.19/0.52 ; 3 with value 30 1 with value 33
% 0.19/0.52 ; The agenda of rows to give has 7 entries:
% 0.19/0.52 ; 1 with value (4 10) 2 with value (4 13) 1 with value (4 21)
% 0.19/0.52 ; 1 with value (4 12) 1 with value (4 17) 1 with value (4 22)
% 0.19/0.52 Evaluation took:
% 0.19/0.52 0.063 seconds of real time
% 0.19/0.52 0.054182 seconds of user run time
% 0.19/0.52 0.009212 seconds of system run time
% 0.19/0.52 0 calls to %EVAL
% 0.19/0.52 0 page faults and
% 0.19/0.52 5,969,736 bytes consed.
% 0.19/0.52 :PROOF-FOUND
% 0.19/0.52 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T10:06:05
% 0.19/0.52 :PROOF-FOUND
% 0.19/0.52 *
%------------------------------------------------------------------------------