TSTP Solution File: GRP483-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP483-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:05 EDT 2022
% Result : Unsatisfiable 0.20s 0.54s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 6 RR)
% Number of literals : 31 ( 30 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 : 49 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(double_divide(double_divide(X,double_divide(Y,identity)),double_divide(double_divide(Z,double_divide(U,double_divide(U,identity))),double_divide(X,identity))),Y) = Z,
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(double_divide(X,inverse(Y)),double_divide(inverse(Z),inverse(X))),Y) = Z,
inference('REWRITE',[status(thm)],[single_axiom,identity,inverse,theory(equality)]) ).
cnf(10,plain,
double_divide(inverse(double_divide(inverse(X),inverse(Y))),Y) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]),inverse,theory(equality)]) ).
cnf(11,plain,
inverse(double_divide(double_divide(X,inverse(identity)),double_divide(inverse(Y),inverse(X)))) = Y,
inference('PARAMODULATE',[status(thm)],[inverse,8,theory(equality)]) ).
cnf(13,plain,
double_divide(inverse(identity),inverse(X)) = X,
inference('PARAMODULATE',[status(thm)],[10,identity,theory(equality)]) ).
cnf(15,plain,
double_divide(inverse(X),Y) = double_divide(inverse(X),inverse(inverse(Y))),
inference('PARAMODULATE',[status(thm)],[10,10,theory(equality)]) ).
cnf(16,plain,
double_divide(double_divide(double_divide(X,inverse(Y)),Z),Y) = double_divide(inverse(Z),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,10,theory(equality)]),15,theory(equality)]) ).
cnf(17,plain,
identity = inverse(identity),
inference('PARAMODULATE',[status(thm)],[identity,13,theory(equality)]) ).
cnf(18,plain,
inverse(double_divide(inverse(X),double_divide(inverse(Y),inverse(X)))) = Y,
inference('REWRITE',[status(thm)],[11,inverse,17,theory(equality)]) ).
cnf(19,plain,
double_divide(identity,inverse(X)) = X,
inference('REWRITE',[status(thm)],[13,17,theory(equality)]) ).
cnf(21,plain,
double_divide(inverse(X),X) = identity,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,17,theory(equality)]),19,theory(equality)]) ).
cnf(22,plain,
double_divide(identity,X) = inverse(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,21,theory(equality)]),17,theory(equality)]) ).
cnf(23,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[19,22,theory(equality)]) ).
cnf(25,plain,
double_divide(inverse(double_divide(X,inverse(Y))),Y) = inverse(X),
inference('PARAMODULATE',[status(thm)],[10,23,theory(equality)]) ).
cnf(26,plain,
inverse(double_divide(X,double_divide(inverse(Y),X))) = Y,
inference('PARAMODULATE',[status(thm)],[18,18,theory(equality)]) ).
cnf(27,plain,
inverse(X) = double_divide(Y,double_divide(inverse(X),Y)),
inference('PARAMODULATE',[status(thm)],[23,26,theory(equality)]) ).
cnf(28,plain,
X = double_divide(Y,double_divide(X,Y)),
inference('PARAMODULATE',[status(thm)],[27,23,theory(equality)]) ).
cnf(29,plain,
X = double_divide(double_divide(Y,X),Y),
inference('PARAMODULATE',[status(thm)],[28,28,theory(equality)]) ).
cnf(31,plain,
inverse(double_divide(X,inverse(Y))) = double_divide(Y,inverse(X)),
inference('PARAMODULATE',[status(thm)],[28,25,theory(equality)]) ).
cnf(32,plain,
double_divide(double_divide(b3,a3),inverse(c3)) != inverse(double_divide(inverse(double_divide(c3,b3)),a3)),
inference('REWRITE',[status(thm)],[7,23,31,theory(equality)]) ).
cnf(33,plain,
double_divide(inverse(X),Y) = inverse(double_divide(inverse(Y),X)),
inference('PARAMODULATE',[status(thm)],[25,29,theory(equality)]) ).
cnf(34,plain,
double_divide(double_divide(b3,a3),inverse(c3)) != double_divide(inverse(a3),double_divide(c3,b3)),
inference('REWRITE',[status(thm)],[32,33,theory(equality)]) ).
cnf(41,plain,
double_divide(double_divide(double_divide(X,Y),Z),inverse(Y)) = double_divide(inverse(Z),X),
inference('PARAMODULATE',[status(thm)],[16,23,theory(equality)]) ).
cnf(58,plain,
double_divide(double_divide(X,Y),inverse(Z)) = double_divide(inverse(Y),double_divide(Z,X)),
inference('PARAMODULATE',[status(thm)],[41,29,theory(equality)]) ).
cnf(59,plain,
$false,
inference('REWRITE',[status(thm)],[34,58,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP483-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n024.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 : Tue Jun 14 10:51:33 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p 2022-06-14T10:51:33
% 0.20/0.49 ; 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-14T10:51:33
% 0.20/0.50
% 0.20/0.54 ; Recognized possible right inverse assertion (= |identity| (|double_divide| ?X (|inverse| ?X))).
% 0.20/0.54
% 0.20/0.54 #||
% 0.20/0.54 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.54 % SZS output start Refutation
% See solution above
% 0.20/0.54 ||#
% 0.20/0.54
% 0.20/0.54 ; Summary of computation:
% 0.20/0.55 ; 249 formulas have been input or derived (from 25 formulas).
% 0.20/0.55 ; 59 (24%) were retained. Of these,
% 0.20/0.55 ; 24 (41%) were simplified or subsumed later,
% 0.20/0.55 ; 35 (59%) are still being kept.
% 0.20/0.55 ;
% 0.20/0.55 ; Run time in seconds excluding printing time:
% 0.20/0.55 ; 0.001 2% Read assertion file (1 call)
% 0.20/0.55 ; 0.000 0% Assert (5 calls)
% 0.20/0.55 ; 0.007 13% Process new row (230 calls)
% 0.20/0.55 ; 0.001 2% Resolution (48 calls)
% 0.20/0.55 ; 0.006 11% Paramodulation (24 calls)
% 0.20/0.55 ; 0.005 9% Forward simplification (204 calls)
% 0.20/0.55 ; 0.005 9% Backward simplification (59 calls)
% 0.20/0.55 ; 0.004 7% Ordering (774 calls)
% 0.20/0.55 ; 0.002 4% Sortal reasoning (32 calls)
% 0.20/0.55 ; 0.000 0% Purity testing (1 call)
% 0.20/0.55 ; 0.023 43% Other
% 0.20/0.55 ; 0.054 Total
% 0.20/0.55 ; 0.059 Real time
% 0.20/0.55 ;
% 0.20/0.55 ; Term-hash-array has 213 terms in all.
% 0.20/0.55 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.20/0.55 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.20/0.55 ; Path-index has 117 entries (133 at peak, 246 added, 129 deleted).
% 0.20/0.55 ; Path-index has 430 nodes (472 at peak, 664 added, 234 deleted).
% 0.20/0.55 ; Trie-index has 117 entries (133 at peak, 246 added, 129 deleted).
% 0.20/0.55 ; Trie-index has 455 nodes (536 at peak, 1,037 added, 582 deleted).
% 0.20/0.55 ; Retrieved 722 generalization terms in 1,093 calls.
% 0.20/0.55 ; Retrieved 188 instance terms in 86 calls.
% 0.20/0.55 ; Retrieved 431 unifiable terms in 165 calls.
% 0.20/0.55 ;
% 0.20/0.55 ; The agenda of backward simplifiable rows to process has 1 entry:
% 0.20/0.55 ; 1 with value 0
% 0.20/0.55 ; The agenda of rows to process has 18 entries:
% 0.20/0.55 ; 2 with value 22 1 with value 25 1 with value 29
% 0.20/0.55 ; 4 with value 23 2 with value 26 1 with value 30
% 0.20/0.55 ; 1 with value 24 5 with value 28 1 with value 31
% 0.20/0.55 ; The agenda of rows to give has 20 entries:
% 0.20/0.55 ; 1 with value (4 21) 3 with value (4 25) 1 with value (4 28)
% 0.20/0.55 ; 3 with value (4 22) 2 with value (4 26) 1 with value (4 30)
% 0.20/0.55 ; 1 with value (4 23) 6 with value (4 27) 1 with value (4 31)
% 0.20/0.55 ; 1 with value (4 24)
% 0.20/0.55 Evaluation took:
% 0.20/0.55 0.059 seconds of real time
% 0.20/0.55 0.052834 seconds of user run time
% 0.20/0.55 0.006169 seconds of system run time
% 0.20/0.55 0 calls to %EVAL
% 0.20/0.55 0 page faults and
% 0.20/0.55 4,843,536 bytes consed.
% 0.20/0.55 :PROOF-FOUND
% 0.20/0.55 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T10:51:33
% 0.20/0.55 :PROOF-FOUND
% 0.20/0.55 *
%------------------------------------------------------------------------------