TSTP Solution File: GRP075-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP075-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n006.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:36:02 EDT 2022
% Result : Unsatisfiable 0.35s 0.53s
% Output : Refutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of clauses : 33 ( 30 unt; 0 nHn; 8 RR)
% Number of literals : 38 ( 37 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 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/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,negated_conjecture,
( multiply(inverse(a1),a1) != identity
| multiply(identity,a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(6,plain,
multiply(X,Y) = inverse(double_divide(Y,X)),
inference('REWRITE',[status(thm)],[multiply,inverse,theory(equality)]) ).
cnf(7,plain,
( inverse(identity) != identity
| inverse(inverse(a2)) != a2
| 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,inverse,identity,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,
inverse(identity) = identity,
inference('PARAMODULATE',[status(thm)],[identity,13,theory(equality)]) ).
cnf(18,plain,
( inverse(inverse(a2)) != a2
| inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(inverse(double_divide(c3,b3)),a3)) ),
inference('REWRITE',[status(thm)],[7,17,theory(equality)]) ).
cnf(19,plain,
inverse(double_divide(inverse(X),double_divide(inverse(Y),inverse(X)))) = Y,
inference('REWRITE',[status(thm)],[11,inverse,17,theory(equality)]) ).
cnf(20,plain,
double_divide(identity,inverse(X)) = X,
inference('REWRITE',[status(thm)],[13,17,theory(equality)]) ).
cnf(22,plain,
double_divide(inverse(X),X) = identity,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,17,theory(equality)]),20,theory(equality)]) ).
cnf(23,plain,
double_divide(identity,X) = inverse(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,22,theory(equality)]),17,theory(equality)]) ).
cnf(24,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[20,23,theory(equality)]) ).
cnf(26,plain,
inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(inverse(double_divide(c3,b3)),a3)),
inference('REWRITE',[status(thm)],[18,24,theory(equality)]) ).
cnf(27,plain,
double_divide(inverse(double_divide(X,inverse(Y))),Y) = inverse(X),
inference('PARAMODULATE',[status(thm)],[10,24,theory(equality)]) ).
cnf(28,plain,
inverse(double_divide(X,double_divide(inverse(Y),X))) = Y,
inference('PARAMODULATE',[status(thm)],[19,19,theory(equality)]) ).
cnf(29,plain,
inverse(X) = double_divide(Y,double_divide(inverse(X),Y)),
inference('PARAMODULATE',[status(thm)],[24,28,theory(equality)]) ).
cnf(30,plain,
X = double_divide(Y,double_divide(X,Y)),
inference('PARAMODULATE',[status(thm)],[29,24,theory(equality)]) ).
cnf(31,plain,
X = double_divide(double_divide(Y,X),Y),
inference('PARAMODULATE',[status(thm)],[30,30,theory(equality)]) ).
cnf(33,plain,
inverse(double_divide(X,inverse(Y))) = double_divide(Y,inverse(X)),
inference('PARAMODULATE',[status(thm)],[30,27,theory(equality)]) ).
cnf(34,plain,
double_divide(double_divide(b3,a3),inverse(c3)) != inverse(double_divide(inverse(double_divide(c3,b3)),a3)),
inference('REWRITE',[status(thm)],[26,24,33,theory(equality)]) ).
cnf(35,plain,
double_divide(inverse(X),Y) = inverse(double_divide(inverse(Y),X)),
inference('PARAMODULATE',[status(thm)],[27,31,theory(equality)]) ).
cnf(36,plain,
double_divide(double_divide(b3,a3),inverse(c3)) != double_divide(inverse(a3),double_divide(c3,b3)),
inference('REWRITE',[status(thm)],[34,35,theory(equality)]) ).
cnf(43,plain,
double_divide(double_divide(double_divide(X,Y),Z),inverse(Y)) = double_divide(inverse(Z),X),
inference('PARAMODULATE',[status(thm)],[16,24,theory(equality)]) ).
cnf(60,plain,
double_divide(double_divide(X,Y),inverse(Z)) = double_divide(inverse(Y),double_divide(Z,X)),
inference('PARAMODULATE',[status(thm)],[43,31,theory(equality)]) ).
cnf(61,plain,
$false,
inference('REWRITE',[status(thm)],[36,60,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP075-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n006.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 00:11:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.47 *
% 0.20/0.47 #<PACKAGE "SNARK-USER">
% 0.20/0.47 *
% 0.20/0.47 SNARK-TPTP-OPTIONS
% 0.20/0.47 *
% 0.20/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47 (USE-FACTORING :POS)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47 *
% 0.20/0.47 "."
% 0.20/0.47 *
% 0.20/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T00:11:56
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n006.cluster.edu at 2022-06-14T00:11:56
% 0.20/0.49
% 0.35/0.53 ; Recognized possible right inverse assertion (= |identity| (|double_divide| ?X (|inverse| ?X))).
% 0.35/0.53
% 0.35/0.53 #||
% 0.35/0.53 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.35/0.53 % SZS output start Refutation
% See solution above
% 0.38/0.53 ||#
% 0.38/0.53
% 0.38/0.53 ; Summary of computation:
% 0.38/0.53 ; 251 formulas have been input or derived (from 27 formulas).
% 0.38/0.53 ; 61 (24%) were retained. Of these,
% 0.38/0.53 ; 26 (43%) were simplified or subsumed later,
% 0.38/0.53 ; 35 (57%) are still being kept.
% 0.38/0.53 ;
% 0.38/0.53 ; Run time in seconds excluding printing time:
% 0.38/0.53 ; 0.001 2% Read assertion file (1 call)
% 0.38/0.53 ; 0.001 2% Assert (5 calls)
% 0.38/0.53 ; 0.013 23% Process new row (232 calls)
% 0.38/0.53 ; 0.000 0% Resolution (52 calls)
% 0.38/0.53 ; 0.005 9% Paramodulation (26 calls)
% 0.38/0.53 ; 0.000 0% Condensing (3 calls)
% 0.38/0.53 ; 0.000 0% Forward subsumption (3 calls)
% 0.38/0.53 ; 0.000 0% Backward subsumption (3 calls)
% 0.38/0.53 ; 0.007 12% Forward simplification (206 calls)
% 0.38/0.53 ; 0.004 7% Backward simplification (61 calls)
% 0.38/0.53 ; 0.005 9% Ordering (777 calls)
% 0.38/0.53 ; 0.000 0% Sortal reasoning (32 calls)
% 0.38/0.53 ; 0.000 0% Purity testing (1 call)
% 0.38/0.53 ; 0.021 37% Other
% 0.38/0.54 ; 0.057 Total
% 0.38/0.54 ; 0.062 Real time
% 0.38/0.54 ;
% 0.38/0.54 ; Term-hash-array has 221 terms in all.
% 0.38/0.54 ; Feature-vector-row-index has 0 entries (1 at peak, 3 added, 3 deleted).
% 0.38/0.54 ; Feature-vector-row-index has 1 node (26 at peak, 69 added, 68 deleted).
% 0.38/0.54 ; Retrieved 0 possibly forward subsuming rows in 3 calls.
% 0.38/0.54 ; Retrieved 0 possibly backward subsumed rows in 3 calls.
% 0.38/0.54 ; Path-index has 119 entries (135 at peak, 287 added, 168 deleted).
% 0.38/0.54 ; Path-index has 434 nodes (476 at peak, 740 added, 306 deleted).
% 0.38/0.54 ; Trie-index has 119 entries (135 at peak, 287 added, 168 deleted).
% 0.38/0.54 ; Trie-index has 457 nodes (538 at peak, 1,141 added, 684 deleted).
% 0.38/0.54 ; Retrieved 729 generalization terms in 1,084 calls.
% 0.38/0.54 ; Retrieved 188 instance terms in 85 calls.
% 0.38/0.54 ; Retrieved 472 unifiable terms in 201 calls.
% 0.38/0.54 ;
% 0.38/0.54 ; The agenda of backward simplifiable rows to process has 1 entry:
% 0.38/0.54 ; 1 with value 0
% 0.38/0.54 ; The agenda of rows to process has 18 entries:
% 0.38/0.54 ; 2 with value 22 1 with value 25 1 with value 29
% 0.38/0.54 ; 4 with value 23 2 with value 26 1 with value 30
% 0.38/0.54 ; 1 with value 24 5 with value 28 1 with value 31
% 0.38/0.54 ; The agenda of rows to give has 20 entries:
% 0.38/0.54 ; 1 with value (4 21) 3 with value (4 25) 1 with value (4 28)
% 0.38/0.54 ; 3 with value (4 22) 2 with value (4 26) 1 with value (4 30)
% 0.38/0.54 ; 1 with value (4 23) 6 with value (4 27) 1 with value (4 31)
% 0.38/0.54 ; 1 with value (4 24)
% 0.38/0.54 Evaluation took:
% 0.38/0.54 0.062 seconds of real time
% 0.38/0.54 0.050539 seconds of user run time
% 0.38/0.54 0.011652 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 5,302,440 bytes consed.
% 0.38/0.54 :PROOF-FOUND
% 0.38/0.54 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T00:11:57
% 0.38/0.54 :PROOF-FOUND
% 0.38/0.54 *
%------------------------------------------------------------------------------