TSTP Solution File: GRP488-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP488-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n018.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:06 EDT 2022
% Result : Unsatisfiable 0.38s 0.53s
% Output : Refutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 4 RR)
% Number of literals : 23 ( 22 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(X,double_divide(double_divide(double_divide(identity,double_divide(double_divide(X,identity),double_divide(Y,Z))),Y),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(X,inverse(double_divide(double_divide(identity,double_divide(inverse(X),double_divide(Y,Z))),Y))) = Z,
inference('REWRITE',[status(thm)],[single_axiom,inverse,theory(equality)]) ).
cnf(10,plain,
double_divide(X,inverse(double_divide(double_divide(identity,inverse(inverse(X))),Y))) = inverse(Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]),inverse,theory(equality)]) ).
cnf(13,plain,
double_divide(X,inverse(identity)) = inverse(inverse(double_divide(identity,inverse(inverse(X))))),
inference('PARAMODULATE',[status(thm)],[10,identity,theory(equality)]) ).
cnf(14,plain,
double_divide(X,double_divide(X,inverse(identity))) = inverse(identity),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,inverse,theory(equality)]),13,theory(equality)]) ).
cnf(20,plain,
double_divide(X,inverse(double_divide(identity,inverse(X)))) = inverse(identity),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,14,theory(equality)]),identity,theory(equality)]) ).
cnf(26,plain,
identity = inverse(identity),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[20,identity,theory(equality)]),identity,theory(equality)]) ).
cnf(27,plain,
inverse(X) = inverse(inverse(double_divide(identity,inverse(inverse(X))))),
inference('REWRITE',[status(thm)],[13,inverse,26,theory(equality)]) ).
cnf(30,plain,
double_divide(X,inverse(double_divide(identity,inverse(X)))) = identity,
inference('REWRITE',[status(thm)],[20,26,theory(equality)]) ).
cnf(32,plain,
double_divide(identity,inverse(double_divide(double_divide(identity,double_divide(identity,double_divide(X,Y))),X))) = Y,
inference('PARAMODULATE',[status(thm)],[8,26,theory(equality)]) ).
cnf(36,plain,
inverse(X) = inverse(double_divide(identity,inverse(X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,30,theory(equality)]),10,inverse,theory(equality)]) ).
cnf(38,plain,
inverse(X) = inverse(inverse(inverse(X))),
inference('REWRITE',[status(thm)],[27,36,theory(equality)]) ).
cnf(44,plain,
inverse(double_divide(identity,X)) = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[36,10,theory(equality)]),inverse,26,theory(equality)]) ).
cnf(52,plain,
inverse(X) = inverse(double_divide(double_divide(identity,double_divide(identity,double_divide(Y,X))),Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[44,8,theory(equality)]),38,26,theory(equality)]) ).
cnf(54,plain,
double_divide(identity,inverse(X)) = X,
inference('REWRITE',[status(thm)],[32,52,theory(equality)]) ).
cnf(60,plain,
X = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[54,38,theory(equality)]),54,theory(equality)]) ).
cnf(68,plain,
$false,
inference('REWRITE',[status(thm)],[7,60,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP488-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 08:37:57 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 *
% 0.20/0.48 *
% 0.20/0.49 #<PACKAGE "SNARK-USER">
% 0.20/0.49 *
% 0.20/0.49 SNARK-TPTP-OPTIONS
% 0.20/0.49 *
% 0.20/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49 (USE-FACTORING :POS)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49 *
% 0.20/0.49 "."
% 0.20/0.49 *
% 0.20/0.49 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T08:37:57
% 0.20/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n018.cluster.edu at 2022-06-13T08:37:57
% 0.20/0.50
% 0.35/0.53 ; Recognized possible right inverse assertion (= |identity| (|double_divide| ?X (|inverse| ?X))).
% 0.35/0.53
% 0.38/0.53 #||
% 0.38/0.53 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.53 % SZS output start Refutation
% See solution above
% 0.38/0.54 ||#
% 0.38/0.54
% 0.38/0.54 ; Summary of computation:
% 0.38/0.54 ; 162 formulas have been input or derived (from 18 formulas).
% 0.38/0.54 ; 68 (42%) were retained. Of these,
% 0.38/0.54 ; 50 (74%) were simplified or subsumed later,
% 0.38/0.54 ; 18 (26%) are still being kept.
% 0.38/0.54 ;
% 0.38/0.54 ; Run time in seconds excluding printing time:
% 0.38/0.54 ; 0.002 4% Read assertion file (1 call)
% 0.38/0.54 ; 0.000 0% Assert (5 calls)
% 0.38/0.54 ; 0.011 23% Process new row (156 calls)
% 0.38/0.54 ; 0.000 0% Resolution (34 calls)
% 0.38/0.54 ; 0.000 0% Paramodulation (17 calls)
% 0.38/0.54 ; 0.002 4% Forward simplification (146 calls)
% 0.38/0.54 ; 0.009 19% Backward simplification (68 calls)
% 0.38/0.54 ; 0.003 6% Ordering (317 calls)
% 0.38/0.54 ; 0.000 0% Sortal reasoning (32 calls)
% 0.38/0.54 ; 0.000 0% Purity testing (1 call)
% 0.38/0.54 ; 0.021 44% Other
% 0.38/0.54 ; 0.048 Total
% 0.38/0.54 ; 0.052 Real time
% 0.38/0.54 ;
% 0.38/0.54 ; Term-hash-array has 236 terms in all.
% 0.38/0.54 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.38/0.54 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.38/0.54 ; Path-index has 61 entries (118 at peak, 283 added, 222 deleted).
% 0.38/0.54 ; Path-index has 435 nodes (478 at peak, 705 added, 270 deleted).
% 0.38/0.54 ; Trie-index has 61 entries (118 at peak, 283 added, 222 deleted).
% 0.38/0.54 ; Trie-index has 218 nodes (491 at peak, 1,129 added, 911 deleted).
% 0.38/0.54 ; Retrieved 289 generalization terms in 812 calls.
% 0.38/0.54 ; Retrieved 112 instance terms in 72 calls.
% 0.38/0.54 ; Retrieved 232 unifiable terms in 115 calls.
% 0.38/0.54 ;
% 0.38/0.54 ; The agenda of rows to process has 4 entries:
% 0.38/0.54 ; 1 with value 17 1 with value 23 1 with value 27
% 0.38/0.54 ; 1 with value 19
% 0.38/0.54 ; The agenda of rows to give has 11 entries:
% 0.38/0.54 ; 3 with value (4 14) 1 with value (4 17) 1 with value (4 22)
% 0.38/0.54 ; 1 with value (4 15) 2 with value (4 18) 1 with value (4 26)
% 0.38/0.54 ; 1 with value (4 16) 1 with value (4 21)
% 0.38/0.54 Evaluation took:
% 0.38/0.54 0.052 seconds of real time
% 0.38/0.54 0.04694 seconds of user run time
% 0.38/0.54 0.005096 seconds of system run time
% 0.38/0.54 0 calls to %EVAL
% 0.38/0.54 0 page faults and
% 0.38/0.54 4,118,904 bytes consed.
% 0.38/0.54 :PROOF-FOUND
% 0.38/0.54 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T08:37:57
% 0.38/0.54 :PROOF-FOUND
% 0.38/0.54 *
%------------------------------------------------------------------------------