TSTP Solution File: GRP576-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP576-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n015.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.35s 0.52s
% Output : Refutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 5 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 49 ( 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_4,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_4) ).
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(b,a)) != inverse(double_divide(a,b)),
inference('REWRITE',[status(thm)],[prove_these_axioms_4,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(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(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(48,plain,
X = double_divide(double_divide(X,Y),Y),
inference('REWRITE',[status(thm)],[41,46,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(56,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,53,theory(equality)]),theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP576-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 13:36:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.47 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T13:36:08
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n015.cluster.edu at 2022-06-13T13:36:08
% 0.19/0.48
% 0.35/0.52 ; Recognized possible right inverse assertion (= |identity| (|double_divide| ?X (|inverse| ?X))).
% 0.35/0.52
% 0.35/0.52 #||
% 0.35/0.52 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.35/0.52 % SZS output start Refutation
% See solution above
% 0.35/0.52 ||#
% 0.35/0.52
% 0.35/0.52 ; Summary of computation:
% 0.35/0.52 ; 192 formulas have been input or derived (from 25 formulas).
% 0.35/0.52 ; 56 (29%) were retained. Of these,
% 0.35/0.52 ; 39 (70%) were simplified or subsumed later,
% 0.35/0.52 ; 17 (30%) are still being kept.
% 0.35/0.52 ;
% 0.35/0.52 ; Run time in seconds excluding printing time:
% 0.35/0.52 ; 0.001 2% Read assertion file (1 call)
% 0.35/0.52 ; 0.001 2% Assert (5 calls)
% 0.35/0.52 ; 0.005 11% Process new row (189 calls)
% 0.35/0.52 ; 0.003 7% Resolution (48 calls)
% 0.35/0.52 ; 0.002 5% Paramodulation (24 calls)
% 0.35/0.52 ; 0.000 0% Forward simplification (151 calls)
% 0.35/0.52 ; 0.004 9% Backward simplification (56 calls)
% 0.35/0.52 ; 0.005 11% Ordering (331 calls)
% 0.35/0.52 ; 0.000 0% Sortal reasoning (32 calls)
% 0.35/0.52 ; 0.000 0% Purity testing (1 call)
% 0.35/0.52 ; 0.023 52% Other
% 0.35/0.52 ; 0.044 Total
% 0.35/0.52 ; 0.049 Real time
% 0.35/0.52 ;
% 0.35/0.52 ; Term-hash-array has 206 terms in all.
% 0.35/0.52 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.35/0.52 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.35/0.52 ; Path-index has 52 entries (97 at peak, 248 added, 196 deleted).
% 0.35/0.52 ; Path-index has 463 nodes (484 at peak, 783 added, 320 deleted).
% 0.35/0.52 ; Trie-index has 52 entries (97 at peak, 248 added, 196 deleted).
% 0.35/0.52 ; Trie-index has 157 nodes (417 at peak, 997 added, 840 deleted).
% 0.35/0.52 ; Retrieved 177 generalization terms in 589 calls.
% 0.35/0.52 ; Retrieved 102 instance terms in 55 calls.
% 0.35/0.52 ; Retrieved 306 unifiable terms in 158 calls.
% 0.35/0.52 ;
% 0.35/0.52 ; The agenda of rows to process has 3 entries:
% 0.35/0.52 ; 3 with value 18
% 0.35/0.52 ; The agenda of rows to give has 5 entries:
% 0.35/0.52 ; 2 with value (4 15) 2 with value (4 21) 1 with value (4 22)
% 0.35/0.52 Evaluation took:
% 0.35/0.52 0.049 seconds of real time
% 0.35/0.52 0.039121 seconds of user run time
% 0.35/0.52 0.010017 seconds of system run time
% 0.35/0.52 0 calls to %EVAL
% 0.35/0.52 0 page faults and
% 0.35/0.52 4,610,336 bytes consed.
% 0.35/0.52 :PROOF-FOUND
% 0.35/0.52 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T13:36:08
% 0.35/0.52 :PROOF-FOUND
% 0.35/0.52 *
%------------------------------------------------------------------------------