TSTP Solution File: GRP553-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP553-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n023.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:23 EDT 2022
% Result : Unsatisfiable 0.41s 0.59s
% Output : Refutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 4 RR)
% Number of literals : 23 ( 22 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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 : 54 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(X,inverse(divide(Y,divide(X,Z)))),Z) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = divide(X,inverse(Y)),
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,
divide(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1)),
inference('REWRITE',[status(thm)],[prove_these_axioms_1,multiply,theory(equality)]) ).
cnf(5,plain,
divide(divide(X,inverse(Y)),Z) = divide(U,inverse(divide(Y,divide(U,divide(X,Z))))),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(7,plain,
divide(divide(divide(X,inverse(Y)),Z),divide(X,Z)) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(8,plain,
divide(X,inverse(divide(divide(Y,divide(Z,U)),divide(X,divide(Z,U))))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(21,plain,
divide(X,divide(divide(Y,inverse(X)),divide(Y,inverse(Z)))) = Z,
inference('PARAMODULATE',[status(thm)],[7,7,theory(equality)]) ).
cnf(33,plain,
divide(divide(X,divide(Y,divide(Y,inverse(Z)))),X) = Z,
inference('PARAMODULATE',[status(thm)],[21,single_axiom,theory(equality)]) ).
cnf(35,plain,
divide(divide(divide(X,inverse(Y)),inverse(Z)),divide(X,inverse(U))) = divide(Y,inverse(divide(Z,U))),
inference('PARAMODULATE',[status(thm)],[5,21,theory(equality)]) ).
cnf(46,plain,
divide(divide(X,inverse(Y)),Z) = divide(divide(X,Z),divide(U,divide(U,inverse(Y)))),
inference('PARAMODULATE',[status(thm)],[single_axiom,33,theory(equality)]) ).
cnf(61,plain,
divide(X,inverse(divide(divide(Y,Z),divide(X,Z)))) = Y,
inference('PARAMODULATE',[status(thm)],[8,8,theory(equality)]) ).
cnf(63,plain,
divide(X,inverse(Y)) = divide(X,divide(Z,divide(Z,inverse(Y)))),
inference('PARAMODULATE',[status(thm)],[61,33,theory(equality)]) ).
cnf(72,plain,
divide(divide(X,inverse(Y)),Z) = divide(divide(X,Z),inverse(Y)),
inference('REWRITE',[status(thm)],[46,63,theory(equality)]) ).
cnf(75,plain,
divide(divide(X,Y),inverse(divide(Z,divide(X,Y)))) = Z,
inference('REWRITE',[status(thm)],[single_axiom,72,theory(equality)]) ).
cnf(92,plain,
divide(X,inverse(divide(Y,Y))) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[61,21,theory(equality)]),35,5,theory(equality)]) ).
cnf(99,plain,
divide(X,inverse(divide(Y,X))) = Y,
inference('PARAMODULATE',[status(thm)],[75,75,theory(equality)]) ).
cnf(100,plain,
divide(inverse(divide(X,Y)),inverse(X)) = Y,
inference('PARAMODULATE',[status(thm)],[99,99,theory(equality)]) ).
cnf(114,plain,
divide(inverse(X),inverse(Y)) = inverse(divide(X,Y)),
inference('PARAMODULATE',[status(thm)],[99,100,theory(equality)]) ).
cnf(116,plain,
inverse(divide(divide(X,Y),X)) = Y,
inference('REWRITE',[status(thm)],[100,114,theory(equality)]) ).
cnf(117,plain,
inverse(divide(a1,a1)) != inverse(divide(b1,b1)),
inference('REWRITE',[status(thm)],[4,114,theory(equality)]) ).
cnf(127,plain,
inverse(divide(X,X)) = inverse(divide(Y,Y)),
inference('PARAMODULATE',[status(thm)],[116,92,theory(equality)]) ).
cnf(128,plain,
$false,
inference('REWRITE',[status(thm)],[117,127,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP553-1 : TPTP v8.1.0. Released v2.6.0.
% 0.08/0.14 % Command : run-snark %s %d
% 0.14/0.36 % Computer : n023.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 13 23:27:21 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.49 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.50 *
% 0.21/0.50 *
% 0.21/0.50 #<PACKAGE "SNARK-USER">
% 0.21/0.50 *
% 0.21/0.50 SNARK-TPTP-OPTIONS
% 0.21/0.50 *
% 0.21/0.50 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.50 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.50 (USE-FACTORING :POS)
% 0.21/0.50 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.50 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.50 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.50 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.50 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.50 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.50 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.50 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.50 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.50 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.50 *
% 0.21/0.50 "."
% 0.21/0.50 *
% 0.21/0.50 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T23:27:21
% 0.21/0.50 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n023.cluster.edu at 2022-06-13T23:27:21
% 0.41/0.59
% 0.41/0.59
% 0.41/0.59 #||
% 0.41/0.59 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.59 % SZS output start Refutation
% See solution above
% 0.41/0.59 ||#
% 0.41/0.59
% 0.41/0.59 ; Summary of computation:
% 0.41/0.59 ; 279 formulas have been input or derived (from 17 formulas).
% 0.41/0.59 ; 128 (46%) were retained. Of these,
% 0.41/0.59 ; 53 (41%) were simplified or subsumed later,
% 0.41/0.59 ; 75 (59%) are still being kept.
% 0.41/0.59 ;
% 0.41/0.59 ; Run time in seconds excluding printing time:
% 0.41/0.59 ; 0.001 1% Read assertion file (1 call)
% 0.41/0.59 ; 0.001 1% Assert (3 calls)
% 0.41/0.59 ; 0.018 21% Process new row (266 calls)
% 0.41/0.59 ; 0.002 2% Resolution (32 calls)
% 0.41/0.59 ; 0.010 12% Paramodulation (16 calls)
% 0.41/0.59 ; 0.010 12% Forward simplification (200 calls)
% 0.41/0.59 ; 0.013 15% Backward simplification (127 calls)
% 0.41/0.59 ; 0.004 5% Ordering (808 calls)
% 0.41/0.59 ; 0.000 0% Sortal reasoning (32 calls)
% 0.41/0.59 ; 0.000 0% Purity testing (1 call)
% 0.41/0.59 ; 0.025 30% Other
% 0.41/0.59 ; 0.084 Total
% 0.41/0.59 ; 0.087 Real time
% 0.41/0.59 ;
% 0.41/0.59 ; Term-hash-array has 616 terms in all.
% 0.41/0.59 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.41/0.59 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.41/0.59 ; Path-index has 388 entries (426 at peak, 628 added, 240 deleted).
% 0.41/0.59 ; Path-index has 1,232 nodes (1,251 at peak, 1,448 added, 216 deleted).
% 0.41/0.59 ; Trie-index has 388 entries (426 at peak, 628 added, 240 deleted).
% 0.41/0.59 ; Trie-index has 1,562 nodes (1,807 at peak, 2,586 added, 1,024 deleted).
% 0.41/0.59 ; Retrieved 438 generalization terms in 1,196 calls.
% 0.41/0.59 ; Retrieved 818 instance terms in 144 calls.
% 0.41/0.59 ; Retrieved 1,566 unifiable terms in 121 calls.
% 0.41/0.59 ;
% 0.41/0.59 ; The agenda of rows to process has 8 entries:
% 0.41/0.59 ; 1 with value 18 1 with value 27 1 with value 31
% 0.41/0.59 ; 2 with value 19 1 with value 28 1 with value 33
% 0.41/0.59 ; 1 with value 23
% 0.41/0.59 ; The agenda of rows to give has 68 entries:
% 0.41/0.59 ; 1 with value (4 14) 4 with value (4 25) 5 with value (4 32)
% 0.41/0.59 ; 1 with value (4 16) 3 with value (4 26) 2 with value (4 33)
% 0.41/0.59 ; 2 with value (4 17) 6 with value (4 27) 1 with value (4 34)
% 0.41/0.59 ; 2 with value (4 19) 5 with value (4 28) 4 with value (4 35)
% 0.41/0.59 ; 2 with value (4 21) 3 with value (4 29) 1 with value (4 36)
% 0.41/0.59 ; 2 with value (4 22) 2 with value (4 30) 3 with value (4 37)
% 0.41/0.59 ; 4 with value (4 23) 6 with value (4 31) 3 with value (4 39)
% 0.41/0.59 ; 6 with value (4 24)
% 0.41/0.59 Evaluation took:
% 0.41/0.59 0.088 seconds of real time
% 0.41/0.59 0.079661 seconds of user run time
% 0.41/0.59 0.007973 seconds of system run time
% 0.41/0.59 0 calls to %EVAL
% 0.41/0.59 0 page faults and
% 0.41/0.59 6,003,136 bytes consed.
% 0.41/0.59 :PROOF-FOUND
% 0.41/0.59 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T23:27:21
% 0.41/0.59 :PROOF-FOUND
% 0.41/0.59 *
%------------------------------------------------------------------------------