TSTP Solution File: GRP494-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP494-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n024.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:08 EDT 2022
% Result : Unsatisfiable 0.38s 0.56s
% Output : Refutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 4 RR)
% Number of literals : 20 ( 19 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(double_divide(identity,X),double_divide(double_divide(double_divide(Y,Z),double_divide(identity,identity)),double_divide(X,Z))) = Y,
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(identity,X),double_divide(double_divide(double_divide(Y,Z),inverse(identity)),double_divide(X,Z))) = Y,
inference('REWRITE',[status(thm)],[single_axiom,inverse,theory(equality)]) ).
cnf(12,plain,
double_divide(double_divide(identity,X),double_divide(identity,double_divide(X,inverse(Y)))) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]),identity,theory(equality)]) ).
cnf(16,plain,
double_divide(double_divide(identity,X),inverse(identity)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,identity,theory(equality)]),inverse,theory(equality)]) ).
cnf(18,plain,
double_divide(identity,double_divide(identity,double_divide(inverse(identity),inverse(X)))) = X,
inference('PARAMODULATE',[status(thm)],[12,identity,theory(equality)]) ).
cnf(22,plain,
identity = inverse(identity),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[16,identity,theory(equality)]),identity,theory(equality)]) ).
cnf(29,plain,
inverse(double_divide(identity,X)) = X,
inference('REWRITE',[status(thm)],[16,inverse,22,theory(equality)]) ).
cnf(30,plain,
double_divide(identity,double_divide(identity,double_divide(identity,inverse(X)))) = X,
inference('REWRITE',[status(thm)],[18,22,theory(equality)]) ).
cnf(36,plain,
double_divide(double_divide(identity,X),double_divide(identity,double_divide(X,Y))) = double_divide(identity,Y),
inference('PARAMODULATE',[status(thm)],[12,29,theory(equality)]) ).
cnf(37,plain,
double_divide(identity,inverse(X)) = X,
inference('REWRITE',[status(thm)],[12,36,theory(equality)]) ).
cnf(38,plain,
double_divide(identity,double_divide(identity,X)) = X,
inference('REWRITE',[status(thm)],[30,37,theory(equality)]) ).
cnf(43,plain,
inverse(X) = double_divide(identity,X),
inference('PARAMODULATE',[status(thm)],[29,38,theory(equality)]) ).
cnf(46,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[37,43,theory(equality)]) ).
cnf(47,plain,
$false,
inference('REWRITE',[status(thm)],[7,46,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : GRP494-1 : TPTP v8.1.0. Released v2.6.0.
% 0.04/0.15 % Command : run-snark %s %d
% 0.15/0.36 % Computer : n024.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Mon Jun 13 04:47:18 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.22/0.50 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.51 *
% 0.22/0.51 *
% 0.22/0.52 #<PACKAGE "SNARK-USER">
% 0.22/0.52 *
% 0.22/0.52 SNARK-TPTP-OPTIONS
% 0.22/0.52 *
% 0.22/0.52 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.22/0.52 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.22/0.52 (USE-FACTORING :POS)
% 0.22/0.52 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.22/0.52 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.22/0.52 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.22/0.52 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.22/0.52 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.22/0.52 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.22/0.52 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.22/0.52 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.22/0.52 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.22/0.52 (DECLARE-TPTP-SYMBOLS2))
% 0.22/0.52 *
% 0.22/0.52 "."
% 0.22/0.52 *
% 0.22/0.52 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T04:47:18
% 0.22/0.52 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n024.cluster.edu at 2022-06-13T04:47:18
% 0.36/0.53
% 0.38/0.56 ; Recognized possible right inverse assertion (= |identity| (|double_divide| ?X (|inverse| ?X))).
% 0.38/0.56
% 0.38/0.56 #||
% 0.38/0.56 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.56 % SZS output start Refutation
% See solution above
% 0.38/0.56 ||#
% 0.38/0.56
% 0.38/0.56 ; Summary of computation:
% 0.38/0.56 ; 103 formulas have been input or derived (from 13 formulas).
% 0.38/0.56 ; 47 (46%) were retained. Of these,
% 0.38/0.56 ; 36 (77%) were simplified or subsumed later,
% 0.38/0.56 ; 11 (23%) are still being kept.
% 0.38/0.56 ;
% 0.38/0.56 ; Run time in seconds excluding printing time:
% 0.38/0.56 ; 0.001 2% Read assertion file (1 call)
% 0.38/0.56 ; 0.000 0% Assert (5 calls)
% 0.38/0.56 ; 0.005 12% Process new row (83 calls)
% 0.38/0.56 ; 0.001 2% Resolution (24 calls)
% 0.38/0.56 ; 0.001 2% Paramodulation (12 calls)
% 0.38/0.56 ; 0.005 12% Forward simplification (79 calls)
% 0.38/0.56 ; 0.005 12% Backward simplification (47 calls)
% 0.38/0.56 ; 0.000 0% Ordering (155 calls)
% 0.38/0.56 ; 0.002 5% Sortal reasoning (32 calls)
% 0.38/0.56 ; 0.000 0% Purity testing (1 call)
% 0.38/0.56 ; 0.020 50% Other
% 0.38/0.56 ; 0.040 Total
% 0.38/0.56 ; 0.043 Real time
% 0.38/0.56 ;
% 0.38/0.56 ; Term-hash-array has 173 terms in all.
% 0.38/0.56 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.38/0.56 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.38/0.56 ; Path-index has 46 entries (94 at peak, 222 added, 176 deleted).
% 0.38/0.56 ; Path-index has 383 nodes (398 at peak, 604 added, 221 deleted).
% 0.38/0.56 ; Trie-index has 46 entries (94 at peak, 222 added, 176 deleted).
% 0.38/0.56 ; Trie-index has 163 nodes (424 at peak, 899 added, 736 deleted).
% 0.38/0.56 ; Retrieved 94 generalization terms in 403 calls.
% 0.38/0.56 ; Retrieved 74 instance terms in 46 calls.
% 0.38/0.56 ; Retrieved 142 unifiable terms in 80 calls.
% 0.38/0.56 ;
% 0.38/0.56 ; The agenda of backward simplifiable rows to process has 11 entries:
% 0.38/0.56 ; 11 with value 0
% 0.38/0.56 ; The agenda of rows to process has 6 entries:
% 0.38/0.56 ; 1 with value 11 2 with value 22 1 with value 23
% 0.38/0.56 ; 2 with value 12
% 0.38/0.56 ; The agenda of rows to give has 6 entries:
% 0.38/0.56 ; 1 with value (4 9) 1 with value (4 18) 1 with value (4 24)
% 0.38/0.56 ; 1 with value (4 11) 1 with value (4 20) 1 with value (4 26)
% 0.38/0.56 Evaluation took:
% 0.38/0.56 0.044 seconds of real time
% 0.38/0.56 0.035843 seconds of user run time
% 0.38/0.56 0.007715 seconds of system run time
% 0.38/0.56 0 calls to %EVAL
% 0.38/0.56 0 page faults and
% 0.38/0.56 3,295,776 bytes consed.
% 0.38/0.56 :PROOF-FOUND
% 0.38/0.56 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T04:47:19
% 0.38/0.56 :PROOF-FOUND
% 0.38/0.56 *
%------------------------------------------------------------------------------