TSTP Solution File: GRP615-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP615-1 : TPTP v8.1.0. Released v2.6.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:40 EDT 2022
% Result : Unsatisfiable 0.49s 0.68s
% Output : Refutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of clauses : 41 ( 41 unt; 0 nHn; 6 RR)
% Number of literals : 41 ( 40 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 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 : 83 ( 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/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = inverse(double_divide(Y,X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(4,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,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(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(128,plain,
inverse(double_divide(inverse(double_divide(b3,a3)),c3)) != inverse(double_divide(inverse(double_divide(c3,b3)),a3)),
inference('PARAMODULATE',[status(thm)],[4,123,theory(equality)]) ).
cnf(134,plain,
double_divide(X,Y) = inverse(double_divide(inverse(Y),inverse(X))),
inference('PARAMODULATE',[status(thm)],[110,76,theory(equality)]) ).
cnf(150,plain,
double_divide(inverse(double_divide(inverse(double_divide(double_divide(X,Y),inverse(Z))),Y)),X) = Z,
inference('REWRITE',[status(thm)],[41,134,theory(equality)]) ).
cnf(164,plain,
double_divide(inverse(double_divide(X,Y)),inverse(X)) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[117,97,theory(equality)]) ).
cnf(165,plain,
double_divide(inverse(X),inverse(Y)) = inverse(double_divide(X,Y)),
inference('PARAMODULATE',[status(thm)],[110,164,theory(equality)]) ).
cnf(173,plain,
inverse(double_divide(X,Y)) = inverse(double_divide(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[123,165,theory(equality)]),165,theory(equality)]) ).
cnf(178,plain,
double_divide(X,inverse(Y)) = inverse(double_divide(inverse(X),Y)),
inference('PARAMODULATE',[status(thm)],[165,97,theory(equality)]) ).
cnf(182,plain,
double_divide(double_divide(double_divide(double_divide(X,Y),inverse(Z)),inverse(Y)),X) = Z,
inference('REWRITE',[status(thm)],[150,178,theory(equality)]) ).
cnf(186,plain,
double_divide(double_divide(b3,a3),inverse(c3)) != double_divide(double_divide(c3,b3),inverse(a3)),
inference('REWRITE',[status(thm)],[128,178,theory(equality)]) ).
cnf(220,plain,
double_divide(inverse(X),Y) = inverse(double_divide(inverse(Y),X)),
inference('PARAMODULATE',[status(thm)],[123,178,theory(equality)]) ).
cnf(236,plain,
double_divide(X,Y) = double_divide(double_divide(double_divide(X,Z),inverse(Y)),inverse(Z)),
inference('PARAMODULATE',[status(thm)],[110,182,theory(equality)]) ).
cnf(252,plain,
double_divide(inverse(double_divide(X,Y)),Z) = inverse(double_divide(inverse(Z),double_divide(Y,X))),
inference('PARAMODULATE',[status(thm)],[220,173,theory(equality)]) ).
cnf(304,plain,
double_divide(double_divide(b3,a3),inverse(c3)) != double_divide(inverse(a3),double_divide(b3,c3)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[186,178,theory(equality)]),97,252,theory(equality)]) ).
cnf(306,plain,
double_divide(inverse(X),double_divide(Y,Z)) = double_divide(double_divide(Y,X),inverse(Z)),
inference('PARAMODULATE',[status(thm)],[110,236,theory(equality)]) ).
cnf(307,plain,
$false,
inference('REWRITE',[status(thm)],[304,306,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP615-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/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 12:30:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 *
% 0.20/0.46 *
% 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-13T12:30:08
% 0.20/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-13T12:30:08
% 0.49/0.67
% 0.49/0.67
% 0.49/0.67 #||
% 0.49/0.68 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.49/0.68 % SZS output start Refutation
% See solution above
% 0.49/0.68 ||#
% 0.49/0.68
% 0.49/0.68 ; Summary of computation:
% 0.49/0.68 ; 1383 formulas have been input or derived (from 45 formulas).
% 0.49/0.68 ; 307 (22%) were retained. Of these,
% 0.49/0.68 ; 196 (64%) were simplified or subsumed later,
% 0.49/0.68 ; 111 (36%) are still being kept.
% 0.49/0.68 ;
% 0.49/0.68 ; Run time in seconds excluding printing time:
% 0.49/0.68 ; 0.001 0% Read assertion file (1 call)
% 0.49/0.68 ; 0.000 0% Assert (3 calls)
% 0.49/0.68 ; 0.046 23% Process new row (1,232 calls)
% 0.49/0.68 ; 0.003 2% Resolution (88 calls)
% 0.49/0.68 ; 0.021 10% Paramodulation (44 calls)
% 0.49/0.68 ; 0.033 16% Forward simplification (934 calls)
% 0.49/0.68 ; 0.034 17% Backward simplification (306 calls)
% 0.49/0.68 ; 0.033 16% Ordering (6,331 calls)
% 0.49/0.68 ; 0.000 0% Sortal reasoning (32 calls)
% 0.49/0.68 ; 0.000 0% Purity testing (1 call)
% 0.49/0.68 ; 0.029 14% Other
% 0.49/0.68 ; 0.200 Total
% 0.49/0.68 ; 0.213 Real time
% 0.49/0.68 ;
% 0.49/0.68 ; Term-hash-array has 1,439 terms in all.
% 0.49/0.68 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.49/0.68 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.49/0.68 ; Path-index has 359 entries (516 at peak, 1,622 added, 1,263 deleted).
% 0.49/0.68 ; Path-index has 3,213 nodes (3,395 at peak, 4,829 added, 1,616 deleted).
% 0.49/0.68 ; Trie-index has 359 entries (516 at peak, 1,622 added, 1,263 deleted).
% 0.49/0.68 ; Trie-index has 1,488 nodes (3,166 at peak, 8,590 added, 7,102 deleted).
% 0.49/0.68 ; Retrieved 5,521 generalization terms in 6,490 calls.
% 0.49/0.68 ; Retrieved 2,722 instance terms in 398 calls.
% 0.49/0.68 ; Retrieved 6,226 unifiable terms in 365 calls.
% 0.49/0.68 ;
% 0.49/0.68 ; The agenda of backward simplifiable rows to process has 27 entries:
% 0.49/0.68 ; 27 with value 0
% 0.49/0.68 ; The agenda of rows to process has 53 entries:
% 0.49/0.68 ; 3 with value 23 5 with value 28 4 with value 31
% 0.49/0.68 ; 14 with value 24 2 with value 29 4 with value 32
% 0.49/0.68 ; 1 with value 25 7 with value 30 2 with value 33
% 0.49/0.68 ; 11 with value 27
% 0.49/0.68 ; The agenda of rows to give has 89 entries:
% 0.49/0.68 ; 5 with value (4 23) 14 with value (4 28) 2 with value (4 35)
% 0.49/0.68 ; 4 with value (4 24) 25 with value (4 29) 1 with value (4 36)
% 0.49/0.68 ; 6 with value (4 25) 1 with value (4 30) 1 with value (4 39)
% 0.49/0.68 ; 12 with value (4 26) 2 with value (4 31) 1 with value (4 42)
% 0.49/0.68 ; 13 with value (4 27) 2 with value (4 34)
% 0.49/0.68 Evaluation took:
% 0.49/0.68 0.213 seconds of real time
% 0.49/0.69 0.181794 seconds of user run time
% 0.49/0.69 0.030995 seconds of system run time
% 0.49/0.69 [Run times include 0.009 seconds GC run time.]
% 0.49/0.69 0 calls to %EVAL
% 0.49/0.69 0 page faults and
% 0.49/0.69 16,113,800 bytes consed.
% 0.49/0.69 :PROOF-FOUND
% 0.49/0.69 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T12:30:08
% 0.49/0.69 :PROOF-FOUND
% 0.49/0.69 *
%------------------------------------------------------------------------------