TSTP Solution File: GRP575-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP575-1 : TPTP v8.1.0. Released v2.6.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 : Sat Jul 16 11:39:29 EDT 2022
% Result : Unsatisfiable 0.47s 0.63s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 5
% Syntax : Number of clauses : 48 ( 48 unt; 0 nHn; 7 RR)
% Number of literals : 48 ( 47 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 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 : 91 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(double_divide(X,double_divide(double_divide(Y,double_divide(Z,X)),double_divide(Z,identity))),double_divide(identity,identity)) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = double_divide(double_divide(Y,X),identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(inverse,axiom,
inverse(X) = double_divide(X,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(identity,axiom,
identity = double_divide(X,inverse(X)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/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(X,double_divide(double_divide(Y,double_divide(Z,X)),inverse(Z))),inverse(identity)) = Y,
inference('REWRITE',[status(thm)],[single_axiom,inverse,theory(equality)]) ).
cnf(9,plain,
double_divide(double_divide(inverse(X),double_divide(inverse(Y),inverse(X))),inverse(identity)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]),inverse,theory(equality)]) ).
cnf(11,plain,
double_divide(double_divide(inverse(identity),double_divide(double_divide(X,Y),inverse(double_divide(Z,double_divide(double_divide(Y,double_divide(U,Z)),inverse(U)))))),inverse(identity)) = X,
inference('PARAMODULATE',[status(thm)],[8,8,theory(equality)]) ).
cnf(12,plain,
double_divide(inverse(inverse(inverse(X))),inverse(identity)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,identity,theory(equality)]),inverse,theory(equality)]) ).
cnf(14,plain,
double_divide(double_divide(inverse(identity),X),inverse(identity)) = inverse(inverse(X)),
inference('PARAMODULATE',[status(thm)],[9,12,theory(equality)]) ).
cnf(16,plain,
inverse(inverse(double_divide(double_divide(X,Y),inverse(double_divide(Z,double_divide(double_divide(Y,double_divide(U,Z)),inverse(U))))))) = X,
inference('REWRITE',[status(thm)],[11,14,theory(equality)]) ).
cnf(20,plain,
identity = inverse(inverse(inverse(inverse(identity)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[14,identity,theory(equality)]),identity,theory(equality)]) ).
cnf(24,plain,
identity = inverse(identity),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,20,theory(equality)]),identity,theory(equality)]) ).
cnf(25,plain,
inverse(double_divide(X,double_divide(double_divide(Y,double_divide(Z,X)),inverse(Z)))) = Y,
inference('REWRITE',[status(thm)],[8,inverse,24,theory(equality)]) ).
cnf(26,plain,
inverse(inverse(double_divide(double_divide(X,Y),Y))) = X,
inference('REWRITE',[status(thm)],[16,25,theory(equality)]) ).
cnf(27,plain,
inverse(double_divide(inverse(X),double_divide(inverse(Y),inverse(X)))) = Y,
inference('REWRITE',[status(thm)],[9,inverse,24,theory(equality)]) ).
cnf(29,plain,
inverse(inverse(inverse(inverse(X)))) = X,
inference('REWRITE',[status(thm)],[12,inverse,24,theory(equality)]) ).
cnf(30,plain,
inverse(double_divide(identity,X)) = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[14,inverse,24,theory(equality)]) ).
cnf(33,plain,
inverse(double_divide(X,double_divide(double_divide(Y,double_divide(double_divide(Z,double_divide(double_divide(U,double_divide(V,Z)),inverse(V))),X)),U))) = Y,
inference('PARAMODULATE',[status(thm)],[25,25,theory(equality)]) ).
cnf(36,plain,
inverse(inverse(inverse(X))) = double_divide(Y,double_divide(double_divide(X,double_divide(Z,Y)),inverse(Z))),
inference('PARAMODULATE',[status(thm)],[29,25,theory(equality)]) ).
cnf(37,plain,
inverse(double_divide(X,double_divide(double_divide(Y,double_divide(inverse(inverse(inverse(Z))),X)),Z))) = Y,
inference('REWRITE',[status(thm)],[33,36,theory(equality)]) ).
cnf(39,plain,
inverse(X) = double_divide(identity,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[29,30,theory(equality)]),29,theory(equality)]) ).
cnf(41,plain,
inverse(inverse(X)) = double_divide(double_divide(X,Y),Y),
inference('PARAMODULATE',[status(thm)],[29,26,theory(equality)]) ).
cnf(42,plain,
identity = double_divide(inverse(X),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[41,39,theory(equality)]),24,theory(equality)]) ).
cnf(43,plain,
inverse(inverse(double_divide(X,Y))) = double_divide(inverse(inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[41,41,theory(equality)]) ).
cnf(44,plain,
inverse(double_divide(X,double_divide(double_divide(Y,inverse(inverse(double_divide(inverse(Z),X)))),Z))) = Y,
inference('REWRITE',[status(thm)],[37,43,theory(equality)]) ).
cnf(45,plain,
inverse(inverse(inverse(X))) = inverse(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[41,42,theory(equality)]),39,theory(equality)]) ).
cnf(46,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[29,45,theory(equality)]) ).
cnf(47,plain,
inverse(double_divide(X,double_divide(double_divide(Y,double_divide(inverse(Z),X)),Z))) = Y,
inference('REWRITE',[status(thm)],[44,46,theory(equality)]) ).
cnf(48,plain,
X = double_divide(double_divide(X,Y),Y),
inference('REWRITE',[status(thm)],[41,46,theory(equality)]) ).
cnf(49,plain,
inverse(X) = double_divide(Y,double_divide(double_divide(X,double_divide(Z,Y)),inverse(Z))),
inference('REWRITE',[status(thm)],[36,45,theory(equality)]) ).
cnf(50,plain,
inverse(double_divide(X,double_divide(inverse(Y),X))) = Y,
inference('PARAMODULATE',[status(thm)],[27,27,theory(equality)]) ).
cnf(51,plain,
inverse(X) = double_divide(Y,double_divide(inverse(X),Y)),
inference('PARAMODULATE',[status(thm)],[46,50,theory(equality)]) ).
cnf(52,plain,
X = double_divide(Y,double_divide(X,Y)),
inference('PARAMODULATE',[status(thm)],[51,46,theory(equality)]) ).
cnf(53,plain,
double_divide(X,Y) = double_divide(Y,X),
inference('PARAMODULATE',[status(thm)],[52,48,theory(equality)]) ).
cnf(58,plain,
inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(a3,inverse(double_divide(c3,b3)))),
inference('PARAMODULATE',[status(thm)],[7,53,theory(equality)]) ).
cnf(60,plain,
inverse(double_divide(X,double_divide(Y,Z))) = double_divide(Y,double_divide(inverse(Z),X)),
inference('PARAMODULATE',[status(thm)],[47,48,theory(equality)]) ).
cnf(61,plain,
inverse(double_divide(X,double_divide(Y,Z))) = double_divide(Z,double_divide(X,inverse(Y))),
inference('PARAMODULATE',[status(thm)],[49,48,theory(equality)]) ).
cnf(63,plain,
inverse(double_divide(X,inverse(Y))) = double_divide(Y,inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[60,inverse,theory(equality)]),39,24,theory(equality)]) ).
cnf(66,plain,
double_divide(double_divide(b3,a3),inverse(c3)) != double_divide(double_divide(c3,b3),inverse(a3)),
inference('REWRITE',[status(thm)],[58,46,63,theory(equality)]) ).
cnf(91,plain,
inverse(double_divide(X,Y)) = double_divide(inverse(Y),inverse(X)),
inference('PARAMODULATE',[status(thm)],[63,46,theory(equality)]) ).
cnf(96,plain,
inverse(double_divide(inverse(X),Y)) = double_divide(X,inverse(Y)),
inference('PARAMODULATE',[status(thm)],[63,53,theory(equality)]) ).
cnf(105,plain,
inverse(double_divide(X,Y)) = inverse(double_divide(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[53,91,theory(equality)]),91,theory(equality)]) ).
cnf(137,plain,
inverse(double_divide(inverse(X),double_divide(Y,Z))) = double_divide(X,inverse(double_divide(Z,Y))),
inference('PARAMODULATE',[status(thm)],[96,105,theory(equality)]) ).
cnf(176,plain,
inverse(double_divide(X,inverse(double_divide(Y,Z)))) = double_divide(inverse(Y),double_divide(X,Z)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[61,91,theory(equality)]),46,theory(equality)]) ).
cnf(228,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[66,53,theory(equality)]),53,46,137,176,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP575-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n019.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 : Tue Jun 14 05:13:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 *
% 0.21/0.47 *
% 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/sandbox2/benchmark/theBenchmark.p 2022-06-14T05:13:55
% 0.21/0.48 ; 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-14T05:13:55
% 0.21/0.49
% 0.47/0.63 ; Recognized possible right inverse assertion (= |identity| (|double_divide| ?X (|inverse| ?X))).
% 0.47/0.63
% 0.47/0.63 #||
% 0.47/0.63 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.63 % SZS output start Refutation
% See solution above
% 0.47/0.63 ||#
% 0.47/0.63
% 0.47/0.63 ; Summary of computation:
% 0.47/0.63 ; 777 formulas have been input or derived (from 39 formulas).
% 0.47/0.63 ; 228 (29%) were retained. Of these,
% 0.47/0.63 ; 58 (25%) were simplified or subsumed later,
% 0.47/0.63 ; 170 (75%) are still being kept.
% 0.47/0.63 ;
% 0.47/0.63 ; Run time in seconds excluding printing time:
% 0.47/0.63 ; 0.001 1% Read assertion file (1 call)
% 0.47/0.63 ; 0.001 1% Assert (5 calls)
% 0.47/0.63 ; 0.013 9% Process new row (746 calls)
% 0.47/0.63 ; 0.000 0% Resolution (76 calls)
% 0.47/0.63 ; 0.013 9% Paramodulation (38 calls)
% 0.47/0.63 ; 0.027 18% Forward simplification (667 calls)
% 0.47/0.63 ; 0.020 14% Backward simplification (228 calls)
% 0.47/0.63 ; 0.048 33% Ordering (9,173 calls)
% 0.47/0.63 ; 0.000 0% Sortal reasoning (32 calls)
% 0.47/0.63 ; 0.000 0% Purity testing (1 call)
% 0.47/0.63 ; 0.023 16% Other
% 0.47/0.63 ; 0.146 Total
% 0.47/0.63 ; 0.151 Real time
% 0.47/0.63 ;
% 0.47/0.63 ; Term-hash-array has 674 terms in all.
% 0.47/0.63 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.47/0.63 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.47/0.63 ; Path-index has 482 entries (482 at peak, 743 added, 261 deleted).
% 0.47/0.63 ; Path-index has 739 nodes (739 at peak, 1,150 added, 411 deleted).
% 0.47/0.63 ; Trie-index has 482 entries (482 at peak, 743 added, 261 deleted).
% 0.47/0.63 ; Trie-index has 1,414 nodes (1,414 at peak, 2,530 added, 1,116 deleted).
% 0.47/0.63 ; Retrieved 6,524 generalization terms in 4,202 calls.
% 0.47/0.63 ; Retrieved 2,163 instance terms in 482 calls.
% 0.47/0.63 ; Retrieved 1,480 unifiable terms in 278 calls.
% 0.47/0.63 ;
% 0.47/0.63 ; The agenda of rows to process has 4 entries:
% 0.47/0.63 ; 4 with value 26
% 0.47/0.63 ; The agenda of rows to give has 148 entries:
% 0.47/0.63 ; 10 with value (4 22) 15 with value (4 26) 22 with value (4 30)
% 0.47/0.63 ; 13 with value (4 23) 28 with value (4 27) 10 with value (4 31)
% 0.47/0.63 ; 9 with value (4 24) 12 with value (4 28) 8 with value (4 32)
% 0.47/0.63 ; 15 with value (4 25) 6 with value (4 29)
% 0.47/0.63 Evaluation took:
% 0.47/0.63 0.151 seconds of real time
% 0.47/0.63 0.127277 seconds of user run time
% 0.47/0.63 0.023514 seconds of system run time
% 0.47/0.63 0 calls to %EVAL
% 0.47/0.63 0 page faults and
% 0.47/0.63 12,288,664 bytes consed.
% 0.47/0.63 :PROOF-FOUND
% 0.47/0.63 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T05:13:55
% 0.48/0.63 :PROOF-FOUND
% 0.48/0.63 *
%------------------------------------------------------------------------------