TSTP Solution File: GRP517-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP517-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n028.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:14 EDT 2022
% Result : Unsatisfiable 0.39s 0.59s
% Output : Refutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 2 RR)
% Number of literals : 19 ( 18 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X,multiply(multiply(inverse(multiply(X,Y)),Z),Y)) = Z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(3,plain,
multiply(X,multiply(multiply(inverse(Y),Z),multiply(multiply(inverse(multiply(X,U)),Y),U))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(4,plain,
multiply(X,multiply(Y,Z)) = multiply(multiply(inverse(multiply(inverse(multiply(X,Z)),U)),Y),U),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(5,plain,
multiply(multiply(inverse(X),Y),X) = Y,
inference('PARAMODULATE',[status(thm)],[3,single_axiom,theory(equality)]) ).
cnf(6,plain,
multiply(X,multiply(Y,multiply(multiply(inverse(multiply(X,Z)),U),Z))) = multiply(multiply(inverse(multiply(inverse(U),V)),Y),V),
inference('PARAMODULATE',[status(thm)],[3,single_axiom,theory(equality)]) ).
cnf(9,plain,
multiply(X,multiply(Y,multiply(multiply(inverse(multiply(X,Z)),U),Z))) = multiply(multiply(inverse(V),Y),multiply(multiply(inverse(multiply(inverse(U),W)),V),W)),
inference('PARAMODULATE',[status(thm)],[3,3,theory(equality)]) ).
cnf(13,plain,
multiply(X,Y) = multiply(multiply(inverse(multiply(inverse(Y),Z)),X),Z),
inference('PARAMODULATE',[status(thm)],[5,single_axiom,theory(equality)]) ).
cnf(14,plain,
multiply(X,multiply(Y,Z)) = multiply(Y,multiply(X,Z)),
inference('REWRITE',[status(thm)],[4,13,theory(equality)]) ).
cnf(16,plain,
multiply(X,multiply(Y,multiply(multiply(inverse(multiply(X,Z)),U),Z))) = multiply(multiply(inverse(V),Y),multiply(V,U)),
inference('REWRITE',[status(thm)],[9,13,theory(equality)]) ).
cnf(17,plain,
multiply(X,multiply(Y,multiply(multiply(inverse(multiply(X,Z)),U),Z))) = multiply(Y,U),
inference('REWRITE',[status(thm)],[6,13,theory(equality)]) ).
cnf(18,plain,
multiply(X,Y) = multiply(multiply(inverse(Z),X),multiply(Z,Y)),
inference('REWRITE',[status(thm)],[16,17,theory(equality)]) ).
cnf(19,plain,
multiply(X,Y) = multiply(multiply(inverse(Z),Y),multiply(X,Z)),
inference('PARAMODULATE',[status(thm)],[14,5,theory(equality)]) ).
cnf(26,plain,
multiply(X,Y) = multiply(Y,X),
inference('PARAMODULATE',[status(thm)],[18,19,theory(equality)]) ).
cnf(37,plain,
multiply(inverse(X),multiply(X,Y)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[5,26,theory(equality)]),14,theory(equality)]) ).
cnf(52,plain,
multiply(inverse(X),multiply(Y,X)) = Y,
inference('PARAMODULATE',[status(thm)],[37,26,theory(equality)]) ).
cnf(66,plain,
X = multiply(X,multiply(inverse(Y),Y)),
inference('PARAMODULATE',[status(thm)],[14,52,theory(equality)]) ).
cnf(131,plain,
multiply(inverse(X),X) = multiply(inverse(Y),Y),
inference('PARAMODULATE',[status(thm)],[37,66,theory(equality)]) ).
cnf(132,plain,
$false,
inference('REWRITE',[status(thm)],[prove_these_axioms_1,131,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP517-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.14/0.33 % Computer : n028.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Mon Jun 13 21:30:23 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 *
% 0.20/0.46 *
% 0.20/0.46 #<PACKAGE "SNARK-USER">
% 0.20/0.46 *
% 0.20/0.46 SNARK-TPTP-OPTIONS
% 0.20/0.46 *
% 0.20/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.46 (USE-FACTORING :POS)
% 0.20/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.46 *
% 0.20/0.46 "."
% 0.20/0.46 *
% 0.20/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T21:30:23
% 0.20/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n028.cluster.edu at 2022-06-13T21:30:23
% 0.39/0.59
% 0.39/0.59
% 0.39/0.59 #||
% 0.39/0.59 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.59 % SZS output start Refutation
% See solution above
% 0.39/0.59 ||#
% 0.39/0.59
% 0.39/0.59 ; Summary of computation:
% 0.39/0.59 ; 420 formulas have been input or derived (from 21 formulas).
% 0.39/0.59 ; 132 (31%) were retained. Of these,
% 0.39/0.59 ; 34 (26%) were simplified or subsumed later,
% 0.39/0.59 ; 98 (74%) are still being kept.
% 0.39/0.59 ;
% 0.39/0.59 ; Run time in seconds excluding printing time:
% 0.39/0.59 ; 0.001 1% Read assertion file (1 call)
% 0.39/0.59 ; 0.001 1% Assert (2 calls)
% 0.39/0.59 ; 0.018 15% Process new row (375 calls)
% 0.39/0.59 ; 0.000 0% Resolution (40 calls)
% 0.39/0.59 ; 0.008 7% Paramodulation (20 calls)
% 0.39/0.59 ; 0.020 16% Forward simplification (354 calls)
% 0.39/0.59 ; 0.016 13% Backward simplification (132 calls)
% 0.39/0.59 ; 0.033 27% Ordering (4,213 calls)
% 0.39/0.59 ; 0.000 0% Sortal reasoning (32 calls)
% 0.39/0.59 ; 0.000 0% Purity testing (1 call)
% 0.39/0.59 ; 0.025 20% Other
% 0.39/0.59 ; 0.122 Total
% 0.39/0.59 ; 0.124 Real time
% 0.39/0.59 ;
% 0.39/0.59 ; Term-hash-array has 412 terms in all.
% 0.39/0.59 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.39/0.59 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.39/0.59 ; Path-index has 278 entries (282 at peak, 448 added, 170 deleted).
% 0.39/0.59 ; Path-index has 403 nodes (407 at peak, 569 added, 166 deleted).
% 0.39/0.59 ; Trie-index has 278 entries (282 at peak, 448 added, 170 deleted).
% 0.39/0.59 ; Trie-index has 549 nodes (564 at peak, 1,167 added, 618 deleted).
% 0.39/0.59 ; Retrieved 2,476 generalization terms in 1,766 calls.
% 0.39/0.59 ; Retrieved 1,836 instance terms in 206 calls.
% 0.39/0.59 ; Retrieved 1,401 unifiable terms in 142 calls.
% 0.39/0.59 ;
% 0.39/0.59 ; The agenda of rows to process has 25 entries:
% 0.39/0.59 ; 5 with value 20 1 with value 24 5 with value 26
% 0.39/0.59 ; 1 with value 21 9 with value 25 1 with value 27
% 0.39/0.59 ; 3 with value 22
% 0.39/0.59 ; The agenda of rows to give has 82 entries:
% 0.39/0.59 ; 2 with value (4 19) 1 with value (4 22) 32 with value (4 25)
% 0.39/0.59 ; 10 with value (4 20) 3 with value (4 23) 8 with value (4 26)
% 0.39/0.59 ; 9 with value (4 21) 7 with value (4 24) 10 with value (4 27)
% 0.39/0.59 Evaluation took:
% 0.39/0.59 0.124 seconds of real time
% 0.39/0.59 0.105945 seconds of user run time
% 0.39/0.59 0.018346 seconds of system run time
% 0.39/0.59 0 calls to %EVAL
% 0.39/0.59 0 page faults and
% 0.39/0.59 6,740,264 bytes consed.
% 0.39/0.59 :PROOF-FOUND
% 0.39/0.59 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T21:30:23
% 0.39/0.59 :PROOF-FOUND
% 0.39/0.59 *
%------------------------------------------------------------------------------