TSTP Solution File: GRP492-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP492-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n014.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:07 EDT 2022
% Result : Unsatisfiable 0.21s 0.54s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 5
% Syntax : Number of clauses : 41 ( 41 unt; 0 nHn; 8 RR)
% Number of literals : 41 ( 40 equ; 4 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(double_divide(identity,X),double_divide(identity,double_divide(double_divide(double_divide(X,Y),identity),double_divide(Z,Y)))) = 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_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(6,plain,
multiply(X,Y) = inverse(double_divide(Y,X)),
inference('REWRITE',[status(thm)],[multiply,inverse,theory(equality)]) ).
cnf(7,plain,
inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(inverse(double_divide(c3,b3)),a3)),
inference('REWRITE',[status(thm)],[prove_these_axioms_3,6,theory(equality)]) ).
cnf(8,plain,
double_divide(double_divide(identity,X),double_divide(identity,double_divide(inverse(double_divide(X,Y)),double_divide(Z,Y)))) = Z,
inference('REWRITE',[status(thm)],[single_axiom,inverse,theory(equality)]) ).
cnf(9,plain,
double_divide(inverse(identity),double_divide(identity,double_divide(inverse(double_divide(identity,X)),double_divide(Y,X)))) = Y,
inference('PARAMODULATE',[status(thm)],[8,inverse,theory(equality)]) ).
cnf(10,plain,
double_divide(double_divide(identity,X),double_divide(identity,double_divide(inverse(inverse(X)),inverse(Y)))) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,inverse,theory(equality)]),inverse,theory(equality)]) ).
cnf(16,plain,
double_divide(double_divide(identity,X),inverse(identity)) = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,identity,theory(equality)]),inverse,theory(equality)]) ).
cnf(18,plain,
double_divide(identity,double_divide(identity,double_divide(inverse(inverse(inverse(identity))),inverse(X)))) = X,
inference('PARAMODULATE',[status(thm)],[10,identity,theory(equality)]) ).
cnf(22,plain,
identity = inverse(inverse(inverse(identity))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[16,identity,theory(equality)]),identity,theory(equality)]) ).
cnf(23,plain,
double_divide(identity,double_divide(identity,double_divide(identity,inverse(X)))) = X,
inference('REWRITE',[status(thm)],[18,22,theory(equality)]) ).
cnf(25,plain,
double_divide(double_divide(identity,X),double_divide(identity,double_divide(inverse(double_divide(X,inverse(identity))),inverse(inverse(Y))))) = double_divide(identity,Y),
inference('PARAMODULATE',[status(thm)],[8,16,theory(equality)]) ).
cnf(27,plain,
double_divide(double_divide(identity,X),double_divide(identity,inverse(inverse(inverse(X))))) = inverse(inverse(identity)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,22,theory(equality)]),inverse,theory(equality)]) ).
cnf(29,plain,
inverse(identity) = inverse(inverse(identity)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[23,22,theory(equality)]),identity,inverse,theory(equality)]) ).
cnf(32,plain,
identity = inverse(identity),
inference('REWRITE',[status(thm)],[22,29,theory(equality)]) ).
cnf(33,plain,
double_divide(identity,double_divide(identity,double_divide(inverse(double_divide(identity,X)),double_divide(Y,X)))) = Y,
inference('REWRITE',[status(thm)],[9,32,theory(equality)]) ).
cnf(35,plain,
inverse(double_divide(identity,X)) = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[16,inverse,32,theory(equality)]) ).
cnf(36,plain,
double_divide(identity,double_divide(identity,double_divide(inverse(inverse(X)),double_divide(Y,X)))) = Y,
inference('REWRITE',[status(thm)],[33,35,theory(equality)]) ).
cnf(38,plain,
inverse(X) = double_divide(identity,X),
inference('REWRITE',[status(thm)],[25,10,inverse,32,theory(equality)]) ).
cnf(39,plain,
inverse(inverse(double_divide(inverse(inverse(X)),double_divide(Y,X)))) = Y,
inference('REWRITE',[status(thm)],[36,38,theory(equality)]) ).
cnf(40,plain,
inverse(inverse(inverse(inverse(X)))) = X,
inference('REWRITE',[status(thm)],[23,38,theory(equality)]) ).
cnf(41,plain,
double_divide(inverse(X),inverse(double_divide(inverse(double_divide(X,Y)),double_divide(Z,Y)))) = Z,
inference('REWRITE',[status(thm)],[8,38,theory(equality)]) ).
cnf(49,plain,
double_divide(inverse(X),X) = identity,
inference('REWRITE',[status(thm)],[27,32,40,38,29,theory(equality)]) ).
cnf(51,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[41,49,theory(equality)]),inverse,32,theory(equality)]) ).
cnf(55,plain,
double_divide(X,double_divide(Y,X)) = Y,
inference('REWRITE',[status(thm)],[39,51,theory(equality)]) ).
cnf(58,plain,
double_divide(inverse(X),inverse(double_divide(X,Y))) = inverse(Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[41,49,theory(equality)]),51,inverse,theory(equality)]) ).
cnf(59,plain,
double_divide(double_divide(X,Y),X) = Y,
inference('PARAMODULATE',[status(thm)],[55,55,theory(equality)]) ).
cnf(62,plain,
double_divide(inverse(X),inverse(double_divide(inverse(double_divide(X,double_divide(Y,Z))),Y))) = Z,
inference('PARAMODULATE',[status(thm)],[41,55,theory(equality)]) ).
cnf(66,plain,
double_divide(inverse(X),inverse(Y)) = inverse(double_divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[59,58,theory(equality)]) ).
cnf(68,plain,
inverse(double_divide(double_divide(inverse(double_divide(X,double_divide(Y,Z))),Y),X)) = Z,
inference('REWRITE',[status(thm)],[62,66,theory(equality)]) ).
cnf(71,plain,
double_divide(X,inverse(Y)) = inverse(double_divide(Y,inverse(X))),
inference('PARAMODULATE',[status(thm)],[66,51,theory(equality)]) ).
cnf(73,plain,
double_divide(double_divide(b3,a3),inverse(c3)) != inverse(double_divide(inverse(double_divide(c3,b3)),a3)),
inference('REWRITE',[status(thm)],[7,71,theory(equality)]) ).
cnf(74,plain,
double_divide(inverse(X),Y) = inverse(double_divide(inverse(Y),X)),
inference('PARAMODULATE',[status(thm)],[66,51,theory(equality)]) ).
cnf(75,plain,
double_divide(inverse(X),double_divide(inverse(Y),double_divide(X,double_divide(Y,Z)))) = Z,
inference('REWRITE',[status(thm)],[68,51,74,theory(equality)]) ).
cnf(77,plain,
double_divide(double_divide(b3,a3),inverse(c3)) != double_divide(inverse(a3),double_divide(c3,b3)),
inference('REWRITE',[status(thm)],[73,74,theory(equality)]) ).
cnf(78,plain,
double_divide(X,inverse(Y)) = double_divide(inverse(Z),double_divide(Y,double_divide(Z,X))),
inference('PARAMODULATE',[status(thm)],[59,75,theory(equality)]) ).
cnf(79,plain,
double_divide(double_divide(X,Y),inverse(Z)) = double_divide(inverse(Y),double_divide(Z,X)),
inference('PARAMODULATE',[status(thm)],[78,55,theory(equality)]) ).
cnf(80,plain,
$false,
inference('REWRITE',[status(thm)],[77,79,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP492-1 : TPTP v8.1.0. Released v2.6.0.
% 0.12/0.13 % Command : run-snark %s %d
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 04:31:21 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.47 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.48 *
% 0.21/0.48 *
% 0.21/0.48 #<PACKAGE "SNARK-USER">
% 0.21/0.48 *
% 0.21/0.48 SNARK-TPTP-OPTIONS
% 0.21/0.48 *
% 0.21/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48 (USE-FACTORING :POS)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.48 *
% 0.21/0.48 "."
% 0.21/0.48 *
% 0.21/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T04:31:22
% 0.21/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n014.cluster.edu at 2022-06-14T04:31:22
% 0.21/0.50
% 0.21/0.54 ; Recognized possible right inverse assertion (= |identity| (|double_divide| ?X (|inverse| ?X))).
% 0.21/0.54
% 0.21/0.54 #||
% 0.21/0.54 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.54 % SZS output start Refutation
% See solution above
% 0.21/0.55 ||#
% 0.21/0.55
% 0.21/0.55 ; Summary of computation:
% 0.21/0.55 ; 215 formulas have been input or derived (from 23 formulas).
% 0.21/0.55 ; 80 (37%) were retained. Of these,
% 0.21/0.55 ; 63 (79%) were simplified or subsumed later,
% 0.21/0.55 ; 17 (21%) are still being kept.
% 0.21/0.55 ;
% 0.21/0.55 ; Run time in seconds excluding printing time:
% 0.21/0.55 ; 0.001 2% Read assertion file (1 call)
% 0.21/0.55 ; 0.001 2% Assert (5 calls)
% 0.21/0.55 ; 0.011 20% Process new row (203 calls)
% 0.21/0.55 ; 0.000 0% Resolution (44 calls)
% 0.21/0.55 ; 0.004 7% Paramodulation (22 calls)
% 0.21/0.55 ; 0.002 4% Forward simplification (172 calls)
% 0.21/0.55 ; 0.009 16% Backward simplification (80 calls)
% 0.21/0.55 ; 0.003 5% Ordering (423 calls)
% 0.21/0.55 ; 0.000 0% Sortal reasoning (32 calls)
% 0.21/0.55 ; 0.000 0% Purity testing (1 call)
% 0.21/0.55 ; 0.025 45% Other
% 0.21/0.55 ; 0.056 Total
% 0.21/0.55 ; 0.061 Real time
% 0.21/0.55 ;
% 0.21/0.55 ; Term-hash-array has 320 terms in all.
% 0.21/0.55 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.21/0.55 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.21/0.55 ; Path-index has 52 entries (137 at peak, 405 added, 353 deleted).
% 0.21/0.55 ; Path-index has 638 nodes (690 at peak, 1,152 added, 514 deleted).
% 0.21/0.55 ; Trie-index has 52 entries (137 at peak, 405 added, 353 deleted).
% 0.21/0.55 ; Trie-index has 167 nodes (592 at peak, 1,571 added, 1,404 deleted).
% 0.21/0.55 ; Retrieved 438 generalization terms in 1,046 calls.
% 0.21/0.55 ; Retrieved 181 instance terms in 85 calls.
% 0.21/0.55 ; Retrieved 379 unifiable terms in 159 calls.
% 0.21/0.55 ;
% 0.21/0.55 ; The agenda of backward simplifiable rows to process has 1 entry:
% 0.21/0.55 ; 1 with value 0
% 0.21/0.55 ; The agenda of rows to process has 11 entries:
% 0.21/0.55 ; 1 with value 20 2 with value 22 1 with value 24
% 0.21/0.55 ; 4 with value 21 1 with value 23 2 with value 28
% 0.21/0.55 ; The agenda of rows to give has 5 entries:
% 0.21/0.55 ; 1 with value (4 20) 3 with value (4 21) 1 with value (4 22)
% 0.21/0.55 Evaluation took:
% 0.21/0.55 0.062 seconds of real time
% 0.21/0.55 0.051569 seconds of user run time
% 0.21/0.55 0.01014 seconds of system run time
% 0.21/0.55 0 calls to %EVAL
% 0.21/0.55 0 page faults and
% 0.21/0.55 6,301,256 bytes consed.
% 0.21/0.55 :PROOF-FOUND
% 0.21/0.55 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T04:31:22
% 0.21/0.55 :PROOF-FOUND
% 0.21/0.55 *
%------------------------------------------------------------------------------