TSTP Solution File: GRP600-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP600-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n026.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.20s 0.58s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 3 RR)
% Number of literals : 21 ( 20 equ; 2 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 40 ( 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/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_4,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_4) ).
cnf(4,plain,
inverse(double_divide(b,a)) != inverse(double_divide(a,b)),
inference('REWRITE',[status(thm)],[prove_these_axioms_4,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(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(54,plain,
double_divide(inverse(X),inverse(double_divide(Y,inverse(Y)))) = X,
inference('PARAMODULATE',[status(thm)],[21,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(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(123,plain,
double_divide(X,Y) = double_divide(Y,X),
inference('PARAMODULATE',[status(thm)],[112,110,theory(equality)]) ).
cnf(125,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[4,123,theory(equality)]),theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP600-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n026.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 : Mon Jun 13 11:02:51 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-13T11:02:51
% 0.20/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n026.cluster.edu at 2022-06-13T11:02:51
% 0.20/0.58
% 0.20/0.58
% 0.20/0.58 #||
% 0.20/0.58 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.58 % SZS output start Refutation
% See solution above
% 0.20/0.58 ||#
% 0.20/0.58
% 0.20/0.58 ; Summary of computation:
% 0.20/0.58 ; 255 formulas have been input or derived (from 18 formulas).
% 0.20/0.58 ; 125 (49%) were retained. Of these,
% 0.20/0.58 ; 67 (54%) were simplified or subsumed later,
% 0.20/0.58 ; 58 (46%) are still being kept.
% 0.20/0.58 ;
% 0.20/0.58 ; Run time in seconds excluding printing time:
% 0.20/0.58 ; 0.001 1% Read assertion file (1 call)
% 0.20/0.58 ; 0.000 0% Assert (3 calls)
% 0.20/0.58 ; 0.023 26% Process new row (240 calls)
% 0.20/0.58 ; 0.001 1% Resolution (34 calls)
% 0.20/0.58 ; 0.007 8% Paramodulation (17 calls)
% 0.20/0.58 ; 0.012 13% Forward simplification (222 calls)
% 0.20/0.58 ; 0.018 20% Backward simplification (124 calls)
% 0.20/0.58 ; 0.001 1% Ordering (464 calls)
% 0.20/0.58 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.58 ; 0.000 0% Purity testing (1 call)
% 0.20/0.58 ; 0.027 30% Other
% 0.20/0.58 ; 0.090 Total
% 0.20/0.58 ; 0.093 Real time
% 0.20/0.59 ;
% 0.20/0.59 ; Term-hash-array has 880 terms in all.
% 0.20/0.59 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.20/0.59 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.20/0.59 ; Path-index has 408 entries (543 at peak, 914 added, 506 deleted).
% 0.20/0.59 ; Path-index has 1,921 nodes (2,209 at peak, 2,484 added, 563 deleted).
% 0.20/0.59 ; Trie-index has 408 entries (543 at peak, 914 added, 506 deleted).
% 0.20/0.59 ; Trie-index has 2,008 nodes (3,545 at peak, 5,204 added, 3,196 deleted).
% 0.20/0.59 ; Retrieved 654 generalization terms in 1,359 calls.
% 0.20/0.59 ; Retrieved 1,052 instance terms in 123 calls.
% 0.20/0.59 ; Retrieved 2,160 unifiable terms in 140 calls.
% 0.20/0.59 ;
% 0.20/0.59 ; The agenda of rows to process has 7 entries:
% 0.20/0.59 ; 7 with value 19
% 0.20/0.59 ; The agenda of rows to give has 50 entries:
% 0.20/0.59 ; 2 with value (4 16) 2 with value (4 30) 2 with value (4 42)
% 0.20/0.59 ; 1 with value (4 17) 1 with value (4 32) 1 with value (4 44)
% 0.20/0.59 ; 2 with value (4 18) 3 with value (4 33) 1 with value (4 45)
% 0.20/0.59 ; 2 with value (4 19) 1 with value (4 34) 2 with value (4 48)
% 0.20/0.59 ; 2 with value (4 20) 1 with value (4 35) 1 with value (4 49)
% 0.20/0.59 ; 3 with value (4 24) 3 with value (4 36) 1 with value (4 50)
% 0.20/0.59 ; 3 with value (4 25) 2 with value (4 37) 1 with value (4 51)
% 0.20/0.59 ; 3 with value (4 26) 2 with value (4 39) 1 with value (4 52)
% 0.20/0.59 ; 2 with value (4 27) 2 with value (4 40) 1 with value (4 56)
% 0.20/0.59 ; 1 with value (4 29) 1 with value (4 41)
% 0.20/0.59 Evaluation took:
% 0.20/0.59 0.093 seconds of real time
% 0.20/0.59 0.084066 seconds of user run time
% 0.20/0.59 0.008813 seconds of system run time
% 0.20/0.59 0 calls to %EVAL
% 0.20/0.59 0 page faults and
% 0.20/0.59 6,781,096 bytes consed.
% 0.20/0.59 :PROOF-FOUND
% 0.20/0.59 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T11:02:51
% 0.20/0.59 :PROOF-FOUND
% 0.20/0.59 *
%------------------------------------------------------------------------------