TSTP Solution File: GRP514-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP514-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n011.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:13 EDT 2022
% Result : Unsatisfiable 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 3 RR)
% Number of literals : 15 ( 14 equ; 2 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 : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X,multiply(multiply(Y,Z),inverse(multiply(X,Z)))) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(3,plain,
multiply(X,multiply(multiply(Y,multiply(multiply(Z,U),inverse(multiply(X,U)))),inverse(Z))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(5,plain,
multiply(X,multiply(Y,inverse(Y))) = X,
inference('PARAMODULATE',[status(thm)],[3,single_axiom,theory(equality)]) ).
cnf(11,plain,
multiply(X,multiply(Y,inverse(X))) = Y,
inference('PARAMODULATE',[status(thm)],[3,5,theory(equality)]) ).
cnf(12,plain,
multiply(X,multiply(multiply(Y,multiply(Z,inverse(X))),inverse(Z))) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,5,theory(equality)]),5,theory(equality)]) ).
cnf(13,plain,
multiply(X,multiply(multiply(Y,Z),inverse(Y))) = multiply(X,Z),
inference('PARAMODULATE',[status(thm)],[3,11,theory(equality)]) ).
cnf(21,plain,
multiply(X,multiply(Y,inverse(multiply(Y,multiply(X,inverse(Z)))))) = Z,
inference('PARAMODULATE',[status(thm)],[12,12,theory(equality)]) ).
cnf(24,plain,
multiply(multiply(X,Y),multiply(Z,inverse(multiply(Z,Y)))) = X,
inference('PARAMODULATE',[status(thm)],[21,13,theory(equality)]) ).
cnf(28,plain,
multiply(multiply(X,multiply(Y,inverse(multiply(Y,Z)))),Z) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[24,24,theory(equality)]),13,theory(equality)]) ).
cnf(29,plain,
multiply(X,Y) = multiply(X,multiply(Z,inverse(multiply(Z,inverse(Y))))),
inference('PARAMODULATE',[status(thm)],[13,28,theory(equality)]) ).
cnf(30,plain,
multiply(X,Y) = multiply(Y,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[11,28,theory(equality)]),29,theory(equality)]) ).
cnf(33,plain,
multiply(a2,multiply(inverse(b2),b2)) != a2,
inference('PARAMODULATE',[status(thm)],[prove_these_axioms_2,30,theory(equality)]) ).
cnf(35,plain,
multiply(X,multiply(inverse(Y),Y)) = X,
inference('PARAMODULATE',[status(thm)],[5,30,theory(equality)]) ).
cnf(36,plain,
$false,
inference('REWRITE',[status(thm)],[33,35,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP514-1 : TPTP v8.1.0. Released v2.6.0.
% 0.04/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n011.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 13:42:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 *
% 0.20/0.46 *
% 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.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T13:42:19
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n011.cluster.edu at 2022-06-13T13:42:19
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 #||
% 0.20/0.51 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.51 % SZS output start Refutation
% See solution above
% 0.20/0.51 ||#
% 0.20/0.51
% 0.20/0.51 ; Summary of computation:
% 0.20/0.51 ; 168 formulas have been input or derived (from 14 formulas).
% 0.20/0.51 ; 36 (21%) were retained. Of these,
% 0.20/0.51 ; 17 (47%) were simplified or subsumed later,
% 0.20/0.51 ; 19 (53%) are still being kept.
% 0.20/0.51 ;
% 0.20/0.51 ; Run time in seconds excluding printing time:
% 0.20/0.51 ; 0.001 2% Read assertion file (1 call)
% 0.20/0.51 ; 0.000 0% Assert (2 calls)
% 0.20/0.51 ; 0.005 12% Process new row (125 calls)
% 0.20/0.51 ; 0.003 7% Resolution (26 calls)
% 0.20/0.51 ; 0.005 12% Paramodulation (13 calls)
% 0.20/0.51 ; 0.002 5% Forward simplification (120 calls)
% 0.20/0.51 ; 0.003 7% Backward simplification (36 calls)
% 0.20/0.51 ; 0.001 2% Ordering (262 calls)
% 0.20/0.51 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.51 ; 0.000 0% Purity testing (1 call)
% 0.20/0.51 ; 0.021 51% Other
% 0.20/0.51 ; 0.041 Total
% 0.20/0.51 ; 0.043 Real time
% 0.20/0.51 ;
% 0.20/0.51 ; Term-hash-array has 209 terms in all.
% 0.20/0.51 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.20/0.51 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.20/0.51 ; Path-index has 83 entries (125 at peak, 214 added, 131 deleted).
% 0.20/0.51 ; Path-index has 364 nodes (430 at peak, 504 added, 140 deleted).
% 0.20/0.51 ; Trie-index has 83 entries (125 at peak, 214 added, 131 deleted).
% 0.20/0.51 ; Trie-index has 203 nodes (409 at peak, 623 added, 420 deleted).
% 0.20/0.51 ; Retrieved 373 generalization terms in 585 calls.
% 0.20/0.51 ; Retrieved 148 instance terms in 35 calls.
% 0.20/0.51 ; Retrieved 420 unifiable terms in 103 calls.
% 0.20/0.51 ;
% 0.20/0.51 ; The agenda of rows to process has 39 entries:
% 0.20/0.51 ; 9 with value 20 8 with value 25 16 with value 26
% 0.20/0.51 ; 6 with value 24
% 0.20/0.51 ; The agenda of rows to give has 10 entries:
% 0.20/0.51 ; 2 with value (4 20) 1 with value (4 26) 1 with value (4 29)
% 0.20/0.51 ; 1 with value (4 24) 1 with value (4 27) 2 with value (4 30)
% 0.20/0.51 ; 1 with value (4 25) 1 with value (4 28)
% 0.20/0.51 Evaluation took:
% 0.20/0.51 0.044 seconds of real time
% 0.20/0.51 0.038289 seconds of user run time
% 0.20/0.51 0.006293 seconds of system run time
% 0.20/0.51 0 calls to %EVAL
% 0.20/0.51 0 page faults and
% 0.20/0.51 3,292,192 bytes consed.
% 0.20/0.51 :PROOF-FOUND
% 0.20/0.51 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T13:42:19
% 0.20/0.51 :PROOF-FOUND
% 0.20/0.51 *
%------------------------------------------------------------------------------