TSTP Solution File: GRP111-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP111-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n010.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:12 EDT 2022
% Result : Unsatisfiable 0.51s 0.71s
% Output : Refutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of clauses : 42 ( 38 unt; 0 nHn; 7 RR)
% Number of literals : 51 ( 50 equ; 15 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 82 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(inverse(double_divide(inverse(double_divide(X,inverse(Y))),Z)),double_divide(X,Z)) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = inverse(double_divide(Y,X)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(4,plain,
( inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1)))
| inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2))))) != a2
| inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(inverse(double_divide(c3,b3)),a3))
| inverse(double_divide(b4,a4)) != inverse(double_divide(a4,b4)) ),
inference('REWRITE',[status(thm)],[prove_these_axioms,multiply,theory(equality)]) ).
cnf(5,plain,
double_divide(inverse(X),double_divide(inverse(double_divide(Y,inverse(X))),double_divide(Y,inverse(Z)))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(6,plain,
double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(X,inverse(Y))),Z)),inverse(U))),double_divide(X,Z))),Y) = U,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(8,plain,
double_divide(inverse(double_divide(inverse(double_divide(inverse(X),inverse(Y))),double_divide(inverse(double_divide(Z,inverse(X))),double_divide(Z,inverse(U))))),U) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(21,plain,
double_divide(inverse(double_divide(inverse(X),inverse(Y))),X) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,6,theory(equality)]),single_axiom,theory(equality)]) ).
cnf(38,plain,
double_divide(inverse(X),double_divide(inverse(Y),Y)) = X,
inference('PARAMODULATE',[status(thm)],[single_axiom,21,theory(equality)]) ).
cnf(39,plain,
double_divide(inverse(X),double_divide(inverse(inverse(Y)),inverse(X))) = Y,
inference('PARAMODULATE',[status(thm)],[21,21,theory(equality)]) ).
cnf(41,plain,
double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(inverse(X),inverse(Y))),inverse(Z))),X)),Y) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,21,theory(equality)]) ).
cnf(54,plain,
double_divide(inverse(double_divide(inverse(X),X)),inverse(Y)) = Y,
inference('PARAMODULATE',[status(thm)],[21,38,theory(equality)]) ).
cnf(55,plain,
double_divide(inverse(double_divide(X,inverse(Y))),double_divide(X,double_divide(inverse(Z),Z))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,38,theory(equality)]) ).
cnf(61,plain,
double_divide(inverse(X),Y) = double_divide(inverse(inverse(Y)),inverse(X)),
inference('PARAMODULATE',[status(thm)],[5,39,theory(equality)]) ).
cnf(74,plain,
double_divide(inverse(X),double_divide(inverse(X),Y)) = Y,
inference('REWRITE',[status(thm)],[39,61,theory(equality)]) ).
cnf(75,plain,
double_divide(inverse(X),X) = double_divide(inverse(Y),Y),
inference('PARAMODULATE',[status(thm)],[74,38,theory(equality)]) ).
cnf(76,plain,
double_divide(inverse(double_divide(inverse(X),inverse(Y))),Y) = X,
inference('PARAMODULATE',[status(thm)],[8,74,theory(equality)]) ).
cnf(90,plain,
double_divide(inverse(double_divide(inverse(double_divide(inverse(X),X)),Y)),double_divide(inverse(inverse(Z)),Y)) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,75,theory(equality)]) ).
cnf(93,plain,
double_divide(inverse(double_divide(inverse(X),X)),Y) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[74,54,theory(equality)]) ).
cnf(94,plain,
double_divide(inverse(inverse(X)),double_divide(inverse(inverse(Y)),X)) = Y,
inference('REWRITE',[status(thm)],[90,93,theory(equality)]) ).
cnf(97,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[54,93,theory(equality)]) ).
cnf(110,plain,
double_divide(X,double_divide(Y,X)) = Y,
inference('REWRITE',[status(thm)],[94,97,theory(equality)]) ).
cnf(112,plain,
double_divide(X,double_divide(X,Y)) = Y,
inference('PARAMODULATE',[status(thm)],[74,97,theory(equality)]) ).
cnf(113,plain,
double_divide(inverse(X),X) = double_divide(Y,inverse(Y)),
inference('PARAMODULATE',[status(thm)],[75,97,theory(equality)]) ).
cnf(115,plain,
double_divide(X,double_divide(inverse(Y),Y)) = inverse(X),
inference('PARAMODULATE',[status(thm)],[38,97,theory(equality)]) ).
cnf(117,plain,
double_divide(inverse(double_divide(X,inverse(Y))),inverse(X)) = Y,
inference('REWRITE',[status(thm)],[55,115,theory(equality)]) ).
cnf(123,plain,
double_divide(X,Y) = double_divide(Y,X),
inference('PARAMODULATE',[status(thm)],[112,110,theory(equality)]) ).
cnf(125,plain,
( inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1)))
| inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2))))) != a2
| inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(inverse(double_divide(c3,b3)),a3)) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[4,123,theory(equality)]),theory(equality)]) ).
cnf(129,plain,
double_divide(X,double_divide(Y,inverse(Y))) = inverse(X),
inference('PARAMODULATE',[status(thm)],[110,113,theory(equality)]) ).
cnf(131,plain,
double_divide(X,Y) = inverse(double_divide(inverse(Y),inverse(X))),
inference('PARAMODULATE',[status(thm)],[110,76,theory(equality)]) ).
cnf(147,plain,
double_divide(inverse(double_divide(inverse(double_divide(double_divide(X,Y),inverse(Z))),Y)),X) = Z,
inference('REWRITE',[status(thm)],[41,131,theory(equality)]) ).
cnf(161,plain,
double_divide(inverse(double_divide(X,Y)),inverse(X)) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[117,97,theory(equality)]) ).
cnf(162,plain,
double_divide(inverse(X),inverse(Y)) = inverse(double_divide(X,Y)),
inference('PARAMODULATE',[status(thm)],[110,161,theory(equality)]) ).
cnf(175,plain,
double_divide(X,inverse(Y)) = inverse(double_divide(inverse(X),Y)),
inference('PARAMODULATE',[status(thm)],[162,97,theory(equality)]) ).
cnf(178,plain,
double_divide(double_divide(double_divide(double_divide(X,Y),inverse(Z)),inverse(Y)),X) = Z,
inference('REWRITE',[status(thm)],[147,175,theory(equality)]) ).
cnf(180,plain,
( inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1)))
| double_divide(inverse(c3),double_divide(b3,a3)) != double_divide(double_divide(c3,b3),inverse(a3)) ),
inference('REWRITE',[status(thm)],[125,97,129,175,theory(equality)]) ).
cnf(181,plain,
double_divide(inverse(X),Y) = inverse(double_divide(X,inverse(Y))),
inference('PARAMODULATE',[status(thm)],[162,97,theory(equality)]) ).
cnf(203,plain,
double_divide(inverse(c3),double_divide(b3,a3)) != double_divide(double_divide(c3,b3),inverse(a3)),
inference('REWRITE',[status(thm)],[180,75,181,theory(equality)]) ).
cnf(230,plain,
double_divide(X,Y) = double_divide(double_divide(double_divide(X,Z),inverse(Y)),inverse(Z)),
inference('PARAMODULATE',[status(thm)],[110,178,theory(equality)]) ).
cnf(292,plain,
double_divide(inverse(c3),double_divide(b3,a3)) != double_divide(double_divide(b3,c3),inverse(a3)),
inference('PARAMODULATE',[status(thm)],[203,123,theory(equality)]) ).
cnf(296,plain,
double_divide(inverse(X),double_divide(Y,Z)) = double_divide(double_divide(Y,X),inverse(Z)),
inference('PARAMODULATE',[status(thm)],[110,230,theory(equality)]) ).
cnf(297,plain,
$false,
inference('REWRITE',[status(thm)],[292,296,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP111-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n010.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:38:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.46 #<PACKAGE "SNARK-USER">
% 0.19/0.46 *
% 0.19/0.46 SNARK-TPTP-OPTIONS
% 0.19/0.46 *
% 0.19/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46 (USE-FACTORING :POS)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46 *
% 0.19/0.46 "."
% 0.19/0.46 *
% 0.19/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T00:38:54
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n010.cluster.edu at 2022-06-14T00:38:54
% 0.51/0.71
% 0.51/0.71
% 0.51/0.71 #||
% 0.51/0.71 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.51/0.71 % SZS output start Refutation
% See solution above
% 0.51/0.73 ||#
% 0.51/0.73
% 0.51/0.73 ; Summary of computation:
% 0.51/0.73 ; 1336 formulas have been input or derived (from 41 formulas).
% 0.51/0.73 ; 297 (22%) were retained. Of these,
% 0.51/0.73 ; 186 (63%) were simplified or subsumed later,
% 0.51/0.73 ; 111 (37%) are still being kept.
% 0.51/0.73 ;
% 0.51/0.73 ; Run time in seconds excluding printing time:
% 0.51/0.73 ; 0.001 0% Read assertion file (1 call)
% 0.51/0.73 ; 0.000 0% Assert (3 calls)
% 0.51/0.73 ; 0.058 23% Process new row (1,209 calls)
% 0.51/0.73 ; 0.002 1% Resolution (80 calls)
% 0.51/0.73 ; 0.030 12% Paramodulation (40 calls)
% 0.51/0.73 ; 0.000 0% Condensing (3 calls)
% 0.51/0.73 ; 0.000 0% Forward subsumption (3 calls)
% 0.51/0.73 ; 0.000 0% Backward subsumption (3 calls)
% 0.51/0.73 ; 0.000 0% Clause clause subsumption (1 call)
% 0.51/0.73 ; 0.036 15% Forward simplification (892 calls)
% 0.51/0.73 ; 0.042 17% Backward simplification (296 calls)
% 0.51/0.73 ; 0.051 21% Ordering (5,921 calls)
% 0.51/0.73 ; 0.000 0% Sortal reasoning (32 calls)
% 0.51/0.73 ; 0.000 0% Purity testing (1 call)
% 0.51/0.73 ; 0.027 11% Other
% 0.51/0.73 ; 0.247 Total
% 0.51/0.73 ; 0.266 Real time
% 0.51/0.73 ;
% 0.51/0.73 ; Term-hash-array has 1,435 terms in all.
% 0.51/0.73 ; Feature-vector-row-index has 0 entries (1 at peak, 3 added, 3 deleted).
% 0.51/0.73 ; Feature-vector-row-index has 1 node (36 at peak, 88 added, 87 deleted).
% 0.51/0.73 ; Retrieved 0 possibly forward subsuming rows in 3 calls.
% 0.51/0.73 ; Retrieved 1 possibly backward subsumed row in 3 calls.
% 0.51/0.73 ; Path-index has 363 entries (522 at peak, 1,674 added, 1,311 deleted).
% 0.51/0.73 ; Path-index has 3,218 nodes (3,400 at peak, 4,952 added, 1,734 deleted).
% 0.51/0.73 ; Trie-index has 363 entries (522 at peak, 1,674 added, 1,311 deleted).
% 0.51/0.73 ; Trie-index has 1,492 nodes (3,234 at peak, 8,716 added, 7,224 deleted).
% 0.51/0.73 ; Retrieved 5,079 generalization terms in 6,051 calls.
% 0.51/0.73 ; Retrieved 2,685 instance terms in 385 calls.
% 0.51/0.73 ; Retrieved 5,599 unifiable terms in 338 calls.
% 0.51/0.73 ;
% 0.51/0.73 ; The agenda of backward simplifiable rows to process has 20 entries:
% 0.51/0.73 ; 20 with value 0
% 0.51/0.73 ; The agenda of rows to process has 53 entries:
% 0.51/0.73 ; 3 with value 23 5 with value 28 4 with value 31
% 0.51/0.73 ; 14 with value 24 2 with value 29 4 with value 32
% 0.51/0.73 ; 1 with value 25 7 with value 30 2 with value 33
% 0.51/0.73 ; 11 with value 27
% 0.51/0.73 ; The agenda of rows to give has 89 entries:
% 0.51/0.73 ; 5 with value (4 23) 14 with value (4 28) 2 with value (4 35)
% 0.51/0.73 ; 4 with value (4 24) 25 with value (4 29) 1 with value (4 36)
% 0.51/0.73 ; 6 with value (4 25) 1 with value (4 30) 1 with value (4 39)
% 0.51/0.73 ; 12 with value (4 26) 2 with value (4 31) 1 with value (4 42)
% 0.51/0.73 ; 13 with value (4 27) 2 with value (4 34)
% 0.51/0.73 Evaluation took:
% 0.51/0.73 0.267 seconds of real time
% 0.51/0.73 0.23348 seconds of user run time
% 0.51/0.73 0.033125 seconds of system run time
% 0.51/0.73 [Run times include 0.013 seconds GC run time.]
% 0.51/0.73 0 calls to %EVAL
% 0.51/0.73 0 page faults and
% 0.51/0.73 16,408,432 bytes consed.
% 0.51/0.73 :PROOF-FOUND
% 0.51/0.73 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T00:38:55
% 0.51/0.73 :PROOF-FOUND
% 0.51/0.73 *
%------------------------------------------------------------------------------