TSTP Solution File: GRP599-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP599-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n007.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:36 EDT 2022
% Result : Unsatisfiable 0.47s 0.65s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of clauses : 39 ( 39 unt; 0 nHn; 6 RR)
% Number of literals : 39 ( 38 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 : 78 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(double_divide(X,Y),inverse(double_divide(X,inverse(double_divide(inverse(Z),Y))))) = Z,
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(double_divide(double_divide(inverse(X),Y),inverse(double_divide(inverse(Z),Y))),inverse(Z)) = X,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(6,plain,
double_divide(X,inverse(double_divide(double_divide(Y,Z),inverse(double_divide(inverse(U),inverse(double_divide(Y,inverse(double_divide(inverse(X),Z))))))))) = U,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(8,plain,
double_divide(X,inverse(double_divide(double_divide(double_divide(inverse(X),Y),inverse(double_divide(inverse(Z),Y))),inverse(double_divide(inverse(U),inverse(Z)))))) = U,
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(21,plain,
double_divide(X,inverse(double_divide(inverse(Y),inverse(X)))) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,6,theory(equality)]),single_axiom,theory(equality)]) ).
cnf(38,plain,
double_divide(double_divide(X,inverse(X)),inverse(Y)) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,21,theory(equality)]) ).
cnf(39,plain,
double_divide(double_divide(inverse(X),inverse(inverse(Y))),inverse(X)) = Y,
inference('PARAMODULATE',[status(thm)],[21,21,theory(equality)]) ).
cnf(41,plain,
double_divide(X,inverse(double_divide(Y,inverse(double_divide(inverse(Z),inverse(double_divide(inverse(X),inverse(Y)))))))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,21,theory(equality)]) ).
cnf(54,plain,
double_divide(inverse(X),inverse(double_divide(Y,inverse(Y)))) = X,
inference('PARAMODULATE',[status(thm)],[21,38,theory(equality)]) ).
cnf(55,plain,
double_divide(double_divide(double_divide(X,inverse(X)),Y),inverse(double_divide(inverse(Z),Y))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,38,theory(equality)]) ).
cnf(61,plain,
double_divide(X,inverse(Y)) = double_divide(inverse(Y),inverse(inverse(X))),
inference('PARAMODULATE',[status(thm)],[5,39,theory(equality)]) ).
cnf(74,plain,
double_divide(double_divide(X,inverse(Y)),inverse(Y)) = X,
inference('REWRITE',[status(thm)],[39,61,theory(equality)]) ).
cnf(75,plain,
double_divide(X,inverse(X)) = double_divide(Y,inverse(Y)),
inference('PARAMODULATE',[status(thm)],[74,38,theory(equality)]) ).
cnf(76,plain,
double_divide(X,inverse(double_divide(inverse(X),inverse(Y)))) = Y,
inference('PARAMODULATE',[status(thm)],[8,74,theory(equality)]) ).
cnf(90,plain,
double_divide(double_divide(X,inverse(inverse(Y))),inverse(double_divide(X,inverse(double_divide(Z,inverse(Z)))))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,75,theory(equality)]) ).
cnf(93,plain,
double_divide(X,inverse(double_divide(Y,inverse(Y)))) = inverse(X),
inference('PARAMODULATE',[status(thm)],[74,54,theory(equality)]) ).
cnf(95,plain,
double_divide(double_divide(X,inverse(inverse(Y))),inverse(inverse(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(double_divide(X,Y),X) = Y,
inference('REWRITE',[status(thm)],[95,97,theory(equality)]) ).
cnf(112,plain,
double_divide(double_divide(X,Y),Y) = X,
inference('PARAMODULATE',[status(thm)],[74,97,theory(equality)]) ).
cnf(115,plain,
double_divide(double_divide(X,inverse(X)),Y) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[38,97,theory(equality)]) ).
cnf(117,plain,
double_divide(inverse(X),inverse(double_divide(inverse(Y),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(124,plain,
double_divide(X,double_divide(X,Y)) = Y,
inference('PARAMODULATE',[status(thm)],[110,112,theory(equality)]) ).
cnf(127,plain,
inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(a3,inverse(double_divide(c3,b3)))),
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(160,plain,
double_divide(X,inverse(double_divide(Y,inverse(double_divide(inverse(Z),double_divide(Y,X)))))) = Z,
inference('REWRITE',[status(thm)],[41,134,theory(equality)]) ).
cnf(164,plain,
double_divide(inverse(X),inverse(double_divide(Y,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(178,plain,
double_divide(X,inverse(Y)) = inverse(double_divide(inverse(X),Y)),
inference('PARAMODULATE',[status(thm)],[165,97,theory(equality)]) ).
cnf(195,plain,
double_divide(X,double_divide(inverse(Y),double_divide(inverse(Z),double_divide(Y,X)))) = Z,
inference('REWRITE',[status(thm)],[160,97,165,178,theory(equality)]) ).
cnf(202,plain,
double_divide(inverse(c3),double_divide(b3,a3)) != double_divide(inverse(a3),double_divide(c3,b3)),
inference('REWRITE',[status(thm)],[127,97,178,theory(equality)]) ).
cnf(236,plain,
double_divide(X,Y) = double_divide(inverse(Z),double_divide(inverse(X),double_divide(Z,Y))),
inference('PARAMODULATE',[status(thm)],[110,195,theory(equality)]) ).
cnf(295,plain,
double_divide(inverse(c3),double_divide(a3,b3)) != double_divide(inverse(a3),double_divide(c3,b3)),
inference('PARAMODULATE',[status(thm)],[202,123,theory(equality)]) ).
cnf(305,plain,
double_divide(inverse(X),double_divide(Y,Z)) = double_divide(inverse(Y),double_divide(X,Z)),
inference('PARAMODULATE',[status(thm)],[124,236,theory(equality)]) ).
cnf(306,plain,
$false,
inference('REWRITE',[status(thm)],[295,305,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP599-1 : TPTP v8.1.0. Released v2.6.0.
% 0.10/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 08:00:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 *
% 0.18/0.45 *
% 0.18/0.45 #<PACKAGE "SNARK-USER">
% 0.18/0.45 *
% 0.18/0.45 SNARK-TPTP-OPTIONS
% 0.18/0.45 *
% 0.18/0.45 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.45 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.45 (USE-FACTORING :POS)
% 0.18/0.45 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.45 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.45 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.45 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.45 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.45 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.45 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.45 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.45 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.45 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.45 *
% 0.18/0.45 "."
% 0.18/0.45 *
% 0.18/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T08:00:54
% 0.18/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n007.cluster.edu at 2022-06-13T08:00:54
% 0.47/0.65
% 0.47/0.65
% 0.47/0.65 #||
% 0.47/0.65 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.65 % SZS output start Refutation
% See solution above
% 0.47/0.67 ||#
% 0.47/0.67
% 0.47/0.67 ; Summary of computation:
% 0.47/0.67 ; 1370 formulas have been input or derived (from 45 formulas).
% 0.47/0.67 ; 306 (22%) were retained. Of these,
% 0.47/0.67 ; 185 (60%) were simplified or subsumed later,
% 0.47/0.67 ; 121 (40%) are still being kept.
% 0.47/0.67 ;
% 0.47/0.67 ; Run time in seconds excluding printing time:
% 0.47/0.67 ; 0.001 0% Read assertion file (1 call)
% 0.47/0.67 ; 0.000 0% Assert (3 calls)
% 0.47/0.67 ; 0.045 22% Process new row (1,225 calls)
% 0.47/0.67 ; 0.002 1% Resolution (88 calls)
% 0.47/0.67 ; 0.024 12% Paramodulation (44 calls)
% 0.47/0.67 ; 0.032 16% Forward simplification (934 calls)
% 0.47/0.67 ; 0.030 15% Backward simplification (305 calls)
% 0.47/0.67 ; 0.038 19% Ordering (6,214 calls)
% 0.47/0.67 ; 0.000 0% Sortal reasoning (32 calls)
% 0.47/0.67 ; 0.000 0% Purity testing (1 call)
% 0.47/0.67 ; 0.028 14% Other
% 0.47/0.67 ; 0.200 Total
% 0.47/0.67 ; 0.212 Real time
% 0.47/0.67 ;
% 0.47/0.67 ; Term-hash-array has 1,469 terms in all.
% 0.47/0.67 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.47/0.67 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.47/0.67 ; Path-index has 395 entries (548 at peak, 1,653 added, 1,258 deleted).
% 0.47/0.67 ; Path-index has 3,274 nodes (3,392 at peak, 4,817 added, 1,543 deleted).
% 0.47/0.67 ; Trie-index has 395 entries (548 at peak, 1,653 added, 1,258 deleted).
% 0.47/0.67 ; Trie-index has 1,658 nodes (3,566 at peak, 8,949 added, 7,291 deleted).
% 0.47/0.67 ; Retrieved 5,841 generalization terms in 6,511 calls.
% 0.47/0.67 ; Retrieved 2,700 instance terms in 396 calls.
% 0.47/0.67 ; Retrieved 6,337 unifiable terms in 365 calls.
% 0.47/0.67 ;
% 0.47/0.67 ; The agenda of backward simplifiable rows to process has 17 entries:
% 0.47/0.67 ; 17 with value 0
% 0.47/0.67 ; The agenda of rows to process has 54 entries:
% 0.47/0.67 ; 3 with value 23 5 with value 28 4 with value 31
% 0.47/0.67 ; 15 with value 24 2 with value 29 4 with value 32
% 0.47/0.67 ; 1 with value 25 7 with value 30 2 with value 33
% 0.47/0.67 ; 11 with value 27
% 0.47/0.67 ; The agenda of rows to give has 95 entries:
% 0.47/0.67 ; 5 with value (4 23) 15 with value (4 28) 2 with value (4 35)
% 0.47/0.67 ; 8 with value (4 24) 25 with value (4 29) 1 with value (4 36)
% 0.47/0.67 ; 6 with value (4 25) 1 with value (4 30) 2 with value (4 39)
% 0.47/0.67 ; 12 with value (4 26) 2 with value (4 31) 1 with value (4 42)
% 0.47/0.67 ; 13 with value (4 27) 2 with value (4 34)
% 0.47/0.67 Evaluation took:
% 0.47/0.67 0.212 seconds of real time
% 0.47/0.67 0.180664 seconds of user run time
% 0.47/0.67 0.03091 seconds of system run time
% 0.47/0.67 [Run times include 0.008 seconds GC run time.]
% 0.47/0.67 0 calls to %EVAL
% 0.47/0.67 0 page faults and
% 0.47/0.67 15,739,904 bytes consed.
% 0.47/0.67 :PROOF-FOUND
% 0.47/0.67 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T08:00:54
% 0.47/0.67 :PROOF-FOUND
% 0.47/0.67 *
%------------------------------------------------------------------------------