TSTP Solution File: GRP613-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP613-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n022.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.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 4 RR)
% Number of literals : 29 ( 28 equ; 3 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 : 56 ( 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_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(4,plain,
inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1))),
inference('REWRITE',[status(thm)],[prove_these_axioms_1,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(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(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(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(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(129,plain,
double_divide(X,inverse(X)) = double_divide(Y,inverse(Y)),
inference('PARAMODULATE',[status(thm)],[113,113,theory(equality)]) ).
cnf(132,plain,
inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(inverse(X),X)),
inference('PARAMODULATE',[status(thm)],[4,113,theory(equality)]) ).
cnf(165,plain,
double_divide(inverse(double_divide(X,Y)),inverse(X)) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[117,97,theory(equality)]) ).
cnf(166,plain,
double_divide(inverse(X),inverse(Y)) = inverse(double_divide(X,Y)),
inference('PARAMODULATE',[status(thm)],[110,165,theory(equality)]) ).
cnf(175,plain,
double_divide(X,inverse(X)) = inverse(double_divide(Y,inverse(Y))),
inference('PARAMODULATE',[status(thm)],[129,166,theory(equality)]) ).
cnf(179,plain,
double_divide(X,inverse(Y)) = inverse(double_divide(inverse(X),Y)),
inference('PARAMODULATE',[status(thm)],[166,97,theory(equality)]) ).
cnf(184,plain,
$false,
inference('REWRITE',[status(thm)],[132,175,179,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP613-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n022.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 : Mon Jun 13 09:01:33 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.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T09:01:33
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n022.cluster.edu at 2022-06-13T09:01:33
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55 #||
% 0.20/0.55 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.55 % SZS output start Refutation
% See solution above
% 0.20/0.55 ||#
% 0.20/0.55
% 0.20/0.55 ; Summary of computation:
% 0.20/0.55 ; 499 formulas have been input or derived (from 28 formulas).
% 0.20/0.55 ; 184 (37%) were retained. Of these,
% 0.20/0.55 ; 122 (66%) were simplified or subsumed later,
% 0.20/0.55 ; 62 (34%) are still being kept.
% 0.20/0.55 ;
% 0.20/0.55 ; Run time in seconds excluding printing time:
% 0.20/0.55 ; 0.000 0% Read assertion file (1 call)
% 0.20/0.55 ; 0.001 1% Assert (3 calls)
% 0.20/0.55 ; 0.024 33% Process new row (474 calls)
% 0.20/0.55 ; 0.001 1% Resolution (54 calls)
% 0.20/0.55 ; 0.009 12% Paramodulation (27 calls)
% 0.20/0.55 ; 0.013 18% Forward simplification (401 calls)
% 0.20/0.55 ; 0.010 14% Backward simplification (183 calls)
% 0.20/0.55 ; 0.001 1% Ordering (864 calls)
% 0.20/0.55 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.55 ; 0.000 0% Purity testing (1 call)
% 0.20/0.55 ; 0.014 19% Other
% 0.20/0.55 ; 0.073 Total
% 0.20/0.55 ; 0.076 Real time
% 0.20/0.55 ;
% 0.20/0.55 ; Term-hash-array has 1,098 terms in all.
% 0.20/0.55 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.20/0.55 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.20/0.55 ; Path-index has 336 entries (495 at peak, 1,181 added, 845 deleted).
% 0.20/0.55 ; Path-index has 2,921 nodes (2,921 at peak, 3,944 added, 1,023 deleted).
% 0.20/0.55 ; Trie-index has 336 entries (495 at peak, 1,181 added, 845 deleted).
% 0.20/0.55 ; Trie-index has 1,704 nodes (3,153 at peak, 6,571 added, 4,867 deleted).
% 0.20/0.55 ; Retrieved 1,375 generalization terms in 2,496 calls.
% 0.20/0.55 ; Retrieved 1,189 instance terms in 184 calls.
% 0.20/0.55 ; Retrieved 3,507 unifiable terms in 207 calls.
% 0.20/0.55 ;
% 0.20/0.55 ; The agenda of backward simplifiable rows to process has 2 entries:
% 0.20/0.55 ; 2 with value 0
% 0.20/0.55 ; The agenda of rows to process has 3 entries:
% 0.20/0.55 ; 1 with value 21 2 with value 22
% 0.20/0.55 ; The agenda of rows to give has 48 entries:
% 0.20/0.55 ; 1 with value (4 19) 1 with value (4 27) 2 with value (4 35)
% 0.20/0.55 ; 3 with value (4 20) 3 with value (4 28) 2 with value (4 36)
% 0.20/0.55 ; 4 with value (4 21) 6 with value (4 30) 1 with value (4 37)
% 0.20/0.55 ; 2 with value (4 22) 1 with value (4 31) 2 with value (4 39)
% 0.20/0.55 ; 2 with value (4 23) 1 with value (4 32) 1 with value (4 40)
% 0.20/0.55 ; 3 with value (4 24) 1 with value (4 33) 2 with value (4 41)
% 0.20/0.55 ; 4 with value (4 25) 3 with value (4 34) 1 with value (4 43)
% 0.20/0.55 ; 2 with value (4 26)
% 0.20/0.55 Evaluation took:
% 0.20/0.55 0.076 seconds of real time
% 0.20/0.55 0.071415 seconds of user run time
% 0.20/0.55 0.004131 seconds of system run time
% 0.20/0.55 0 calls to %EVAL
% 0.20/0.55 0 page faults and
% 0.20/0.55 9,434,744 bytes consed.
% 0.20/0.55 :PROOF-FOUND
% 0.20/0.55 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T09:01:33
% 0.20/0.55 :PROOF-FOUND
% 0.20/0.55 *
%------------------------------------------------------------------------------